2 * Copyright 2011 INRIA Saclay
3 * Copyright 2011 Sven Verdoolaege
4 * Copyright 2012 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_list_private.h>
23 #include <isl/constraint.h>
26 #include <isl_config.h>
28 __isl_give isl_aff *isl_aff_alloc_vec(__isl_take isl_local_space *ls,
29 __isl_take isl_vec *v)
36 aff = isl_calloc_type(v->ctx, struct isl_aff);
46 isl_local_space_free(ls);
51 __isl_give isl_aff *isl_aff_alloc(__isl_take isl_local_space *ls)
60 ctx = isl_local_space_get_ctx(ls);
61 if (!isl_local_space_divs_known(ls))
62 isl_die(ctx, isl_error_invalid, "local space has unknown divs",
64 if (!isl_local_space_is_set(ls))
65 isl_die(ctx, isl_error_invalid,
66 "domain of affine expression should be a set",
69 total = isl_local_space_dim(ls, isl_dim_all);
70 v = isl_vec_alloc(ctx, 1 + 1 + total);
71 return isl_aff_alloc_vec(ls, v);
73 isl_local_space_free(ls);
77 __isl_give isl_aff *isl_aff_zero_on_domain(__isl_take isl_local_space *ls)
81 aff = isl_aff_alloc(ls);
85 isl_int_set_si(aff->v->el[0], 1);
86 isl_seq_clr(aff->v->el + 1, aff->v->size - 1);
91 __isl_give isl_aff *isl_aff_copy(__isl_keep isl_aff *aff)
100 __isl_give isl_aff *isl_aff_dup(__isl_keep isl_aff *aff)
105 return isl_aff_alloc_vec(isl_local_space_copy(aff->ls),
106 isl_vec_copy(aff->v));
109 __isl_give isl_aff *isl_aff_cow(__isl_take isl_aff *aff)
117 return isl_aff_dup(aff);
120 void *isl_aff_free(__isl_take isl_aff *aff)
128 isl_local_space_free(aff->ls);
129 isl_vec_free(aff->v);
136 isl_ctx *isl_aff_get_ctx(__isl_keep isl_aff *aff)
138 return aff ? isl_local_space_get_ctx(aff->ls) : NULL;
141 /* Externally, an isl_aff has a map space, but internally, the
142 * ls field corresponds to the domain of that space.
144 int isl_aff_dim(__isl_keep isl_aff *aff, enum isl_dim_type type)
148 if (type == isl_dim_out)
150 if (type == isl_dim_in)
152 return isl_local_space_dim(aff->ls, type);
155 __isl_give isl_space *isl_aff_get_domain_space(__isl_keep isl_aff *aff)
157 return aff ? isl_local_space_get_space(aff->ls) : NULL;
160 __isl_give isl_space *isl_aff_get_space(__isl_keep isl_aff *aff)
165 space = isl_local_space_get_space(aff->ls);
166 space = isl_space_from_domain(space);
167 space = isl_space_add_dims(space, isl_dim_out, 1);
171 __isl_give isl_local_space *isl_aff_get_domain_local_space(
172 __isl_keep isl_aff *aff)
174 return aff ? isl_local_space_copy(aff->ls) : NULL;
177 __isl_give isl_local_space *isl_aff_get_local_space(__isl_keep isl_aff *aff)
182 ls = isl_local_space_copy(aff->ls);
183 ls = isl_local_space_from_domain(ls);
184 ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
188 /* Externally, an isl_aff has a map space, but internally, the
189 * ls field corresponds to the domain of that space.
191 const char *isl_aff_get_dim_name(__isl_keep isl_aff *aff,
192 enum isl_dim_type type, unsigned pos)
196 if (type == isl_dim_out)
198 if (type == isl_dim_in)
200 return isl_local_space_get_dim_name(aff->ls, type, pos);
203 __isl_give isl_aff *isl_aff_reset_domain_space(__isl_take isl_aff *aff,
204 __isl_take isl_space *dim)
206 aff = isl_aff_cow(aff);
210 aff->ls = isl_local_space_reset_space(aff->ls, dim);
212 return isl_aff_free(aff);
221 /* Reset the space of "aff". This function is called from isl_pw_templ.c
222 * and doesn't know if the space of an element object is represented
223 * directly or through its domain. It therefore passes along both.
225 __isl_give isl_aff *isl_aff_reset_space_and_domain(__isl_take isl_aff *aff,
226 __isl_take isl_space *space, __isl_take isl_space *domain)
228 isl_space_free(space);
229 return isl_aff_reset_domain_space(aff, domain);
232 /* Reorder the coefficients of the affine expression based
233 * on the given reodering.
234 * The reordering r is assumed to have been extended with the local
237 static __isl_give isl_vec *vec_reorder(__isl_take isl_vec *vec,
238 __isl_take isl_reordering *r, int n_div)
246 res = isl_vec_alloc(vec->ctx,
247 2 + isl_space_dim(r->dim, isl_dim_all) + n_div);
248 isl_seq_cpy(res->el, vec->el, 2);
249 isl_seq_clr(res->el + 2, res->size - 2);
250 for (i = 0; i < r->len; ++i)
251 isl_int_set(res->el[2 + r->pos[i]], vec->el[2 + i]);
253 isl_reordering_free(r);
258 isl_reordering_free(r);
262 /* Reorder the dimensions of the domain of "aff" according
263 * to the given reordering.
265 __isl_give isl_aff *isl_aff_realign_domain(__isl_take isl_aff *aff,
266 __isl_take isl_reordering *r)
268 aff = isl_aff_cow(aff);
272 r = isl_reordering_extend(r, aff->ls->div->n_row);
273 aff->v = vec_reorder(aff->v, isl_reordering_copy(r),
274 aff->ls->div->n_row);
275 aff->ls = isl_local_space_realign(aff->ls, r);
277 if (!aff->v || !aff->ls)
278 return isl_aff_free(aff);
283 isl_reordering_free(r);
287 __isl_give isl_aff *isl_aff_align_params(__isl_take isl_aff *aff,
288 __isl_take isl_space *model)
293 if (!isl_space_match(aff->ls->dim, isl_dim_param,
294 model, isl_dim_param)) {
297 model = isl_space_drop_dims(model, isl_dim_in,
298 0, isl_space_dim(model, isl_dim_in));
299 model = isl_space_drop_dims(model, isl_dim_out,
300 0, isl_space_dim(model, isl_dim_out));
301 exp = isl_parameter_alignment_reordering(aff->ls->dim, model);
302 exp = isl_reordering_extend_space(exp,
303 isl_aff_get_domain_space(aff));
304 aff = isl_aff_realign_domain(aff, exp);
307 isl_space_free(model);
310 isl_space_free(model);
315 int isl_aff_plain_is_zero(__isl_keep isl_aff *aff)
320 return isl_seq_first_non_zero(aff->v->el + 1, aff->v->size - 1) < 0;
323 int isl_aff_plain_is_equal(__isl_keep isl_aff *aff1, __isl_keep isl_aff *aff2)
330 equal = isl_local_space_is_equal(aff1->ls, aff2->ls);
331 if (equal < 0 || !equal)
334 return isl_vec_is_equal(aff1->v, aff2->v);
337 int isl_aff_get_denominator(__isl_keep isl_aff *aff, isl_int *v)
341 isl_int_set(*v, aff->v->el[0]);
345 int isl_aff_get_constant(__isl_keep isl_aff *aff, isl_int *v)
349 isl_int_set(*v, aff->v->el[1]);
353 int isl_aff_get_coefficient(__isl_keep isl_aff *aff,
354 enum isl_dim_type type, int pos, isl_int *v)
359 if (type == isl_dim_out)
360 isl_die(aff->v->ctx, isl_error_invalid,
361 "output/set dimension does not have a coefficient",
363 if (type == isl_dim_in)
366 if (pos >= isl_local_space_dim(aff->ls, type))
367 isl_die(aff->v->ctx, isl_error_invalid,
368 "position out of bounds", return -1);
370 pos += isl_local_space_offset(aff->ls, type);
371 isl_int_set(*v, aff->v->el[1 + pos]);
376 __isl_give isl_aff *isl_aff_set_denominator(__isl_take isl_aff *aff, isl_int v)
378 aff = isl_aff_cow(aff);
382 aff->v = isl_vec_cow(aff->v);
384 return isl_aff_free(aff);
386 isl_int_set(aff->v->el[0], v);
391 __isl_give isl_aff *isl_aff_set_constant(__isl_take isl_aff *aff, isl_int v)
393 aff = isl_aff_cow(aff);
397 aff->v = isl_vec_cow(aff->v);
399 return isl_aff_free(aff);
401 isl_int_set(aff->v->el[1], v);
406 __isl_give isl_aff *isl_aff_add_constant(__isl_take isl_aff *aff, isl_int v)
408 if (isl_int_is_zero(v))
411 aff = isl_aff_cow(aff);
415 aff->v = isl_vec_cow(aff->v);
417 return isl_aff_free(aff);
419 isl_int_addmul(aff->v->el[1], aff->v->el[0], v);
424 __isl_give isl_aff *isl_aff_add_constant_si(__isl_take isl_aff *aff, int v)
429 isl_int_set_si(t, v);
430 aff = isl_aff_add_constant(aff, t);
436 /* Add "v" to the numerator of the constant term of "aff".
438 __isl_give isl_aff *isl_aff_add_constant_num(__isl_take isl_aff *aff, isl_int v)
440 if (isl_int_is_zero(v))
443 aff = isl_aff_cow(aff);
447 aff->v = isl_vec_cow(aff->v);
449 return isl_aff_free(aff);
451 isl_int_add(aff->v->el[1], aff->v->el[1], v);
456 /* Add "v" to the numerator of the constant term of "aff".
458 __isl_give isl_aff *isl_aff_add_constant_num_si(__isl_take isl_aff *aff, int v)
466 isl_int_set_si(t, v);
467 aff = isl_aff_add_constant_num(aff, t);
473 __isl_give isl_aff *isl_aff_set_constant_si(__isl_take isl_aff *aff, int v)
475 aff = isl_aff_cow(aff);
479 aff->v = isl_vec_cow(aff->v);
481 return isl_aff_free(aff);
483 isl_int_set_si(aff->v->el[1], v);
488 __isl_give isl_aff *isl_aff_set_coefficient(__isl_take isl_aff *aff,
489 enum isl_dim_type type, int pos, isl_int v)
494 if (type == isl_dim_out)
495 isl_die(aff->v->ctx, isl_error_invalid,
496 "output/set dimension does not have a coefficient",
497 return isl_aff_free(aff));
498 if (type == isl_dim_in)
501 if (pos >= isl_local_space_dim(aff->ls, type))
502 isl_die(aff->v->ctx, isl_error_invalid,
503 "position out of bounds", return isl_aff_free(aff));
505 aff = isl_aff_cow(aff);
509 aff->v = isl_vec_cow(aff->v);
511 return isl_aff_free(aff);
513 pos += isl_local_space_offset(aff->ls, type);
514 isl_int_set(aff->v->el[1 + pos], v);
519 __isl_give isl_aff *isl_aff_set_coefficient_si(__isl_take isl_aff *aff,
520 enum isl_dim_type type, int pos, int v)
525 if (type == isl_dim_out)
526 isl_die(aff->v->ctx, isl_error_invalid,
527 "output/set dimension does not have a coefficient",
528 return isl_aff_free(aff));
529 if (type == isl_dim_in)
532 if (pos >= isl_local_space_dim(aff->ls, type))
533 isl_die(aff->v->ctx, isl_error_invalid,
534 "position out of bounds", return isl_aff_free(aff));
536 aff = isl_aff_cow(aff);
540 aff->v = isl_vec_cow(aff->v);
542 return isl_aff_free(aff);
544 pos += isl_local_space_offset(aff->ls, type);
545 isl_int_set_si(aff->v->el[1 + pos], v);
550 __isl_give isl_aff *isl_aff_add_coefficient(__isl_take isl_aff *aff,
551 enum isl_dim_type type, int pos, isl_int v)
556 if (type == isl_dim_out)
557 isl_die(aff->v->ctx, isl_error_invalid,
558 "output/set dimension does not have a coefficient",
559 return isl_aff_free(aff));
560 if (type == isl_dim_in)
563 if (pos >= isl_local_space_dim(aff->ls, type))
564 isl_die(aff->v->ctx, isl_error_invalid,
565 "position out of bounds", return isl_aff_free(aff));
567 aff = isl_aff_cow(aff);
571 aff->v = isl_vec_cow(aff->v);
573 return isl_aff_free(aff);
575 pos += isl_local_space_offset(aff->ls, type);
576 isl_int_addmul(aff->v->el[1 + pos], aff->v->el[0], v);
581 __isl_give isl_aff *isl_aff_add_coefficient_si(__isl_take isl_aff *aff,
582 enum isl_dim_type type, int pos, int v)
587 isl_int_set_si(t, v);
588 aff = isl_aff_add_coefficient(aff, type, pos, t);
594 __isl_give isl_aff *isl_aff_get_div(__isl_keep isl_aff *aff, int pos)
599 return isl_local_space_get_div(aff->ls, pos);
602 __isl_give isl_aff *isl_aff_neg(__isl_take isl_aff *aff)
604 aff = isl_aff_cow(aff);
607 aff->v = isl_vec_cow(aff->v);
609 return isl_aff_free(aff);
611 isl_seq_neg(aff->v->el + 1, aff->v->el + 1, aff->v->size - 1);
616 /* Remove divs from the local space that do not appear in the affine
618 * We currently only remove divs at the end.
619 * Some intermediate divs may also not appear directly in the affine
620 * expression, but we would also need to check that no other divs are
621 * defined in terms of them.
623 __isl_give isl_aff *isl_aff_remove_unused_divs( __isl_take isl_aff *aff)
632 n = isl_local_space_dim(aff->ls, isl_dim_div);
633 off = isl_local_space_offset(aff->ls, isl_dim_div);
635 pos = isl_seq_last_non_zero(aff->v->el + 1 + off, n) + 1;
639 aff = isl_aff_cow(aff);
643 aff->ls = isl_local_space_drop_dims(aff->ls, isl_dim_div, pos, n - pos);
644 aff->v = isl_vec_drop_els(aff->v, 1 + off + pos, n - pos);
645 if (!aff->ls || !aff->v)
646 return isl_aff_free(aff);
651 /* Given two affine expressions "p" of length p_len (including the
652 * denominator and the constant term) and "subs" of length subs_len,
653 * plug in "subs" for the variable at position "pos".
654 * The variables of "subs" and "p" are assumed to match up to subs_len,
655 * but "p" may have additional variables.
656 * "v" is an initialized isl_int that can be used internally.
658 * In particular, if "p" represents the expression
662 * with i the variable at position "pos" and "subs" represents the expression
666 * then the result represents the expression
671 void isl_seq_substitute(isl_int *p, int pos, isl_int *subs,
672 int p_len, int subs_len, isl_int v)
674 isl_int_set(v, p[1 + pos]);
675 isl_int_set_si(p[1 + pos], 0);
676 isl_seq_combine(p + 1, subs[0], p + 1, v, subs + 1, subs_len - 1);
677 isl_seq_scale(p + subs_len, p + subs_len, subs[0], p_len - subs_len);
678 isl_int_mul(p[0], p[0], subs[0]);
681 /* Look for any divs in the aff->ls with a denominator equal to one
682 * and plug them into the affine expression and any subsequent divs
683 * that may reference the div.
685 static __isl_give isl_aff *plug_in_integral_divs(__isl_take isl_aff *aff)
697 n = isl_local_space_dim(aff->ls, isl_dim_div);
699 for (i = 0; i < n; ++i) {
700 if (!isl_int_is_one(aff->ls->div->row[i][0]))
702 ls = isl_local_space_copy(aff->ls);
703 ls = isl_local_space_substitute_seq(ls, isl_dim_div, i,
704 aff->ls->div->row[i], len, i + 1);
705 vec = isl_vec_copy(aff->v);
706 vec = isl_vec_cow(vec);
712 pos = isl_local_space_offset(aff->ls, isl_dim_div) + i;
713 isl_seq_substitute(vec->el, pos, aff->ls->div->row[i],
718 isl_vec_free(aff->v);
720 isl_local_space_free(aff->ls);
727 isl_local_space_free(ls);
728 return isl_aff_free(aff);
731 /* Swap divs "a" and "b" in "aff", which is assumed to be non-NULL.
733 * Even though this function is only called on isl_affs with a single
734 * reference, we are careful to only change aff->v and aff->ls together.
736 static __isl_give isl_aff *swap_div(__isl_take isl_aff *aff, int a, int b)
738 unsigned off = isl_local_space_offset(aff->ls, isl_dim_div);
742 ls = isl_local_space_copy(aff->ls);
743 ls = isl_local_space_swap_div(ls, a, b);
744 v = isl_vec_copy(aff->v);
749 isl_int_swap(v->el[1 + off + a], v->el[1 + off + b]);
750 isl_vec_free(aff->v);
752 isl_local_space_free(aff->ls);
758 isl_local_space_free(ls);
759 return isl_aff_free(aff);
762 /* Sort the divs in the local space of "aff" according to
763 * the comparison function "cmp_row" in isl_local_space.c
765 * Reordering divs does not change the semantics of "aff",
766 * so there is no need to call isl_aff_cow.
767 * Moreover, this function is currently only called on isl_affs
768 * with a single reference.
770 static __isl_give isl_aff *sort_divs(__isl_take isl_aff *aff)
777 n = isl_aff_dim(aff, isl_dim_div);
778 for (i = 1; i < n; ++i) {
779 for (j = i - 1; j >= 0; --j) {
780 if (isl_mat_cmp_div(aff->ls->div, j, j + 1) <= 0)
782 aff = swap_div(aff, j, j + 1);
791 /* Normalize the representation of "aff".
793 * This function should only be called of "new" isl_affs, i.e.,
794 * with only a single reference. We therefore do not need to
795 * worry about affecting other instances.
797 __isl_give isl_aff *isl_aff_normalize(__isl_take isl_aff *aff)
801 aff->v = isl_vec_normalize(aff->v);
803 return isl_aff_free(aff);
804 aff = plug_in_integral_divs(aff);
805 aff = sort_divs(aff);
806 aff = isl_aff_remove_unused_divs(aff);
810 /* Given f, return floor(f).
811 * If f is an integer expression, then just return f.
812 * If f is a constant, then return the constant floor(f).
813 * Otherwise, if f = g/m, write g = q m + r,
814 * create a new div d = [r/m] and return the expression q + d.
815 * The coefficients in r are taken to lie between -m/2 and m/2.
817 __isl_give isl_aff *isl_aff_floor(__isl_take isl_aff *aff)
827 if (isl_int_is_one(aff->v->el[0]))
830 aff = isl_aff_cow(aff);
834 aff->v = isl_vec_cow(aff->v);
836 return isl_aff_free(aff);
838 if (isl_aff_is_cst(aff)) {
839 isl_int_fdiv_q(aff->v->el[1], aff->v->el[1], aff->v->el[0]);
840 isl_int_set_si(aff->v->el[0], 1);
844 div = isl_vec_copy(aff->v);
845 div = isl_vec_cow(div);
847 return isl_aff_free(aff);
849 ctx = isl_aff_get_ctx(aff);
850 isl_int_fdiv_q(aff->v->el[0], aff->v->el[0], ctx->two);
851 for (i = 1; i < aff->v->size; ++i) {
852 isl_int_fdiv_r(div->el[i], div->el[i], div->el[0]);
853 isl_int_fdiv_q(aff->v->el[i], aff->v->el[i], div->el[0]);
854 if (isl_int_gt(div->el[i], aff->v->el[0])) {
855 isl_int_sub(div->el[i], div->el[i], div->el[0]);
856 isl_int_add_ui(aff->v->el[i], aff->v->el[i], 1);
860 aff->ls = isl_local_space_add_div(aff->ls, div);
862 return isl_aff_free(aff);
865 aff->v = isl_vec_extend(aff->v, size + 1);
867 return isl_aff_free(aff);
868 isl_int_set_si(aff->v->el[0], 1);
869 isl_int_set_si(aff->v->el[size], 1);
876 * aff mod m = aff - m * floor(aff/m)
878 __isl_give isl_aff *isl_aff_mod(__isl_take isl_aff *aff, isl_int m)
882 res = isl_aff_copy(aff);
883 aff = isl_aff_scale_down(aff, m);
884 aff = isl_aff_floor(aff);
885 aff = isl_aff_scale(aff, m);
886 res = isl_aff_sub(res, aff);
893 * pwaff mod m = pwaff - m * floor(pwaff/m)
895 __isl_give isl_pw_aff *isl_pw_aff_mod(__isl_take isl_pw_aff *pwaff, isl_int m)
899 res = isl_pw_aff_copy(pwaff);
900 pwaff = isl_pw_aff_scale_down(pwaff, m);
901 pwaff = isl_pw_aff_floor(pwaff);
902 pwaff = isl_pw_aff_scale(pwaff, m);
903 res = isl_pw_aff_sub(res, pwaff);
908 /* Given f, return ceil(f).
909 * If f is an integer expression, then just return f.
910 * Otherwise, create a new div d = [-f] and return the expression -d.
912 __isl_give isl_aff *isl_aff_ceil(__isl_take isl_aff *aff)
917 if (isl_int_is_one(aff->v->el[0]))
920 aff = isl_aff_neg(aff);
921 aff = isl_aff_floor(aff);
922 aff = isl_aff_neg(aff);
927 /* Apply the expansion computed by isl_merge_divs.
928 * The expansion itself is given by "exp" while the resulting
929 * list of divs is given by "div".
931 __isl_give isl_aff *isl_aff_expand_divs( __isl_take isl_aff *aff,
932 __isl_take isl_mat *div, int *exp)
939 aff = isl_aff_cow(aff);
943 old_n_div = isl_local_space_dim(aff->ls, isl_dim_div);
944 new_n_div = isl_mat_rows(div);
945 if (new_n_div < old_n_div)
946 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
947 "not an expansion", goto error);
949 aff->v = isl_vec_extend(aff->v, aff->v->size + new_n_div - old_n_div);
953 offset = 1 + isl_local_space_offset(aff->ls, isl_dim_div);
955 for (i = new_n_div - 1; i >= 0; --i) {
956 if (j >= 0 && exp[j] == i) {
958 isl_int_swap(aff->v->el[offset + i],
959 aff->v->el[offset + j]);
962 isl_int_set_si(aff->v->el[offset + i], 0);
965 aff->ls = isl_local_space_replace_divs(aff->ls, isl_mat_copy(div));
976 /* Add two affine expressions that live in the same local space.
978 static __isl_give isl_aff *add_expanded(__isl_take isl_aff *aff1,
979 __isl_take isl_aff *aff2)
983 aff1 = isl_aff_cow(aff1);
987 aff1->v = isl_vec_cow(aff1->v);
993 isl_int_gcd(gcd, aff1->v->el[0], aff2->v->el[0]);
994 isl_int_divexact(f, aff2->v->el[0], gcd);
995 isl_seq_scale(aff1->v->el + 1, aff1->v->el + 1, f, aff1->v->size - 1);
996 isl_int_divexact(f, aff1->v->el[0], gcd);
997 isl_seq_addmul(aff1->v->el + 1, f, aff2->v->el + 1, aff1->v->size - 1);
998 isl_int_divexact(f, aff2->v->el[0], gcd);
999 isl_int_mul(aff1->v->el[0], aff1->v->el[0], f);
1011 __isl_give isl_aff *isl_aff_add(__isl_take isl_aff *aff1,
1012 __isl_take isl_aff *aff2)
1022 ctx = isl_aff_get_ctx(aff1);
1023 if (!isl_space_is_equal(aff1->ls->dim, aff2->ls->dim))
1024 isl_die(ctx, isl_error_invalid,
1025 "spaces don't match", goto error);
1027 if (aff1->ls->div->n_row == 0 && aff2->ls->div->n_row == 0)
1028 return add_expanded(aff1, aff2);
1030 exp1 = isl_alloc_array(ctx, int, aff1->ls->div->n_row);
1031 exp2 = isl_alloc_array(ctx, int, aff2->ls->div->n_row);
1035 div = isl_merge_divs(aff1->ls->div, aff2->ls->div, exp1, exp2);
1036 aff1 = isl_aff_expand_divs(aff1, isl_mat_copy(div), exp1);
1037 aff2 = isl_aff_expand_divs(aff2, div, exp2);
1041 return add_expanded(aff1, aff2);
1050 __isl_give isl_aff *isl_aff_sub(__isl_take isl_aff *aff1,
1051 __isl_take isl_aff *aff2)
1053 return isl_aff_add(aff1, isl_aff_neg(aff2));
1056 __isl_give isl_aff *isl_aff_scale(__isl_take isl_aff *aff, isl_int f)
1060 if (isl_int_is_one(f))
1063 aff = isl_aff_cow(aff);
1066 aff->v = isl_vec_cow(aff->v);
1068 return isl_aff_free(aff);
1071 isl_int_gcd(gcd, aff->v->el[0], f);
1072 isl_int_divexact(aff->v->el[0], aff->v->el[0], gcd);
1073 isl_int_divexact(gcd, f, gcd);
1074 isl_seq_scale(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
1080 __isl_give isl_aff *isl_aff_scale_down(__isl_take isl_aff *aff, isl_int f)
1084 if (isl_int_is_one(f))
1087 aff = isl_aff_cow(aff);
1091 if (isl_int_is_zero(f))
1092 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
1093 "cannot scale down by zero", return isl_aff_free(aff));
1095 aff->v = isl_vec_cow(aff->v);
1097 return isl_aff_free(aff);
1100 isl_seq_gcd(aff->v->el + 1, aff->v->size - 1, &gcd);
1101 isl_int_gcd(gcd, gcd, f);
1102 isl_seq_scale_down(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
1103 isl_int_divexact(gcd, f, gcd);
1104 isl_int_mul(aff->v->el[0], aff->v->el[0], gcd);
1110 __isl_give isl_aff *isl_aff_scale_down_ui(__isl_take isl_aff *aff, unsigned f)
1118 isl_int_set_ui(v, f);
1119 aff = isl_aff_scale_down(aff, v);
1125 __isl_give isl_aff *isl_aff_set_dim_name(__isl_take isl_aff *aff,
1126 enum isl_dim_type type, unsigned pos, const char *s)
1128 aff = isl_aff_cow(aff);
1131 if (type == isl_dim_out)
1132 isl_die(aff->v->ctx, isl_error_invalid,
1133 "cannot set name of output/set dimension",
1134 return isl_aff_free(aff));
1135 if (type == isl_dim_in)
1137 aff->ls = isl_local_space_set_dim_name(aff->ls, type, pos, s);
1139 return isl_aff_free(aff);
1144 __isl_give isl_aff *isl_aff_set_dim_id(__isl_take isl_aff *aff,
1145 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
1147 aff = isl_aff_cow(aff);
1149 return isl_id_free(id);
1150 if (type == isl_dim_out)
1151 isl_die(aff->v->ctx, isl_error_invalid,
1152 "cannot set name of output/set dimension",
1154 if (type == isl_dim_in)
1156 aff->ls = isl_local_space_set_dim_id(aff->ls, type, pos, id);
1158 return isl_aff_free(aff);
1167 /* Exploit the equalities in "eq" to simplify the affine expression
1168 * and the expressions of the integer divisions in the local space.
1169 * The integer divisions in this local space are assumed to appear
1170 * as regular dimensions in "eq".
1172 static __isl_give isl_aff *isl_aff_substitute_equalities_lifted(
1173 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
1181 if (eq->n_eq == 0) {
1182 isl_basic_set_free(eq);
1186 aff = isl_aff_cow(aff);
1190 aff->ls = isl_local_space_substitute_equalities(aff->ls,
1191 isl_basic_set_copy(eq));
1195 total = 1 + isl_space_dim(eq->dim, isl_dim_all);
1197 for (i = 0; i < eq->n_eq; ++i) {
1198 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
1199 if (j < 0 || j == 0 || j >= total)
1202 isl_seq_elim(aff->v->el + 1, eq->eq[i], j, total,
1206 isl_basic_set_free(eq);
1207 aff = isl_aff_normalize(aff);
1210 isl_basic_set_free(eq);
1215 /* Exploit the equalities in "eq" to simplify the affine expression
1216 * and the expressions of the integer divisions in the local space.
1218 static __isl_give isl_aff *isl_aff_substitute_equalities(
1219 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
1225 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
1227 eq = isl_basic_set_add(eq, isl_dim_set, n_div);
1228 return isl_aff_substitute_equalities_lifted(aff, eq);
1230 isl_basic_set_free(eq);
1235 /* Look for equalities among the variables shared by context and aff
1236 * and the integer divisions of aff, if any.
1237 * The equalities are then used to eliminate coefficients and/or integer
1238 * divisions from aff.
1240 __isl_give isl_aff *isl_aff_gist(__isl_take isl_aff *aff,
1241 __isl_take isl_set *context)
1243 isl_basic_set *hull;
1248 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
1250 isl_basic_set *bset;
1251 isl_local_space *ls;
1252 context = isl_set_add_dims(context, isl_dim_set, n_div);
1253 ls = isl_aff_get_domain_local_space(aff);
1254 bset = isl_basic_set_from_local_space(ls);
1255 bset = isl_basic_set_lift(bset);
1256 bset = isl_basic_set_flatten(bset);
1257 context = isl_set_intersect(context,
1258 isl_set_from_basic_set(bset));
1261 hull = isl_set_affine_hull(context);
1262 return isl_aff_substitute_equalities_lifted(aff, hull);
1265 isl_set_free(context);
1269 __isl_give isl_aff *isl_aff_gist_params(__isl_take isl_aff *aff,
1270 __isl_take isl_set *context)
1272 isl_set *dom_context = isl_set_universe(isl_aff_get_domain_space(aff));
1273 dom_context = isl_set_intersect_params(dom_context, context);
1274 return isl_aff_gist(aff, dom_context);
1277 /* Return a basic set containing those elements in the space
1278 * of aff where it is non-negative.
1280 __isl_give isl_basic_set *isl_aff_nonneg_basic_set(__isl_take isl_aff *aff)
1282 isl_constraint *ineq;
1283 isl_basic_set *bset;
1285 ineq = isl_inequality_from_aff(aff);
1287 bset = isl_basic_set_from_constraint(ineq);
1288 bset = isl_basic_set_simplify(bset);
1292 /* Return a basic set containing those elements in the domain space
1293 * of aff where it is negative.
1295 __isl_give isl_basic_set *isl_aff_neg_basic_set(__isl_take isl_aff *aff)
1297 aff = isl_aff_neg(aff);
1298 aff = isl_aff_add_constant_num_si(aff, -1);
1299 return isl_aff_nonneg_basic_set(aff);
1302 /* Return a basic set containing those elements in the space
1303 * of aff where it is zero.
1305 __isl_give isl_basic_set *isl_aff_zero_basic_set(__isl_take isl_aff *aff)
1307 isl_constraint *ineq;
1308 isl_basic_set *bset;
1310 ineq = isl_equality_from_aff(aff);
1312 bset = isl_basic_set_from_constraint(ineq);
1313 bset = isl_basic_set_simplify(bset);
1317 /* Return a basic set containing those elements in the shared space
1318 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
1320 __isl_give isl_basic_set *isl_aff_ge_basic_set(__isl_take isl_aff *aff1,
1321 __isl_take isl_aff *aff2)
1323 aff1 = isl_aff_sub(aff1, aff2);
1325 return isl_aff_nonneg_basic_set(aff1);
1328 /* Return a basic set containing those elements in the shared space
1329 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
1331 __isl_give isl_basic_set *isl_aff_le_basic_set(__isl_take isl_aff *aff1,
1332 __isl_take isl_aff *aff2)
1334 return isl_aff_ge_basic_set(aff2, aff1);
1337 __isl_give isl_aff *isl_aff_add_on_domain(__isl_keep isl_set *dom,
1338 __isl_take isl_aff *aff1, __isl_take isl_aff *aff2)
1340 aff1 = isl_aff_add(aff1, aff2);
1341 aff1 = isl_aff_gist(aff1, isl_set_copy(dom));
1345 int isl_aff_is_empty(__isl_keep isl_aff *aff)
1353 /* Check whether the given affine expression has non-zero coefficient
1354 * for any dimension in the given range or if any of these dimensions
1355 * appear with non-zero coefficients in any of the integer divisions
1356 * involved in the affine expression.
1358 int isl_aff_involves_dims(__isl_keep isl_aff *aff,
1359 enum isl_dim_type type, unsigned first, unsigned n)
1371 ctx = isl_aff_get_ctx(aff);
1372 if (first + n > isl_aff_dim(aff, type))
1373 isl_die(ctx, isl_error_invalid,
1374 "range out of bounds", return -1);
1376 active = isl_local_space_get_active(aff->ls, aff->v->el + 2);
1380 first += isl_local_space_offset(aff->ls, type) - 1;
1381 for (i = 0; i < n; ++i)
1382 if (active[first + i]) {
1395 __isl_give isl_aff *isl_aff_drop_dims(__isl_take isl_aff *aff,
1396 enum isl_dim_type type, unsigned first, unsigned n)
1402 if (type == isl_dim_out)
1403 isl_die(aff->v->ctx, isl_error_invalid,
1404 "cannot drop output/set dimension",
1405 return isl_aff_free(aff));
1406 if (type == isl_dim_in)
1408 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
1411 ctx = isl_aff_get_ctx(aff);
1412 if (first + n > isl_local_space_dim(aff->ls, type))
1413 isl_die(ctx, isl_error_invalid, "range out of bounds",
1414 return isl_aff_free(aff));
1416 aff = isl_aff_cow(aff);
1420 aff->ls = isl_local_space_drop_dims(aff->ls, type, first, n);
1422 return isl_aff_free(aff);
1424 first += 1 + isl_local_space_offset(aff->ls, type);
1425 aff->v = isl_vec_drop_els(aff->v, first, n);
1427 return isl_aff_free(aff);
1432 /* Project the domain of the affine expression onto its parameter space.
1433 * The affine expression may not involve any of the domain dimensions.
1435 __isl_give isl_aff *isl_aff_project_domain_on_params(__isl_take isl_aff *aff)
1441 n = isl_aff_dim(aff, isl_dim_in);
1442 involves = isl_aff_involves_dims(aff, isl_dim_in, 0, n);
1444 return isl_aff_free(aff);
1446 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
1447 "affine expression involves some of the domain dimensions",
1448 return isl_aff_free(aff));
1449 aff = isl_aff_drop_dims(aff, isl_dim_in, 0, n);
1450 space = isl_aff_get_domain_space(aff);
1451 space = isl_space_params(space);
1452 aff = isl_aff_reset_domain_space(aff, space);
1456 __isl_give isl_aff *isl_aff_insert_dims(__isl_take isl_aff *aff,
1457 enum isl_dim_type type, unsigned first, unsigned n)
1463 if (type == isl_dim_out)
1464 isl_die(aff->v->ctx, isl_error_invalid,
1465 "cannot insert output/set dimensions",
1466 return isl_aff_free(aff));
1467 if (type == isl_dim_in)
1469 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
1472 ctx = isl_aff_get_ctx(aff);
1473 if (first > isl_local_space_dim(aff->ls, type))
1474 isl_die(ctx, isl_error_invalid, "position out of bounds",
1475 return isl_aff_free(aff));
1477 aff = isl_aff_cow(aff);
1481 aff->ls = isl_local_space_insert_dims(aff->ls, type, first, n);
1483 return isl_aff_free(aff);
1485 first += 1 + isl_local_space_offset(aff->ls, type);
1486 aff->v = isl_vec_insert_zero_els(aff->v, first, n);
1488 return isl_aff_free(aff);
1493 __isl_give isl_aff *isl_aff_add_dims(__isl_take isl_aff *aff,
1494 enum isl_dim_type type, unsigned n)
1498 pos = isl_aff_dim(aff, type);
1500 return isl_aff_insert_dims(aff, type, pos, n);
1503 __isl_give isl_pw_aff *isl_pw_aff_add_dims(__isl_take isl_pw_aff *pwaff,
1504 enum isl_dim_type type, unsigned n)
1508 pos = isl_pw_aff_dim(pwaff, type);
1510 return isl_pw_aff_insert_dims(pwaff, type, pos, n);
1513 __isl_give isl_pw_aff *isl_pw_aff_from_aff(__isl_take isl_aff *aff)
1515 isl_set *dom = isl_set_universe(isl_aff_get_domain_space(aff));
1516 return isl_pw_aff_alloc(dom, aff);
1520 #define PW isl_pw_aff
1524 #define EL_IS_ZERO is_empty
1528 #define IS_ZERO is_empty
1531 #undef DEFAULT_IS_ZERO
1532 #define DEFAULT_IS_ZERO 0
1536 #define NO_MOVE_DIMS
1540 #include <isl_pw_templ.c>
1542 static __isl_give isl_set *align_params_pw_pw_set_and(
1543 __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2,
1544 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
1545 __isl_take isl_pw_aff *pwaff2))
1547 if (!pwaff1 || !pwaff2)
1549 if (isl_space_match(pwaff1->dim, isl_dim_param,
1550 pwaff2->dim, isl_dim_param))
1551 return fn(pwaff1, pwaff2);
1552 if (!isl_space_has_named_params(pwaff1->dim) ||
1553 !isl_space_has_named_params(pwaff2->dim))
1554 isl_die(isl_pw_aff_get_ctx(pwaff1), isl_error_invalid,
1555 "unaligned unnamed parameters", goto error);
1556 pwaff1 = isl_pw_aff_align_params(pwaff1, isl_pw_aff_get_space(pwaff2));
1557 pwaff2 = isl_pw_aff_align_params(pwaff2, isl_pw_aff_get_space(pwaff1));
1558 return fn(pwaff1, pwaff2);
1560 isl_pw_aff_free(pwaff1);
1561 isl_pw_aff_free(pwaff2);
1565 /* Compute a piecewise quasi-affine expression with a domain that
1566 * is the union of those of pwaff1 and pwaff2 and such that on each
1567 * cell, the quasi-affine expression is the better (according to cmp)
1568 * of those of pwaff1 and pwaff2. If only one of pwaff1 or pwaff2
1569 * is defined on a given cell, then the associated expression
1570 * is the defined one.
1572 static __isl_give isl_pw_aff *pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
1573 __isl_take isl_pw_aff *pwaff2,
1574 __isl_give isl_basic_set *(*cmp)(__isl_take isl_aff *aff1,
1575 __isl_take isl_aff *aff2))
1582 if (!pwaff1 || !pwaff2)
1585 ctx = isl_space_get_ctx(pwaff1->dim);
1586 if (!isl_space_is_equal(pwaff1->dim, pwaff2->dim))
1587 isl_die(ctx, isl_error_invalid,
1588 "arguments should live in same space", goto error);
1590 if (isl_pw_aff_is_empty(pwaff1)) {
1591 isl_pw_aff_free(pwaff1);
1595 if (isl_pw_aff_is_empty(pwaff2)) {
1596 isl_pw_aff_free(pwaff2);
1600 n = 2 * (pwaff1->n + 1) * (pwaff2->n + 1);
1601 res = isl_pw_aff_alloc_size(isl_space_copy(pwaff1->dim), n);
1603 for (i = 0; i < pwaff1->n; ++i) {
1604 set = isl_set_copy(pwaff1->p[i].set);
1605 for (j = 0; j < pwaff2->n; ++j) {
1606 struct isl_set *common;
1609 common = isl_set_intersect(
1610 isl_set_copy(pwaff1->p[i].set),
1611 isl_set_copy(pwaff2->p[j].set));
1612 better = isl_set_from_basic_set(cmp(
1613 isl_aff_copy(pwaff2->p[j].aff),
1614 isl_aff_copy(pwaff1->p[i].aff)));
1615 better = isl_set_intersect(common, better);
1616 if (isl_set_plain_is_empty(better)) {
1617 isl_set_free(better);
1620 set = isl_set_subtract(set, isl_set_copy(better));
1622 res = isl_pw_aff_add_piece(res, better,
1623 isl_aff_copy(pwaff2->p[j].aff));
1625 res = isl_pw_aff_add_piece(res, set,
1626 isl_aff_copy(pwaff1->p[i].aff));
1629 for (j = 0; j < pwaff2->n; ++j) {
1630 set = isl_set_copy(pwaff2->p[j].set);
1631 for (i = 0; i < pwaff1->n; ++i)
1632 set = isl_set_subtract(set,
1633 isl_set_copy(pwaff1->p[i].set));
1634 res = isl_pw_aff_add_piece(res, set,
1635 isl_aff_copy(pwaff2->p[j].aff));
1638 isl_pw_aff_free(pwaff1);
1639 isl_pw_aff_free(pwaff2);
1643 isl_pw_aff_free(pwaff1);
1644 isl_pw_aff_free(pwaff2);
1648 /* Compute a piecewise quasi-affine expression with a domain that
1649 * is the union of those of pwaff1 and pwaff2 and such that on each
1650 * cell, the quasi-affine expression is the maximum of those of pwaff1
1651 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1652 * cell, then the associated expression is the defined one.
1654 static __isl_give isl_pw_aff *pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
1655 __isl_take isl_pw_aff *pwaff2)
1657 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_ge_basic_set);
1660 __isl_give isl_pw_aff *isl_pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
1661 __isl_take isl_pw_aff *pwaff2)
1663 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
1667 /* Compute a piecewise quasi-affine expression with a domain that
1668 * is the union of those of pwaff1 and pwaff2 and such that on each
1669 * cell, the quasi-affine expression is the minimum of those of pwaff1
1670 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1671 * cell, then the associated expression is the defined one.
1673 static __isl_give isl_pw_aff *pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
1674 __isl_take isl_pw_aff *pwaff2)
1676 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_le_basic_set);
1679 __isl_give isl_pw_aff *isl_pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
1680 __isl_take isl_pw_aff *pwaff2)
1682 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
1686 __isl_give isl_pw_aff *isl_pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
1687 __isl_take isl_pw_aff *pwaff2, int max)
1690 return isl_pw_aff_union_max(pwaff1, pwaff2);
1692 return isl_pw_aff_union_min(pwaff1, pwaff2);
1695 /* Construct a map with as domain the domain of pwaff and
1696 * one-dimensional range corresponding to the affine expressions.
1698 static __isl_give isl_map *map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1707 dim = isl_pw_aff_get_space(pwaff);
1708 map = isl_map_empty(dim);
1710 for (i = 0; i < pwaff->n; ++i) {
1711 isl_basic_map *bmap;
1714 bmap = isl_basic_map_from_aff(isl_aff_copy(pwaff->p[i].aff));
1715 map_i = isl_map_from_basic_map(bmap);
1716 map_i = isl_map_intersect_domain(map_i,
1717 isl_set_copy(pwaff->p[i].set));
1718 map = isl_map_union_disjoint(map, map_i);
1721 isl_pw_aff_free(pwaff);
1726 /* Construct a map with as domain the domain of pwaff and
1727 * one-dimensional range corresponding to the affine expressions.
1729 __isl_give isl_map *isl_map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1733 if (isl_space_is_set(pwaff->dim))
1734 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1735 "space of input is not a map",
1736 return isl_pw_aff_free(pwaff));
1737 return map_from_pw_aff(pwaff);
1740 /* Construct a one-dimensional set with as parameter domain
1741 * the domain of pwaff and the single set dimension
1742 * corresponding to the affine expressions.
1744 __isl_give isl_set *isl_set_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1748 if (!isl_space_is_set(pwaff->dim))
1749 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1750 "space of input is not a set",
1751 return isl_pw_aff_free(pwaff));
1752 return map_from_pw_aff(pwaff);
1755 /* Return a set containing those elements in the domain
1756 * of pwaff where it is non-negative.
1758 __isl_give isl_set *isl_pw_aff_nonneg_set(__isl_take isl_pw_aff *pwaff)
1766 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
1768 for (i = 0; i < pwaff->n; ++i) {
1769 isl_basic_set *bset;
1772 bset = isl_aff_nonneg_basic_set(isl_aff_copy(pwaff->p[i].aff));
1773 set_i = isl_set_from_basic_set(bset);
1774 set_i = isl_set_intersect(set_i, isl_set_copy(pwaff->p[i].set));
1775 set = isl_set_union_disjoint(set, set_i);
1778 isl_pw_aff_free(pwaff);
1783 /* Return a set containing those elements in the domain
1784 * of pwaff where it is zero (if complement is 0) or not zero
1785 * (if complement is 1).
1787 static __isl_give isl_set *pw_aff_zero_set(__isl_take isl_pw_aff *pwaff,
1796 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
1798 for (i = 0; i < pwaff->n; ++i) {
1799 isl_basic_set *bset;
1800 isl_set *set_i, *zero;
1802 bset = isl_aff_zero_basic_set(isl_aff_copy(pwaff->p[i].aff));
1803 zero = isl_set_from_basic_set(bset);
1804 set_i = isl_set_copy(pwaff->p[i].set);
1806 set_i = isl_set_subtract(set_i, zero);
1808 set_i = isl_set_intersect(set_i, zero);
1809 set = isl_set_union_disjoint(set, set_i);
1812 isl_pw_aff_free(pwaff);
1817 /* Return a set containing those elements in the domain
1818 * of pwaff where it is zero.
1820 __isl_give isl_set *isl_pw_aff_zero_set(__isl_take isl_pw_aff *pwaff)
1822 return pw_aff_zero_set(pwaff, 0);
1825 /* Return a set containing those elements in the domain
1826 * of pwaff where it is not zero.
1828 __isl_give isl_set *isl_pw_aff_non_zero_set(__isl_take isl_pw_aff *pwaff)
1830 return pw_aff_zero_set(pwaff, 1);
1833 /* Return a set containing those elements in the shared domain
1834 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
1836 * We compute the difference on the shared domain and then construct
1837 * the set of values where this difference is non-negative.
1838 * If strict is set, we first subtract 1 from the difference.
1839 * If equal is set, we only return the elements where pwaff1 and pwaff2
1842 static __isl_give isl_set *pw_aff_gte_set(__isl_take isl_pw_aff *pwaff1,
1843 __isl_take isl_pw_aff *pwaff2, int strict, int equal)
1845 isl_set *set1, *set2;
1847 set1 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff1));
1848 set2 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff2));
1849 set1 = isl_set_intersect(set1, set2);
1850 pwaff1 = isl_pw_aff_intersect_domain(pwaff1, isl_set_copy(set1));
1851 pwaff2 = isl_pw_aff_intersect_domain(pwaff2, isl_set_copy(set1));
1852 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_neg(pwaff2));
1855 isl_space *dim = isl_set_get_space(set1);
1857 aff = isl_aff_zero_on_domain(isl_local_space_from_space(dim));
1858 aff = isl_aff_add_constant_si(aff, -1);
1859 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_alloc(set1, aff));
1864 return isl_pw_aff_zero_set(pwaff1);
1865 return isl_pw_aff_nonneg_set(pwaff1);
1868 /* Return a set containing those elements in the shared domain
1869 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
1871 static __isl_give isl_set *pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
1872 __isl_take isl_pw_aff *pwaff2)
1874 return pw_aff_gte_set(pwaff1, pwaff2, 0, 1);
1877 __isl_give isl_set *isl_pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
1878 __isl_take isl_pw_aff *pwaff2)
1880 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_eq_set);
1883 /* Return a set containing those elements in the shared domain
1884 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
1886 static __isl_give isl_set *pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
1887 __isl_take isl_pw_aff *pwaff2)
1889 return pw_aff_gte_set(pwaff1, pwaff2, 0, 0);
1892 __isl_give isl_set *isl_pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
1893 __isl_take isl_pw_aff *pwaff2)
1895 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ge_set);
1898 /* Return a set containing those elements in the shared domain
1899 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
1901 static __isl_give isl_set *pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
1902 __isl_take isl_pw_aff *pwaff2)
1904 return pw_aff_gte_set(pwaff1, pwaff2, 1, 0);
1907 __isl_give isl_set *isl_pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
1908 __isl_take isl_pw_aff *pwaff2)
1910 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_gt_set);
1913 __isl_give isl_set *isl_pw_aff_le_set(__isl_take isl_pw_aff *pwaff1,
1914 __isl_take isl_pw_aff *pwaff2)
1916 return isl_pw_aff_ge_set(pwaff2, pwaff1);
1919 __isl_give isl_set *isl_pw_aff_lt_set(__isl_take isl_pw_aff *pwaff1,
1920 __isl_take isl_pw_aff *pwaff2)
1922 return isl_pw_aff_gt_set(pwaff2, pwaff1);
1925 /* Return a set containing those elements in the shared domain
1926 * of the elements of list1 and list2 where each element in list1
1927 * has the relation specified by "fn" with each element in list2.
1929 static __isl_give isl_set *pw_aff_list_set(__isl_take isl_pw_aff_list *list1,
1930 __isl_take isl_pw_aff_list *list2,
1931 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
1932 __isl_take isl_pw_aff *pwaff2))
1938 if (!list1 || !list2)
1941 ctx = isl_pw_aff_list_get_ctx(list1);
1942 if (list1->n < 1 || list2->n < 1)
1943 isl_die(ctx, isl_error_invalid,
1944 "list should contain at least one element", goto error);
1946 set = isl_set_universe(isl_pw_aff_get_domain_space(list1->p[0]));
1947 for (i = 0; i < list1->n; ++i)
1948 for (j = 0; j < list2->n; ++j) {
1951 set_ij = fn(isl_pw_aff_copy(list1->p[i]),
1952 isl_pw_aff_copy(list2->p[j]));
1953 set = isl_set_intersect(set, set_ij);
1956 isl_pw_aff_list_free(list1);
1957 isl_pw_aff_list_free(list2);
1960 isl_pw_aff_list_free(list1);
1961 isl_pw_aff_list_free(list2);
1965 /* Return a set containing those elements in the shared domain
1966 * of the elements of list1 and list2 where each element in list1
1967 * is equal to each element in list2.
1969 __isl_give isl_set *isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list *list1,
1970 __isl_take isl_pw_aff_list *list2)
1972 return pw_aff_list_set(list1, list2, &isl_pw_aff_eq_set);
1975 __isl_give isl_set *isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list *list1,
1976 __isl_take isl_pw_aff_list *list2)
1978 return pw_aff_list_set(list1, list2, &isl_pw_aff_ne_set);
1981 /* Return a set containing those elements in the shared domain
1982 * of the elements of list1 and list2 where each element in list1
1983 * is less than or equal to each element in list2.
1985 __isl_give isl_set *isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list *list1,
1986 __isl_take isl_pw_aff_list *list2)
1988 return pw_aff_list_set(list1, list2, &isl_pw_aff_le_set);
1991 __isl_give isl_set *isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list *list1,
1992 __isl_take isl_pw_aff_list *list2)
1994 return pw_aff_list_set(list1, list2, &isl_pw_aff_lt_set);
1997 __isl_give isl_set *isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list *list1,
1998 __isl_take isl_pw_aff_list *list2)
2000 return pw_aff_list_set(list1, list2, &isl_pw_aff_ge_set);
2003 __isl_give isl_set *isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list *list1,
2004 __isl_take isl_pw_aff_list *list2)
2006 return pw_aff_list_set(list1, list2, &isl_pw_aff_gt_set);
2010 /* Return a set containing those elements in the shared domain
2011 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
2013 static __isl_give isl_set *pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
2014 __isl_take isl_pw_aff *pwaff2)
2016 isl_set *set_lt, *set_gt;
2018 set_lt = isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1),
2019 isl_pw_aff_copy(pwaff2));
2020 set_gt = isl_pw_aff_gt_set(pwaff1, pwaff2);
2021 return isl_set_union_disjoint(set_lt, set_gt);
2024 __isl_give isl_set *isl_pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
2025 __isl_take isl_pw_aff *pwaff2)
2027 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ne_set);
2030 __isl_give isl_pw_aff *isl_pw_aff_scale_down(__isl_take isl_pw_aff *pwaff,
2035 if (isl_int_is_one(v))
2037 if (!isl_int_is_pos(v))
2038 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
2039 "factor needs to be positive",
2040 return isl_pw_aff_free(pwaff));
2041 pwaff = isl_pw_aff_cow(pwaff);
2047 for (i = 0; i < pwaff->n; ++i) {
2048 pwaff->p[i].aff = isl_aff_scale_down(pwaff->p[i].aff, v);
2049 if (!pwaff->p[i].aff)
2050 return isl_pw_aff_free(pwaff);
2056 __isl_give isl_pw_aff *isl_pw_aff_floor(__isl_take isl_pw_aff *pwaff)
2060 pwaff = isl_pw_aff_cow(pwaff);
2066 for (i = 0; i < pwaff->n; ++i) {
2067 pwaff->p[i].aff = isl_aff_floor(pwaff->p[i].aff);
2068 if (!pwaff->p[i].aff)
2069 return isl_pw_aff_free(pwaff);
2075 __isl_give isl_pw_aff *isl_pw_aff_ceil(__isl_take isl_pw_aff *pwaff)
2079 pwaff = isl_pw_aff_cow(pwaff);
2085 for (i = 0; i < pwaff->n; ++i) {
2086 pwaff->p[i].aff = isl_aff_ceil(pwaff->p[i].aff);
2087 if (!pwaff->p[i].aff)
2088 return isl_pw_aff_free(pwaff);
2094 /* Assuming that "cond1" and "cond2" are disjoint,
2095 * return an affine expression that is equal to pwaff1 on cond1
2096 * and to pwaff2 on cond2.
2098 static __isl_give isl_pw_aff *isl_pw_aff_select(
2099 __isl_take isl_set *cond1, __isl_take isl_pw_aff *pwaff1,
2100 __isl_take isl_set *cond2, __isl_take isl_pw_aff *pwaff2)
2102 pwaff1 = isl_pw_aff_intersect_domain(pwaff1, cond1);
2103 pwaff2 = isl_pw_aff_intersect_domain(pwaff2, cond2);
2105 return isl_pw_aff_add_disjoint(pwaff1, pwaff2);
2108 /* Return an affine expression that is equal to pwaff_true for elements
2109 * where "cond" is non-zero and to pwaff_false for elements where "cond"
2111 * That is, return cond ? pwaff_true : pwaff_false;
2113 __isl_give isl_pw_aff *isl_pw_aff_cond(__isl_take isl_pw_aff *cond,
2114 __isl_take isl_pw_aff *pwaff_true, __isl_take isl_pw_aff *pwaff_false)
2116 isl_set *cond_true, *cond_false;
2118 cond_true = isl_pw_aff_non_zero_set(isl_pw_aff_copy(cond));
2119 cond_false = isl_pw_aff_zero_set(cond);
2120 return isl_pw_aff_select(cond_true, pwaff_true,
2121 cond_false, pwaff_false);
2124 int isl_aff_is_cst(__isl_keep isl_aff *aff)
2129 return isl_seq_first_non_zero(aff->v->el + 2, aff->v->size - 2) == -1;
2132 /* Check whether pwaff is a piecewise constant.
2134 int isl_pw_aff_is_cst(__isl_keep isl_pw_aff *pwaff)
2141 for (i = 0; i < pwaff->n; ++i) {
2142 int is_cst = isl_aff_is_cst(pwaff->p[i].aff);
2143 if (is_cst < 0 || !is_cst)
2150 __isl_give isl_aff *isl_aff_mul(__isl_take isl_aff *aff1,
2151 __isl_take isl_aff *aff2)
2153 if (!isl_aff_is_cst(aff2) && isl_aff_is_cst(aff1))
2154 return isl_aff_mul(aff2, aff1);
2156 if (!isl_aff_is_cst(aff2))
2157 isl_die(isl_aff_get_ctx(aff1), isl_error_invalid,
2158 "at least one affine expression should be constant",
2161 aff1 = isl_aff_cow(aff1);
2165 aff1 = isl_aff_scale(aff1, aff2->v->el[1]);
2166 aff1 = isl_aff_scale_down(aff1, aff2->v->el[0]);
2176 static __isl_give isl_pw_aff *pw_aff_add(__isl_take isl_pw_aff *pwaff1,
2177 __isl_take isl_pw_aff *pwaff2)
2179 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_add);
2182 __isl_give isl_pw_aff *isl_pw_aff_add(__isl_take isl_pw_aff *pwaff1,
2183 __isl_take isl_pw_aff *pwaff2)
2185 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_add);
2188 __isl_give isl_pw_aff *isl_pw_aff_union_add(__isl_take isl_pw_aff *pwaff1,
2189 __isl_take isl_pw_aff *pwaff2)
2191 return isl_pw_aff_union_add_(pwaff1, pwaff2);
2194 static __isl_give isl_pw_aff *pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
2195 __isl_take isl_pw_aff *pwaff2)
2197 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_mul);
2200 __isl_give isl_pw_aff *isl_pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
2201 __isl_take isl_pw_aff *pwaff2)
2203 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_mul);
2206 static __isl_give isl_pw_aff *pw_aff_min(__isl_take isl_pw_aff *pwaff1,
2207 __isl_take isl_pw_aff *pwaff2)
2212 dom = isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1)),
2213 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2)));
2214 le = isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1),
2215 isl_pw_aff_copy(pwaff2));
2216 dom = isl_set_subtract(dom, isl_set_copy(le));
2217 return isl_pw_aff_select(le, pwaff1, dom, pwaff2);
2220 __isl_give isl_pw_aff *isl_pw_aff_min(__isl_take isl_pw_aff *pwaff1,
2221 __isl_take isl_pw_aff *pwaff2)
2223 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_min);
2226 static __isl_give isl_pw_aff *pw_aff_max(__isl_take isl_pw_aff *pwaff1,
2227 __isl_take isl_pw_aff *pwaff2)
2232 dom = isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1)),
2233 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2)));
2234 ge = isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1),
2235 isl_pw_aff_copy(pwaff2));
2236 dom = isl_set_subtract(dom, isl_set_copy(ge));
2237 return isl_pw_aff_select(ge, pwaff1, dom, pwaff2);
2240 __isl_give isl_pw_aff *isl_pw_aff_max(__isl_take isl_pw_aff *pwaff1,
2241 __isl_take isl_pw_aff *pwaff2)
2243 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_max);
2246 static __isl_give isl_pw_aff *pw_aff_list_reduce(
2247 __isl_take isl_pw_aff_list *list,
2248 __isl_give isl_pw_aff *(*fn)(__isl_take isl_pw_aff *pwaff1,
2249 __isl_take isl_pw_aff *pwaff2))
2258 ctx = isl_pw_aff_list_get_ctx(list);
2260 isl_die(ctx, isl_error_invalid,
2261 "list should contain at least one element",
2262 return isl_pw_aff_list_free(list));
2264 res = isl_pw_aff_copy(list->p[0]);
2265 for (i = 1; i < list->n; ++i)
2266 res = fn(res, isl_pw_aff_copy(list->p[i]));
2268 isl_pw_aff_list_free(list);
2272 /* Return an isl_pw_aff that maps each element in the intersection of the
2273 * domains of the elements of list to the minimal corresponding affine
2276 __isl_give isl_pw_aff *isl_pw_aff_list_min(__isl_take isl_pw_aff_list *list)
2278 return pw_aff_list_reduce(list, &isl_pw_aff_min);
2281 /* Return an isl_pw_aff that maps each element in the intersection of the
2282 * domains of the elements of list to the maximal corresponding affine
2285 __isl_give isl_pw_aff *isl_pw_aff_list_max(__isl_take isl_pw_aff_list *list)
2287 return pw_aff_list_reduce(list, &isl_pw_aff_max);
2293 #include <isl_multi_templ.c>
2295 /* Construct an isl_multi_aff in the given space with value zero in
2296 * each of the output dimensions.
2298 __isl_give isl_multi_aff *isl_multi_aff_zero(__isl_take isl_space *space)
2306 n = isl_space_dim(space , isl_dim_out);
2307 ma = isl_multi_aff_alloc(isl_space_copy(space));
2310 isl_space_free(space);
2313 isl_local_space *ls;
2316 space = isl_space_domain(space);
2317 ls = isl_local_space_from_space(space);
2318 aff = isl_aff_zero_on_domain(ls);
2320 for (i = 0; i < n; ++i)
2321 ma = isl_multi_aff_set_aff(ma, i, isl_aff_copy(aff));
2329 /* Create an isl_multi_aff in the given space that maps each
2330 * input dimension to the corresponding output dimension.
2332 __isl_give isl_multi_aff *isl_multi_aff_identity(__isl_take isl_space *space)
2340 if (isl_space_is_set(space))
2341 isl_die(isl_space_get_ctx(space), isl_error_invalid,
2342 "expecting map space", goto error);
2344 n = isl_space_dim(space, isl_dim_out);
2345 if (n != isl_space_dim(space, isl_dim_in))
2346 isl_die(isl_space_get_ctx(space), isl_error_invalid,
2347 "number of input and output dimensions needs to be "
2348 "the same", goto error);
2350 ma = isl_multi_aff_alloc(isl_space_copy(space));
2353 isl_space_free(space);
2356 isl_local_space *ls;
2359 space = isl_space_domain(space);
2360 ls = isl_local_space_from_space(space);
2361 aff = isl_aff_zero_on_domain(ls);
2363 for (i = 0; i < n; ++i) {
2365 aff_i = isl_aff_copy(aff);
2366 aff_i = isl_aff_add_coefficient_si(aff_i,
2368 ma = isl_multi_aff_set_aff(ma, i, aff_i);
2376 isl_space_free(space);
2380 /* Create an isl_pw_multi_aff with the given isl_multi_aff on a universe
2383 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_multi_aff(
2384 __isl_take isl_multi_aff *ma)
2386 isl_set *dom = isl_set_universe(isl_multi_aff_get_domain_space(ma));
2387 return isl_pw_multi_aff_alloc(dom, ma);
2390 /* Create a piecewise multi-affine expression in the given space that maps each
2391 * input dimension to the corresponding output dimension.
2393 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_identity(
2394 __isl_take isl_space *space)
2396 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_identity(space));
2399 __isl_give isl_multi_aff *isl_multi_aff_add(__isl_take isl_multi_aff *maff1,
2400 __isl_take isl_multi_aff *maff2)
2405 maff1 = isl_multi_aff_cow(maff1);
2406 if (!maff1 || !maff2)
2409 ctx = isl_multi_aff_get_ctx(maff1);
2410 if (!isl_space_is_equal(maff1->space, maff2->space))
2411 isl_die(ctx, isl_error_invalid,
2412 "spaces don't match", goto error);
2414 for (i = 0; i < maff1->n; ++i) {
2415 maff1->p[i] = isl_aff_add(maff1->p[i],
2416 isl_aff_copy(maff2->p[i]));
2421 isl_multi_aff_free(maff2);
2424 isl_multi_aff_free(maff1);
2425 isl_multi_aff_free(maff2);
2429 /* Given two multi-affine expressions A -> B and C -> D,
2430 * construct a multi-affine expression [A -> C] -> [B -> D].
2432 __isl_give isl_multi_aff *isl_multi_aff_product(
2433 __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2)
2439 int in1, in2, out1, out2;
2441 in1 = isl_multi_aff_dim(ma1, isl_dim_in);
2442 in2 = isl_multi_aff_dim(ma2, isl_dim_in);
2443 out1 = isl_multi_aff_dim(ma1, isl_dim_out);
2444 out2 = isl_multi_aff_dim(ma2, isl_dim_out);
2445 space = isl_space_product(isl_multi_aff_get_space(ma1),
2446 isl_multi_aff_get_space(ma2));
2447 res = isl_multi_aff_alloc(isl_space_copy(space));
2448 space = isl_space_domain(space);
2450 for (i = 0; i < out1; ++i) {
2451 aff = isl_multi_aff_get_aff(ma1, i);
2452 aff = isl_aff_insert_dims(aff, isl_dim_in, in1, in2);
2453 aff = isl_aff_reset_domain_space(aff, isl_space_copy(space));
2454 res = isl_multi_aff_set_aff(res, i, aff);
2457 for (i = 0; i < out2; ++i) {
2458 aff = isl_multi_aff_get_aff(ma2, i);
2459 aff = isl_aff_insert_dims(aff, isl_dim_in, 0, in1);
2460 aff = isl_aff_reset_domain_space(aff, isl_space_copy(space));
2461 res = isl_multi_aff_set_aff(res, out1 + i, aff);
2464 isl_space_free(space);
2465 isl_multi_aff_free(ma1);
2466 isl_multi_aff_free(ma2);
2470 /* Exploit the equalities in "eq" to simplify the affine expressions.
2472 static __isl_give isl_multi_aff *isl_multi_aff_substitute_equalities(
2473 __isl_take isl_multi_aff *maff, __isl_take isl_basic_set *eq)
2477 maff = isl_multi_aff_cow(maff);
2481 for (i = 0; i < maff->n; ++i) {
2482 maff->p[i] = isl_aff_substitute_equalities(maff->p[i],
2483 isl_basic_set_copy(eq));
2488 isl_basic_set_free(eq);
2491 isl_basic_set_free(eq);
2492 isl_multi_aff_free(maff);
2496 __isl_give isl_multi_aff *isl_multi_aff_scale(__isl_take isl_multi_aff *maff,
2501 maff = isl_multi_aff_cow(maff);
2505 for (i = 0; i < maff->n; ++i) {
2506 maff->p[i] = isl_aff_scale(maff->p[i], f);
2508 return isl_multi_aff_free(maff);
2514 __isl_give isl_multi_aff *isl_multi_aff_add_on_domain(__isl_keep isl_set *dom,
2515 __isl_take isl_multi_aff *maff1, __isl_take isl_multi_aff *maff2)
2517 maff1 = isl_multi_aff_add(maff1, maff2);
2518 maff1 = isl_multi_aff_gist(maff1, isl_set_copy(dom));
2522 int isl_multi_aff_is_empty(__isl_keep isl_multi_aff *maff)
2530 int isl_multi_aff_plain_is_equal(__isl_keep isl_multi_aff *maff1,
2531 __isl_keep isl_multi_aff *maff2)
2536 if (!maff1 || !maff2)
2538 if (maff1->n != maff2->n)
2540 equal = isl_space_is_equal(maff1->space, maff2->space);
2541 if (equal < 0 || !equal)
2544 for (i = 0; i < maff1->n; ++i) {
2545 equal = isl_aff_plain_is_equal(maff1->p[i], maff2->p[i]);
2546 if (equal < 0 || !equal)
2553 __isl_give isl_multi_aff *isl_multi_aff_set_dim_name(
2554 __isl_take isl_multi_aff *maff,
2555 enum isl_dim_type type, unsigned pos, const char *s)
2559 maff = isl_multi_aff_cow(maff);
2563 maff->space = isl_space_set_dim_name(maff->space, type, pos, s);
2565 return isl_multi_aff_free(maff);
2567 if (type == isl_dim_out)
2569 for (i = 0; i < maff->n; ++i) {
2570 maff->p[i] = isl_aff_set_dim_name(maff->p[i], type, pos, s);
2572 return isl_multi_aff_free(maff);
2578 __isl_give isl_multi_aff *isl_multi_aff_drop_dims(__isl_take isl_multi_aff *maff,
2579 enum isl_dim_type type, unsigned first, unsigned n)
2583 maff = isl_multi_aff_cow(maff);
2587 maff->space = isl_space_drop_dims(maff->space, type, first, n);
2589 return isl_multi_aff_free(maff);
2591 if (type == isl_dim_out) {
2592 for (i = 0; i < n; ++i)
2593 isl_aff_free(maff->p[first + i]);
2594 for (i = first; i + n < maff->n; ++i)
2595 maff->p[i] = maff->p[i + n];
2600 for (i = 0; i < maff->n; ++i) {
2601 maff->p[i] = isl_aff_drop_dims(maff->p[i], type, first, n);
2603 return isl_multi_aff_free(maff);
2609 /* Return the set of domain elements where "ma1" is lexicographically
2610 * smaller than or equal to "ma2".
2612 __isl_give isl_set *isl_multi_aff_lex_le_set(__isl_take isl_multi_aff *ma1,
2613 __isl_take isl_multi_aff *ma2)
2615 return isl_multi_aff_lex_ge_set(ma2, ma1);
2618 /* Return the set of domain elements where "ma1" is lexicographically
2619 * greater than or equal to "ma2".
2621 __isl_give isl_set *isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff *ma1,
2622 __isl_take isl_multi_aff *ma2)
2625 isl_map *map1, *map2;
2628 map1 = isl_map_from_multi_aff(ma1);
2629 map2 = isl_map_from_multi_aff(ma2);
2630 map = isl_map_range_product(map1, map2);
2631 space = isl_space_range(isl_map_get_space(map));
2632 space = isl_space_domain(isl_space_unwrap(space));
2633 ge = isl_map_lex_ge(space);
2634 map = isl_map_intersect_range(map, isl_map_wrap(ge));
2636 return isl_map_domain(map);
2640 #define PW isl_pw_multi_aff
2642 #define EL isl_multi_aff
2644 #define EL_IS_ZERO is_empty
2648 #define IS_ZERO is_empty
2651 #undef DEFAULT_IS_ZERO
2652 #define DEFAULT_IS_ZERO 0
2657 #define NO_INVOLVES_DIMS
2658 #define NO_MOVE_DIMS
2659 #define NO_INSERT_DIMS
2663 #include <isl_pw_templ.c>
2666 #define UNION isl_union_pw_multi_aff
2668 #define PART isl_pw_multi_aff
2670 #define PARTS pw_multi_aff
2671 #define ALIGN_DOMAIN
2675 #include <isl_union_templ.c>
2677 /* Given a function "cmp" that returns the set of elements where
2678 * "ma1" is "better" than "ma2", return the intersection of this
2679 * set with "dom1" and "dom2".
2681 static __isl_give isl_set *shared_and_better(__isl_keep isl_set *dom1,
2682 __isl_keep isl_set *dom2, __isl_keep isl_multi_aff *ma1,
2683 __isl_keep isl_multi_aff *ma2,
2684 __isl_give isl_set *(*cmp)(__isl_take isl_multi_aff *ma1,
2685 __isl_take isl_multi_aff *ma2))
2691 common = isl_set_intersect(isl_set_copy(dom1), isl_set_copy(dom2));
2692 is_empty = isl_set_plain_is_empty(common);
2693 if (is_empty >= 0 && is_empty)
2696 return isl_set_free(common);
2697 better = cmp(isl_multi_aff_copy(ma1), isl_multi_aff_copy(ma2));
2698 better = isl_set_intersect(common, better);
2703 /* Given a function "cmp" that returns the set of elements where
2704 * "ma1" is "better" than "ma2", return a piecewise multi affine
2705 * expression defined on the union of the definition domains
2706 * of "pma1" and "pma2" that maps to the "best" of "pma1" and
2707 * "pma2" on each cell. If only one of the two input functions
2708 * is defined on a given cell, then it is considered the best.
2710 static __isl_give isl_pw_multi_aff *pw_multi_aff_union_opt(
2711 __isl_take isl_pw_multi_aff *pma1,
2712 __isl_take isl_pw_multi_aff *pma2,
2713 __isl_give isl_set *(*cmp)(__isl_take isl_multi_aff *ma1,
2714 __isl_take isl_multi_aff *ma2))
2717 isl_pw_multi_aff *res = NULL;
2719 isl_set *set = NULL;
2724 ctx = isl_space_get_ctx(pma1->dim);
2725 if (!isl_space_is_equal(pma1->dim, pma2->dim))
2726 isl_die(ctx, isl_error_invalid,
2727 "arguments should live in the same space", goto error);
2729 if (isl_pw_multi_aff_is_empty(pma1)) {
2730 isl_pw_multi_aff_free(pma1);
2734 if (isl_pw_multi_aff_is_empty(pma2)) {
2735 isl_pw_multi_aff_free(pma2);
2739 n = 2 * (pma1->n + 1) * (pma2->n + 1);
2740 res = isl_pw_multi_aff_alloc_size(isl_space_copy(pma1->dim), n);
2742 for (i = 0; i < pma1->n; ++i) {
2743 set = isl_set_copy(pma1->p[i].set);
2744 for (j = 0; j < pma2->n; ++j) {
2748 better = shared_and_better(pma2->p[j].set,
2749 pma1->p[i].set, pma2->p[j].maff,
2750 pma1->p[i].maff, cmp);
2751 is_empty = isl_set_plain_is_empty(better);
2752 if (is_empty < 0 || is_empty) {
2753 isl_set_free(better);
2758 set = isl_set_subtract(set, isl_set_copy(better));
2760 res = isl_pw_multi_aff_add_piece(res, better,
2761 isl_multi_aff_copy(pma2->p[j].maff));
2763 res = isl_pw_multi_aff_add_piece(res, set,
2764 isl_multi_aff_copy(pma1->p[i].maff));
2767 for (j = 0; j < pma2->n; ++j) {
2768 set = isl_set_copy(pma2->p[j].set);
2769 for (i = 0; i < pma1->n; ++i)
2770 set = isl_set_subtract(set,
2771 isl_set_copy(pma1->p[i].set));
2772 res = isl_pw_multi_aff_add_piece(res, set,
2773 isl_multi_aff_copy(pma2->p[j].maff));
2776 isl_pw_multi_aff_free(pma1);
2777 isl_pw_multi_aff_free(pma2);
2781 isl_pw_multi_aff_free(pma1);
2782 isl_pw_multi_aff_free(pma2);
2784 return isl_pw_multi_aff_free(res);
2787 static __isl_give isl_pw_multi_aff *pw_multi_aff_union_lexmax(
2788 __isl_take isl_pw_multi_aff *pma1,
2789 __isl_take isl_pw_multi_aff *pma2)
2791 return pw_multi_aff_union_opt(pma1, pma2, &isl_multi_aff_lex_ge_set);
2794 /* Given two piecewise multi affine expressions, return a piecewise
2795 * multi-affine expression defined on the union of the definition domains
2796 * of the inputs that is equal to the lexicographic maximum of the two
2797 * inputs on each cell. If only one of the two inputs is defined on
2798 * a given cell, then it is considered to be the maximum.
2800 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmax(
2801 __isl_take isl_pw_multi_aff *pma1,
2802 __isl_take isl_pw_multi_aff *pma2)
2804 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
2805 &pw_multi_aff_union_lexmax);
2808 static __isl_give isl_pw_multi_aff *pw_multi_aff_union_lexmin(
2809 __isl_take isl_pw_multi_aff *pma1,
2810 __isl_take isl_pw_multi_aff *pma2)
2812 return pw_multi_aff_union_opt(pma1, pma2, &isl_multi_aff_lex_le_set);
2815 /* Given two piecewise multi affine expressions, return a piecewise
2816 * multi-affine expression defined on the union of the definition domains
2817 * of the inputs that is equal to the lexicographic minimum of the two
2818 * inputs on each cell. If only one of the two inputs is defined on
2819 * a given cell, then it is considered to be the minimum.
2821 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmin(
2822 __isl_take isl_pw_multi_aff *pma1,
2823 __isl_take isl_pw_multi_aff *pma2)
2825 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
2826 &pw_multi_aff_union_lexmin);
2829 static __isl_give isl_pw_multi_aff *pw_multi_aff_add(
2830 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2832 return isl_pw_multi_aff_on_shared_domain(pma1, pma2,
2833 &isl_multi_aff_add);
2836 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_add(
2837 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2839 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
2843 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_add(
2844 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2846 return isl_pw_multi_aff_union_add_(pma1, pma2);
2849 /* Given two piecewise multi-affine expressions A -> B and C -> D,
2850 * construct a piecewise multi-affine expression [A -> C] -> [B -> D].
2852 static __isl_give isl_pw_multi_aff *pw_multi_aff_product(
2853 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2857 isl_pw_multi_aff *res;
2862 n = pma1->n * pma2->n;
2863 space = isl_space_product(isl_space_copy(pma1->dim),
2864 isl_space_copy(pma2->dim));
2865 res = isl_pw_multi_aff_alloc_size(space, n);
2867 for (i = 0; i < pma1->n; ++i) {
2868 for (j = 0; j < pma2->n; ++j) {
2872 domain = isl_set_product(isl_set_copy(pma1->p[i].set),
2873 isl_set_copy(pma2->p[j].set));
2874 ma = isl_multi_aff_product(
2875 isl_multi_aff_copy(pma1->p[i].maff),
2876 isl_multi_aff_copy(pma2->p[i].maff));
2877 res = isl_pw_multi_aff_add_piece(res, domain, ma);
2881 isl_pw_multi_aff_free(pma1);
2882 isl_pw_multi_aff_free(pma2);
2885 isl_pw_multi_aff_free(pma1);
2886 isl_pw_multi_aff_free(pma2);
2890 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_product(
2891 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2893 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
2894 &pw_multi_aff_product);
2897 /* Construct a map mapping the domain of the piecewise multi-affine expression
2898 * to its range, with each dimension in the range equated to the
2899 * corresponding affine expression on its cell.
2901 __isl_give isl_map *isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
2909 map = isl_map_empty(isl_pw_multi_aff_get_space(pma));
2911 for (i = 0; i < pma->n; ++i) {
2912 isl_multi_aff *maff;
2913 isl_basic_map *bmap;
2916 maff = isl_multi_aff_copy(pma->p[i].maff);
2917 bmap = isl_basic_map_from_multi_aff(maff);
2918 map_i = isl_map_from_basic_map(bmap);
2919 map_i = isl_map_intersect_domain(map_i,
2920 isl_set_copy(pma->p[i].set));
2921 map = isl_map_union_disjoint(map, map_i);
2924 isl_pw_multi_aff_free(pma);
2928 __isl_give isl_set *isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
2930 if (!isl_space_is_set(pma->dim))
2931 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
2932 "isl_pw_multi_aff cannot be converted into an isl_set",
2933 return isl_pw_multi_aff_free(pma));
2935 return isl_map_from_pw_multi_aff(pma);
2938 /* Given a basic map with a single output dimension that is defined
2939 * in terms of the parameters and input dimensions using an equality,
2940 * extract an isl_aff that expresses the output dimension in terms
2941 * of the parameters and input dimensions.
2943 * Since some applications expect the result of isl_pw_multi_aff_from_map
2944 * to only contain integer affine expressions, we compute the floor
2945 * of the expression before returning.
2947 * This function shares some similarities with
2948 * isl_basic_map_has_defining_equality and isl_constraint_get_bound.
2950 static __isl_give isl_aff *extract_isl_aff_from_basic_map(
2951 __isl_take isl_basic_map *bmap)
2956 isl_local_space *ls;
2961 if (isl_basic_map_dim(bmap, isl_dim_out) != 1)
2962 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
2963 "basic map should have a single output dimension",
2965 offset = isl_basic_map_offset(bmap, isl_dim_out);
2966 total = isl_basic_map_total_dim(bmap);
2967 for (i = 0; i < bmap->n_eq; ++i) {
2968 if (isl_int_is_zero(bmap->eq[i][offset]))
2970 if (isl_seq_first_non_zero(bmap->eq[i] + offset + 1,
2971 1 + total - (offset + 1)) != -1)
2975 if (i >= bmap->n_eq)
2976 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
2977 "unable to find suitable equality", goto error);
2978 ls = isl_basic_map_get_local_space(bmap);
2979 aff = isl_aff_alloc(isl_local_space_domain(ls));
2982 if (isl_int_is_neg(bmap->eq[i][offset]))
2983 isl_seq_cpy(aff->v->el + 1, bmap->eq[i], offset);
2985 isl_seq_neg(aff->v->el + 1, bmap->eq[i], offset);
2986 isl_seq_clr(aff->v->el + 1 + offset, aff->v->size - (1 + offset));
2987 isl_int_abs(aff->v->el[0], bmap->eq[i][offset]);
2988 isl_basic_map_free(bmap);
2990 aff = isl_aff_remove_unused_divs(aff);
2991 aff = isl_aff_floor(aff);
2994 isl_basic_map_free(bmap);
2998 /* Given a basic map where each output dimension is defined
2999 * in terms of the parameters and input dimensions using an equality,
3000 * extract an isl_multi_aff that expresses the output dimensions in terms
3001 * of the parameters and input dimensions.
3003 static __isl_give isl_multi_aff *extract_isl_multi_aff_from_basic_map(
3004 __isl_take isl_basic_map *bmap)
3013 ma = isl_multi_aff_alloc(isl_basic_map_get_space(bmap));
3014 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3016 for (i = 0; i < n_out; ++i) {
3017 isl_basic_map *bmap_i;
3020 bmap_i = isl_basic_map_copy(bmap);
3021 bmap_i = isl_basic_map_project_out(bmap_i, isl_dim_out,
3022 i + 1, n_out - (1 + i));
3023 bmap_i = isl_basic_map_project_out(bmap_i, isl_dim_out, 0, i);
3024 aff = extract_isl_aff_from_basic_map(bmap_i);
3025 ma = isl_multi_aff_set_aff(ma, i, aff);
3028 isl_basic_map_free(bmap);
3033 /* Create an isl_pw_multi_aff that is equivalent to
3034 * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain).
3035 * The given basic map is such that each output dimension is defined
3036 * in terms of the parameters and input dimensions using an equality.
3038 static __isl_give isl_pw_multi_aff *plain_pw_multi_aff_from_map(
3039 __isl_take isl_set *domain, __isl_take isl_basic_map *bmap)
3043 ma = extract_isl_multi_aff_from_basic_map(bmap);
3044 return isl_pw_multi_aff_alloc(domain, ma);
3047 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
3048 * This obivously only works if the input "map" is single-valued.
3049 * If so, we compute the lexicographic minimum of the image in the form
3050 * of an isl_pw_multi_aff. Since the image is unique, it is equal
3051 * to its lexicographic minimum.
3052 * If the input is not single-valued, we produce an error.
3054 * As a special case, we first check if all output dimensions are uniquely
3055 * defined in terms of the parameters and input dimensions over the entire
3056 * domain. If so, we extract the desired isl_pw_multi_aff directly
3057 * from the affine hull of "map" and its domain.
3059 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_map(__isl_take isl_map *map)
3063 isl_pw_multi_aff *pma;
3064 isl_basic_map *hull;
3069 hull = isl_map_affine_hull(isl_map_copy(map));
3070 sv = isl_basic_map_plain_is_single_valued(hull);
3072 return plain_pw_multi_aff_from_map(isl_map_domain(map), hull);
3073 isl_basic_map_free(hull);
3077 sv = isl_map_is_single_valued(map);
3081 isl_die(isl_map_get_ctx(map), isl_error_invalid,
3082 "map is not single-valued", goto error);
3083 map = isl_map_make_disjoint(map);
3087 pma = isl_pw_multi_aff_empty(isl_map_get_space(map));
3089 for (i = 0; i < map->n; ++i) {
3090 isl_pw_multi_aff *pma_i;
3091 isl_basic_map *bmap;
3092 bmap = isl_basic_map_copy(map->p[i]);
3093 pma_i = isl_basic_map_lexmin_pw_multi_aff(bmap);
3094 pma = isl_pw_multi_aff_add_disjoint(pma, pma_i);
3104 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_set(__isl_take isl_set *set)
3106 return isl_pw_multi_aff_from_map(set);
3109 /* Return the piecewise affine expression "set ? 1 : 0".
3111 __isl_give isl_pw_aff *isl_set_indicator_function(__isl_take isl_set *set)
3114 isl_space *space = isl_set_get_space(set);
3115 isl_local_space *ls = isl_local_space_from_space(space);
3116 isl_aff *zero = isl_aff_zero_on_domain(isl_local_space_copy(ls));
3117 isl_aff *one = isl_aff_zero_on_domain(ls);
3119 one = isl_aff_add_constant_si(one, 1);
3120 pa = isl_pw_aff_alloc(isl_set_copy(set), one);
3121 set = isl_set_complement(set);
3122 pa = isl_pw_aff_add_disjoint(pa, isl_pw_aff_alloc(set, zero));
3127 /* Plug in "subs" for dimension "type", "pos" of "aff".
3129 * Let i be the dimension to replace and let "subs" be of the form
3133 * and "aff" of the form
3139 * (a f + d g')/(m d)
3141 * where g' is the result of plugging in "subs" in each of the integer
3144 __isl_give isl_aff *isl_aff_substitute(__isl_take isl_aff *aff,
3145 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
3150 aff = isl_aff_cow(aff);
3152 return isl_aff_free(aff);
3154 ctx = isl_aff_get_ctx(aff);
3155 if (!isl_space_is_equal(aff->ls->dim, subs->ls->dim))
3156 isl_die(ctx, isl_error_invalid,
3157 "spaces don't match", return isl_aff_free(aff));
3158 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
3159 isl_die(ctx, isl_error_unsupported,
3160 "cannot handle divs yet", return isl_aff_free(aff));
3162 aff->ls = isl_local_space_substitute(aff->ls, type, pos, subs);
3164 return isl_aff_free(aff);
3166 aff->v = isl_vec_cow(aff->v);
3168 return isl_aff_free(aff);
3170 pos += isl_local_space_offset(aff->ls, type);
3173 isl_seq_substitute(aff->v->el, pos, subs->v->el,
3174 aff->v->size, subs->v->size, v);
3180 /* Plug in "subs" for dimension "type", "pos" in each of the affine
3181 * expressions in "maff".
3183 __isl_give isl_multi_aff *isl_multi_aff_substitute(
3184 __isl_take isl_multi_aff *maff, enum isl_dim_type type, unsigned pos,
3185 __isl_keep isl_aff *subs)
3189 maff = isl_multi_aff_cow(maff);
3191 return isl_multi_aff_free(maff);
3193 if (type == isl_dim_in)
3196 for (i = 0; i < maff->n; ++i) {
3197 maff->p[i] = isl_aff_substitute(maff->p[i], type, pos, subs);
3199 return isl_multi_aff_free(maff);
3205 /* Plug in "subs" for dimension "type", "pos" of "pma".
3207 * pma is of the form
3211 * while subs is of the form
3213 * v' = B_j(v) -> S_j
3215 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
3216 * has a contribution in the result, in particular
3218 * C_ij(S_j) -> M_i(S_j)
3220 * Note that plugging in S_j in C_ij may also result in an empty set
3221 * and this contribution should simply be discarded.
3223 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_substitute(
3224 __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos,
3225 __isl_keep isl_pw_aff *subs)
3228 isl_pw_multi_aff *res;
3231 return isl_pw_multi_aff_free(pma);
3233 n = pma->n * subs->n;
3234 res = isl_pw_multi_aff_alloc_size(isl_space_copy(pma->dim), n);
3236 for (i = 0; i < pma->n; ++i) {
3237 for (j = 0; j < subs->n; ++j) {
3239 isl_multi_aff *res_ij;
3240 common = isl_set_intersect(
3241 isl_set_copy(pma->p[i].set),
3242 isl_set_copy(subs->p[j].set));
3243 common = isl_set_substitute(common,
3244 type, pos, subs->p[j].aff);
3245 if (isl_set_plain_is_empty(common)) {
3246 isl_set_free(common);
3250 res_ij = isl_multi_aff_substitute(
3251 isl_multi_aff_copy(pma->p[i].maff),
3252 type, pos, subs->p[j].aff);
3254 res = isl_pw_multi_aff_add_piece(res, common, res_ij);
3258 isl_pw_multi_aff_free(pma);
3262 /* Extend the local space of "dst" to include the divs
3263 * in the local space of "src".
3265 __isl_give isl_aff *isl_aff_align_divs(__isl_take isl_aff *dst,
3266 __isl_keep isl_aff *src)
3274 return isl_aff_free(dst);
3276 ctx = isl_aff_get_ctx(src);
3277 if (!isl_space_is_equal(src->ls->dim, dst->ls->dim))
3278 isl_die(ctx, isl_error_invalid,
3279 "spaces don't match", goto error);
3281 if (src->ls->div->n_row == 0)
3284 exp1 = isl_alloc_array(ctx, int, src->ls->div->n_row);
3285 exp2 = isl_alloc_array(ctx, int, dst->ls->div->n_row);
3289 div = isl_merge_divs(src->ls->div, dst->ls->div, exp1, exp2);
3290 dst = isl_aff_expand_divs(dst, div, exp2);
3298 return isl_aff_free(dst);
3301 /* Adjust the local spaces of the affine expressions in "maff"
3302 * such that they all have the save divs.
3304 __isl_give isl_multi_aff *isl_multi_aff_align_divs(
3305 __isl_take isl_multi_aff *maff)
3313 maff = isl_multi_aff_cow(maff);
3317 for (i = 1; i < maff->n; ++i)
3318 maff->p[0] = isl_aff_align_divs(maff->p[0], maff->p[i]);
3319 for (i = 1; i < maff->n; ++i) {
3320 maff->p[i] = isl_aff_align_divs(maff->p[i], maff->p[0]);
3322 return isl_multi_aff_free(maff);
3328 __isl_give isl_aff *isl_aff_lift(__isl_take isl_aff *aff)
3330 aff = isl_aff_cow(aff);
3334 aff->ls = isl_local_space_lift(aff->ls);
3336 return isl_aff_free(aff);
3341 /* Lift "maff" to a space with extra dimensions such that the result
3342 * has no more existentially quantified variables.
3343 * If "ls" is not NULL, then *ls is assigned the local space that lies
3344 * at the basis of the lifting applied to "maff".
3346 __isl_give isl_multi_aff *isl_multi_aff_lift(__isl_take isl_multi_aff *maff,
3347 __isl_give isl_local_space **ls)
3361 isl_space *space = isl_multi_aff_get_domain_space(maff);
3362 *ls = isl_local_space_from_space(space);
3364 return isl_multi_aff_free(maff);
3369 maff = isl_multi_aff_cow(maff);
3370 maff = isl_multi_aff_align_divs(maff);
3374 n_div = isl_aff_dim(maff->p[0], isl_dim_div);
3375 space = isl_multi_aff_get_space(maff);
3376 space = isl_space_lift(isl_space_domain(space), n_div);
3377 space = isl_space_extend_domain_with_range(space,
3378 isl_multi_aff_get_space(maff));
3380 return isl_multi_aff_free(maff);
3381 isl_space_free(maff->space);
3382 maff->space = space;
3385 *ls = isl_aff_get_domain_local_space(maff->p[0]);
3387 return isl_multi_aff_free(maff);
3390 for (i = 0; i < maff->n; ++i) {
3391 maff->p[i] = isl_aff_lift(maff->p[i]);
3399 isl_local_space_free(*ls);
3400 return isl_multi_aff_free(maff);
3404 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
3406 __isl_give isl_pw_aff *isl_pw_multi_aff_get_pw_aff(
3407 __isl_keep isl_pw_multi_aff *pma, int pos)
3417 n_out = isl_pw_multi_aff_dim(pma, isl_dim_out);
3418 if (pos < 0 || pos >= n_out)
3419 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
3420 "index out of bounds", return NULL);
3422 space = isl_pw_multi_aff_get_space(pma);
3423 space = isl_space_drop_dims(space, isl_dim_out,
3424 pos + 1, n_out - pos - 1);
3425 space = isl_space_drop_dims(space, isl_dim_out, 0, pos);
3427 pa = isl_pw_aff_alloc_size(space, pma->n);
3428 for (i = 0; i < pma->n; ++i) {
3430 aff = isl_multi_aff_get_aff(pma->p[i].maff, pos);
3431 pa = isl_pw_aff_add_piece(pa, isl_set_copy(pma->p[i].set), aff);
3437 /* Return an isl_pw_multi_aff with the given "set" as domain and
3438 * an unnamed zero-dimensional range.
3440 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_domain(
3441 __isl_take isl_set *set)
3446 space = isl_set_get_space(set);
3447 space = isl_space_from_domain(space);
3448 ma = isl_multi_aff_zero(space);
3449 return isl_pw_multi_aff_alloc(set, ma);
3452 /* Add an isl_pw_multi_aff with the given "set" as domain and
3453 * an unnamed zero-dimensional range to *user.
3455 static int add_pw_multi_aff_from_domain(__isl_take isl_set *set, void *user)
3457 isl_union_pw_multi_aff **upma = user;
3458 isl_pw_multi_aff *pma;
3460 pma = isl_pw_multi_aff_from_domain(set);
3461 *upma = isl_union_pw_multi_aff_add_pw_multi_aff(*upma, pma);
3466 /* Return an isl_union_pw_multi_aff with the given "uset" as domain and
3467 * an unnamed zero-dimensional range.
3469 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_domain(
3470 __isl_take isl_union_set *uset)
3473 isl_union_pw_multi_aff *upma;
3478 space = isl_union_set_get_space(uset);
3479 upma = isl_union_pw_multi_aff_empty(space);
3481 if (isl_union_set_foreach_set(uset,
3482 &add_pw_multi_aff_from_domain, &upma) < 0)
3485 isl_union_set_free(uset);
3488 isl_union_set_free(uset);
3489 isl_union_pw_multi_aff_free(upma);
3493 /* Convert "pma" to an isl_map and add it to *umap.
3495 static int map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma, void *user)
3497 isl_union_map **umap = user;
3500 map = isl_map_from_pw_multi_aff(pma);
3501 *umap = isl_union_map_add_map(*umap, map);
3506 /* Construct a union map mapping the domain of the union
3507 * piecewise multi-affine expression to its range, with each dimension
3508 * in the range equated to the corresponding affine expression on its cell.
3510 __isl_give isl_union_map *isl_union_map_from_union_pw_multi_aff(
3511 __isl_take isl_union_pw_multi_aff *upma)
3514 isl_union_map *umap;
3519 space = isl_union_pw_multi_aff_get_space(upma);
3520 umap = isl_union_map_empty(space);
3522 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma,
3523 &map_from_pw_multi_aff, &umap) < 0)
3526 isl_union_pw_multi_aff_free(upma);
3529 isl_union_pw_multi_aff_free(upma);
3530 isl_union_map_free(umap);
3534 /* Local data for bin_entry and the callback "fn".
3536 struct isl_union_pw_multi_aff_bin_data {
3537 isl_union_pw_multi_aff *upma2;
3538 isl_union_pw_multi_aff *res;
3539 isl_pw_multi_aff *pma;
3540 int (*fn)(void **entry, void *user);
3543 /* Given an isl_pw_multi_aff from upma1, store it in data->pma
3544 * and call data->fn for each isl_pw_multi_aff in data->upma2.
3546 static int bin_entry(void **entry, void *user)
3548 struct isl_union_pw_multi_aff_bin_data *data = user;
3549 isl_pw_multi_aff *pma = *entry;
3552 if (isl_hash_table_foreach(data->upma2->dim->ctx, &data->upma2->table,
3553 data->fn, data) < 0)
3559 /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2".
3560 * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is
3561 * passed as user field) and the isl_pw_multi_aff from upma2 is available
3562 * as *entry. The callback should adjust data->res if desired.
3564 static __isl_give isl_union_pw_multi_aff *bin_op(
3565 __isl_take isl_union_pw_multi_aff *upma1,
3566 __isl_take isl_union_pw_multi_aff *upma2,
3567 int (*fn)(void **entry, void *user))
3570 struct isl_union_pw_multi_aff_bin_data data = { NULL, NULL, NULL, fn };
3572 space = isl_union_pw_multi_aff_get_space(upma2);
3573 upma1 = isl_union_pw_multi_aff_align_params(upma1, space);
3574 space = isl_union_pw_multi_aff_get_space(upma1);
3575 upma2 = isl_union_pw_multi_aff_align_params(upma2, space);
3577 if (!upma1 || !upma2)
3581 data.res = isl_union_pw_multi_aff_alloc(isl_space_copy(upma1->dim),
3583 if (isl_hash_table_foreach(upma1->dim->ctx, &upma1->table,
3584 &bin_entry, &data) < 0)
3587 isl_union_pw_multi_aff_free(upma1);
3588 isl_union_pw_multi_aff_free(upma2);
3591 isl_union_pw_multi_aff_free(upma1);
3592 isl_union_pw_multi_aff_free(upma2);
3593 isl_union_pw_multi_aff_free(data.res);
3597 /* Given two isl_multi_affs A -> B and C -> D,
3598 * construct an isl_multi_aff (A * C) -> (B, D).
3600 __isl_give isl_multi_aff *isl_multi_aff_flat_range_product(
3601 __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2)
3611 space = isl_space_range_product(isl_multi_aff_get_space(ma1),
3612 isl_multi_aff_get_space(ma2));
3613 space = isl_space_flatten_range(space);
3614 res = isl_multi_aff_alloc(space);
3616 n1 = isl_multi_aff_dim(ma1, isl_dim_out);
3617 n2 = isl_multi_aff_dim(ma2, isl_dim_out);
3619 for (i = 0; i < n1; ++i) {
3620 aff = isl_multi_aff_get_aff(ma1, i);
3621 res = isl_multi_aff_set_aff(res, i, aff);
3624 for (i = 0; i < n2; ++i) {
3625 aff = isl_multi_aff_get_aff(ma2, i);
3626 res = isl_multi_aff_set_aff(res, n1 + i, aff);
3629 isl_multi_aff_free(ma1);
3630 isl_multi_aff_free(ma2);
3633 isl_multi_aff_free(ma1);
3634 isl_multi_aff_free(ma2);
3638 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
3639 * construct an isl_pw_multi_aff (A * C) -> (B, D).
3641 static __isl_give isl_pw_multi_aff *pw_multi_aff_flat_range_product(
3642 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3646 space = isl_space_range_product(isl_pw_multi_aff_get_space(pma1),
3647 isl_pw_multi_aff_get_space(pma2));
3648 space = isl_space_flatten_range(space);
3649 return isl_pw_multi_aff_on_shared_domain_in(pma1, pma2, space,
3650 &isl_multi_aff_flat_range_product);
3653 /* Given two isl_pw_multi_affs A -> B and C -> D,
3654 * construct an isl_pw_multi_aff (A * C) -> (B, D).
3656 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_flat_range_product(
3657 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3659 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3660 &pw_multi_aff_flat_range_product);
3663 /* If data->pma and *entry have the same domain space, then compute
3664 * their flat range product and the result to data->res.
3666 static int flat_range_product_entry(void **entry, void *user)
3668 struct isl_union_pw_multi_aff_bin_data *data = user;
3669 isl_pw_multi_aff *pma2 = *entry;
3671 if (!isl_space_tuple_match(data->pma->dim, isl_dim_in,
3672 pma2->dim, isl_dim_in))
3675 pma2 = isl_pw_multi_aff_flat_range_product(
3676 isl_pw_multi_aff_copy(data->pma),
3677 isl_pw_multi_aff_copy(pma2));
3679 data->res = isl_union_pw_multi_aff_add_pw_multi_aff(data->res, pma2);
3684 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
3685 * construct an isl_union_pw_multi_aff (A * C) -> (B, D).
3687 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_flat_range_product(
3688 __isl_take isl_union_pw_multi_aff *upma1,
3689 __isl_take isl_union_pw_multi_aff *upma2)
3691 return bin_op(upma1, upma2, &flat_range_product_entry);
3694 /* Replace the affine expressions at position "pos" in "pma" by "pa".
3695 * The parameters are assumed to have been aligned.
3697 * The implementation essentially performs an isl_pw_*_on_shared_domain,
3698 * except that it works on two different isl_pw_* types.
3700 static __isl_give isl_pw_multi_aff *pw_multi_aff_set_pw_aff(
3701 __isl_take isl_pw_multi_aff *pma, unsigned pos,
3702 __isl_take isl_pw_aff *pa)
3705 isl_pw_multi_aff *res = NULL;
3710 if (!isl_space_tuple_match(pma->dim, isl_dim_in, pa->dim, isl_dim_in))
3711 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
3712 "domains don't match", goto error);
3713 if (pos >= isl_pw_multi_aff_dim(pma, isl_dim_out))
3714 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
3715 "index out of bounds", goto error);
3718 res = isl_pw_multi_aff_alloc_size(isl_pw_multi_aff_get_space(pma), n);
3720 for (i = 0; i < pma->n; ++i) {
3721 for (j = 0; j < pa->n; ++j) {
3723 isl_multi_aff *res_ij;
3726 common = isl_set_intersect(isl_set_copy(pma->p[i].set),
3727 isl_set_copy(pa->p[j].set));
3728 empty = isl_set_plain_is_empty(common);
3729 if (empty < 0 || empty) {
3730 isl_set_free(common);
3736 res_ij = isl_multi_aff_set_aff(
3737 isl_multi_aff_copy(pma->p[i].maff), pos,
3738 isl_aff_copy(pa->p[j].aff));
3739 res_ij = isl_multi_aff_gist(res_ij,
3740 isl_set_copy(common));
3742 res = isl_pw_multi_aff_add_piece(res, common, res_ij);
3746 isl_pw_multi_aff_free(pma);
3747 isl_pw_aff_free(pa);
3750 isl_pw_multi_aff_free(pma);
3751 isl_pw_aff_free(pa);
3752 return isl_pw_multi_aff_free(res);
3755 /* Replace the affine expressions at position "pos" in "pma" by "pa".
3757 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_set_pw_aff(
3758 __isl_take isl_pw_multi_aff *pma, unsigned pos,
3759 __isl_take isl_pw_aff *pa)
3763 if (isl_space_match(pma->dim, isl_dim_param, pa->dim, isl_dim_param))
3764 return pw_multi_aff_set_pw_aff(pma, pos, pa);
3765 if (!isl_space_has_named_params(pma->dim) ||
3766 !isl_space_has_named_params(pa->dim))
3767 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
3768 "unaligned unnamed parameters", goto error);
3769 pma = isl_pw_multi_aff_align_params(pma, isl_pw_aff_get_space(pa));
3770 pa = isl_pw_aff_align_params(pa, isl_pw_multi_aff_get_space(pma));
3771 return pw_multi_aff_set_pw_aff(pma, pos, pa);
3773 isl_pw_multi_aff_free(pma);
3774 isl_pw_aff_free(pa);