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_mat_private.h>
22 #include <isl/constraint.h>
25 #include <isl_val_private.h>
26 #include <isl_config.h>
31 #include <isl_list_templ.c>
36 #include <isl_list_templ.c>
38 __isl_give isl_aff *isl_aff_alloc_vec(__isl_take isl_local_space *ls,
39 __isl_take isl_vec *v)
46 aff = isl_calloc_type(v->ctx, struct isl_aff);
56 isl_local_space_free(ls);
61 __isl_give isl_aff *isl_aff_alloc(__isl_take isl_local_space *ls)
70 ctx = isl_local_space_get_ctx(ls);
71 if (!isl_local_space_divs_known(ls))
72 isl_die(ctx, isl_error_invalid, "local space has unknown divs",
74 if (!isl_local_space_is_set(ls))
75 isl_die(ctx, isl_error_invalid,
76 "domain of affine expression should be a set",
79 total = isl_local_space_dim(ls, isl_dim_all);
80 v = isl_vec_alloc(ctx, 1 + 1 + total);
81 return isl_aff_alloc_vec(ls, v);
83 isl_local_space_free(ls);
87 __isl_give isl_aff *isl_aff_zero_on_domain(__isl_take isl_local_space *ls)
91 aff = isl_aff_alloc(ls);
95 isl_int_set_si(aff->v->el[0], 1);
96 isl_seq_clr(aff->v->el + 1, aff->v->size - 1);
101 /* Return a piecewise affine expression defined on the specified domain
102 * that is equal to zero.
104 __isl_give isl_pw_aff *isl_pw_aff_zero_on_domain(__isl_take isl_local_space *ls)
106 return isl_pw_aff_from_aff(isl_aff_zero_on_domain(ls));
109 /* Return an affine expression that is equal to the specified dimension
112 __isl_give isl_aff *isl_aff_var_on_domain(__isl_take isl_local_space *ls,
113 enum isl_dim_type type, unsigned pos)
121 space = isl_local_space_get_space(ls);
124 if (isl_space_is_map(space))
125 isl_die(isl_space_get_ctx(space), isl_error_invalid,
126 "expecting (parameter) set space", goto error);
127 if (pos >= isl_local_space_dim(ls, type))
128 isl_die(isl_space_get_ctx(space), isl_error_invalid,
129 "position out of bounds", goto error);
131 isl_space_free(space);
132 aff = isl_aff_alloc(ls);
136 pos += isl_local_space_offset(aff->ls, type);
138 isl_int_set_si(aff->v->el[0], 1);
139 isl_seq_clr(aff->v->el + 1, aff->v->size - 1);
140 isl_int_set_si(aff->v->el[1 + pos], 1);
144 isl_local_space_free(ls);
145 isl_space_free(space);
149 /* Return a piecewise affine expression that is equal to
150 * the specified dimension in "ls".
152 __isl_give isl_pw_aff *isl_pw_aff_var_on_domain(__isl_take isl_local_space *ls,
153 enum isl_dim_type type, unsigned pos)
155 return isl_pw_aff_from_aff(isl_aff_var_on_domain(ls, type, pos));
158 __isl_give isl_aff *isl_aff_copy(__isl_keep isl_aff *aff)
167 __isl_give isl_aff *isl_aff_dup(__isl_keep isl_aff *aff)
172 return isl_aff_alloc_vec(isl_local_space_copy(aff->ls),
173 isl_vec_copy(aff->v));
176 __isl_give isl_aff *isl_aff_cow(__isl_take isl_aff *aff)
184 return isl_aff_dup(aff);
187 void *isl_aff_free(__isl_take isl_aff *aff)
195 isl_local_space_free(aff->ls);
196 isl_vec_free(aff->v);
203 isl_ctx *isl_aff_get_ctx(__isl_keep isl_aff *aff)
205 return aff ? isl_local_space_get_ctx(aff->ls) : NULL;
208 /* Externally, an isl_aff has a map space, but internally, the
209 * ls field corresponds to the domain of that space.
211 int isl_aff_dim(__isl_keep isl_aff *aff, enum isl_dim_type type)
215 if (type == isl_dim_out)
217 if (type == isl_dim_in)
219 return isl_local_space_dim(aff->ls, type);
222 __isl_give isl_space *isl_aff_get_domain_space(__isl_keep isl_aff *aff)
224 return aff ? isl_local_space_get_space(aff->ls) : NULL;
227 __isl_give isl_space *isl_aff_get_space(__isl_keep isl_aff *aff)
232 space = isl_local_space_get_space(aff->ls);
233 space = isl_space_from_domain(space);
234 space = isl_space_add_dims(space, isl_dim_out, 1);
238 __isl_give isl_local_space *isl_aff_get_domain_local_space(
239 __isl_keep isl_aff *aff)
241 return aff ? isl_local_space_copy(aff->ls) : NULL;
244 __isl_give isl_local_space *isl_aff_get_local_space(__isl_keep isl_aff *aff)
249 ls = isl_local_space_copy(aff->ls);
250 ls = isl_local_space_from_domain(ls);
251 ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
255 /* Externally, an isl_aff has a map space, but internally, the
256 * ls field corresponds to the domain of that space.
258 const char *isl_aff_get_dim_name(__isl_keep isl_aff *aff,
259 enum isl_dim_type type, unsigned pos)
263 if (type == isl_dim_out)
265 if (type == isl_dim_in)
267 return isl_local_space_get_dim_name(aff->ls, type, pos);
270 __isl_give isl_aff *isl_aff_reset_domain_space(__isl_take isl_aff *aff,
271 __isl_take isl_space *dim)
273 aff = isl_aff_cow(aff);
277 aff->ls = isl_local_space_reset_space(aff->ls, dim);
279 return isl_aff_free(aff);
288 /* Reset the space of "aff". This function is called from isl_pw_templ.c
289 * and doesn't know if the space of an element object is represented
290 * directly or through its domain. It therefore passes along both.
292 __isl_give isl_aff *isl_aff_reset_space_and_domain(__isl_take isl_aff *aff,
293 __isl_take isl_space *space, __isl_take isl_space *domain)
295 isl_space_free(space);
296 return isl_aff_reset_domain_space(aff, domain);
299 /* Reorder the coefficients of the affine expression based
300 * on the given reodering.
301 * The reordering r is assumed to have been extended with the local
304 static __isl_give isl_vec *vec_reorder(__isl_take isl_vec *vec,
305 __isl_take isl_reordering *r, int n_div)
313 res = isl_vec_alloc(vec->ctx,
314 2 + isl_space_dim(r->dim, isl_dim_all) + n_div);
315 isl_seq_cpy(res->el, vec->el, 2);
316 isl_seq_clr(res->el + 2, res->size - 2);
317 for (i = 0; i < r->len; ++i)
318 isl_int_set(res->el[2 + r->pos[i]], vec->el[2 + i]);
320 isl_reordering_free(r);
325 isl_reordering_free(r);
329 /* Reorder the dimensions of the domain of "aff" according
330 * to the given reordering.
332 __isl_give isl_aff *isl_aff_realign_domain(__isl_take isl_aff *aff,
333 __isl_take isl_reordering *r)
335 aff = isl_aff_cow(aff);
339 r = isl_reordering_extend(r, aff->ls->div->n_row);
340 aff->v = vec_reorder(aff->v, isl_reordering_copy(r),
341 aff->ls->div->n_row);
342 aff->ls = isl_local_space_realign(aff->ls, r);
344 if (!aff->v || !aff->ls)
345 return isl_aff_free(aff);
350 isl_reordering_free(r);
354 __isl_give isl_aff *isl_aff_align_params(__isl_take isl_aff *aff,
355 __isl_take isl_space *model)
360 if (!isl_space_match(aff->ls->dim, isl_dim_param,
361 model, isl_dim_param)) {
364 model = isl_space_drop_dims(model, isl_dim_in,
365 0, isl_space_dim(model, isl_dim_in));
366 model = isl_space_drop_dims(model, isl_dim_out,
367 0, isl_space_dim(model, isl_dim_out));
368 exp = isl_parameter_alignment_reordering(aff->ls->dim, model);
369 exp = isl_reordering_extend_space(exp,
370 isl_aff_get_domain_space(aff));
371 aff = isl_aff_realign_domain(aff, exp);
374 isl_space_free(model);
377 isl_space_free(model);
382 int isl_aff_plain_is_zero(__isl_keep isl_aff *aff)
387 return isl_seq_first_non_zero(aff->v->el + 1, aff->v->size - 1) < 0;
390 int isl_aff_plain_is_equal(__isl_keep isl_aff *aff1, __isl_keep isl_aff *aff2)
397 equal = isl_local_space_is_equal(aff1->ls, aff2->ls);
398 if (equal < 0 || !equal)
401 return isl_vec_is_equal(aff1->v, aff2->v);
404 int isl_aff_get_denominator(__isl_keep isl_aff *aff, isl_int *v)
408 isl_int_set(*v, aff->v->el[0]);
412 /* Return the common denominator of "aff".
414 __isl_give isl_val *isl_aff_get_denominator_val(__isl_keep isl_aff *aff)
421 ctx = isl_aff_get_ctx(aff);
422 return isl_val_int_from_isl_int(ctx, aff->v->el[0]);
425 int isl_aff_get_constant(__isl_keep isl_aff *aff, isl_int *v)
429 isl_int_set(*v, aff->v->el[1]);
433 /* Return the constant term of "aff".
435 __isl_give isl_val *isl_aff_get_constant_val(__isl_keep isl_aff *aff)
443 ctx = isl_aff_get_ctx(aff);
444 v = isl_val_rat_from_isl_int(ctx, aff->v->el[1], aff->v->el[0]);
445 return isl_val_normalize(v);
448 int isl_aff_get_coefficient(__isl_keep isl_aff *aff,
449 enum isl_dim_type type, int pos, isl_int *v)
454 if (type == isl_dim_out)
455 isl_die(aff->v->ctx, isl_error_invalid,
456 "output/set dimension does not have a coefficient",
458 if (type == isl_dim_in)
461 if (pos >= isl_local_space_dim(aff->ls, type))
462 isl_die(aff->v->ctx, isl_error_invalid,
463 "position out of bounds", return -1);
465 pos += isl_local_space_offset(aff->ls, type);
466 isl_int_set(*v, aff->v->el[1 + pos]);
471 /* Return the coefficient of the variable of type "type" at position "pos"
474 __isl_give isl_val *isl_aff_get_coefficient_val(__isl_keep isl_aff *aff,
475 enum isl_dim_type type, int pos)
483 ctx = isl_aff_get_ctx(aff);
484 if (type == isl_dim_out)
485 isl_die(ctx, isl_error_invalid,
486 "output/set dimension does not have a coefficient",
488 if (type == isl_dim_in)
491 if (pos >= isl_local_space_dim(aff->ls, type))
492 isl_die(ctx, isl_error_invalid,
493 "position out of bounds", return NULL);
495 pos += isl_local_space_offset(aff->ls, type);
496 v = isl_val_rat_from_isl_int(ctx, aff->v->el[1 + pos], aff->v->el[0]);
497 return isl_val_normalize(v);
500 __isl_give isl_aff *isl_aff_set_denominator(__isl_take isl_aff *aff, isl_int v)
502 aff = isl_aff_cow(aff);
506 aff->v = isl_vec_cow(aff->v);
508 return isl_aff_free(aff);
510 isl_int_set(aff->v->el[0], v);
515 __isl_give isl_aff *isl_aff_set_constant(__isl_take isl_aff *aff, isl_int v)
517 aff = isl_aff_cow(aff);
521 aff->v = isl_vec_cow(aff->v);
523 return isl_aff_free(aff);
525 isl_int_set(aff->v->el[1], v);
530 /* Replace the constant term of "aff" by "v".
532 __isl_give isl_aff *isl_aff_set_constant_val(__isl_take isl_aff *aff,
533 __isl_take isl_val *v)
538 if (!isl_val_is_rat(v))
539 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
540 "expecting rational value", goto error);
542 if (isl_int_eq(aff->v->el[1], v->n) &&
543 isl_int_eq(aff->v->el[0], v->d)) {
548 aff = isl_aff_cow(aff);
551 aff->v = isl_vec_cow(aff->v);
555 if (isl_int_eq(aff->v->el[0], v->d)) {
556 isl_int_set(aff->v->el[1], v->n);
557 } else if (isl_int_is_one(v->d)) {
558 isl_int_mul(aff->v->el[1], aff->v->el[0], v->n);
560 isl_seq_scale(aff->v->el + 1,
561 aff->v->el + 1, v->d, aff->v->size - 1);
562 isl_int_mul(aff->v->el[1], aff->v->el[0], v->n);
563 isl_int_mul(aff->v->el[0], aff->v->el[0], v->d);
564 aff->v = isl_vec_normalize(aff->v);
577 __isl_give isl_aff *isl_aff_add_constant(__isl_take isl_aff *aff, isl_int v)
579 if (isl_int_is_zero(v))
582 aff = isl_aff_cow(aff);
586 aff->v = isl_vec_cow(aff->v);
588 return isl_aff_free(aff);
590 isl_int_addmul(aff->v->el[1], aff->v->el[0], v);
595 /* Add "v" to the constant term of "aff".
597 __isl_give isl_aff *isl_aff_add_constant_val(__isl_take isl_aff *aff,
598 __isl_take isl_val *v)
603 if (isl_val_is_zero(v)) {
608 if (!isl_val_is_rat(v))
609 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
610 "expecting rational value", goto error);
612 aff = isl_aff_cow(aff);
616 aff->v = isl_vec_cow(aff->v);
620 if (isl_int_is_one(v->d)) {
621 isl_int_addmul(aff->v->el[1], aff->v->el[0], v->n);
622 } else if (isl_int_eq(aff->v->el[0], v->d)) {
623 isl_int_add(aff->v->el[1], aff->v->el[1], v->n);
624 aff->v = isl_vec_normalize(aff->v);
628 isl_seq_scale(aff->v->el + 1,
629 aff->v->el + 1, v->d, aff->v->size - 1);
630 isl_int_addmul(aff->v->el[1], aff->v->el[0], v->n);
631 isl_int_mul(aff->v->el[0], aff->v->el[0], v->d);
632 aff->v = isl_vec_normalize(aff->v);
645 __isl_give isl_aff *isl_aff_add_constant_si(__isl_take isl_aff *aff, int v)
650 isl_int_set_si(t, v);
651 aff = isl_aff_add_constant(aff, t);
657 /* Add "v" to the numerator of the constant term of "aff".
659 __isl_give isl_aff *isl_aff_add_constant_num(__isl_take isl_aff *aff, isl_int v)
661 if (isl_int_is_zero(v))
664 aff = isl_aff_cow(aff);
668 aff->v = isl_vec_cow(aff->v);
670 return isl_aff_free(aff);
672 isl_int_add(aff->v->el[1], aff->v->el[1], v);
677 /* Add "v" to the numerator of the constant term of "aff".
679 __isl_give isl_aff *isl_aff_add_constant_num_si(__isl_take isl_aff *aff, int v)
687 isl_int_set_si(t, v);
688 aff = isl_aff_add_constant_num(aff, t);
694 __isl_give isl_aff *isl_aff_set_constant_si(__isl_take isl_aff *aff, int v)
696 aff = isl_aff_cow(aff);
700 aff->v = isl_vec_cow(aff->v);
702 return isl_aff_free(aff);
704 isl_int_set_si(aff->v->el[1], v);
709 __isl_give isl_aff *isl_aff_set_coefficient(__isl_take isl_aff *aff,
710 enum isl_dim_type type, int pos, isl_int v)
715 if (type == isl_dim_out)
716 isl_die(aff->v->ctx, isl_error_invalid,
717 "output/set dimension does not have a coefficient",
718 return isl_aff_free(aff));
719 if (type == isl_dim_in)
722 if (pos >= isl_local_space_dim(aff->ls, type))
723 isl_die(aff->v->ctx, isl_error_invalid,
724 "position out of bounds", return isl_aff_free(aff));
726 aff = isl_aff_cow(aff);
730 aff->v = isl_vec_cow(aff->v);
732 return isl_aff_free(aff);
734 pos += isl_local_space_offset(aff->ls, type);
735 isl_int_set(aff->v->el[1 + pos], v);
740 __isl_give isl_aff *isl_aff_set_coefficient_si(__isl_take isl_aff *aff,
741 enum isl_dim_type type, int pos, int v)
746 if (type == isl_dim_out)
747 isl_die(aff->v->ctx, isl_error_invalid,
748 "output/set dimension does not have a coefficient",
749 return isl_aff_free(aff));
750 if (type == isl_dim_in)
753 if (pos >= isl_local_space_dim(aff->ls, type))
754 isl_die(aff->v->ctx, isl_error_invalid,
755 "position out of bounds", return isl_aff_free(aff));
757 aff = isl_aff_cow(aff);
761 aff->v = isl_vec_cow(aff->v);
763 return isl_aff_free(aff);
765 pos += isl_local_space_offset(aff->ls, type);
766 isl_int_set_si(aff->v->el[1 + pos], v);
771 /* Replace the coefficient of the variable of type "type" at position "pos"
774 __isl_give isl_aff *isl_aff_set_coefficient_val(__isl_take isl_aff *aff,
775 enum isl_dim_type type, int pos, __isl_take isl_val *v)
780 if (type == isl_dim_out)
781 isl_die(aff->v->ctx, isl_error_invalid,
782 "output/set dimension does not have a coefficient",
784 if (type == isl_dim_in)
787 if (pos >= isl_local_space_dim(aff->ls, type))
788 isl_die(aff->v->ctx, isl_error_invalid,
789 "position out of bounds", goto error);
791 if (!isl_val_is_rat(v))
792 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
793 "expecting rational value", goto error);
795 pos += isl_local_space_offset(aff->ls, type);
796 if (isl_int_eq(aff->v->el[1 + pos], v->n) &&
797 isl_int_eq(aff->v->el[0], v->d)) {
802 aff = isl_aff_cow(aff);
805 aff->v = isl_vec_cow(aff->v);
809 if (isl_int_eq(aff->v->el[0], v->d)) {
810 isl_int_set(aff->v->el[1 + pos], v->n);
811 } else if (isl_int_is_one(v->d)) {
812 isl_int_mul(aff->v->el[1 + pos], aff->v->el[0], v->n);
814 isl_seq_scale(aff->v->el + 1,
815 aff->v->el + 1, v->d, aff->v->size - 1);
816 isl_int_mul(aff->v->el[1 + pos], aff->v->el[0], v->n);
817 isl_int_mul(aff->v->el[0], aff->v->el[0], v->d);
818 aff->v = isl_vec_normalize(aff->v);
831 __isl_give isl_aff *isl_aff_add_coefficient(__isl_take isl_aff *aff,
832 enum isl_dim_type type, int pos, isl_int v)
837 if (type == isl_dim_out)
838 isl_die(aff->v->ctx, isl_error_invalid,
839 "output/set dimension does not have a coefficient",
840 return isl_aff_free(aff));
841 if (type == isl_dim_in)
844 if (pos >= isl_local_space_dim(aff->ls, type))
845 isl_die(aff->v->ctx, isl_error_invalid,
846 "position out of bounds", return isl_aff_free(aff));
848 aff = isl_aff_cow(aff);
852 aff->v = isl_vec_cow(aff->v);
854 return isl_aff_free(aff);
856 pos += isl_local_space_offset(aff->ls, type);
857 isl_int_addmul(aff->v->el[1 + pos], aff->v->el[0], v);
862 /* Add "v" to the coefficient of the variable of type "type"
863 * at position "pos" of "aff".
865 __isl_give isl_aff *isl_aff_add_coefficient_val(__isl_take isl_aff *aff,
866 enum isl_dim_type type, int pos, __isl_take isl_val *v)
871 if (isl_val_is_zero(v)) {
876 if (type == isl_dim_out)
877 isl_die(aff->v->ctx, isl_error_invalid,
878 "output/set dimension does not have a coefficient",
880 if (type == isl_dim_in)
883 if (pos >= isl_local_space_dim(aff->ls, type))
884 isl_die(aff->v->ctx, isl_error_invalid,
885 "position out of bounds", goto error);
887 if (!isl_val_is_rat(v))
888 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
889 "expecting rational value", goto error);
891 aff = isl_aff_cow(aff);
895 aff->v = isl_vec_cow(aff->v);
899 pos += isl_local_space_offset(aff->ls, type);
900 if (isl_int_is_one(v->d)) {
901 isl_int_addmul(aff->v->el[1 + pos], aff->v->el[0], v->n);
902 } else if (isl_int_eq(aff->v->el[0], v->d)) {
903 isl_int_add(aff->v->el[1 + pos], aff->v->el[1 + pos], v->n);
904 aff->v = isl_vec_normalize(aff->v);
908 isl_seq_scale(aff->v->el + 1,
909 aff->v->el + 1, v->d, aff->v->size - 1);
910 isl_int_addmul(aff->v->el[1 + pos], aff->v->el[0], v->n);
911 isl_int_mul(aff->v->el[0], aff->v->el[0], v->d);
912 aff->v = isl_vec_normalize(aff->v);
925 __isl_give isl_aff *isl_aff_add_coefficient_si(__isl_take isl_aff *aff,
926 enum isl_dim_type type, int pos, int v)
931 isl_int_set_si(t, v);
932 aff = isl_aff_add_coefficient(aff, type, pos, t);
938 __isl_give isl_aff *isl_aff_get_div(__isl_keep isl_aff *aff, int pos)
943 return isl_local_space_get_div(aff->ls, pos);
946 __isl_give isl_aff *isl_aff_neg(__isl_take isl_aff *aff)
948 aff = isl_aff_cow(aff);
951 aff->v = isl_vec_cow(aff->v);
953 return isl_aff_free(aff);
955 isl_seq_neg(aff->v->el + 1, aff->v->el + 1, aff->v->size - 1);
960 /* Remove divs from the local space that do not appear in the affine
962 * We currently only remove divs at the end.
963 * Some intermediate divs may also not appear directly in the affine
964 * expression, but we would also need to check that no other divs are
965 * defined in terms of them.
967 __isl_give isl_aff *isl_aff_remove_unused_divs( __isl_take isl_aff *aff)
976 n = isl_local_space_dim(aff->ls, isl_dim_div);
977 off = isl_local_space_offset(aff->ls, isl_dim_div);
979 pos = isl_seq_last_non_zero(aff->v->el + 1 + off, n) + 1;
983 aff = isl_aff_cow(aff);
987 aff->ls = isl_local_space_drop_dims(aff->ls, isl_dim_div, pos, n - pos);
988 aff->v = isl_vec_drop_els(aff->v, 1 + off + pos, n - pos);
989 if (!aff->ls || !aff->v)
990 return isl_aff_free(aff);
995 /* Given two affine expressions "p" of length p_len (including the
996 * denominator and the constant term) and "subs" of length subs_len,
997 * plug in "subs" for the variable at position "pos".
998 * The variables of "subs" and "p" are assumed to match up to subs_len,
999 * but "p" may have additional variables.
1000 * "v" is an initialized isl_int that can be used internally.
1002 * In particular, if "p" represents the expression
1006 * with i the variable at position "pos" and "subs" represents the expression
1010 * then the result represents the expression
1015 void isl_seq_substitute(isl_int *p, int pos, isl_int *subs,
1016 int p_len, int subs_len, isl_int v)
1018 isl_int_set(v, p[1 + pos]);
1019 isl_int_set_si(p[1 + pos], 0);
1020 isl_seq_combine(p + 1, subs[0], p + 1, v, subs + 1, subs_len - 1);
1021 isl_seq_scale(p + subs_len, p + subs_len, subs[0], p_len - subs_len);
1022 isl_int_mul(p[0], p[0], subs[0]);
1025 /* Look for any divs in the aff->ls with a denominator equal to one
1026 * and plug them into the affine expression and any subsequent divs
1027 * that may reference the div.
1029 static __isl_give isl_aff *plug_in_integral_divs(__isl_take isl_aff *aff)
1035 isl_local_space *ls;
1041 n = isl_local_space_dim(aff->ls, isl_dim_div);
1043 for (i = 0; i < n; ++i) {
1044 if (!isl_int_is_one(aff->ls->div->row[i][0]))
1046 ls = isl_local_space_copy(aff->ls);
1047 ls = isl_local_space_substitute_seq(ls, isl_dim_div, i,
1048 aff->ls->div->row[i], len, i + 1, n - (i + 1));
1049 vec = isl_vec_copy(aff->v);
1050 vec = isl_vec_cow(vec);
1056 pos = isl_local_space_offset(aff->ls, isl_dim_div) + i;
1057 isl_seq_substitute(vec->el, pos, aff->ls->div->row[i],
1062 isl_vec_free(aff->v);
1064 isl_local_space_free(aff->ls);
1071 isl_local_space_free(ls);
1072 return isl_aff_free(aff);
1075 /* Look for any divs j that appear with a unit coefficient inside
1076 * the definitions of other divs i and plug them into the definitions
1079 * In particular, an expression of the form
1081 * floor((f(..) + floor(g(..)/n))/m)
1085 * floor((n * f(..) + g(..))/(n * m))
1087 * This simplification is correct because we can move the expression
1088 * f(..) into the inner floor in the original expression to obtain
1090 * floor(floor((n * f(..) + g(..))/n)/m)
1092 * from which we can derive the simplified expression.
1094 static __isl_give isl_aff *plug_in_unit_divs(__isl_take isl_aff *aff)
1102 n = isl_local_space_dim(aff->ls, isl_dim_div);
1103 off = isl_local_space_offset(aff->ls, isl_dim_div);
1104 for (i = 1; i < n; ++i) {
1105 for (j = 0; j < i; ++j) {
1106 if (!isl_int_is_one(aff->ls->div->row[i][1 + off + j]))
1108 aff->ls = isl_local_space_substitute_seq(aff->ls,
1109 isl_dim_div, j, aff->ls->div->row[j],
1110 aff->v->size, i, 1);
1112 return isl_aff_free(aff);
1119 /* Swap divs "a" and "b" in "aff", which is assumed to be non-NULL.
1121 * Even though this function is only called on isl_affs with a single
1122 * reference, we are careful to only change aff->v and aff->ls together.
1124 static __isl_give isl_aff *swap_div(__isl_take isl_aff *aff, int a, int b)
1126 unsigned off = isl_local_space_offset(aff->ls, isl_dim_div);
1127 isl_local_space *ls;
1130 ls = isl_local_space_copy(aff->ls);
1131 ls = isl_local_space_swap_div(ls, a, b);
1132 v = isl_vec_copy(aff->v);
1137 isl_int_swap(v->el[1 + off + a], v->el[1 + off + b]);
1138 isl_vec_free(aff->v);
1140 isl_local_space_free(aff->ls);
1146 isl_local_space_free(ls);
1147 return isl_aff_free(aff);
1150 /* Merge divs "a" and "b" in "aff", which is assumed to be non-NULL.
1152 * We currently do not actually remove div "b", but simply add its
1153 * coefficient to that of "a" and then zero it out.
1155 static __isl_give isl_aff *merge_divs(__isl_take isl_aff *aff, int a, int b)
1157 unsigned off = isl_local_space_offset(aff->ls, isl_dim_div);
1159 if (isl_int_is_zero(aff->v->el[1 + off + b]))
1162 aff->v = isl_vec_cow(aff->v);
1164 return isl_aff_free(aff);
1166 isl_int_add(aff->v->el[1 + off + a],
1167 aff->v->el[1 + off + a], aff->v->el[1 + off + b]);
1168 isl_int_set_si(aff->v->el[1 + off + b], 0);
1173 /* Sort the divs in the local space of "aff" according to
1174 * the comparison function "cmp_row" in isl_local_space.c,
1175 * combining the coefficients of identical divs.
1177 * Reordering divs does not change the semantics of "aff",
1178 * so there is no need to call isl_aff_cow.
1179 * Moreover, this function is currently only called on isl_affs
1180 * with a single reference.
1182 static __isl_give isl_aff *sort_divs(__isl_take isl_aff *aff)
1190 off = isl_local_space_offset(aff->ls, isl_dim_div);
1191 n = isl_aff_dim(aff, isl_dim_div);
1192 for (i = 1; i < n; ++i) {
1193 for (j = i - 1; j >= 0; --j) {
1194 int cmp = isl_mat_cmp_div(aff->ls->div, j, j + 1);
1198 aff = merge_divs(aff, j, j + 1);
1200 aff = swap_div(aff, j, j + 1);
1209 /* Normalize the representation of "aff".
1211 * This function should only be called of "new" isl_affs, i.e.,
1212 * with only a single reference. We therefore do not need to
1213 * worry about affecting other instances.
1215 __isl_give isl_aff *isl_aff_normalize(__isl_take isl_aff *aff)
1219 aff->v = isl_vec_normalize(aff->v);
1221 return isl_aff_free(aff);
1222 aff = plug_in_integral_divs(aff);
1223 aff = plug_in_unit_divs(aff);
1224 aff = sort_divs(aff);
1225 aff = isl_aff_remove_unused_divs(aff);
1229 /* Given f, return floor(f).
1230 * If f is an integer expression, then just return f.
1231 * If f is a constant, then return the constant floor(f).
1232 * Otherwise, if f = g/m, write g = q m + r,
1233 * create a new div d = [r/m] and return the expression q + d.
1234 * The coefficients in r are taken to lie between -m/2 and m/2.
1236 __isl_give isl_aff *isl_aff_floor(__isl_take isl_aff *aff)
1246 if (isl_int_is_one(aff->v->el[0]))
1249 aff = isl_aff_cow(aff);
1253 aff->v = isl_vec_cow(aff->v);
1255 return isl_aff_free(aff);
1257 if (isl_aff_is_cst(aff)) {
1258 isl_int_fdiv_q(aff->v->el[1], aff->v->el[1], aff->v->el[0]);
1259 isl_int_set_si(aff->v->el[0], 1);
1263 div = isl_vec_copy(aff->v);
1264 div = isl_vec_cow(div);
1266 return isl_aff_free(aff);
1268 ctx = isl_aff_get_ctx(aff);
1269 isl_int_fdiv_q(aff->v->el[0], aff->v->el[0], ctx->two);
1270 for (i = 1; i < aff->v->size; ++i) {
1271 isl_int_fdiv_r(div->el[i], div->el[i], div->el[0]);
1272 isl_int_fdiv_q(aff->v->el[i], aff->v->el[i], div->el[0]);
1273 if (isl_int_gt(div->el[i], aff->v->el[0])) {
1274 isl_int_sub(div->el[i], div->el[i], div->el[0]);
1275 isl_int_add_ui(aff->v->el[i], aff->v->el[i], 1);
1279 aff->ls = isl_local_space_add_div(aff->ls, div);
1281 return isl_aff_free(aff);
1283 size = aff->v->size;
1284 aff->v = isl_vec_extend(aff->v, size + 1);
1286 return isl_aff_free(aff);
1287 isl_int_set_si(aff->v->el[0], 1);
1288 isl_int_set_si(aff->v->el[size], 1);
1290 aff = isl_aff_normalize(aff);
1297 * aff mod m = aff - m * floor(aff/m)
1299 __isl_give isl_aff *isl_aff_mod(__isl_take isl_aff *aff, isl_int m)
1303 res = isl_aff_copy(aff);
1304 aff = isl_aff_scale_down(aff, m);
1305 aff = isl_aff_floor(aff);
1306 aff = isl_aff_scale(aff, m);
1307 res = isl_aff_sub(res, aff);
1314 * pwaff mod m = pwaff - m * floor(pwaff/m)
1316 __isl_give isl_pw_aff *isl_pw_aff_mod(__isl_take isl_pw_aff *pwaff, isl_int m)
1320 res = isl_pw_aff_copy(pwaff);
1321 pwaff = isl_pw_aff_scale_down(pwaff, m);
1322 pwaff = isl_pw_aff_floor(pwaff);
1323 pwaff = isl_pw_aff_scale(pwaff, m);
1324 res = isl_pw_aff_sub(res, pwaff);
1329 /* Given f, return ceil(f).
1330 * If f is an integer expression, then just return f.
1331 * Otherwise, let f be the expression
1337 * floor((e + m - 1)/m)
1339 __isl_give isl_aff *isl_aff_ceil(__isl_take isl_aff *aff)
1344 if (isl_int_is_one(aff->v->el[0]))
1347 aff = isl_aff_cow(aff);
1350 aff->v = isl_vec_cow(aff->v);
1352 return isl_aff_free(aff);
1354 isl_int_add(aff->v->el[1], aff->v->el[1], aff->v->el[0]);
1355 isl_int_sub_ui(aff->v->el[1], aff->v->el[1], 1);
1356 aff = isl_aff_floor(aff);
1361 /* Apply the expansion computed by isl_merge_divs.
1362 * The expansion itself is given by "exp" while the resulting
1363 * list of divs is given by "div".
1365 __isl_give isl_aff *isl_aff_expand_divs( __isl_take isl_aff *aff,
1366 __isl_take isl_mat *div, int *exp)
1373 aff = isl_aff_cow(aff);
1377 old_n_div = isl_local_space_dim(aff->ls, isl_dim_div);
1378 new_n_div = isl_mat_rows(div);
1379 if (new_n_div < old_n_div)
1380 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
1381 "not an expansion", goto error);
1383 aff->v = isl_vec_extend(aff->v, aff->v->size + new_n_div - old_n_div);
1387 offset = 1 + isl_local_space_offset(aff->ls, isl_dim_div);
1389 for (i = new_n_div - 1; i >= 0; --i) {
1390 if (j >= 0 && exp[j] == i) {
1392 isl_int_swap(aff->v->el[offset + i],
1393 aff->v->el[offset + j]);
1396 isl_int_set_si(aff->v->el[offset + i], 0);
1399 aff->ls = isl_local_space_replace_divs(aff->ls, isl_mat_copy(div));
1410 /* Add two affine expressions that live in the same local space.
1412 static __isl_give isl_aff *add_expanded(__isl_take isl_aff *aff1,
1413 __isl_take isl_aff *aff2)
1417 aff1 = isl_aff_cow(aff1);
1421 aff1->v = isl_vec_cow(aff1->v);
1427 isl_int_gcd(gcd, aff1->v->el[0], aff2->v->el[0]);
1428 isl_int_divexact(f, aff2->v->el[0], gcd);
1429 isl_seq_scale(aff1->v->el + 1, aff1->v->el + 1, f, aff1->v->size - 1);
1430 isl_int_divexact(f, aff1->v->el[0], gcd);
1431 isl_seq_addmul(aff1->v->el + 1, f, aff2->v->el + 1, aff1->v->size - 1);
1432 isl_int_divexact(f, aff2->v->el[0], gcd);
1433 isl_int_mul(aff1->v->el[0], aff1->v->el[0], f);
1445 __isl_give isl_aff *isl_aff_add(__isl_take isl_aff *aff1,
1446 __isl_take isl_aff *aff2)
1456 ctx = isl_aff_get_ctx(aff1);
1457 if (!isl_space_is_equal(aff1->ls->dim, aff2->ls->dim))
1458 isl_die(ctx, isl_error_invalid,
1459 "spaces don't match", goto error);
1461 if (aff1->ls->div->n_row == 0 && aff2->ls->div->n_row == 0)
1462 return add_expanded(aff1, aff2);
1464 exp1 = isl_alloc_array(ctx, int, aff1->ls->div->n_row);
1465 exp2 = isl_alloc_array(ctx, int, aff2->ls->div->n_row);
1469 div = isl_merge_divs(aff1->ls->div, aff2->ls->div, exp1, exp2);
1470 aff1 = isl_aff_expand_divs(aff1, isl_mat_copy(div), exp1);
1471 aff2 = isl_aff_expand_divs(aff2, div, exp2);
1475 return add_expanded(aff1, aff2);
1484 __isl_give isl_aff *isl_aff_sub(__isl_take isl_aff *aff1,
1485 __isl_take isl_aff *aff2)
1487 return isl_aff_add(aff1, isl_aff_neg(aff2));
1490 __isl_give isl_aff *isl_aff_scale(__isl_take isl_aff *aff, isl_int f)
1494 if (isl_int_is_one(f))
1497 aff = isl_aff_cow(aff);
1500 aff->v = isl_vec_cow(aff->v);
1502 return isl_aff_free(aff);
1504 if (isl_int_is_pos(f) && isl_int_is_divisible_by(aff->v->el[0], f)) {
1505 isl_int_divexact(aff->v->el[0], aff->v->el[0], f);
1510 isl_int_gcd(gcd, aff->v->el[0], f);
1511 isl_int_divexact(aff->v->el[0], aff->v->el[0], gcd);
1512 isl_int_divexact(gcd, f, gcd);
1513 isl_seq_scale(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
1519 /* Multiple "aff" by "v".
1521 __isl_give isl_aff *isl_aff_scale_val(__isl_take isl_aff *aff,
1522 __isl_take isl_val *v)
1527 if (isl_val_is_one(v)) {
1532 if (!isl_val_is_rat(v))
1533 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
1534 "expecting rational factor", goto error);
1536 aff = isl_aff_scale(aff, v->n);
1537 aff = isl_aff_scale_down(aff, v->d);
1547 __isl_give isl_aff *isl_aff_scale_down(__isl_take isl_aff *aff, isl_int f)
1551 if (isl_int_is_one(f))
1554 aff = isl_aff_cow(aff);
1558 if (isl_int_is_zero(f))
1559 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
1560 "cannot scale down by zero", return isl_aff_free(aff));
1562 aff->v = isl_vec_cow(aff->v);
1564 return isl_aff_free(aff);
1567 isl_seq_gcd(aff->v->el + 1, aff->v->size - 1, &gcd);
1568 isl_int_gcd(gcd, gcd, f);
1569 isl_seq_scale_down(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
1570 isl_int_divexact(gcd, f, gcd);
1571 isl_int_mul(aff->v->el[0], aff->v->el[0], gcd);
1577 __isl_give isl_aff *isl_aff_scale_down_ui(__isl_take isl_aff *aff, unsigned f)
1585 isl_int_set_ui(v, f);
1586 aff = isl_aff_scale_down(aff, v);
1592 __isl_give isl_aff *isl_aff_set_dim_name(__isl_take isl_aff *aff,
1593 enum isl_dim_type type, unsigned pos, const char *s)
1595 aff = isl_aff_cow(aff);
1598 if (type == isl_dim_out)
1599 isl_die(aff->v->ctx, isl_error_invalid,
1600 "cannot set name of output/set dimension",
1601 return isl_aff_free(aff));
1602 if (type == isl_dim_in)
1604 aff->ls = isl_local_space_set_dim_name(aff->ls, type, pos, s);
1606 return isl_aff_free(aff);
1611 __isl_give isl_aff *isl_aff_set_dim_id(__isl_take isl_aff *aff,
1612 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
1614 aff = isl_aff_cow(aff);
1616 return isl_id_free(id);
1617 if (type == isl_dim_out)
1618 isl_die(aff->v->ctx, isl_error_invalid,
1619 "cannot set name of output/set dimension",
1621 if (type == isl_dim_in)
1623 aff->ls = isl_local_space_set_dim_id(aff->ls, type, pos, id);
1625 return isl_aff_free(aff);
1634 /* Exploit the equalities in "eq" to simplify the affine expression
1635 * and the expressions of the integer divisions in the local space.
1636 * The integer divisions in this local space are assumed to appear
1637 * as regular dimensions in "eq".
1639 static __isl_give isl_aff *isl_aff_substitute_equalities_lifted(
1640 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
1648 if (eq->n_eq == 0) {
1649 isl_basic_set_free(eq);
1653 aff = isl_aff_cow(aff);
1657 aff->ls = isl_local_space_substitute_equalities(aff->ls,
1658 isl_basic_set_copy(eq));
1659 aff->v = isl_vec_cow(aff->v);
1660 if (!aff->ls || !aff->v)
1663 total = 1 + isl_space_dim(eq->dim, isl_dim_all);
1665 for (i = 0; i < eq->n_eq; ++i) {
1666 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
1667 if (j < 0 || j == 0 || j >= total)
1670 isl_seq_elim(aff->v->el + 1, eq->eq[i], j, total,
1674 isl_basic_set_free(eq);
1675 aff = isl_aff_normalize(aff);
1678 isl_basic_set_free(eq);
1683 /* Exploit the equalities in "eq" to simplify the affine expression
1684 * and the expressions of the integer divisions in the local space.
1686 static __isl_give isl_aff *isl_aff_substitute_equalities(
1687 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
1693 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
1695 eq = isl_basic_set_add_dims(eq, isl_dim_set, n_div);
1696 return isl_aff_substitute_equalities_lifted(aff, eq);
1698 isl_basic_set_free(eq);
1703 /* Look for equalities among the variables shared by context and aff
1704 * and the integer divisions of aff, if any.
1705 * The equalities are then used to eliminate coefficients and/or integer
1706 * divisions from aff.
1708 __isl_give isl_aff *isl_aff_gist(__isl_take isl_aff *aff,
1709 __isl_take isl_set *context)
1711 isl_basic_set *hull;
1716 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
1718 isl_basic_set *bset;
1719 isl_local_space *ls;
1720 context = isl_set_add_dims(context, isl_dim_set, n_div);
1721 ls = isl_aff_get_domain_local_space(aff);
1722 bset = isl_basic_set_from_local_space(ls);
1723 bset = isl_basic_set_lift(bset);
1724 bset = isl_basic_set_flatten(bset);
1725 context = isl_set_intersect(context,
1726 isl_set_from_basic_set(bset));
1729 hull = isl_set_affine_hull(context);
1730 return isl_aff_substitute_equalities_lifted(aff, hull);
1733 isl_set_free(context);
1737 __isl_give isl_aff *isl_aff_gist_params(__isl_take isl_aff *aff,
1738 __isl_take isl_set *context)
1740 isl_set *dom_context = isl_set_universe(isl_aff_get_domain_space(aff));
1741 dom_context = isl_set_intersect_params(dom_context, context);
1742 return isl_aff_gist(aff, dom_context);
1745 /* Return a basic set containing those elements in the space
1746 * of aff where it is non-negative.
1747 * If "rational" is set, then return a rational basic set.
1749 static __isl_give isl_basic_set *aff_nonneg_basic_set(
1750 __isl_take isl_aff *aff, int rational)
1752 isl_constraint *ineq;
1753 isl_basic_set *bset;
1755 ineq = isl_inequality_from_aff(aff);
1757 bset = isl_basic_set_from_constraint(ineq);
1759 bset = isl_basic_set_set_rational(bset);
1760 bset = isl_basic_set_simplify(bset);
1764 /* Return a basic set containing those elements in the space
1765 * of aff where it is non-negative.
1767 __isl_give isl_basic_set *isl_aff_nonneg_basic_set(__isl_take isl_aff *aff)
1769 return aff_nonneg_basic_set(aff, 0);
1772 /* Return a basic set containing those elements in the domain space
1773 * of aff where it is negative.
1775 __isl_give isl_basic_set *isl_aff_neg_basic_set(__isl_take isl_aff *aff)
1777 aff = isl_aff_neg(aff);
1778 aff = isl_aff_add_constant_num_si(aff, -1);
1779 return isl_aff_nonneg_basic_set(aff);
1782 /* Return a basic set containing those elements in the space
1783 * of aff where it is zero.
1784 * If "rational" is set, then return a rational basic set.
1786 static __isl_give isl_basic_set *aff_zero_basic_set(__isl_take isl_aff *aff,
1789 isl_constraint *ineq;
1790 isl_basic_set *bset;
1792 ineq = isl_equality_from_aff(aff);
1794 bset = isl_basic_set_from_constraint(ineq);
1796 bset = isl_basic_set_set_rational(bset);
1797 bset = isl_basic_set_simplify(bset);
1801 /* Return a basic set containing those elements in the space
1802 * of aff where it is zero.
1804 __isl_give isl_basic_set *isl_aff_zero_basic_set(__isl_take isl_aff *aff)
1806 return aff_zero_basic_set(aff, 0);
1809 /* Return a basic set containing those elements in the shared space
1810 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
1812 __isl_give isl_basic_set *isl_aff_ge_basic_set(__isl_take isl_aff *aff1,
1813 __isl_take isl_aff *aff2)
1815 aff1 = isl_aff_sub(aff1, aff2);
1817 return isl_aff_nonneg_basic_set(aff1);
1820 /* Return a basic set containing those elements in the shared space
1821 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
1823 __isl_give isl_basic_set *isl_aff_le_basic_set(__isl_take isl_aff *aff1,
1824 __isl_take isl_aff *aff2)
1826 return isl_aff_ge_basic_set(aff2, aff1);
1829 __isl_give isl_aff *isl_aff_add_on_domain(__isl_keep isl_set *dom,
1830 __isl_take isl_aff *aff1, __isl_take isl_aff *aff2)
1832 aff1 = isl_aff_add(aff1, aff2);
1833 aff1 = isl_aff_gist(aff1, isl_set_copy(dom));
1837 int isl_aff_is_empty(__isl_keep isl_aff *aff)
1845 /* Check whether the given affine expression has non-zero coefficient
1846 * for any dimension in the given range or if any of these dimensions
1847 * appear with non-zero coefficients in any of the integer divisions
1848 * involved in the affine expression.
1850 int isl_aff_involves_dims(__isl_keep isl_aff *aff,
1851 enum isl_dim_type type, unsigned first, unsigned n)
1863 ctx = isl_aff_get_ctx(aff);
1864 if (first + n > isl_aff_dim(aff, type))
1865 isl_die(ctx, isl_error_invalid,
1866 "range out of bounds", return -1);
1868 active = isl_local_space_get_active(aff->ls, aff->v->el + 2);
1872 first += isl_local_space_offset(aff->ls, type) - 1;
1873 for (i = 0; i < n; ++i)
1874 if (active[first + i]) {
1887 __isl_give isl_aff *isl_aff_drop_dims(__isl_take isl_aff *aff,
1888 enum isl_dim_type type, unsigned first, unsigned n)
1894 if (type == isl_dim_out)
1895 isl_die(aff->v->ctx, isl_error_invalid,
1896 "cannot drop output/set dimension",
1897 return isl_aff_free(aff));
1898 if (type == isl_dim_in)
1900 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
1903 ctx = isl_aff_get_ctx(aff);
1904 if (first + n > isl_local_space_dim(aff->ls, type))
1905 isl_die(ctx, isl_error_invalid, "range out of bounds",
1906 return isl_aff_free(aff));
1908 aff = isl_aff_cow(aff);
1912 aff->ls = isl_local_space_drop_dims(aff->ls, type, first, n);
1914 return isl_aff_free(aff);
1916 first += 1 + isl_local_space_offset(aff->ls, type);
1917 aff->v = isl_vec_drop_els(aff->v, first, n);
1919 return isl_aff_free(aff);
1924 /* Project the domain of the affine expression onto its parameter space.
1925 * The affine expression may not involve any of the domain dimensions.
1927 __isl_give isl_aff *isl_aff_project_domain_on_params(__isl_take isl_aff *aff)
1933 n = isl_aff_dim(aff, isl_dim_in);
1934 involves = isl_aff_involves_dims(aff, isl_dim_in, 0, n);
1936 return isl_aff_free(aff);
1938 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
1939 "affine expression involves some of the domain dimensions",
1940 return isl_aff_free(aff));
1941 aff = isl_aff_drop_dims(aff, isl_dim_in, 0, n);
1942 space = isl_aff_get_domain_space(aff);
1943 space = isl_space_params(space);
1944 aff = isl_aff_reset_domain_space(aff, space);
1948 __isl_give isl_aff *isl_aff_insert_dims(__isl_take isl_aff *aff,
1949 enum isl_dim_type type, unsigned first, unsigned n)
1955 if (type == isl_dim_out)
1956 isl_die(aff->v->ctx, isl_error_invalid,
1957 "cannot insert output/set dimensions",
1958 return isl_aff_free(aff));
1959 if (type == isl_dim_in)
1961 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
1964 ctx = isl_aff_get_ctx(aff);
1965 if (first > isl_local_space_dim(aff->ls, type))
1966 isl_die(ctx, isl_error_invalid, "position out of bounds",
1967 return isl_aff_free(aff));
1969 aff = isl_aff_cow(aff);
1973 aff->ls = isl_local_space_insert_dims(aff->ls, type, first, n);
1975 return isl_aff_free(aff);
1977 first += 1 + isl_local_space_offset(aff->ls, type);
1978 aff->v = isl_vec_insert_zero_els(aff->v, first, n);
1980 return isl_aff_free(aff);
1985 __isl_give isl_aff *isl_aff_add_dims(__isl_take isl_aff *aff,
1986 enum isl_dim_type type, unsigned n)
1990 pos = isl_aff_dim(aff, type);
1992 return isl_aff_insert_dims(aff, type, pos, n);
1995 __isl_give isl_pw_aff *isl_pw_aff_add_dims(__isl_take isl_pw_aff *pwaff,
1996 enum isl_dim_type type, unsigned n)
2000 pos = isl_pw_aff_dim(pwaff, type);
2002 return isl_pw_aff_insert_dims(pwaff, type, pos, n);
2005 __isl_give isl_pw_aff *isl_pw_aff_from_aff(__isl_take isl_aff *aff)
2007 isl_set *dom = isl_set_universe(isl_aff_get_domain_space(aff));
2008 return isl_pw_aff_alloc(dom, aff);
2012 #define PW isl_pw_aff
2016 #define EL_IS_ZERO is_empty
2020 #define IS_ZERO is_empty
2023 #undef DEFAULT_IS_ZERO
2024 #define DEFAULT_IS_ZERO 0
2028 #define NO_MOVE_DIMS
2032 #include <isl_pw_templ.c>
2034 static __isl_give isl_set *align_params_pw_pw_set_and(
2035 __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2,
2036 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
2037 __isl_take isl_pw_aff *pwaff2))
2039 if (!pwaff1 || !pwaff2)
2041 if (isl_space_match(pwaff1->dim, isl_dim_param,
2042 pwaff2->dim, isl_dim_param))
2043 return fn(pwaff1, pwaff2);
2044 if (!isl_space_has_named_params(pwaff1->dim) ||
2045 !isl_space_has_named_params(pwaff2->dim))
2046 isl_die(isl_pw_aff_get_ctx(pwaff1), isl_error_invalid,
2047 "unaligned unnamed parameters", goto error);
2048 pwaff1 = isl_pw_aff_align_params(pwaff1, isl_pw_aff_get_space(pwaff2));
2049 pwaff2 = isl_pw_aff_align_params(pwaff2, isl_pw_aff_get_space(pwaff1));
2050 return fn(pwaff1, pwaff2);
2052 isl_pw_aff_free(pwaff1);
2053 isl_pw_aff_free(pwaff2);
2057 /* Compute a piecewise quasi-affine expression with a domain that
2058 * is the union of those of pwaff1 and pwaff2 and such that on each
2059 * cell, the quasi-affine expression is the better (according to cmp)
2060 * of those of pwaff1 and pwaff2. If only one of pwaff1 or pwaff2
2061 * is defined on a given cell, then the associated expression
2062 * is the defined one.
2064 static __isl_give isl_pw_aff *pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
2065 __isl_take isl_pw_aff *pwaff2,
2066 __isl_give isl_basic_set *(*cmp)(__isl_take isl_aff *aff1,
2067 __isl_take isl_aff *aff2))
2074 if (!pwaff1 || !pwaff2)
2077 ctx = isl_space_get_ctx(pwaff1->dim);
2078 if (!isl_space_is_equal(pwaff1->dim, pwaff2->dim))
2079 isl_die(ctx, isl_error_invalid,
2080 "arguments should live in same space", goto error);
2082 if (isl_pw_aff_is_empty(pwaff1)) {
2083 isl_pw_aff_free(pwaff1);
2087 if (isl_pw_aff_is_empty(pwaff2)) {
2088 isl_pw_aff_free(pwaff2);
2092 n = 2 * (pwaff1->n + 1) * (pwaff2->n + 1);
2093 res = isl_pw_aff_alloc_size(isl_space_copy(pwaff1->dim), n);
2095 for (i = 0; i < pwaff1->n; ++i) {
2096 set = isl_set_copy(pwaff1->p[i].set);
2097 for (j = 0; j < pwaff2->n; ++j) {
2098 struct isl_set *common;
2101 common = isl_set_intersect(
2102 isl_set_copy(pwaff1->p[i].set),
2103 isl_set_copy(pwaff2->p[j].set));
2104 better = isl_set_from_basic_set(cmp(
2105 isl_aff_copy(pwaff2->p[j].aff),
2106 isl_aff_copy(pwaff1->p[i].aff)));
2107 better = isl_set_intersect(common, better);
2108 if (isl_set_plain_is_empty(better)) {
2109 isl_set_free(better);
2112 set = isl_set_subtract(set, isl_set_copy(better));
2114 res = isl_pw_aff_add_piece(res, better,
2115 isl_aff_copy(pwaff2->p[j].aff));
2117 res = isl_pw_aff_add_piece(res, set,
2118 isl_aff_copy(pwaff1->p[i].aff));
2121 for (j = 0; j < pwaff2->n; ++j) {
2122 set = isl_set_copy(pwaff2->p[j].set);
2123 for (i = 0; i < pwaff1->n; ++i)
2124 set = isl_set_subtract(set,
2125 isl_set_copy(pwaff1->p[i].set));
2126 res = isl_pw_aff_add_piece(res, set,
2127 isl_aff_copy(pwaff2->p[j].aff));
2130 isl_pw_aff_free(pwaff1);
2131 isl_pw_aff_free(pwaff2);
2135 isl_pw_aff_free(pwaff1);
2136 isl_pw_aff_free(pwaff2);
2140 /* Compute a piecewise quasi-affine expression with a domain that
2141 * is the union of those of pwaff1 and pwaff2 and such that on each
2142 * cell, the quasi-affine expression is the maximum of those of pwaff1
2143 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2144 * cell, then the associated expression is the defined one.
2146 static __isl_give isl_pw_aff *pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
2147 __isl_take isl_pw_aff *pwaff2)
2149 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_ge_basic_set);
2152 __isl_give isl_pw_aff *isl_pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
2153 __isl_take isl_pw_aff *pwaff2)
2155 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
2159 /* Compute a piecewise quasi-affine expression with a domain that
2160 * is the union of those of pwaff1 and pwaff2 and such that on each
2161 * cell, the quasi-affine expression is the minimum of those of pwaff1
2162 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2163 * cell, then the associated expression is the defined one.
2165 static __isl_give isl_pw_aff *pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
2166 __isl_take isl_pw_aff *pwaff2)
2168 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_le_basic_set);
2171 __isl_give isl_pw_aff *isl_pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
2172 __isl_take isl_pw_aff *pwaff2)
2174 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
2178 __isl_give isl_pw_aff *isl_pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
2179 __isl_take isl_pw_aff *pwaff2, int max)
2182 return isl_pw_aff_union_max(pwaff1, pwaff2);
2184 return isl_pw_aff_union_min(pwaff1, pwaff2);
2187 /* Construct a map with as domain the domain of pwaff and
2188 * one-dimensional range corresponding to the affine expressions.
2190 static __isl_give isl_map *map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
2199 dim = isl_pw_aff_get_space(pwaff);
2200 map = isl_map_empty(dim);
2202 for (i = 0; i < pwaff->n; ++i) {
2203 isl_basic_map *bmap;
2206 bmap = isl_basic_map_from_aff(isl_aff_copy(pwaff->p[i].aff));
2207 map_i = isl_map_from_basic_map(bmap);
2208 map_i = isl_map_intersect_domain(map_i,
2209 isl_set_copy(pwaff->p[i].set));
2210 map = isl_map_union_disjoint(map, map_i);
2213 isl_pw_aff_free(pwaff);
2218 /* Construct a map with as domain the domain of pwaff and
2219 * one-dimensional range corresponding to the affine expressions.
2221 __isl_give isl_map *isl_map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
2225 if (isl_space_is_set(pwaff->dim))
2226 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
2227 "space of input is not a map",
2228 return isl_pw_aff_free(pwaff));
2229 return map_from_pw_aff(pwaff);
2232 /* Construct a one-dimensional set with as parameter domain
2233 * the domain of pwaff and the single set dimension
2234 * corresponding to the affine expressions.
2236 __isl_give isl_set *isl_set_from_pw_aff(__isl_take isl_pw_aff *pwaff)
2240 if (!isl_space_is_set(pwaff->dim))
2241 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
2242 "space of input is not a set",
2243 return isl_pw_aff_free(pwaff));
2244 return map_from_pw_aff(pwaff);
2247 /* Return a set containing those elements in the domain
2248 * of pwaff where it is non-negative.
2250 __isl_give isl_set *isl_pw_aff_nonneg_set(__isl_take isl_pw_aff *pwaff)
2258 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
2260 for (i = 0; i < pwaff->n; ++i) {
2261 isl_basic_set *bset;
2265 rational = isl_set_has_rational(pwaff->p[i].set);
2266 bset = aff_nonneg_basic_set(isl_aff_copy(pwaff->p[i].aff),
2268 set_i = isl_set_from_basic_set(bset);
2269 set_i = isl_set_intersect(set_i, isl_set_copy(pwaff->p[i].set));
2270 set = isl_set_union_disjoint(set, set_i);
2273 isl_pw_aff_free(pwaff);
2278 /* Return a set containing those elements in the domain
2279 * of pwaff where it is zero (if complement is 0) or not zero
2280 * (if complement is 1).
2282 static __isl_give isl_set *pw_aff_zero_set(__isl_take isl_pw_aff *pwaff,
2291 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
2293 for (i = 0; i < pwaff->n; ++i) {
2294 isl_basic_set *bset;
2295 isl_set *set_i, *zero;
2298 rational = isl_set_has_rational(pwaff->p[i].set);
2299 bset = aff_zero_basic_set(isl_aff_copy(pwaff->p[i].aff),
2301 zero = isl_set_from_basic_set(bset);
2302 set_i = isl_set_copy(pwaff->p[i].set);
2304 set_i = isl_set_subtract(set_i, zero);
2306 set_i = isl_set_intersect(set_i, zero);
2307 set = isl_set_union_disjoint(set, set_i);
2310 isl_pw_aff_free(pwaff);
2315 /* Return a set containing those elements in the domain
2316 * of pwaff where it is zero.
2318 __isl_give isl_set *isl_pw_aff_zero_set(__isl_take isl_pw_aff *pwaff)
2320 return pw_aff_zero_set(pwaff, 0);
2323 /* Return a set containing those elements in the domain
2324 * of pwaff where it is not zero.
2326 __isl_give isl_set *isl_pw_aff_non_zero_set(__isl_take isl_pw_aff *pwaff)
2328 return pw_aff_zero_set(pwaff, 1);
2331 /* Return a set containing those elements in the shared domain
2332 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
2334 * We compute the difference on the shared domain and then construct
2335 * the set of values where this difference is non-negative.
2336 * If strict is set, we first subtract 1 from the difference.
2337 * If equal is set, we only return the elements where pwaff1 and pwaff2
2340 static __isl_give isl_set *pw_aff_gte_set(__isl_take isl_pw_aff *pwaff1,
2341 __isl_take isl_pw_aff *pwaff2, int strict, int equal)
2343 isl_set *set1, *set2;
2345 set1 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff1));
2346 set2 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff2));
2347 set1 = isl_set_intersect(set1, set2);
2348 pwaff1 = isl_pw_aff_intersect_domain(pwaff1, isl_set_copy(set1));
2349 pwaff2 = isl_pw_aff_intersect_domain(pwaff2, isl_set_copy(set1));
2350 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_neg(pwaff2));
2353 isl_space *dim = isl_set_get_space(set1);
2355 aff = isl_aff_zero_on_domain(isl_local_space_from_space(dim));
2356 aff = isl_aff_add_constant_si(aff, -1);
2357 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_alloc(set1, aff));
2362 return isl_pw_aff_zero_set(pwaff1);
2363 return isl_pw_aff_nonneg_set(pwaff1);
2366 /* Return a set containing those elements in the shared domain
2367 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
2369 static __isl_give isl_set *pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
2370 __isl_take isl_pw_aff *pwaff2)
2372 return pw_aff_gte_set(pwaff1, pwaff2, 0, 1);
2375 __isl_give isl_set *isl_pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
2376 __isl_take isl_pw_aff *pwaff2)
2378 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_eq_set);
2381 /* Return a set containing those elements in the shared domain
2382 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
2384 static __isl_give isl_set *pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
2385 __isl_take isl_pw_aff *pwaff2)
2387 return pw_aff_gte_set(pwaff1, pwaff2, 0, 0);
2390 __isl_give isl_set *isl_pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
2391 __isl_take isl_pw_aff *pwaff2)
2393 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ge_set);
2396 /* Return a set containing those elements in the shared domain
2397 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
2399 static __isl_give isl_set *pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
2400 __isl_take isl_pw_aff *pwaff2)
2402 return pw_aff_gte_set(pwaff1, pwaff2, 1, 0);
2405 __isl_give isl_set *isl_pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
2406 __isl_take isl_pw_aff *pwaff2)
2408 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_gt_set);
2411 __isl_give isl_set *isl_pw_aff_le_set(__isl_take isl_pw_aff *pwaff1,
2412 __isl_take isl_pw_aff *pwaff2)
2414 return isl_pw_aff_ge_set(pwaff2, pwaff1);
2417 __isl_give isl_set *isl_pw_aff_lt_set(__isl_take isl_pw_aff *pwaff1,
2418 __isl_take isl_pw_aff *pwaff2)
2420 return isl_pw_aff_gt_set(pwaff2, pwaff1);
2423 /* Return a set containing those elements in the shared domain
2424 * of the elements of list1 and list2 where each element in list1
2425 * has the relation specified by "fn" with each element in list2.
2427 static __isl_give isl_set *pw_aff_list_set(__isl_take isl_pw_aff_list *list1,
2428 __isl_take isl_pw_aff_list *list2,
2429 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
2430 __isl_take isl_pw_aff *pwaff2))
2436 if (!list1 || !list2)
2439 ctx = isl_pw_aff_list_get_ctx(list1);
2440 if (list1->n < 1 || list2->n < 1)
2441 isl_die(ctx, isl_error_invalid,
2442 "list should contain at least one element", goto error);
2444 set = isl_set_universe(isl_pw_aff_get_domain_space(list1->p[0]));
2445 for (i = 0; i < list1->n; ++i)
2446 for (j = 0; j < list2->n; ++j) {
2449 set_ij = fn(isl_pw_aff_copy(list1->p[i]),
2450 isl_pw_aff_copy(list2->p[j]));
2451 set = isl_set_intersect(set, set_ij);
2454 isl_pw_aff_list_free(list1);
2455 isl_pw_aff_list_free(list2);
2458 isl_pw_aff_list_free(list1);
2459 isl_pw_aff_list_free(list2);
2463 /* Return a set containing those elements in the shared domain
2464 * of the elements of list1 and list2 where each element in list1
2465 * is equal to each element in list2.
2467 __isl_give isl_set *isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list *list1,
2468 __isl_take isl_pw_aff_list *list2)
2470 return pw_aff_list_set(list1, list2, &isl_pw_aff_eq_set);
2473 __isl_give isl_set *isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list *list1,
2474 __isl_take isl_pw_aff_list *list2)
2476 return pw_aff_list_set(list1, list2, &isl_pw_aff_ne_set);
2479 /* Return a set containing those elements in the shared domain
2480 * of the elements of list1 and list2 where each element in list1
2481 * is less than or equal to each element in list2.
2483 __isl_give isl_set *isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list *list1,
2484 __isl_take isl_pw_aff_list *list2)
2486 return pw_aff_list_set(list1, list2, &isl_pw_aff_le_set);
2489 __isl_give isl_set *isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list *list1,
2490 __isl_take isl_pw_aff_list *list2)
2492 return pw_aff_list_set(list1, list2, &isl_pw_aff_lt_set);
2495 __isl_give isl_set *isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list *list1,
2496 __isl_take isl_pw_aff_list *list2)
2498 return pw_aff_list_set(list1, list2, &isl_pw_aff_ge_set);
2501 __isl_give isl_set *isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list *list1,
2502 __isl_take isl_pw_aff_list *list2)
2504 return pw_aff_list_set(list1, list2, &isl_pw_aff_gt_set);
2508 /* Return a set containing those elements in the shared domain
2509 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
2511 static __isl_give isl_set *pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
2512 __isl_take isl_pw_aff *pwaff2)
2514 isl_set *set_lt, *set_gt;
2516 set_lt = isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1),
2517 isl_pw_aff_copy(pwaff2));
2518 set_gt = isl_pw_aff_gt_set(pwaff1, pwaff2);
2519 return isl_set_union_disjoint(set_lt, set_gt);
2522 __isl_give isl_set *isl_pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
2523 __isl_take isl_pw_aff *pwaff2)
2525 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ne_set);
2528 __isl_give isl_pw_aff *isl_pw_aff_scale_down(__isl_take isl_pw_aff *pwaff,
2533 if (isl_int_is_one(v))
2535 if (!isl_int_is_pos(v))
2536 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
2537 "factor needs to be positive",
2538 return isl_pw_aff_free(pwaff));
2539 pwaff = isl_pw_aff_cow(pwaff);
2545 for (i = 0; i < pwaff->n; ++i) {
2546 pwaff->p[i].aff = isl_aff_scale_down(pwaff->p[i].aff, v);
2547 if (!pwaff->p[i].aff)
2548 return isl_pw_aff_free(pwaff);
2554 __isl_give isl_pw_aff *isl_pw_aff_floor(__isl_take isl_pw_aff *pwaff)
2558 pwaff = isl_pw_aff_cow(pwaff);
2564 for (i = 0; i < pwaff->n; ++i) {
2565 pwaff->p[i].aff = isl_aff_floor(pwaff->p[i].aff);
2566 if (!pwaff->p[i].aff)
2567 return isl_pw_aff_free(pwaff);
2573 __isl_give isl_pw_aff *isl_pw_aff_ceil(__isl_take isl_pw_aff *pwaff)
2577 pwaff = isl_pw_aff_cow(pwaff);
2583 for (i = 0; i < pwaff->n; ++i) {
2584 pwaff->p[i].aff = isl_aff_ceil(pwaff->p[i].aff);
2585 if (!pwaff->p[i].aff)
2586 return isl_pw_aff_free(pwaff);
2592 /* Assuming that "cond1" and "cond2" are disjoint,
2593 * return an affine expression that is equal to pwaff1 on cond1
2594 * and to pwaff2 on cond2.
2596 static __isl_give isl_pw_aff *isl_pw_aff_select(
2597 __isl_take isl_set *cond1, __isl_take isl_pw_aff *pwaff1,
2598 __isl_take isl_set *cond2, __isl_take isl_pw_aff *pwaff2)
2600 pwaff1 = isl_pw_aff_intersect_domain(pwaff1, cond1);
2601 pwaff2 = isl_pw_aff_intersect_domain(pwaff2, cond2);
2603 return isl_pw_aff_add_disjoint(pwaff1, pwaff2);
2606 /* Return an affine expression that is equal to pwaff_true for elements
2607 * where "cond" is non-zero and to pwaff_false for elements where "cond"
2609 * That is, return cond ? pwaff_true : pwaff_false;
2611 __isl_give isl_pw_aff *isl_pw_aff_cond(__isl_take isl_pw_aff *cond,
2612 __isl_take isl_pw_aff *pwaff_true, __isl_take isl_pw_aff *pwaff_false)
2614 isl_set *cond_true, *cond_false;
2616 cond_true = isl_pw_aff_non_zero_set(isl_pw_aff_copy(cond));
2617 cond_false = isl_pw_aff_zero_set(cond);
2618 return isl_pw_aff_select(cond_true, pwaff_true,
2619 cond_false, pwaff_false);
2622 int isl_aff_is_cst(__isl_keep isl_aff *aff)
2627 return isl_seq_first_non_zero(aff->v->el + 2, aff->v->size - 2) == -1;
2630 /* Check whether pwaff is a piecewise constant.
2632 int isl_pw_aff_is_cst(__isl_keep isl_pw_aff *pwaff)
2639 for (i = 0; i < pwaff->n; ++i) {
2640 int is_cst = isl_aff_is_cst(pwaff->p[i].aff);
2641 if (is_cst < 0 || !is_cst)
2648 __isl_give isl_aff *isl_aff_mul(__isl_take isl_aff *aff1,
2649 __isl_take isl_aff *aff2)
2651 if (!isl_aff_is_cst(aff2) && isl_aff_is_cst(aff1))
2652 return isl_aff_mul(aff2, aff1);
2654 if (!isl_aff_is_cst(aff2))
2655 isl_die(isl_aff_get_ctx(aff1), isl_error_invalid,
2656 "at least one affine expression should be constant",
2659 aff1 = isl_aff_cow(aff1);
2663 aff1 = isl_aff_scale(aff1, aff2->v->el[1]);
2664 aff1 = isl_aff_scale_down(aff1, aff2->v->el[0]);
2674 /* Divide "aff1" by "aff2", assuming "aff2" is a piecewise constant.
2676 __isl_give isl_aff *isl_aff_div(__isl_take isl_aff *aff1,
2677 __isl_take isl_aff *aff2)
2682 is_cst = isl_aff_is_cst(aff2);
2686 isl_die(isl_aff_get_ctx(aff2), isl_error_invalid,
2687 "second argument should be a constant", goto error);
2692 neg = isl_int_is_neg(aff2->v->el[1]);
2694 isl_int_neg(aff2->v->el[0], aff2->v->el[0]);
2695 isl_int_neg(aff2->v->el[1], aff2->v->el[1]);
2698 aff1 = isl_aff_scale(aff1, aff2->v->el[0]);
2699 aff1 = isl_aff_scale_down(aff1, aff2->v->el[1]);
2702 isl_int_neg(aff2->v->el[0], aff2->v->el[0]);
2703 isl_int_neg(aff2->v->el[1], aff2->v->el[1]);
2714 static __isl_give isl_pw_aff *pw_aff_add(__isl_take isl_pw_aff *pwaff1,
2715 __isl_take isl_pw_aff *pwaff2)
2717 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_add);
2720 __isl_give isl_pw_aff *isl_pw_aff_add(__isl_take isl_pw_aff *pwaff1,
2721 __isl_take isl_pw_aff *pwaff2)
2723 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_add);
2726 __isl_give isl_pw_aff *isl_pw_aff_union_add(__isl_take isl_pw_aff *pwaff1,
2727 __isl_take isl_pw_aff *pwaff2)
2729 return isl_pw_aff_union_add_(pwaff1, pwaff2);
2732 static __isl_give isl_pw_aff *pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
2733 __isl_take isl_pw_aff *pwaff2)
2735 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_mul);
2738 __isl_give isl_pw_aff *isl_pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
2739 __isl_take isl_pw_aff *pwaff2)
2741 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_mul);
2744 static __isl_give isl_pw_aff *pw_aff_div(__isl_take isl_pw_aff *pa1,
2745 __isl_take isl_pw_aff *pa2)
2747 return isl_pw_aff_on_shared_domain(pa1, pa2, &isl_aff_div);
2750 /* Divide "pa1" by "pa2", assuming "pa2" is a piecewise constant.
2752 __isl_give isl_pw_aff *isl_pw_aff_div(__isl_take isl_pw_aff *pa1,
2753 __isl_take isl_pw_aff *pa2)
2757 is_cst = isl_pw_aff_is_cst(pa2);
2761 isl_die(isl_pw_aff_get_ctx(pa2), isl_error_invalid,
2762 "second argument should be a piecewise constant",
2764 return isl_pw_aff_align_params_pw_pw_and(pa1, pa2, &pw_aff_div);
2766 isl_pw_aff_free(pa1);
2767 isl_pw_aff_free(pa2);
2771 /* Compute the quotient of the integer division of "pa1" by "pa2"
2772 * with rounding towards zero.
2773 * "pa2" is assumed to be a piecewise constant.
2775 * In particular, return
2777 * pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2)
2780 __isl_give isl_pw_aff *isl_pw_aff_tdiv_q(__isl_take isl_pw_aff *pa1,
2781 __isl_take isl_pw_aff *pa2)
2787 is_cst = isl_pw_aff_is_cst(pa2);
2791 isl_die(isl_pw_aff_get_ctx(pa2), isl_error_invalid,
2792 "second argument should be a piecewise constant",
2795 pa1 = isl_pw_aff_div(pa1, pa2);
2797 cond = isl_pw_aff_nonneg_set(isl_pw_aff_copy(pa1));
2798 f = isl_pw_aff_floor(isl_pw_aff_copy(pa1));
2799 c = isl_pw_aff_ceil(pa1);
2800 return isl_pw_aff_cond(isl_set_indicator_function(cond), f, c);
2802 isl_pw_aff_free(pa1);
2803 isl_pw_aff_free(pa2);
2807 /* Compute the remainder of the integer division of "pa1" by "pa2"
2808 * with rounding towards zero.
2809 * "pa2" is assumed to be a piecewise constant.
2811 * In particular, return
2813 * pa1 - pa2 * (pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2))
2816 __isl_give isl_pw_aff *isl_pw_aff_tdiv_r(__isl_take isl_pw_aff *pa1,
2817 __isl_take isl_pw_aff *pa2)
2822 is_cst = isl_pw_aff_is_cst(pa2);
2826 isl_die(isl_pw_aff_get_ctx(pa2), isl_error_invalid,
2827 "second argument should be a piecewise constant",
2829 res = isl_pw_aff_tdiv_q(isl_pw_aff_copy(pa1), isl_pw_aff_copy(pa2));
2830 res = isl_pw_aff_mul(pa2, res);
2831 res = isl_pw_aff_sub(pa1, res);
2834 isl_pw_aff_free(pa1);
2835 isl_pw_aff_free(pa2);
2839 static __isl_give isl_pw_aff *pw_aff_min(__isl_take isl_pw_aff *pwaff1,
2840 __isl_take isl_pw_aff *pwaff2)
2845 dom = isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1)),
2846 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2)));
2847 le = isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1),
2848 isl_pw_aff_copy(pwaff2));
2849 dom = isl_set_subtract(dom, isl_set_copy(le));
2850 return isl_pw_aff_select(le, pwaff1, dom, pwaff2);
2853 __isl_give isl_pw_aff *isl_pw_aff_min(__isl_take isl_pw_aff *pwaff1,
2854 __isl_take isl_pw_aff *pwaff2)
2856 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_min);
2859 static __isl_give isl_pw_aff *pw_aff_max(__isl_take isl_pw_aff *pwaff1,
2860 __isl_take isl_pw_aff *pwaff2)
2865 dom = isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1)),
2866 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2)));
2867 ge = isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1),
2868 isl_pw_aff_copy(pwaff2));
2869 dom = isl_set_subtract(dom, isl_set_copy(ge));
2870 return isl_pw_aff_select(ge, pwaff1, dom, pwaff2);
2873 __isl_give isl_pw_aff *isl_pw_aff_max(__isl_take isl_pw_aff *pwaff1,
2874 __isl_take isl_pw_aff *pwaff2)
2876 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_max);
2879 static __isl_give isl_pw_aff *pw_aff_list_reduce(
2880 __isl_take isl_pw_aff_list *list,
2881 __isl_give isl_pw_aff *(*fn)(__isl_take isl_pw_aff *pwaff1,
2882 __isl_take isl_pw_aff *pwaff2))
2891 ctx = isl_pw_aff_list_get_ctx(list);
2893 isl_die(ctx, isl_error_invalid,
2894 "list should contain at least one element",
2895 return isl_pw_aff_list_free(list));
2897 res = isl_pw_aff_copy(list->p[0]);
2898 for (i = 1; i < list->n; ++i)
2899 res = fn(res, isl_pw_aff_copy(list->p[i]));
2901 isl_pw_aff_list_free(list);
2905 /* Return an isl_pw_aff that maps each element in the intersection of the
2906 * domains of the elements of list to the minimal corresponding affine
2909 __isl_give isl_pw_aff *isl_pw_aff_list_min(__isl_take isl_pw_aff_list *list)
2911 return pw_aff_list_reduce(list, &isl_pw_aff_min);
2914 /* Return an isl_pw_aff that maps each element in the intersection of the
2915 * domains of the elements of list to the maximal corresponding affine
2918 __isl_give isl_pw_aff *isl_pw_aff_list_max(__isl_take isl_pw_aff_list *list)
2920 return pw_aff_list_reduce(list, &isl_pw_aff_max);
2923 /* Mark the domains of "pwaff" as rational.
2925 __isl_give isl_pw_aff *isl_pw_aff_set_rational(__isl_take isl_pw_aff *pwaff)
2929 pwaff = isl_pw_aff_cow(pwaff);
2935 for (i = 0; i < pwaff->n; ++i) {
2936 pwaff->p[i].set = isl_set_set_rational(pwaff->p[i].set);
2937 if (!pwaff->p[i].set)
2938 return isl_pw_aff_free(pwaff);
2944 /* Mark the domains of the elements of "list" as rational.
2946 __isl_give isl_pw_aff_list *isl_pw_aff_list_set_rational(
2947 __isl_take isl_pw_aff_list *list)
2957 for (i = 0; i < n; ++i) {
2960 pa = isl_pw_aff_list_get_pw_aff(list, i);
2961 pa = isl_pw_aff_set_rational(pa);
2962 list = isl_pw_aff_list_set_pw_aff(list, i, pa);
2968 /* Check that the domain space of "aff" matches "space".
2970 * Return 0 on success and -1 on error.
2972 int isl_aff_check_match_domain_space(__isl_keep isl_aff *aff,
2973 __isl_keep isl_space *space)
2975 isl_space *aff_space;
2981 aff_space = isl_aff_get_domain_space(aff);
2983 match = isl_space_match(space, isl_dim_param, aff_space, isl_dim_param);
2987 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
2988 "parameters don't match", goto error);
2989 match = isl_space_tuple_match(space, isl_dim_in,
2990 aff_space, isl_dim_set);
2994 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
2995 "domains don't match", goto error);
2996 isl_space_free(aff_space);
2999 isl_space_free(aff_space);
3006 #include <isl_multi_templ.c>
3008 /* Create an isl_pw_multi_aff with the given isl_multi_aff on a universe
3011 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_multi_aff(
3012 __isl_take isl_multi_aff *ma)
3014 isl_set *dom = isl_set_universe(isl_multi_aff_get_domain_space(ma));
3015 return isl_pw_multi_aff_alloc(dom, ma);
3018 /* Create a piecewise multi-affine expression in the given space that maps each
3019 * input dimension to the corresponding output dimension.
3021 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_identity(
3022 __isl_take isl_space *space)
3024 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_identity(space));
3027 __isl_give isl_multi_aff *isl_multi_aff_add(__isl_take isl_multi_aff *maff1,
3028 __isl_take isl_multi_aff *maff2)
3030 return isl_multi_aff_bin_op(maff1, maff2, &isl_aff_add);
3033 /* Subtract "ma2" from "ma1" and return the result.
3035 __isl_give isl_multi_aff *isl_multi_aff_sub(__isl_take isl_multi_aff *ma1,
3036 __isl_take isl_multi_aff *ma2)
3038 return isl_multi_aff_bin_op(ma1, ma2, &isl_aff_sub);
3041 /* Given two multi-affine expressions A -> B and C -> D,
3042 * construct a multi-affine expression [A -> C] -> [B -> D].
3044 __isl_give isl_multi_aff *isl_multi_aff_product(
3045 __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2)
3051 int in1, in2, out1, out2;
3053 in1 = isl_multi_aff_dim(ma1, isl_dim_in);
3054 in2 = isl_multi_aff_dim(ma2, isl_dim_in);
3055 out1 = isl_multi_aff_dim(ma1, isl_dim_out);
3056 out2 = isl_multi_aff_dim(ma2, isl_dim_out);
3057 space = isl_space_product(isl_multi_aff_get_space(ma1),
3058 isl_multi_aff_get_space(ma2));
3059 res = isl_multi_aff_alloc(isl_space_copy(space));
3060 space = isl_space_domain(space);
3062 for (i = 0; i < out1; ++i) {
3063 aff = isl_multi_aff_get_aff(ma1, i);
3064 aff = isl_aff_insert_dims(aff, isl_dim_in, in1, in2);
3065 aff = isl_aff_reset_domain_space(aff, isl_space_copy(space));
3066 res = isl_multi_aff_set_aff(res, i, aff);
3069 for (i = 0; i < out2; ++i) {
3070 aff = isl_multi_aff_get_aff(ma2, i);
3071 aff = isl_aff_insert_dims(aff, isl_dim_in, 0, in1);
3072 aff = isl_aff_reset_domain_space(aff, isl_space_copy(space));
3073 res = isl_multi_aff_set_aff(res, out1 + i, aff);
3076 isl_space_free(space);
3077 isl_multi_aff_free(ma1);
3078 isl_multi_aff_free(ma2);
3082 /* Exploit the equalities in "eq" to simplify the affine expressions.
3084 static __isl_give isl_multi_aff *isl_multi_aff_substitute_equalities(
3085 __isl_take isl_multi_aff *maff, __isl_take isl_basic_set *eq)
3089 maff = isl_multi_aff_cow(maff);
3093 for (i = 0; i < maff->n; ++i) {
3094 maff->p[i] = isl_aff_substitute_equalities(maff->p[i],
3095 isl_basic_set_copy(eq));
3100 isl_basic_set_free(eq);
3103 isl_basic_set_free(eq);
3104 isl_multi_aff_free(maff);
3108 __isl_give isl_multi_aff *isl_multi_aff_scale(__isl_take isl_multi_aff *maff,
3113 maff = isl_multi_aff_cow(maff);
3117 for (i = 0; i < maff->n; ++i) {
3118 maff->p[i] = isl_aff_scale(maff->p[i], f);
3120 return isl_multi_aff_free(maff);
3126 __isl_give isl_multi_aff *isl_multi_aff_add_on_domain(__isl_keep isl_set *dom,
3127 __isl_take isl_multi_aff *maff1, __isl_take isl_multi_aff *maff2)
3129 maff1 = isl_multi_aff_add(maff1, maff2);
3130 maff1 = isl_multi_aff_gist(maff1, isl_set_copy(dom));
3134 int isl_multi_aff_is_empty(__isl_keep isl_multi_aff *maff)
3142 int isl_multi_aff_plain_is_equal(__isl_keep isl_multi_aff *maff1,
3143 __isl_keep isl_multi_aff *maff2)
3148 if (!maff1 || !maff2)
3150 if (maff1->n != maff2->n)
3152 equal = isl_space_is_equal(maff1->space, maff2->space);
3153 if (equal < 0 || !equal)
3156 for (i = 0; i < maff1->n; ++i) {
3157 equal = isl_aff_plain_is_equal(maff1->p[i], maff2->p[i]);
3158 if (equal < 0 || !equal)
3165 /* Return the set of domain elements where "ma1" is lexicographically
3166 * smaller than or equal to "ma2".
3168 __isl_give isl_set *isl_multi_aff_lex_le_set(__isl_take isl_multi_aff *ma1,
3169 __isl_take isl_multi_aff *ma2)
3171 return isl_multi_aff_lex_ge_set(ma2, ma1);
3174 /* Return the set of domain elements where "ma1" is lexicographically
3175 * greater than or equal to "ma2".
3177 __isl_give isl_set *isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff *ma1,
3178 __isl_take isl_multi_aff *ma2)
3181 isl_map *map1, *map2;
3184 map1 = isl_map_from_multi_aff(ma1);
3185 map2 = isl_map_from_multi_aff(ma2);
3186 map = isl_map_range_product(map1, map2);
3187 space = isl_space_range(isl_map_get_space(map));
3188 space = isl_space_domain(isl_space_unwrap(space));
3189 ge = isl_map_lex_ge(space);
3190 map = isl_map_intersect_range(map, isl_map_wrap(ge));
3192 return isl_map_domain(map);
3196 #define PW isl_pw_multi_aff
3198 #define EL isl_multi_aff
3200 #define EL_IS_ZERO is_empty
3204 #define IS_ZERO is_empty
3207 #undef DEFAULT_IS_ZERO
3208 #define DEFAULT_IS_ZERO 0
3213 #define NO_INVOLVES_DIMS
3214 #define NO_MOVE_DIMS
3215 #define NO_INSERT_DIMS
3219 #include <isl_pw_templ.c>
3222 #define UNION isl_union_pw_multi_aff
3224 #define PART isl_pw_multi_aff
3226 #define PARTS pw_multi_aff
3227 #define ALIGN_DOMAIN
3231 #include <isl_union_templ.c>
3233 /* Given a function "cmp" that returns the set of elements where
3234 * "ma1" is "better" than "ma2", return the intersection of this
3235 * set with "dom1" and "dom2".
3237 static __isl_give isl_set *shared_and_better(__isl_keep isl_set *dom1,
3238 __isl_keep isl_set *dom2, __isl_keep isl_multi_aff *ma1,
3239 __isl_keep isl_multi_aff *ma2,
3240 __isl_give isl_set *(*cmp)(__isl_take isl_multi_aff *ma1,
3241 __isl_take isl_multi_aff *ma2))
3247 common = isl_set_intersect(isl_set_copy(dom1), isl_set_copy(dom2));
3248 is_empty = isl_set_plain_is_empty(common);
3249 if (is_empty >= 0 && is_empty)
3252 return isl_set_free(common);
3253 better = cmp(isl_multi_aff_copy(ma1), isl_multi_aff_copy(ma2));
3254 better = isl_set_intersect(common, better);
3259 /* Given a function "cmp" that returns the set of elements where
3260 * "ma1" is "better" than "ma2", return a piecewise multi affine
3261 * expression defined on the union of the definition domains
3262 * of "pma1" and "pma2" that maps to the "best" of "pma1" and
3263 * "pma2" on each cell. If only one of the two input functions
3264 * is defined on a given cell, then it is considered the best.
3266 static __isl_give isl_pw_multi_aff *pw_multi_aff_union_opt(
3267 __isl_take isl_pw_multi_aff *pma1,
3268 __isl_take isl_pw_multi_aff *pma2,
3269 __isl_give isl_set *(*cmp)(__isl_take isl_multi_aff *ma1,
3270 __isl_take isl_multi_aff *ma2))
3273 isl_pw_multi_aff *res = NULL;
3275 isl_set *set = NULL;
3280 ctx = isl_space_get_ctx(pma1->dim);
3281 if (!isl_space_is_equal(pma1->dim, pma2->dim))
3282 isl_die(ctx, isl_error_invalid,
3283 "arguments should live in the same space", goto error);
3285 if (isl_pw_multi_aff_is_empty(pma1)) {
3286 isl_pw_multi_aff_free(pma1);
3290 if (isl_pw_multi_aff_is_empty(pma2)) {
3291 isl_pw_multi_aff_free(pma2);
3295 n = 2 * (pma1->n + 1) * (pma2->n + 1);
3296 res = isl_pw_multi_aff_alloc_size(isl_space_copy(pma1->dim), n);
3298 for (i = 0; i < pma1->n; ++i) {
3299 set = isl_set_copy(pma1->p[i].set);
3300 for (j = 0; j < pma2->n; ++j) {
3304 better = shared_and_better(pma2->p[j].set,
3305 pma1->p[i].set, pma2->p[j].maff,
3306 pma1->p[i].maff, cmp);
3307 is_empty = isl_set_plain_is_empty(better);
3308 if (is_empty < 0 || is_empty) {
3309 isl_set_free(better);
3314 set = isl_set_subtract(set, isl_set_copy(better));
3316 res = isl_pw_multi_aff_add_piece(res, better,
3317 isl_multi_aff_copy(pma2->p[j].maff));
3319 res = isl_pw_multi_aff_add_piece(res, set,
3320 isl_multi_aff_copy(pma1->p[i].maff));
3323 for (j = 0; j < pma2->n; ++j) {
3324 set = isl_set_copy(pma2->p[j].set);
3325 for (i = 0; i < pma1->n; ++i)
3326 set = isl_set_subtract(set,
3327 isl_set_copy(pma1->p[i].set));
3328 res = isl_pw_multi_aff_add_piece(res, set,
3329 isl_multi_aff_copy(pma2->p[j].maff));
3332 isl_pw_multi_aff_free(pma1);
3333 isl_pw_multi_aff_free(pma2);
3337 isl_pw_multi_aff_free(pma1);
3338 isl_pw_multi_aff_free(pma2);
3340 return isl_pw_multi_aff_free(res);
3343 static __isl_give isl_pw_multi_aff *pw_multi_aff_union_lexmax(
3344 __isl_take isl_pw_multi_aff *pma1,
3345 __isl_take isl_pw_multi_aff *pma2)
3347 return pw_multi_aff_union_opt(pma1, pma2, &isl_multi_aff_lex_ge_set);
3350 /* Given two piecewise multi affine expressions, return a piecewise
3351 * multi-affine expression defined on the union of the definition domains
3352 * of the inputs that is equal to the lexicographic maximum of the two
3353 * inputs on each cell. If only one of the two inputs is defined on
3354 * a given cell, then it is considered to be the maximum.
3356 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmax(
3357 __isl_take isl_pw_multi_aff *pma1,
3358 __isl_take isl_pw_multi_aff *pma2)
3360 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3361 &pw_multi_aff_union_lexmax);
3364 static __isl_give isl_pw_multi_aff *pw_multi_aff_union_lexmin(
3365 __isl_take isl_pw_multi_aff *pma1,
3366 __isl_take isl_pw_multi_aff *pma2)
3368 return pw_multi_aff_union_opt(pma1, pma2, &isl_multi_aff_lex_le_set);
3371 /* Given two piecewise multi affine expressions, return a piecewise
3372 * multi-affine expression defined on the union of the definition domains
3373 * of the inputs that is equal to the lexicographic minimum of the two
3374 * inputs on each cell. If only one of the two inputs is defined on
3375 * a given cell, then it is considered to be the minimum.
3377 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmin(
3378 __isl_take isl_pw_multi_aff *pma1,
3379 __isl_take isl_pw_multi_aff *pma2)
3381 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3382 &pw_multi_aff_union_lexmin);
3385 static __isl_give isl_pw_multi_aff *pw_multi_aff_add(
3386 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3388 return isl_pw_multi_aff_on_shared_domain(pma1, pma2,
3389 &isl_multi_aff_add);
3392 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_add(
3393 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3395 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3399 static __isl_give isl_pw_multi_aff *pw_multi_aff_sub(
3400 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3402 return isl_pw_multi_aff_on_shared_domain(pma1, pma2,
3403 &isl_multi_aff_sub);
3406 /* Subtract "pma2" from "pma1" and return the result.
3408 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_sub(
3409 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3411 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3415 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_add(
3416 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3418 return isl_pw_multi_aff_union_add_(pma1, pma2);
3421 /* Given two piecewise multi-affine expressions A -> B and C -> D,
3422 * construct a piecewise multi-affine expression [A -> C] -> [B -> D].
3424 static __isl_give isl_pw_multi_aff *pw_multi_aff_product(
3425 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3429 isl_pw_multi_aff *res;
3434 n = pma1->n * pma2->n;
3435 space = isl_space_product(isl_space_copy(pma1->dim),
3436 isl_space_copy(pma2->dim));
3437 res = isl_pw_multi_aff_alloc_size(space, n);
3439 for (i = 0; i < pma1->n; ++i) {
3440 for (j = 0; j < pma2->n; ++j) {
3444 domain = isl_set_product(isl_set_copy(pma1->p[i].set),
3445 isl_set_copy(pma2->p[j].set));
3446 ma = isl_multi_aff_product(
3447 isl_multi_aff_copy(pma1->p[i].maff),
3448 isl_multi_aff_copy(pma2->p[i].maff));
3449 res = isl_pw_multi_aff_add_piece(res, domain, ma);
3453 isl_pw_multi_aff_free(pma1);
3454 isl_pw_multi_aff_free(pma2);
3457 isl_pw_multi_aff_free(pma1);
3458 isl_pw_multi_aff_free(pma2);
3462 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_product(
3463 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3465 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3466 &pw_multi_aff_product);
3469 /* Construct a map mapping the domain of the piecewise multi-affine expression
3470 * to its range, with each dimension in the range equated to the
3471 * corresponding affine expression on its cell.
3473 __isl_give isl_map *isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
3481 map = isl_map_empty(isl_pw_multi_aff_get_space(pma));
3483 for (i = 0; i < pma->n; ++i) {
3484 isl_multi_aff *maff;
3485 isl_basic_map *bmap;
3488 maff = isl_multi_aff_copy(pma->p[i].maff);
3489 bmap = isl_basic_map_from_multi_aff(maff);
3490 map_i = isl_map_from_basic_map(bmap);
3491 map_i = isl_map_intersect_domain(map_i,
3492 isl_set_copy(pma->p[i].set));
3493 map = isl_map_union_disjoint(map, map_i);
3496 isl_pw_multi_aff_free(pma);
3500 __isl_give isl_set *isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
3505 if (!isl_space_is_set(pma->dim))
3506 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
3507 "isl_pw_multi_aff cannot be converted into an isl_set",
3508 return isl_pw_multi_aff_free(pma));
3510 return isl_map_from_pw_multi_aff(pma);
3513 /* Given a basic map with a single output dimension that is defined
3514 * in terms of the parameters and input dimensions using an equality,
3515 * extract an isl_aff that expresses the output dimension in terms
3516 * of the parameters and input dimensions.
3518 * Since some applications expect the result of isl_pw_multi_aff_from_map
3519 * to only contain integer affine expressions, we compute the floor
3520 * of the expression before returning.
3522 * This function shares some similarities with
3523 * isl_basic_map_has_defining_equality and isl_constraint_get_bound.
3525 static __isl_give isl_aff *extract_isl_aff_from_basic_map(
3526 __isl_take isl_basic_map *bmap)
3531 isl_local_space *ls;
3536 if (isl_basic_map_dim(bmap, isl_dim_out) != 1)
3537 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
3538 "basic map should have a single output dimension",
3540 offset = isl_basic_map_offset(bmap, isl_dim_out);
3541 total = isl_basic_map_total_dim(bmap);
3542 for (i = 0; i < bmap->n_eq; ++i) {
3543 if (isl_int_is_zero(bmap->eq[i][offset]))
3545 if (isl_seq_first_non_zero(bmap->eq[i] + offset + 1,
3546 1 + total - (offset + 1)) != -1)
3550 if (i >= bmap->n_eq)
3551 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
3552 "unable to find suitable equality", goto error);
3553 ls = isl_basic_map_get_local_space(bmap);
3554 aff = isl_aff_alloc(isl_local_space_domain(ls));
3557 if (isl_int_is_neg(bmap->eq[i][offset]))
3558 isl_seq_cpy(aff->v->el + 1, bmap->eq[i], offset);
3560 isl_seq_neg(aff->v->el + 1, bmap->eq[i], offset);
3561 isl_seq_clr(aff->v->el + 1 + offset, aff->v->size - (1 + offset));
3562 isl_int_abs(aff->v->el[0], bmap->eq[i][offset]);
3563 isl_basic_map_free(bmap);
3565 aff = isl_aff_remove_unused_divs(aff);
3566 aff = isl_aff_floor(aff);
3569 isl_basic_map_free(bmap);
3573 /* Given a basic map where each output dimension is defined
3574 * in terms of the parameters and input dimensions using an equality,
3575 * extract an isl_multi_aff that expresses the output dimensions in terms
3576 * of the parameters and input dimensions.
3578 static __isl_give isl_multi_aff *extract_isl_multi_aff_from_basic_map(
3579 __isl_take isl_basic_map *bmap)
3588 ma = isl_multi_aff_alloc(isl_basic_map_get_space(bmap));
3589 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3591 for (i = 0; i < n_out; ++i) {
3592 isl_basic_map *bmap_i;
3595 bmap_i = isl_basic_map_copy(bmap);
3596 bmap_i = isl_basic_map_project_out(bmap_i, isl_dim_out,
3597 i + 1, n_out - (1 + i));
3598 bmap_i = isl_basic_map_project_out(bmap_i, isl_dim_out, 0, i);
3599 aff = extract_isl_aff_from_basic_map(bmap_i);
3600 ma = isl_multi_aff_set_aff(ma, i, aff);
3603 isl_basic_map_free(bmap);
3608 /* Create an isl_pw_multi_aff that is equivalent to
3609 * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain).
3610 * The given basic map is such that each output dimension is defined
3611 * in terms of the parameters and input dimensions using an equality.
3613 static __isl_give isl_pw_multi_aff *plain_pw_multi_aff_from_map(
3614 __isl_take isl_set *domain, __isl_take isl_basic_map *bmap)
3618 ma = extract_isl_multi_aff_from_basic_map(bmap);
3619 return isl_pw_multi_aff_alloc(domain, ma);
3622 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
3623 * This obviously only works if the input "map" is single-valued.
3624 * If so, we compute the lexicographic minimum of the image in the form
3625 * of an isl_pw_multi_aff. Since the image is unique, it is equal
3626 * to its lexicographic minimum.
3627 * If the input is not single-valued, we produce an error.
3629 static __isl_give isl_pw_multi_aff *pw_multi_aff_from_map_base(
3630 __isl_take isl_map *map)
3634 isl_pw_multi_aff *pma;
3636 sv = isl_map_is_single_valued(map);
3640 isl_die(isl_map_get_ctx(map), isl_error_invalid,
3641 "map is not single-valued", goto error);
3642 map = isl_map_make_disjoint(map);
3646 pma = isl_pw_multi_aff_empty(isl_map_get_space(map));
3648 for (i = 0; i < map->n; ++i) {
3649 isl_pw_multi_aff *pma_i;
3650 isl_basic_map *bmap;
3651 bmap = isl_basic_map_copy(map->p[i]);
3652 pma_i = isl_basic_map_lexmin_pw_multi_aff(bmap);
3653 pma = isl_pw_multi_aff_add_disjoint(pma, pma_i);
3663 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
3664 * taking into account that the output dimension at position "d"
3665 * can be represented as
3667 * x = floor((e(...) + c1) / m)
3669 * given that constraint "i" is of the form
3671 * e(...) + c1 - m x >= 0
3674 * Let "map" be of the form
3678 * We construct a mapping
3680 * A -> [A -> x = floor(...)]
3682 * apply that to the map, obtaining
3684 * [A -> x = floor(...)] -> B
3686 * and equate dimension "d" to x.
3687 * We then compute a isl_pw_multi_aff representation of the resulting map
3688 * and plug in the mapping above.
3690 static __isl_give isl_pw_multi_aff *pw_multi_aff_from_map_div(
3691 __isl_take isl_map *map, __isl_take isl_basic_map *hull, int d, int i)
3695 isl_local_space *ls;
3703 isl_pw_multi_aff *pma;
3706 is_set = isl_map_is_set(map);
3708 offset = isl_basic_map_offset(hull, isl_dim_out);
3709 ctx = isl_map_get_ctx(map);
3710 space = isl_space_domain(isl_map_get_space(map));
3711 n_in = isl_space_dim(space, isl_dim_set);
3712 n = isl_space_dim(space, isl_dim_all);
3714 v = isl_vec_alloc(ctx, 1 + 1 + n);
3716 isl_int_neg(v->el[0], hull->ineq[i][offset + d]);
3717 isl_seq_cpy(v->el + 1, hull->ineq[i], 1 + n);
3719 isl_basic_map_free(hull);
3721 ls = isl_local_space_from_space(isl_space_copy(space));
3722 aff = isl_aff_alloc_vec(ls, v);
3723 aff = isl_aff_floor(aff);
3725 isl_space_free(space);
3726 ma = isl_multi_aff_from_aff(aff);
3728 ma = isl_multi_aff_identity(isl_space_map_from_set(space));
3729 ma = isl_multi_aff_range_product(ma,
3730 isl_multi_aff_from_aff(aff));
3733 insert = isl_map_from_multi_aff(isl_multi_aff_copy(ma));
3734 map = isl_map_apply_domain(map, insert);
3735 map = isl_map_equate(map, isl_dim_in, n_in, isl_dim_out, d);
3736 pma = isl_pw_multi_aff_from_map(map);
3737 pma = isl_pw_multi_aff_pullback_multi_aff(pma, ma);
3742 /* Is constraint "c" of the form
3744 * e(...) + c1 - m x >= 0
3748 * -e(...) + c2 + m x >= 0
3750 * where m > 1 and e only depends on parameters and input dimemnsions?
3752 * "offset" is the offset of the output dimensions
3753 * "pos" is the position of output dimension x.
3755 static int is_potential_div_constraint(isl_int *c, int offset, int d, int total)
3757 if (isl_int_is_zero(c[offset + d]))
3759 if (isl_int_is_one(c[offset + d]))
3761 if (isl_int_is_negone(c[offset + d]))
3763 if (isl_seq_first_non_zero(c + offset, d) != -1)
3765 if (isl_seq_first_non_zero(c + offset + d + 1,
3766 total - (offset + d + 1)) != -1)
3771 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
3773 * As a special case, we first check if there is any pair of constraints,
3774 * shared by all the basic maps in "map" that force a given dimension
3775 * to be equal to the floor of some affine combination of the input dimensions.
3777 * In particular, if we can find two constraints
3779 * e(...) + c1 - m x >= 0 i.e., m x <= e(...) + c1
3783 * -e(...) + c2 + m x >= 0 i.e., m x >= e(...) - c2
3785 * where m > 1 and e only depends on parameters and input dimemnsions,
3788 * c1 + c2 < m i.e., -c2 >= c1 - (m - 1)
3790 * then we know that we can take
3792 * x = floor((e(...) + c1) / m)
3794 * without having to perform any computation.
3796 * Note that we know that
3800 * If c1 + c2 were 0, then we would have detected an equality during
3801 * simplification. If c1 + c2 were negative, then we would have detected
3804 static __isl_give isl_pw_multi_aff *pw_multi_aff_from_map_check_div(
3805 __isl_take isl_map *map)
3811 isl_basic_map *hull;
3813 hull = isl_map_unshifted_simple_hull(isl_map_copy(map));
3818 dim = isl_map_dim(map, isl_dim_out);
3819 offset = isl_basic_map_offset(hull, isl_dim_out);
3820 total = 1 + isl_basic_map_total_dim(hull);
3822 for (d = 0; d < dim; ++d) {
3823 for (i = 0; i < n; ++i) {
3824 if (!is_potential_div_constraint(hull->ineq[i],
3827 for (j = i + 1; j < n; ++j) {
3828 if (!isl_seq_is_neg(hull->ineq[i] + 1,
3829 hull->ineq[j] + 1, total - 1))
3831 isl_int_add(sum, hull->ineq[i][0],
3833 if (isl_int_abs_lt(sum,
3834 hull->ineq[i][offset + d]))
3841 if (isl_int_is_pos(hull->ineq[j][offset + d]))
3843 return pw_multi_aff_from_map_div(map, hull, d, j);
3847 isl_basic_map_free(hull);
3848 return pw_multi_aff_from_map_base(map);
3851 isl_basic_map_free(hull);
3855 /* Given an affine expression
3857 * [A -> B] -> f(A,B)
3859 * construct an isl_multi_aff
3863 * such that dimension "d" in B' is set to "aff" and the remaining
3864 * dimensions are set equal to the corresponding dimensions in B.
3865 * "n_in" is the dimension of the space A.
3866 * "n_out" is the dimension of the space B.
3868 * If "is_set" is set, then the affine expression is of the form
3872 * and we construct an isl_multi_aff
3876 static __isl_give isl_multi_aff *range_map(__isl_take isl_aff *aff, int d,
3877 unsigned n_in, unsigned n_out, int is_set)
3881 isl_space *space, *space2;
3882 isl_local_space *ls;
3884 space = isl_aff_get_domain_space(aff);
3885 ls = isl_local_space_from_space(isl_space_copy(space));
3886 space2 = isl_space_copy(space);
3888 space2 = isl_space_range(isl_space_unwrap(space2));
3889 space = isl_space_map_from_domain_and_range(space, space2);
3890 ma = isl_multi_aff_alloc(space);
3891 ma = isl_multi_aff_set_aff(ma, d, aff);
3893 for (i = 0; i < n_out; ++i) {
3896 aff = isl_aff_var_on_domain(isl_local_space_copy(ls),
3897 isl_dim_set, n_in + i);
3898 ma = isl_multi_aff_set_aff(ma, i, aff);
3901 isl_local_space_free(ls);
3906 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
3907 * taking into account that the dimension at position "d" can be written as
3909 * x = m a + f(..) (1)
3911 * where m is equal to "gcd".
3912 * "i" is the index of the equality in "hull" that defines f(..).
3913 * In particular, the equality is of the form
3915 * f(..) - x + m g(existentials) = 0
3919 * -f(..) + x + m g(existentials) = 0
3921 * We basically plug (1) into "map", resulting in a map with "a"
3922 * in the range instead of "x". The corresponding isl_pw_multi_aff
3923 * defining "a" is then plugged back into (1) to obtain a definition fro "x".
3925 * Specifically, given the input map
3929 * We first wrap it into a set
3933 * and define (1) on top of the corresponding space, resulting in "aff".
3934 * We use this to create an isl_multi_aff that maps the output position "d"
3935 * from "a" to "x", leaving all other (intput and output) dimensions unchanged.
3936 * We plug this into the wrapped map, unwrap the result and compute the
3937 * corresponding isl_pw_multi_aff.
3938 * The result is an expression
3946 * so that we can plug that into "aff", after extending the latter to
3952 * If "map" is actually a set, then there is no "A" space, meaning
3953 * that we do not need to perform any wrapping, and that the result
3954 * of the recursive call is of the form
3958 * which is plugged into a mapping of the form
3962 static __isl_give isl_pw_multi_aff *pw_multi_aff_from_map_stride(
3963 __isl_take isl_map *map, __isl_take isl_basic_map *hull, int d, int i,
3968 isl_local_space *ls;
3971 isl_pw_multi_aff *pma, *id;
3977 is_set = isl_map_is_set(map);
3979 n_in = isl_basic_map_dim(hull, isl_dim_in);
3980 n_out = isl_basic_map_dim(hull, isl_dim_out);
3981 o_out = isl_basic_map_offset(hull, isl_dim_out);
3986 set = isl_map_wrap(map);
3987 space = isl_space_map_from_set(isl_set_get_space(set));
3988 ma = isl_multi_aff_identity(space);
3989 ls = isl_local_space_from_space(isl_set_get_space(set));
3990 aff = isl_aff_alloc(ls);
3992 isl_int_set_si(aff->v->el[0], 1);
3993 if (isl_int_is_one(hull->eq[i][o_out + d]))
3994 isl_seq_neg(aff->v->el + 1, hull->eq[i],
3997 isl_seq_cpy(aff->v->el + 1, hull->eq[i],
3999 isl_int_set(aff->v->el[1 + o_out + d], gcd);
4001 ma = isl_multi_aff_set_aff(ma, n_in + d, isl_aff_copy(aff));
4002 set = isl_set_preimage_multi_aff(set, ma);
4004 ma = range_map(aff, d, n_in, n_out, is_set);
4009 map = isl_set_unwrap(set);
4010 pma = isl_pw_multi_aff_from_map(set);
4013 space = isl_pw_multi_aff_get_domain_space(pma);
4014 space = isl_space_map_from_set(space);
4015 id = isl_pw_multi_aff_identity(space);
4016 pma = isl_pw_multi_aff_range_product(id, pma);
4018 id = isl_pw_multi_aff_from_multi_aff(ma);
4019 pma = isl_pw_multi_aff_pullback_pw_multi_aff(id, pma);
4021 isl_basic_map_free(hull);
4025 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4027 * As a special case, we first check if all output dimensions are uniquely
4028 * defined in terms of the parameters and input dimensions over the entire
4029 * domain. If so, we extract the desired isl_pw_multi_aff directly
4030 * from the affine hull of "map" and its domain.
4032 * Otherwise, we check if any of the output dimensions is "strided".
4033 * That is, we check if can be written as
4037 * with m greater than 1, a some combination of existentiall quantified
4038 * variables and f and expression in the parameters and input dimensions.
4039 * If so, we remove the stride in pw_multi_aff_from_map_stride.
4041 * Otherwise, we continue with pw_multi_aff_from_map_check_div for a further
4044 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_map(__isl_take isl_map *map)
4048 isl_basic_map *hull;
4058 hull = isl_map_affine_hull(isl_map_copy(map));
4059 sv = isl_basic_map_plain_is_single_valued(hull);
4061 return plain_pw_multi_aff_from_map(isl_map_domain(map), hull);
4063 hull = isl_basic_map_free(hull);
4067 n_div = isl_basic_map_dim(hull, isl_dim_div);
4068 o_div = isl_basic_map_offset(hull, isl_dim_div);
4071 isl_basic_map_free(hull);
4072 return pw_multi_aff_from_map_check_div(map);
4077 n_out = isl_basic_map_dim(hull, isl_dim_out);
4078 o_out = isl_basic_map_offset(hull, isl_dim_out);
4080 for (i = 0; i < n_out; ++i) {
4081 for (j = 0; j < hull->n_eq; ++j) {
4082 isl_int *eq = hull->eq[j];
4083 isl_pw_multi_aff *res;
4085 if (!isl_int_is_one(eq[o_out + i]) &&
4086 !isl_int_is_negone(eq[o_out + i]))
4088 if (isl_seq_first_non_zero(eq + o_out, i) != -1)
4090 if (isl_seq_first_non_zero(eq + o_out + i + 1,
4091 n_out - (i + 1)) != -1)
4093 isl_seq_gcd(eq + o_div, n_div, &gcd);
4094 if (isl_int_is_zero(gcd))
4096 if (isl_int_is_one(gcd))
4099 res = pw_multi_aff_from_map_stride(map, hull,
4107 isl_basic_map_free(hull);
4108 return pw_multi_aff_from_map_check_div(map);
4114 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_set(__isl_take isl_set *set)
4116 return isl_pw_multi_aff_from_map(set);
4119 /* Convert "map" into an isl_pw_multi_aff (if possible) and
4122 static int pw_multi_aff_from_map(__isl_take isl_map *map, void *user)
4124 isl_union_pw_multi_aff **upma = user;
4125 isl_pw_multi_aff *pma;
4127 pma = isl_pw_multi_aff_from_map(map);
4128 *upma = isl_union_pw_multi_aff_add_pw_multi_aff(*upma, pma);
4130 return *upma ? 0 : -1;
4133 /* Try and create an isl_union_pw_multi_aff that is equivalent
4134 * to the given isl_union_map.
4135 * The isl_union_map is required to be single-valued in each space.
4136 * Otherwise, an error is produced.
4138 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_union_map(
4139 __isl_take isl_union_map *umap)
4142 isl_union_pw_multi_aff *upma;
4144 space = isl_union_map_get_space(umap);
4145 upma = isl_union_pw_multi_aff_empty(space);
4146 if (isl_union_map_foreach_map(umap, &pw_multi_aff_from_map, &upma) < 0)
4147 upma = isl_union_pw_multi_aff_free(upma);
4148 isl_union_map_free(umap);
4153 /* Try and create an isl_union_pw_multi_aff that is equivalent
4154 * to the given isl_union_set.
4155 * The isl_union_set is required to be a singleton in each space.
4156 * Otherwise, an error is produced.
4158 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_union_set(
4159 __isl_take isl_union_set *uset)
4161 return isl_union_pw_multi_aff_from_union_map(uset);
4164 /* Return the piecewise affine expression "set ? 1 : 0".
4166 __isl_give isl_pw_aff *isl_set_indicator_function(__isl_take isl_set *set)
4169 isl_space *space = isl_set_get_space(set);
4170 isl_local_space *ls = isl_local_space_from_space(space);
4171 isl_aff *zero = isl_aff_zero_on_domain(isl_local_space_copy(ls));
4172 isl_aff *one = isl_aff_zero_on_domain(ls);
4174 one = isl_aff_add_constant_si(one, 1);
4175 pa = isl_pw_aff_alloc(isl_set_copy(set), one);
4176 set = isl_set_complement(set);
4177 pa = isl_pw_aff_add_disjoint(pa, isl_pw_aff_alloc(set, zero));
4182 /* Plug in "subs" for dimension "type", "pos" of "aff".
4184 * Let i be the dimension to replace and let "subs" be of the form
4188 * and "aff" of the form
4194 * (a f + d g')/(m d)
4196 * where g' is the result of plugging in "subs" in each of the integer
4199 __isl_give isl_aff *isl_aff_substitute(__isl_take isl_aff *aff,
4200 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
4205 aff = isl_aff_cow(aff);
4207 return isl_aff_free(aff);
4209 ctx = isl_aff_get_ctx(aff);
4210 if (!isl_space_is_equal(aff->ls->dim, subs->ls->dim))
4211 isl_die(ctx, isl_error_invalid,
4212 "spaces don't match", return isl_aff_free(aff));
4213 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
4214 isl_die(ctx, isl_error_unsupported,
4215 "cannot handle divs yet", return isl_aff_free(aff));
4217 aff->ls = isl_local_space_substitute(aff->ls, type, pos, subs);
4219 return isl_aff_free(aff);
4221 aff->v = isl_vec_cow(aff->v);
4223 return isl_aff_free(aff);
4225 pos += isl_local_space_offset(aff->ls, type);
4228 isl_seq_substitute(aff->v->el, pos, subs->v->el,
4229 aff->v->size, subs->v->size, v);
4235 /* Plug in "subs" for dimension "type", "pos" in each of the affine
4236 * expressions in "maff".
4238 __isl_give isl_multi_aff *isl_multi_aff_substitute(
4239 __isl_take isl_multi_aff *maff, enum isl_dim_type type, unsigned pos,
4240 __isl_keep isl_aff *subs)
4244 maff = isl_multi_aff_cow(maff);
4246 return isl_multi_aff_free(maff);
4248 if (type == isl_dim_in)
4251 for (i = 0; i < maff->n; ++i) {
4252 maff->p[i] = isl_aff_substitute(maff->p[i], type, pos, subs);
4254 return isl_multi_aff_free(maff);
4260 /* Plug in "subs" for dimension "type", "pos" of "pma".
4262 * pma is of the form
4266 * while subs is of the form
4268 * v' = B_j(v) -> S_j
4270 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
4271 * has a contribution in the result, in particular
4273 * C_ij(S_j) -> M_i(S_j)
4275 * Note that plugging in S_j in C_ij may also result in an empty set
4276 * and this contribution should simply be discarded.
4278 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_substitute(
4279 __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos,
4280 __isl_keep isl_pw_aff *subs)
4283 isl_pw_multi_aff *res;
4286 return isl_pw_multi_aff_free(pma);
4288 n = pma->n * subs->n;
4289 res = isl_pw_multi_aff_alloc_size(isl_space_copy(pma->dim), n);
4291 for (i = 0; i < pma->n; ++i) {
4292 for (j = 0; j < subs->n; ++j) {
4294 isl_multi_aff *res_ij;
4297 common = isl_set_intersect(
4298 isl_set_copy(pma->p[i].set),
4299 isl_set_copy(subs->p[j].set));
4300 common = isl_set_substitute(common,
4301 type, pos, subs->p[j].aff);
4302 empty = isl_set_plain_is_empty(common);
4303 if (empty < 0 || empty) {
4304 isl_set_free(common);
4310 res_ij = isl_multi_aff_substitute(
4311 isl_multi_aff_copy(pma->p[i].maff),
4312 type, pos, subs->p[j].aff);
4314 res = isl_pw_multi_aff_add_piece(res, common, res_ij);
4318 isl_pw_multi_aff_free(pma);
4321 isl_pw_multi_aff_free(pma);
4322 isl_pw_multi_aff_free(res);
4326 /* Compute the preimage of a range of dimensions in the affine expression "src"
4327 * under "ma" and put the result in "dst". The number of dimensions in "src"
4328 * that precede the range is given by "n_before". The number of dimensions
4329 * in the range is given by the number of output dimensions of "ma".
4330 * The number of dimensions that follow the range is given by "n_after".
4331 * If "has_denom" is set (to one),
4332 * then "src" and "dst" have an extra initial denominator.
4333 * "n_div_ma" is the number of existentials in "ma"
4334 * "n_div_bset" is the number of existentials in "src"
4335 * The resulting "dst" (which is assumed to have been allocated by
4336 * the caller) contains coefficients for both sets of existentials,
4337 * first those in "ma" and then those in "src".
4338 * f, c1, c2 and g are temporary objects that have been initialized
4341 * Let src represent the expression
4343 * (a(p) + f_u u + b v + f_w w + c(divs))/d
4345 * and let ma represent the expressions
4347 * v_i = (r_i(p) + s_i(y) + t_i(divs'))/m_i
4349 * We start out with the following expression for dst:
4351 * (a(p) + f_u u + 0 y + f_w w + 0 divs' + c(divs) + f \sum_i b_i v_i)/d
4353 * with the multiplication factor f initially equal to 1
4354 * and f \sum_i b_i v_i kept separately.
4355 * For each x_i that we substitute, we multiply the numerator
4356 * (and denominator) of dst by c_1 = m_i and add the numerator
4357 * of the x_i expression multiplied by c_2 = f b_i,
4358 * after removing the common factors of c_1 and c_2.
4359 * The multiplication factor f also needs to be multiplied by c_1
4360 * for the next x_j, j > i.
4362 void isl_seq_preimage(isl_int *dst, isl_int *src,
4363 __isl_keep isl_multi_aff *ma, int n_before, int n_after,
4364 int n_div_ma, int n_div_bmap,
4365 isl_int f, isl_int c1, isl_int c2, isl_int g, int has_denom)
4368 int n_param, n_in, n_out;
4371 n_param = isl_multi_aff_dim(ma, isl_dim_param);
4372 n_in = isl_multi_aff_dim(ma, isl_dim_in);
4373 n_out = isl_multi_aff_dim(ma, isl_dim_out);
4375 isl_seq_cpy(dst, src, has_denom + 1 + n_param + n_before);
4376 o_dst = o_src = has_denom + 1 + n_param + n_before;
4377 isl_seq_clr(dst + o_dst, n_in);
4380 isl_seq_cpy(dst + o_dst, src + o_src, n_after);
4383 isl_seq_clr(dst + o_dst, n_div_ma);
4385 isl_seq_cpy(dst + o_dst, src + o_src, n_div_bmap);
4387 isl_int_set_si(f, 1);
4389 for (i = 0; i < n_out; ++i) {
4390 int offset = has_denom + 1 + n_param + n_before + i;
4392 if (isl_int_is_zero(src[offset]))
4394 isl_int_set(c1, ma->p[i]->v->el[0]);
4395 isl_int_mul(c2, f, src[offset]);
4396 isl_int_gcd(g, c1, c2);
4397 isl_int_divexact(c1, c1, g);
4398 isl_int_divexact(c2, c2, g);
4400 isl_int_mul(f, f, c1);
4403 isl_seq_combine(dst + o_dst, c1, dst + o_dst,
4404 c2, ma->p[i]->v->el + o_src, 1 + n_param);
4405 o_dst += 1 + n_param;
4406 o_src += 1 + n_param;
4407 isl_seq_scale(dst + o_dst, dst + o_dst, c1, n_before);
4409 isl_seq_combine(dst + o_dst, c1, dst + o_dst,
4410 c2, ma->p[i]->v->el + o_src, n_in);
4413 isl_seq_scale(dst + o_dst, dst + o_dst, c1, n_after);
4415 isl_seq_combine(dst + o_dst, c1, dst + o_dst,
4416 c2, ma->p[i]->v->el + o_src, n_div_ma);
4419 isl_seq_scale(dst + o_dst, dst + o_dst, c1, n_div_bmap);
4421 isl_int_mul(dst[0], dst[0], c1);
4425 /* Compute the pullback of "aff" by the function represented by "ma".
4426 * In other words, plug in "ma" in "aff". The result is an affine expression
4427 * defined over the domain space of "ma".
4429 * If "aff" is represented by
4431 * (a(p) + b x + c(divs))/d
4433 * and ma is represented by
4435 * x = D(p) + F(y) + G(divs')
4437 * then the result is
4439 * (a(p) + b D(p) + b F(y) + b G(divs') + c(divs))/d
4441 * The divs in the local space of the input are similarly adjusted
4442 * through a call to isl_local_space_preimage_multi_aff.
4444 __isl_give isl_aff *isl_aff_pullback_multi_aff(__isl_take isl_aff *aff,
4445 __isl_take isl_multi_aff *ma)
4447 isl_aff *res = NULL;
4448 isl_local_space *ls;
4449 int n_div_aff, n_div_ma;
4450 isl_int f, c1, c2, g;
4452 ma = isl_multi_aff_align_divs(ma);
4456 n_div_aff = isl_aff_dim(aff, isl_dim_div);
4457 n_div_ma = ma->n ? isl_aff_dim(ma->p[0], isl_dim_div) : 0;
4459 ls = isl_aff_get_domain_local_space(aff);
4460 ls = isl_local_space_preimage_multi_aff(ls, isl_multi_aff_copy(ma));
4461 res = isl_aff_alloc(ls);
4470 isl_seq_preimage(res->v->el, aff->v->el, ma, 0, 0, n_div_ma, n_div_aff,
4479 isl_multi_aff_free(ma);
4480 res = isl_aff_normalize(res);
4484 isl_multi_aff_free(ma);
4489 /* Compute the pullback of "ma1" by the function represented by "ma2".
4490 * In other words, plug in "ma2" in "ma1".
4492 __isl_give isl_multi_aff *isl_multi_aff_pullback_multi_aff(
4493 __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2)
4496 isl_space *space = NULL;
4498 ma2 = isl_multi_aff_align_divs(ma2);
4499 ma1 = isl_multi_aff_cow(ma1);
4503 space = isl_space_join(isl_multi_aff_get_space(ma2),
4504 isl_multi_aff_get_space(ma1));
4506 for (i = 0; i < ma1->n; ++i) {
4507 ma1->p[i] = isl_aff_pullback_multi_aff(ma1->p[i],
4508 isl_multi_aff_copy(ma2));
4513 ma1 = isl_multi_aff_reset_space(ma1, space);
4514 isl_multi_aff_free(ma2);
4517 isl_space_free(space);
4518 isl_multi_aff_free(ma2);
4519 isl_multi_aff_free(ma1);
4523 /* Extend the local space of "dst" to include the divs
4524 * in the local space of "src".
4526 __isl_give isl_aff *isl_aff_align_divs(__isl_take isl_aff *dst,
4527 __isl_keep isl_aff *src)
4535 return isl_aff_free(dst);
4537 ctx = isl_aff_get_ctx(src);
4538 if (!isl_space_is_equal(src->ls->dim, dst->ls->dim))
4539 isl_die(ctx, isl_error_invalid,
4540 "spaces don't match", goto error);
4542 if (src->ls->div->n_row == 0)
4545 exp1 = isl_alloc_array(ctx, int, src->ls->div->n_row);
4546 exp2 = isl_alloc_array(ctx, int, dst->ls->div->n_row);
4550 div = isl_merge_divs(src->ls->div, dst->ls->div, exp1, exp2);
4551 dst = isl_aff_expand_divs(dst, div, exp2);
4559 return isl_aff_free(dst);
4562 /* Adjust the local spaces of the affine expressions in "maff"
4563 * such that they all have the save divs.
4565 __isl_give isl_multi_aff *isl_multi_aff_align_divs(
4566 __isl_take isl_multi_aff *maff)
4574 maff = isl_multi_aff_cow(maff);
4578 for (i = 1; i < maff->n; ++i)
4579 maff->p[0] = isl_aff_align_divs(maff->p[0], maff->p[i]);
4580 for (i = 1; i < maff->n; ++i) {
4581 maff->p[i] = isl_aff_align_divs(maff->p[i], maff->p[0]);
4583 return isl_multi_aff_free(maff);
4589 __isl_give isl_aff *isl_aff_lift(__isl_take isl_aff *aff)
4591 aff = isl_aff_cow(aff);
4595 aff->ls = isl_local_space_lift(aff->ls);
4597 return isl_aff_free(aff);
4602 /* Lift "maff" to a space with extra dimensions such that the result
4603 * has no more existentially quantified variables.
4604 * If "ls" is not NULL, then *ls is assigned the local space that lies
4605 * at the basis of the lifting applied to "maff".
4607 __isl_give isl_multi_aff *isl_multi_aff_lift(__isl_take isl_multi_aff *maff,
4608 __isl_give isl_local_space **ls)
4622 isl_space *space = isl_multi_aff_get_domain_space(maff);
4623 *ls = isl_local_space_from_space(space);
4625 return isl_multi_aff_free(maff);
4630 maff = isl_multi_aff_cow(maff);
4631 maff = isl_multi_aff_align_divs(maff);
4635 n_div = isl_aff_dim(maff->p[0], isl_dim_div);
4636 space = isl_multi_aff_get_space(maff);
4637 space = isl_space_lift(isl_space_domain(space), n_div);
4638 space = isl_space_extend_domain_with_range(space,
4639 isl_multi_aff_get_space(maff));
4641 return isl_multi_aff_free(maff);
4642 isl_space_free(maff->space);
4643 maff->space = space;
4646 *ls = isl_aff_get_domain_local_space(maff->p[0]);
4648 return isl_multi_aff_free(maff);
4651 for (i = 0; i < maff->n; ++i) {
4652 maff->p[i] = isl_aff_lift(maff->p[i]);
4660 isl_local_space_free(*ls);
4661 return isl_multi_aff_free(maff);
4665 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
4667 __isl_give isl_pw_aff *isl_pw_multi_aff_get_pw_aff(
4668 __isl_keep isl_pw_multi_aff *pma, int pos)
4678 n_out = isl_pw_multi_aff_dim(pma, isl_dim_out);
4679 if (pos < 0 || pos >= n_out)
4680 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
4681 "index out of bounds", return NULL);
4683 space = isl_pw_multi_aff_get_space(pma);
4684 space = isl_space_drop_dims(space, isl_dim_out,
4685 pos + 1, n_out - pos - 1);
4686 space = isl_space_drop_dims(space, isl_dim_out, 0, pos);
4688 pa = isl_pw_aff_alloc_size(space, pma->n);
4689 for (i = 0; i < pma->n; ++i) {
4691 aff = isl_multi_aff_get_aff(pma->p[i].maff, pos);
4692 pa = isl_pw_aff_add_piece(pa, isl_set_copy(pma->p[i].set), aff);
4698 /* Return an isl_pw_multi_aff with the given "set" as domain and
4699 * an unnamed zero-dimensional range.
4701 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_domain(
4702 __isl_take isl_set *set)
4707 space = isl_set_get_space(set);
4708 space = isl_space_from_domain(space);
4709 ma = isl_multi_aff_zero(space);
4710 return isl_pw_multi_aff_alloc(set, ma);
4713 /* Add an isl_pw_multi_aff with the given "set" as domain and
4714 * an unnamed zero-dimensional range to *user.
4716 static int add_pw_multi_aff_from_domain(__isl_take isl_set *set, void *user)
4718 isl_union_pw_multi_aff **upma = user;
4719 isl_pw_multi_aff *pma;
4721 pma = isl_pw_multi_aff_from_domain(set);
4722 *upma = isl_union_pw_multi_aff_add_pw_multi_aff(*upma, pma);
4727 /* Return an isl_union_pw_multi_aff with the given "uset" as domain and
4728 * an unnamed zero-dimensional range.
4730 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_domain(
4731 __isl_take isl_union_set *uset)
4734 isl_union_pw_multi_aff *upma;
4739 space = isl_union_set_get_space(uset);
4740 upma = isl_union_pw_multi_aff_empty(space);
4742 if (isl_union_set_foreach_set(uset,
4743 &add_pw_multi_aff_from_domain, &upma) < 0)
4746 isl_union_set_free(uset);
4749 isl_union_set_free(uset);
4750 isl_union_pw_multi_aff_free(upma);
4754 /* Convert "pma" to an isl_map and add it to *umap.
4756 static int map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma, void *user)
4758 isl_union_map **umap = user;
4761 map = isl_map_from_pw_multi_aff(pma);
4762 *umap = isl_union_map_add_map(*umap, map);
4767 /* Construct a union map mapping the domain of the union
4768 * piecewise multi-affine expression to its range, with each dimension
4769 * in the range equated to the corresponding affine expression on its cell.
4771 __isl_give isl_union_map *isl_union_map_from_union_pw_multi_aff(
4772 __isl_take isl_union_pw_multi_aff *upma)
4775 isl_union_map *umap;
4780 space = isl_union_pw_multi_aff_get_space(upma);
4781 umap = isl_union_map_empty(space);
4783 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma,
4784 &map_from_pw_multi_aff, &umap) < 0)
4787 isl_union_pw_multi_aff_free(upma);
4790 isl_union_pw_multi_aff_free(upma);
4791 isl_union_map_free(umap);
4795 /* Local data for bin_entry and the callback "fn".
4797 struct isl_union_pw_multi_aff_bin_data {
4798 isl_union_pw_multi_aff *upma2;
4799 isl_union_pw_multi_aff *res;
4800 isl_pw_multi_aff *pma;
4801 int (*fn)(void **entry, void *user);
4804 /* Given an isl_pw_multi_aff from upma1, store it in data->pma
4805 * and call data->fn for each isl_pw_multi_aff in data->upma2.
4807 static int bin_entry(void **entry, void *user)
4809 struct isl_union_pw_multi_aff_bin_data *data = user;
4810 isl_pw_multi_aff *pma = *entry;
4813 if (isl_hash_table_foreach(data->upma2->dim->ctx, &data->upma2->table,
4814 data->fn, data) < 0)
4820 /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2".
4821 * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is
4822 * passed as user field) and the isl_pw_multi_aff from upma2 is available
4823 * as *entry. The callback should adjust data->res if desired.
4825 static __isl_give isl_union_pw_multi_aff *bin_op(
4826 __isl_take isl_union_pw_multi_aff *upma1,
4827 __isl_take isl_union_pw_multi_aff *upma2,
4828 int (*fn)(void **entry, void *user))
4831 struct isl_union_pw_multi_aff_bin_data data = { NULL, NULL, NULL, fn };
4833 space = isl_union_pw_multi_aff_get_space(upma2);
4834 upma1 = isl_union_pw_multi_aff_align_params(upma1, space);
4835 space = isl_union_pw_multi_aff_get_space(upma1);
4836 upma2 = isl_union_pw_multi_aff_align_params(upma2, space);
4838 if (!upma1 || !upma2)
4842 data.res = isl_union_pw_multi_aff_alloc(isl_space_copy(upma1->dim),
4844 if (isl_hash_table_foreach(upma1->dim->ctx, &upma1->table,
4845 &bin_entry, &data) < 0)
4848 isl_union_pw_multi_aff_free(upma1);
4849 isl_union_pw_multi_aff_free(upma2);
4852 isl_union_pw_multi_aff_free(upma1);
4853 isl_union_pw_multi_aff_free(upma2);
4854 isl_union_pw_multi_aff_free(data.res);
4858 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
4859 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
4861 static __isl_give isl_pw_multi_aff *pw_multi_aff_range_product(
4862 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
4866 space = isl_space_range_product(isl_pw_multi_aff_get_space(pma1),
4867 isl_pw_multi_aff_get_space(pma2));
4868 return isl_pw_multi_aff_on_shared_domain_in(pma1, pma2, space,
4869 &isl_multi_aff_range_product);
4872 /* Given two isl_pw_multi_affs A -> B and C -> D,
4873 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
4875 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_range_product(
4876 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
4878 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
4879 &pw_multi_aff_range_product);
4882 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
4883 * construct an isl_pw_multi_aff (A * C) -> (B, D).
4885 static __isl_give isl_pw_multi_aff *pw_multi_aff_flat_range_product(
4886 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
4890 space = isl_space_range_product(isl_pw_multi_aff_get_space(pma1),
4891 isl_pw_multi_aff_get_space(pma2));
4892 space = isl_space_flatten_range(space);
4893 return isl_pw_multi_aff_on_shared_domain_in(pma1, pma2, space,
4894 &isl_multi_aff_flat_range_product);
4897 /* Given two isl_pw_multi_affs A -> B and C -> D,
4898 * construct an isl_pw_multi_aff (A * C) -> (B, D).
4900 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_flat_range_product(
4901 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
4903 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
4904 &pw_multi_aff_flat_range_product);
4907 /* If data->pma and *entry have the same domain space, then compute
4908 * their flat range product and the result to data->res.
4910 static int flat_range_product_entry(void **entry, void *user)
4912 struct isl_union_pw_multi_aff_bin_data *data = user;
4913 isl_pw_multi_aff *pma2 = *entry;
4915 if (!isl_space_tuple_match(data->pma->dim, isl_dim_in,
4916 pma2->dim, isl_dim_in))
4919 pma2 = isl_pw_multi_aff_flat_range_product(
4920 isl_pw_multi_aff_copy(data->pma),
4921 isl_pw_multi_aff_copy(pma2));
4923 data->res = isl_union_pw_multi_aff_add_pw_multi_aff(data->res, pma2);
4928 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
4929 * construct an isl_union_pw_multi_aff (A * C) -> (B, D).
4931 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_flat_range_product(
4932 __isl_take isl_union_pw_multi_aff *upma1,
4933 __isl_take isl_union_pw_multi_aff *upma2)
4935 return bin_op(upma1, upma2, &flat_range_product_entry);
4938 /* Replace the affine expressions at position "pos" in "pma" by "pa".
4939 * The parameters are assumed to have been aligned.
4941 * The implementation essentially performs an isl_pw_*_on_shared_domain,
4942 * except that it works on two different isl_pw_* types.
4944 static __isl_give isl_pw_multi_aff *pw_multi_aff_set_pw_aff(
4945 __isl_take isl_pw_multi_aff *pma, unsigned pos,
4946 __isl_take isl_pw_aff *pa)
4949 isl_pw_multi_aff *res = NULL;
4954 if (!isl_space_tuple_match(pma->dim, isl_dim_in, pa->dim, isl_dim_in))
4955 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
4956 "domains don't match", goto error);
4957 if (pos >= isl_pw_multi_aff_dim(pma, isl_dim_out))
4958 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
4959 "index out of bounds", goto error);
4962 res = isl_pw_multi_aff_alloc_size(isl_pw_multi_aff_get_space(pma), n);
4964 for (i = 0; i < pma->n; ++i) {
4965 for (j = 0; j < pa->n; ++j) {
4967 isl_multi_aff *res_ij;
4970 common = isl_set_intersect(isl_set_copy(pma->p[i].set),
4971 isl_set_copy(pa->p[j].set));
4972 empty = isl_set_plain_is_empty(common);
4973 if (empty < 0 || empty) {
4974 isl_set_free(common);
4980 res_ij = isl_multi_aff_set_aff(
4981 isl_multi_aff_copy(pma->p[i].maff), pos,
4982 isl_aff_copy(pa->p[j].aff));
4983 res_ij = isl_multi_aff_gist(res_ij,
4984 isl_set_copy(common));
4986 res = isl_pw_multi_aff_add_piece(res, common, res_ij);
4990 isl_pw_multi_aff_free(pma);
4991 isl_pw_aff_free(pa);
4994 isl_pw_multi_aff_free(pma);
4995 isl_pw_aff_free(pa);
4996 return isl_pw_multi_aff_free(res);
4999 /* Replace the affine expressions at position "pos" in "pma" by "pa".
5001 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_set_pw_aff(
5002 __isl_take isl_pw_multi_aff *pma, unsigned pos,
5003 __isl_take isl_pw_aff *pa)
5007 if (isl_space_match(pma->dim, isl_dim_param, pa->dim, isl_dim_param))
5008 return pw_multi_aff_set_pw_aff(pma, pos, pa);
5009 if (!isl_space_has_named_params(pma->dim) ||
5010 !isl_space_has_named_params(pa->dim))
5011 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
5012 "unaligned unnamed parameters", goto error);
5013 pma = isl_pw_multi_aff_align_params(pma, isl_pw_aff_get_space(pa));
5014 pa = isl_pw_aff_align_params(pa, isl_pw_multi_aff_get_space(pma));
5015 return pw_multi_aff_set_pw_aff(pma, pos, pa);
5017 isl_pw_multi_aff_free(pma);
5018 isl_pw_aff_free(pa);
5022 /* Check that the domain space of "pa" matches "space".
5024 * Return 0 on success and -1 on error.
5026 int isl_pw_aff_check_match_domain_space(__isl_keep isl_pw_aff *pa,
5027 __isl_keep isl_space *space)
5029 isl_space *pa_space;
5035 pa_space = isl_pw_aff_get_space(pa);
5037 match = isl_space_match(space, isl_dim_param, pa_space, isl_dim_param);
5041 isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid,
5042 "parameters don't match", goto error);
5043 match = isl_space_tuple_match(space, isl_dim_in, pa_space, isl_dim_in);
5047 isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid,
5048 "domains don't match", goto error);
5049 isl_space_free(pa_space);
5052 isl_space_free(pa_space);
5059 #include <isl_multi_templ.c>
5061 /* Scale the first elements of "ma" by the corresponding elements of "vec".
5063 __isl_give isl_multi_aff *isl_multi_aff_scale_vec(__isl_take isl_multi_aff *ma,
5064 __isl_take isl_vec *vec)
5072 n = isl_multi_aff_dim(ma, isl_dim_out);
5073 if (isl_vec_size(vec) < n)
5074 n = isl_vec_size(vec);
5077 for (i = 0; i < n; ++i) {
5080 isl_vec_get_element(vec, i, &v);
5082 aff = isl_multi_aff_get_aff(ma, i);
5083 aff = isl_aff_scale(aff, v);
5084 ma = isl_multi_aff_set_aff(ma, i, aff);
5092 isl_multi_aff_free(ma);
5096 /* Scale the first elements of "pma" by the corresponding elements of "vec".
5098 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_scale_vec(
5099 __isl_take isl_pw_multi_aff *pma, __isl_take isl_vec *v)
5103 pma = isl_pw_multi_aff_cow(pma);
5107 for (i = 0; i < pma->n; ++i) {
5108 pma->p[i].maff = isl_multi_aff_scale_vec(pma->p[i].maff,
5110 if (!pma->p[i].maff)
5118 isl_pw_multi_aff_free(pma);
5122 /* This function is called for each entry of an isl_union_pw_multi_aff.
5123 * Replace the entry by the result of applying isl_pw_multi_aff_scale_vec
5124 * to the original entry with the isl_vec in "user" as extra argument.
5126 static int union_pw_multi_aff_scale_vec_entry(void **entry, void *user)
5128 isl_pw_multi_aff **pma = (isl_pw_multi_aff **) entry;
5131 *pma = isl_pw_multi_aff_scale_vec(*pma, isl_vec_copy(v));
5138 /* Scale the first elements of "upma" by the corresponding elements of "vec".
5140 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_scale_vec(
5141 __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_vec *v)
5143 upma = isl_union_pw_multi_aff_cow(upma);
5147 if (isl_hash_table_foreach(upma->dim->ctx, &upma->table,
5148 &union_pw_multi_aff_scale_vec_entry, v) < 0)
5155 isl_union_pw_multi_aff_free(upma);