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 /* Return a piecewise affine expression defined on the specified domain
92 * that is equal to zero.
94 __isl_give isl_pw_aff *isl_pw_aff_zero_on_domain(__isl_take isl_local_space *ls)
96 return isl_pw_aff_from_aff(isl_aff_zero_on_domain(ls));
99 /* Return an affine expression that is equal to the specified dimension
102 __isl_give isl_aff *isl_aff_var_on_domain(__isl_take isl_local_space *ls,
103 enum isl_dim_type type, unsigned pos)
111 space = isl_local_space_get_space(ls);
114 if (isl_space_is_map(space))
115 isl_die(isl_space_get_ctx(space), isl_error_invalid,
116 "expecting (parameter) set space", goto error);
117 if (pos >= isl_local_space_dim(ls, type))
118 isl_die(isl_space_get_ctx(space), isl_error_invalid,
119 "position out of bounds", goto error);
121 isl_space_free(space);
122 aff = isl_aff_alloc(ls);
126 pos += isl_local_space_offset(aff->ls, type);
128 isl_int_set_si(aff->v->el[0], 1);
129 isl_seq_clr(aff->v->el + 1, aff->v->size - 1);
130 isl_int_set_si(aff->v->el[1 + pos], 1);
134 isl_local_space_free(ls);
135 isl_space_free(space);
139 /* Return a piecewise affine expression that is equal to
140 * the specified dimension in "ls".
142 __isl_give isl_pw_aff *isl_pw_aff_var_on_domain(__isl_take isl_local_space *ls,
143 enum isl_dim_type type, unsigned pos)
145 return isl_pw_aff_from_aff(isl_aff_var_on_domain(ls, type, pos));
148 __isl_give isl_aff *isl_aff_copy(__isl_keep isl_aff *aff)
157 __isl_give isl_aff *isl_aff_dup(__isl_keep isl_aff *aff)
162 return isl_aff_alloc_vec(isl_local_space_copy(aff->ls),
163 isl_vec_copy(aff->v));
166 __isl_give isl_aff *isl_aff_cow(__isl_take isl_aff *aff)
174 return isl_aff_dup(aff);
177 void *isl_aff_free(__isl_take isl_aff *aff)
185 isl_local_space_free(aff->ls);
186 isl_vec_free(aff->v);
193 isl_ctx *isl_aff_get_ctx(__isl_keep isl_aff *aff)
195 return aff ? isl_local_space_get_ctx(aff->ls) : NULL;
198 /* Externally, an isl_aff has a map space, but internally, the
199 * ls field corresponds to the domain of that space.
201 int isl_aff_dim(__isl_keep isl_aff *aff, enum isl_dim_type type)
205 if (type == isl_dim_out)
207 if (type == isl_dim_in)
209 return isl_local_space_dim(aff->ls, type);
212 __isl_give isl_space *isl_aff_get_domain_space(__isl_keep isl_aff *aff)
214 return aff ? isl_local_space_get_space(aff->ls) : NULL;
217 __isl_give isl_space *isl_aff_get_space(__isl_keep isl_aff *aff)
222 space = isl_local_space_get_space(aff->ls);
223 space = isl_space_from_domain(space);
224 space = isl_space_add_dims(space, isl_dim_out, 1);
228 __isl_give isl_local_space *isl_aff_get_domain_local_space(
229 __isl_keep isl_aff *aff)
231 return aff ? isl_local_space_copy(aff->ls) : NULL;
234 __isl_give isl_local_space *isl_aff_get_local_space(__isl_keep isl_aff *aff)
239 ls = isl_local_space_copy(aff->ls);
240 ls = isl_local_space_from_domain(ls);
241 ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
245 /* Externally, an isl_aff has a map space, but internally, the
246 * ls field corresponds to the domain of that space.
248 const char *isl_aff_get_dim_name(__isl_keep isl_aff *aff,
249 enum isl_dim_type type, unsigned pos)
253 if (type == isl_dim_out)
255 if (type == isl_dim_in)
257 return isl_local_space_get_dim_name(aff->ls, type, pos);
260 __isl_give isl_aff *isl_aff_reset_domain_space(__isl_take isl_aff *aff,
261 __isl_take isl_space *dim)
263 aff = isl_aff_cow(aff);
267 aff->ls = isl_local_space_reset_space(aff->ls, dim);
269 return isl_aff_free(aff);
278 /* Reset the space of "aff". This function is called from isl_pw_templ.c
279 * and doesn't know if the space of an element object is represented
280 * directly or through its domain. It therefore passes along both.
282 __isl_give isl_aff *isl_aff_reset_space_and_domain(__isl_take isl_aff *aff,
283 __isl_take isl_space *space, __isl_take isl_space *domain)
285 isl_space_free(space);
286 return isl_aff_reset_domain_space(aff, domain);
289 /* Reorder the coefficients of the affine expression based
290 * on the given reodering.
291 * The reordering r is assumed to have been extended with the local
294 static __isl_give isl_vec *vec_reorder(__isl_take isl_vec *vec,
295 __isl_take isl_reordering *r, int n_div)
303 res = isl_vec_alloc(vec->ctx,
304 2 + isl_space_dim(r->dim, isl_dim_all) + n_div);
305 isl_seq_cpy(res->el, vec->el, 2);
306 isl_seq_clr(res->el + 2, res->size - 2);
307 for (i = 0; i < r->len; ++i)
308 isl_int_set(res->el[2 + r->pos[i]], vec->el[2 + i]);
310 isl_reordering_free(r);
315 isl_reordering_free(r);
319 /* Reorder the dimensions of the domain of "aff" according
320 * to the given reordering.
322 __isl_give isl_aff *isl_aff_realign_domain(__isl_take isl_aff *aff,
323 __isl_take isl_reordering *r)
325 aff = isl_aff_cow(aff);
329 r = isl_reordering_extend(r, aff->ls->div->n_row);
330 aff->v = vec_reorder(aff->v, isl_reordering_copy(r),
331 aff->ls->div->n_row);
332 aff->ls = isl_local_space_realign(aff->ls, r);
334 if (!aff->v || !aff->ls)
335 return isl_aff_free(aff);
340 isl_reordering_free(r);
344 __isl_give isl_aff *isl_aff_align_params(__isl_take isl_aff *aff,
345 __isl_take isl_space *model)
350 if (!isl_space_match(aff->ls->dim, isl_dim_param,
351 model, isl_dim_param)) {
354 model = isl_space_drop_dims(model, isl_dim_in,
355 0, isl_space_dim(model, isl_dim_in));
356 model = isl_space_drop_dims(model, isl_dim_out,
357 0, isl_space_dim(model, isl_dim_out));
358 exp = isl_parameter_alignment_reordering(aff->ls->dim, model);
359 exp = isl_reordering_extend_space(exp,
360 isl_aff_get_domain_space(aff));
361 aff = isl_aff_realign_domain(aff, exp);
364 isl_space_free(model);
367 isl_space_free(model);
372 int isl_aff_plain_is_zero(__isl_keep isl_aff *aff)
377 return isl_seq_first_non_zero(aff->v->el + 1, aff->v->size - 1) < 0;
380 int isl_aff_plain_is_equal(__isl_keep isl_aff *aff1, __isl_keep isl_aff *aff2)
387 equal = isl_local_space_is_equal(aff1->ls, aff2->ls);
388 if (equal < 0 || !equal)
391 return isl_vec_is_equal(aff1->v, aff2->v);
394 int isl_aff_get_denominator(__isl_keep isl_aff *aff, isl_int *v)
398 isl_int_set(*v, aff->v->el[0]);
402 int isl_aff_get_constant(__isl_keep isl_aff *aff, isl_int *v)
406 isl_int_set(*v, aff->v->el[1]);
410 int isl_aff_get_coefficient(__isl_keep isl_aff *aff,
411 enum isl_dim_type type, int pos, isl_int *v)
416 if (type == isl_dim_out)
417 isl_die(aff->v->ctx, isl_error_invalid,
418 "output/set dimension does not have a coefficient",
420 if (type == isl_dim_in)
423 if (pos >= isl_local_space_dim(aff->ls, type))
424 isl_die(aff->v->ctx, isl_error_invalid,
425 "position out of bounds", return -1);
427 pos += isl_local_space_offset(aff->ls, type);
428 isl_int_set(*v, aff->v->el[1 + pos]);
433 __isl_give isl_aff *isl_aff_set_denominator(__isl_take isl_aff *aff, isl_int v)
435 aff = isl_aff_cow(aff);
439 aff->v = isl_vec_cow(aff->v);
441 return isl_aff_free(aff);
443 isl_int_set(aff->v->el[0], v);
448 __isl_give isl_aff *isl_aff_set_constant(__isl_take isl_aff *aff, isl_int v)
450 aff = isl_aff_cow(aff);
454 aff->v = isl_vec_cow(aff->v);
456 return isl_aff_free(aff);
458 isl_int_set(aff->v->el[1], v);
463 __isl_give isl_aff *isl_aff_add_constant(__isl_take isl_aff *aff, isl_int v)
465 if (isl_int_is_zero(v))
468 aff = isl_aff_cow(aff);
472 aff->v = isl_vec_cow(aff->v);
474 return isl_aff_free(aff);
476 isl_int_addmul(aff->v->el[1], aff->v->el[0], v);
481 __isl_give isl_aff *isl_aff_add_constant_si(__isl_take isl_aff *aff, int v)
486 isl_int_set_si(t, v);
487 aff = isl_aff_add_constant(aff, t);
493 /* Add "v" to the numerator of the constant term of "aff".
495 __isl_give isl_aff *isl_aff_add_constant_num(__isl_take isl_aff *aff, isl_int v)
497 if (isl_int_is_zero(v))
500 aff = isl_aff_cow(aff);
504 aff->v = isl_vec_cow(aff->v);
506 return isl_aff_free(aff);
508 isl_int_add(aff->v->el[1], aff->v->el[1], v);
513 /* Add "v" to the numerator of the constant term of "aff".
515 __isl_give isl_aff *isl_aff_add_constant_num_si(__isl_take isl_aff *aff, int v)
523 isl_int_set_si(t, v);
524 aff = isl_aff_add_constant_num(aff, t);
530 __isl_give isl_aff *isl_aff_set_constant_si(__isl_take isl_aff *aff, int v)
532 aff = isl_aff_cow(aff);
536 aff->v = isl_vec_cow(aff->v);
538 return isl_aff_free(aff);
540 isl_int_set_si(aff->v->el[1], v);
545 __isl_give isl_aff *isl_aff_set_coefficient(__isl_take isl_aff *aff,
546 enum isl_dim_type type, int pos, isl_int v)
551 if (type == isl_dim_out)
552 isl_die(aff->v->ctx, isl_error_invalid,
553 "output/set dimension does not have a coefficient",
554 return isl_aff_free(aff));
555 if (type == isl_dim_in)
558 if (pos >= isl_local_space_dim(aff->ls, type))
559 isl_die(aff->v->ctx, isl_error_invalid,
560 "position out of bounds", return isl_aff_free(aff));
562 aff = isl_aff_cow(aff);
566 aff->v = isl_vec_cow(aff->v);
568 return isl_aff_free(aff);
570 pos += isl_local_space_offset(aff->ls, type);
571 isl_int_set(aff->v->el[1 + pos], v);
576 __isl_give isl_aff *isl_aff_set_coefficient_si(__isl_take isl_aff *aff,
577 enum isl_dim_type type, int pos, int v)
582 if (type == isl_dim_out)
583 isl_die(aff->v->ctx, isl_error_invalid,
584 "output/set dimension does not have a coefficient",
585 return isl_aff_free(aff));
586 if (type == isl_dim_in)
589 if (pos >= isl_local_space_dim(aff->ls, type))
590 isl_die(aff->v->ctx, isl_error_invalid,
591 "position out of bounds", return isl_aff_free(aff));
593 aff = isl_aff_cow(aff);
597 aff->v = isl_vec_cow(aff->v);
599 return isl_aff_free(aff);
601 pos += isl_local_space_offset(aff->ls, type);
602 isl_int_set_si(aff->v->el[1 + pos], v);
607 __isl_give isl_aff *isl_aff_add_coefficient(__isl_take isl_aff *aff,
608 enum isl_dim_type type, int pos, isl_int v)
613 if (type == isl_dim_out)
614 isl_die(aff->v->ctx, isl_error_invalid,
615 "output/set dimension does not have a coefficient",
616 return isl_aff_free(aff));
617 if (type == isl_dim_in)
620 if (pos >= isl_local_space_dim(aff->ls, type))
621 isl_die(aff->v->ctx, isl_error_invalid,
622 "position out of bounds", return isl_aff_free(aff));
624 aff = isl_aff_cow(aff);
628 aff->v = isl_vec_cow(aff->v);
630 return isl_aff_free(aff);
632 pos += isl_local_space_offset(aff->ls, type);
633 isl_int_addmul(aff->v->el[1 + pos], aff->v->el[0], v);
638 __isl_give isl_aff *isl_aff_add_coefficient_si(__isl_take isl_aff *aff,
639 enum isl_dim_type type, int pos, int v)
644 isl_int_set_si(t, v);
645 aff = isl_aff_add_coefficient(aff, type, pos, t);
651 __isl_give isl_aff *isl_aff_get_div(__isl_keep isl_aff *aff, int pos)
656 return isl_local_space_get_div(aff->ls, pos);
659 __isl_give isl_aff *isl_aff_neg(__isl_take isl_aff *aff)
661 aff = isl_aff_cow(aff);
664 aff->v = isl_vec_cow(aff->v);
666 return isl_aff_free(aff);
668 isl_seq_neg(aff->v->el + 1, aff->v->el + 1, aff->v->size - 1);
673 /* Remove divs from the local space that do not appear in the affine
675 * We currently only remove divs at the end.
676 * Some intermediate divs may also not appear directly in the affine
677 * expression, but we would also need to check that no other divs are
678 * defined in terms of them.
680 __isl_give isl_aff *isl_aff_remove_unused_divs( __isl_take isl_aff *aff)
689 n = isl_local_space_dim(aff->ls, isl_dim_div);
690 off = isl_local_space_offset(aff->ls, isl_dim_div);
692 pos = isl_seq_last_non_zero(aff->v->el + 1 + off, n) + 1;
696 aff = isl_aff_cow(aff);
700 aff->ls = isl_local_space_drop_dims(aff->ls, isl_dim_div, pos, n - pos);
701 aff->v = isl_vec_drop_els(aff->v, 1 + off + pos, n - pos);
702 if (!aff->ls || !aff->v)
703 return isl_aff_free(aff);
708 /* Given two affine expressions "p" of length p_len (including the
709 * denominator and the constant term) and "subs" of length subs_len,
710 * plug in "subs" for the variable at position "pos".
711 * The variables of "subs" and "p" are assumed to match up to subs_len,
712 * but "p" may have additional variables.
713 * "v" is an initialized isl_int that can be used internally.
715 * In particular, if "p" represents the expression
719 * with i the variable at position "pos" and "subs" represents the expression
723 * then the result represents the expression
728 void isl_seq_substitute(isl_int *p, int pos, isl_int *subs,
729 int p_len, int subs_len, isl_int v)
731 isl_int_set(v, p[1 + pos]);
732 isl_int_set_si(p[1 + pos], 0);
733 isl_seq_combine(p + 1, subs[0], p + 1, v, subs + 1, subs_len - 1);
734 isl_seq_scale(p + subs_len, p + subs_len, subs[0], p_len - subs_len);
735 isl_int_mul(p[0], p[0], subs[0]);
738 /* Look for any divs in the aff->ls with a denominator equal to one
739 * and plug them into the affine expression and any subsequent divs
740 * that may reference the div.
742 static __isl_give isl_aff *plug_in_integral_divs(__isl_take isl_aff *aff)
754 n = isl_local_space_dim(aff->ls, isl_dim_div);
756 for (i = 0; i < n; ++i) {
757 if (!isl_int_is_one(aff->ls->div->row[i][0]))
759 ls = isl_local_space_copy(aff->ls);
760 ls = isl_local_space_substitute_seq(ls, isl_dim_div, i,
761 aff->ls->div->row[i], len, i + 1);
762 vec = isl_vec_copy(aff->v);
763 vec = isl_vec_cow(vec);
769 pos = isl_local_space_offset(aff->ls, isl_dim_div) + i;
770 isl_seq_substitute(vec->el, pos, aff->ls->div->row[i],
775 isl_vec_free(aff->v);
777 isl_local_space_free(aff->ls);
784 isl_local_space_free(ls);
785 return isl_aff_free(aff);
788 /* Swap divs "a" and "b" in "aff", which is assumed to be non-NULL.
790 * Even though this function is only called on isl_affs with a single
791 * reference, we are careful to only change aff->v and aff->ls together.
793 static __isl_give isl_aff *swap_div(__isl_take isl_aff *aff, int a, int b)
795 unsigned off = isl_local_space_offset(aff->ls, isl_dim_div);
799 ls = isl_local_space_copy(aff->ls);
800 ls = isl_local_space_swap_div(ls, a, b);
801 v = isl_vec_copy(aff->v);
806 isl_int_swap(v->el[1 + off + a], v->el[1 + off + b]);
807 isl_vec_free(aff->v);
809 isl_local_space_free(aff->ls);
815 isl_local_space_free(ls);
816 return isl_aff_free(aff);
819 /* Merge divs "a" and "b" in "aff", which is assumed to be non-NULL.
821 * We currently do not actually remove div "b", but simply add its
822 * coefficient to that of "a" and then zero it out.
824 static __isl_give isl_aff *merge_divs(__isl_take isl_aff *aff, int a, int b)
826 unsigned off = isl_local_space_offset(aff->ls, isl_dim_div);
828 if (isl_int_is_zero(aff->v->el[1 + off + b]))
831 aff->v = isl_vec_cow(aff->v);
833 return isl_aff_free(aff);
835 isl_int_add(aff->v->el[1 + off + a],
836 aff->v->el[1 + off + a], aff->v->el[1 + off + b]);
837 isl_int_set_si(aff->v->el[1 + off + b], 0);
842 /* Sort the divs in the local space of "aff" according to
843 * the comparison function "cmp_row" in isl_local_space.c,
844 * combining the coefficients of identical divs.
846 * Reordering divs does not change the semantics of "aff",
847 * so there is no need to call isl_aff_cow.
848 * Moreover, this function is currently only called on isl_affs
849 * with a single reference.
851 static __isl_give isl_aff *sort_divs(__isl_take isl_aff *aff)
859 off = isl_local_space_offset(aff->ls, isl_dim_div);
860 n = isl_aff_dim(aff, isl_dim_div);
861 for (i = 1; i < n; ++i) {
862 for (j = i - 1; j >= 0; --j) {
863 int cmp = isl_mat_cmp_div(aff->ls->div, j, j + 1);
867 aff = merge_divs(aff, j, j + 1);
869 aff = swap_div(aff, j, j + 1);
878 /* Normalize the representation of "aff".
880 * This function should only be called of "new" isl_affs, i.e.,
881 * with only a single reference. We therefore do not need to
882 * worry about affecting other instances.
884 __isl_give isl_aff *isl_aff_normalize(__isl_take isl_aff *aff)
888 aff->v = isl_vec_normalize(aff->v);
890 return isl_aff_free(aff);
891 aff = plug_in_integral_divs(aff);
892 aff = sort_divs(aff);
893 aff = isl_aff_remove_unused_divs(aff);
897 /* Given f, return floor(f).
898 * If f is an integer expression, then just return f.
899 * If f is a constant, then return the constant floor(f).
900 * Otherwise, if f = g/m, write g = q m + r,
901 * create a new div d = [r/m] and return the expression q + d.
902 * The coefficients in r are taken to lie between -m/2 and m/2.
904 __isl_give isl_aff *isl_aff_floor(__isl_take isl_aff *aff)
914 if (isl_int_is_one(aff->v->el[0]))
917 aff = isl_aff_cow(aff);
921 aff->v = isl_vec_cow(aff->v);
923 return isl_aff_free(aff);
925 if (isl_aff_is_cst(aff)) {
926 isl_int_fdiv_q(aff->v->el[1], aff->v->el[1], aff->v->el[0]);
927 isl_int_set_si(aff->v->el[0], 1);
931 div = isl_vec_copy(aff->v);
932 div = isl_vec_cow(div);
934 return isl_aff_free(aff);
936 ctx = isl_aff_get_ctx(aff);
937 isl_int_fdiv_q(aff->v->el[0], aff->v->el[0], ctx->two);
938 for (i = 1; i < aff->v->size; ++i) {
939 isl_int_fdiv_r(div->el[i], div->el[i], div->el[0]);
940 isl_int_fdiv_q(aff->v->el[i], aff->v->el[i], div->el[0]);
941 if (isl_int_gt(div->el[i], aff->v->el[0])) {
942 isl_int_sub(div->el[i], div->el[i], div->el[0]);
943 isl_int_add_ui(aff->v->el[i], aff->v->el[i], 1);
947 aff->ls = isl_local_space_add_div(aff->ls, div);
949 return isl_aff_free(aff);
952 aff->v = isl_vec_extend(aff->v, size + 1);
954 return isl_aff_free(aff);
955 isl_int_set_si(aff->v->el[0], 1);
956 isl_int_set_si(aff->v->el[size], 1);
963 * aff mod m = aff - m * floor(aff/m)
965 __isl_give isl_aff *isl_aff_mod(__isl_take isl_aff *aff, isl_int m)
969 res = isl_aff_copy(aff);
970 aff = isl_aff_scale_down(aff, m);
971 aff = isl_aff_floor(aff);
972 aff = isl_aff_scale(aff, m);
973 res = isl_aff_sub(res, aff);
980 * pwaff mod m = pwaff - m * floor(pwaff/m)
982 __isl_give isl_pw_aff *isl_pw_aff_mod(__isl_take isl_pw_aff *pwaff, isl_int m)
986 res = isl_pw_aff_copy(pwaff);
987 pwaff = isl_pw_aff_scale_down(pwaff, m);
988 pwaff = isl_pw_aff_floor(pwaff);
989 pwaff = isl_pw_aff_scale(pwaff, m);
990 res = isl_pw_aff_sub(res, pwaff);
995 /* Given f, return ceil(f).
996 * If f is an integer expression, then just return f.
997 * Otherwise, create a new div d = [-f] and return the expression -d.
999 __isl_give isl_aff *isl_aff_ceil(__isl_take isl_aff *aff)
1004 if (isl_int_is_one(aff->v->el[0]))
1007 aff = isl_aff_neg(aff);
1008 aff = isl_aff_floor(aff);
1009 aff = isl_aff_neg(aff);
1014 /* Apply the expansion computed by isl_merge_divs.
1015 * The expansion itself is given by "exp" while the resulting
1016 * list of divs is given by "div".
1018 __isl_give isl_aff *isl_aff_expand_divs( __isl_take isl_aff *aff,
1019 __isl_take isl_mat *div, int *exp)
1026 aff = isl_aff_cow(aff);
1030 old_n_div = isl_local_space_dim(aff->ls, isl_dim_div);
1031 new_n_div = isl_mat_rows(div);
1032 if (new_n_div < old_n_div)
1033 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
1034 "not an expansion", goto error);
1036 aff->v = isl_vec_extend(aff->v, aff->v->size + new_n_div - old_n_div);
1040 offset = 1 + isl_local_space_offset(aff->ls, isl_dim_div);
1042 for (i = new_n_div - 1; i >= 0; --i) {
1043 if (j >= 0 && exp[j] == i) {
1045 isl_int_swap(aff->v->el[offset + i],
1046 aff->v->el[offset + j]);
1049 isl_int_set_si(aff->v->el[offset + i], 0);
1052 aff->ls = isl_local_space_replace_divs(aff->ls, isl_mat_copy(div));
1063 /* Add two affine expressions that live in the same local space.
1065 static __isl_give isl_aff *add_expanded(__isl_take isl_aff *aff1,
1066 __isl_take isl_aff *aff2)
1070 aff1 = isl_aff_cow(aff1);
1074 aff1->v = isl_vec_cow(aff1->v);
1080 isl_int_gcd(gcd, aff1->v->el[0], aff2->v->el[0]);
1081 isl_int_divexact(f, aff2->v->el[0], gcd);
1082 isl_seq_scale(aff1->v->el + 1, aff1->v->el + 1, f, aff1->v->size - 1);
1083 isl_int_divexact(f, aff1->v->el[0], gcd);
1084 isl_seq_addmul(aff1->v->el + 1, f, aff2->v->el + 1, aff1->v->size - 1);
1085 isl_int_divexact(f, aff2->v->el[0], gcd);
1086 isl_int_mul(aff1->v->el[0], aff1->v->el[0], f);
1098 __isl_give isl_aff *isl_aff_add(__isl_take isl_aff *aff1,
1099 __isl_take isl_aff *aff2)
1109 ctx = isl_aff_get_ctx(aff1);
1110 if (!isl_space_is_equal(aff1->ls->dim, aff2->ls->dim))
1111 isl_die(ctx, isl_error_invalid,
1112 "spaces don't match", goto error);
1114 if (aff1->ls->div->n_row == 0 && aff2->ls->div->n_row == 0)
1115 return add_expanded(aff1, aff2);
1117 exp1 = isl_alloc_array(ctx, int, aff1->ls->div->n_row);
1118 exp2 = isl_alloc_array(ctx, int, aff2->ls->div->n_row);
1122 div = isl_merge_divs(aff1->ls->div, aff2->ls->div, exp1, exp2);
1123 aff1 = isl_aff_expand_divs(aff1, isl_mat_copy(div), exp1);
1124 aff2 = isl_aff_expand_divs(aff2, div, exp2);
1128 return add_expanded(aff1, aff2);
1137 __isl_give isl_aff *isl_aff_sub(__isl_take isl_aff *aff1,
1138 __isl_take isl_aff *aff2)
1140 return isl_aff_add(aff1, isl_aff_neg(aff2));
1143 __isl_give isl_aff *isl_aff_scale(__isl_take isl_aff *aff, isl_int f)
1147 if (isl_int_is_one(f))
1150 aff = isl_aff_cow(aff);
1153 aff->v = isl_vec_cow(aff->v);
1155 return isl_aff_free(aff);
1158 isl_int_gcd(gcd, aff->v->el[0], f);
1159 isl_int_divexact(aff->v->el[0], aff->v->el[0], gcd);
1160 isl_int_divexact(gcd, f, gcd);
1161 isl_seq_scale(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
1167 __isl_give isl_aff *isl_aff_scale_down(__isl_take isl_aff *aff, isl_int f)
1171 if (isl_int_is_one(f))
1174 aff = isl_aff_cow(aff);
1178 if (isl_int_is_zero(f))
1179 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
1180 "cannot scale down by zero", return isl_aff_free(aff));
1182 aff->v = isl_vec_cow(aff->v);
1184 return isl_aff_free(aff);
1187 isl_seq_gcd(aff->v->el + 1, aff->v->size - 1, &gcd);
1188 isl_int_gcd(gcd, gcd, f);
1189 isl_seq_scale_down(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
1190 isl_int_divexact(gcd, f, gcd);
1191 isl_int_mul(aff->v->el[0], aff->v->el[0], gcd);
1197 __isl_give isl_aff *isl_aff_scale_down_ui(__isl_take isl_aff *aff, unsigned f)
1205 isl_int_set_ui(v, f);
1206 aff = isl_aff_scale_down(aff, v);
1212 __isl_give isl_aff *isl_aff_set_dim_name(__isl_take isl_aff *aff,
1213 enum isl_dim_type type, unsigned pos, const char *s)
1215 aff = isl_aff_cow(aff);
1218 if (type == isl_dim_out)
1219 isl_die(aff->v->ctx, isl_error_invalid,
1220 "cannot set name of output/set dimension",
1221 return isl_aff_free(aff));
1222 if (type == isl_dim_in)
1224 aff->ls = isl_local_space_set_dim_name(aff->ls, type, pos, s);
1226 return isl_aff_free(aff);
1231 __isl_give isl_aff *isl_aff_set_dim_id(__isl_take isl_aff *aff,
1232 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
1234 aff = isl_aff_cow(aff);
1236 return isl_id_free(id);
1237 if (type == isl_dim_out)
1238 isl_die(aff->v->ctx, isl_error_invalid,
1239 "cannot set name of output/set dimension",
1241 if (type == isl_dim_in)
1243 aff->ls = isl_local_space_set_dim_id(aff->ls, type, pos, id);
1245 return isl_aff_free(aff);
1254 /* Exploit the equalities in "eq" to simplify the affine expression
1255 * and the expressions of the integer divisions in the local space.
1256 * The integer divisions in this local space are assumed to appear
1257 * as regular dimensions in "eq".
1259 static __isl_give isl_aff *isl_aff_substitute_equalities_lifted(
1260 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
1268 if (eq->n_eq == 0) {
1269 isl_basic_set_free(eq);
1273 aff = isl_aff_cow(aff);
1277 aff->ls = isl_local_space_substitute_equalities(aff->ls,
1278 isl_basic_set_copy(eq));
1282 total = 1 + isl_space_dim(eq->dim, isl_dim_all);
1284 for (i = 0; i < eq->n_eq; ++i) {
1285 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
1286 if (j < 0 || j == 0 || j >= total)
1289 isl_seq_elim(aff->v->el + 1, eq->eq[i], j, total,
1293 isl_basic_set_free(eq);
1294 aff = isl_aff_normalize(aff);
1297 isl_basic_set_free(eq);
1302 /* Exploit the equalities in "eq" to simplify the affine expression
1303 * and the expressions of the integer divisions in the local space.
1305 static __isl_give isl_aff *isl_aff_substitute_equalities(
1306 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
1312 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
1314 eq = isl_basic_set_add(eq, isl_dim_set, n_div);
1315 return isl_aff_substitute_equalities_lifted(aff, eq);
1317 isl_basic_set_free(eq);
1322 /* Look for equalities among the variables shared by context and aff
1323 * and the integer divisions of aff, if any.
1324 * The equalities are then used to eliminate coefficients and/or integer
1325 * divisions from aff.
1327 __isl_give isl_aff *isl_aff_gist(__isl_take isl_aff *aff,
1328 __isl_take isl_set *context)
1330 isl_basic_set *hull;
1335 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
1337 isl_basic_set *bset;
1338 isl_local_space *ls;
1339 context = isl_set_add_dims(context, isl_dim_set, n_div);
1340 ls = isl_aff_get_domain_local_space(aff);
1341 bset = isl_basic_set_from_local_space(ls);
1342 bset = isl_basic_set_lift(bset);
1343 bset = isl_basic_set_flatten(bset);
1344 context = isl_set_intersect(context,
1345 isl_set_from_basic_set(bset));
1348 hull = isl_set_affine_hull(context);
1349 return isl_aff_substitute_equalities_lifted(aff, hull);
1352 isl_set_free(context);
1356 __isl_give isl_aff *isl_aff_gist_params(__isl_take isl_aff *aff,
1357 __isl_take isl_set *context)
1359 isl_set *dom_context = isl_set_universe(isl_aff_get_domain_space(aff));
1360 dom_context = isl_set_intersect_params(dom_context, context);
1361 return isl_aff_gist(aff, dom_context);
1364 /* Return a basic set containing those elements in the space
1365 * of aff where it is non-negative.
1367 __isl_give isl_basic_set *isl_aff_nonneg_basic_set(__isl_take isl_aff *aff)
1369 isl_constraint *ineq;
1370 isl_basic_set *bset;
1372 ineq = isl_inequality_from_aff(aff);
1374 bset = isl_basic_set_from_constraint(ineq);
1375 bset = isl_basic_set_simplify(bset);
1379 /* Return a basic set containing those elements in the domain space
1380 * of aff where it is negative.
1382 __isl_give isl_basic_set *isl_aff_neg_basic_set(__isl_take isl_aff *aff)
1384 aff = isl_aff_neg(aff);
1385 aff = isl_aff_add_constant_num_si(aff, -1);
1386 return isl_aff_nonneg_basic_set(aff);
1389 /* Return a basic set containing those elements in the space
1390 * of aff where it is zero.
1391 * If "rational" is set, then return a rational basic set.
1393 static __isl_give isl_basic_set *aff_zero_basic_set(__isl_take isl_aff *aff,
1396 isl_constraint *ineq;
1397 isl_basic_set *bset;
1399 ineq = isl_equality_from_aff(aff);
1401 bset = isl_basic_set_from_constraint(ineq);
1403 bset = isl_basic_set_set_rational(bset);
1404 bset = isl_basic_set_simplify(bset);
1408 /* Return a basic set containing those elements in the space
1409 * of aff where it is zero.
1411 __isl_give isl_basic_set *isl_aff_zero_basic_set(__isl_take isl_aff *aff)
1413 return aff_zero_basic_set(aff, 0);
1416 /* Return a basic set containing those elements in the shared space
1417 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
1419 __isl_give isl_basic_set *isl_aff_ge_basic_set(__isl_take isl_aff *aff1,
1420 __isl_take isl_aff *aff2)
1422 aff1 = isl_aff_sub(aff1, aff2);
1424 return isl_aff_nonneg_basic_set(aff1);
1427 /* Return a basic set containing those elements in the shared space
1428 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
1430 __isl_give isl_basic_set *isl_aff_le_basic_set(__isl_take isl_aff *aff1,
1431 __isl_take isl_aff *aff2)
1433 return isl_aff_ge_basic_set(aff2, aff1);
1436 __isl_give isl_aff *isl_aff_add_on_domain(__isl_keep isl_set *dom,
1437 __isl_take isl_aff *aff1, __isl_take isl_aff *aff2)
1439 aff1 = isl_aff_add(aff1, aff2);
1440 aff1 = isl_aff_gist(aff1, isl_set_copy(dom));
1444 int isl_aff_is_empty(__isl_keep isl_aff *aff)
1452 /* Check whether the given affine expression has non-zero coefficient
1453 * for any dimension in the given range or if any of these dimensions
1454 * appear with non-zero coefficients in any of the integer divisions
1455 * involved in the affine expression.
1457 int isl_aff_involves_dims(__isl_keep isl_aff *aff,
1458 enum isl_dim_type type, unsigned first, unsigned n)
1470 ctx = isl_aff_get_ctx(aff);
1471 if (first + n > isl_aff_dim(aff, type))
1472 isl_die(ctx, isl_error_invalid,
1473 "range out of bounds", return -1);
1475 active = isl_local_space_get_active(aff->ls, aff->v->el + 2);
1479 first += isl_local_space_offset(aff->ls, type) - 1;
1480 for (i = 0; i < n; ++i)
1481 if (active[first + i]) {
1494 __isl_give isl_aff *isl_aff_drop_dims(__isl_take isl_aff *aff,
1495 enum isl_dim_type type, unsigned first, unsigned n)
1501 if (type == isl_dim_out)
1502 isl_die(aff->v->ctx, isl_error_invalid,
1503 "cannot drop output/set dimension",
1504 return isl_aff_free(aff));
1505 if (type == isl_dim_in)
1507 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
1510 ctx = isl_aff_get_ctx(aff);
1511 if (first + n > isl_local_space_dim(aff->ls, type))
1512 isl_die(ctx, isl_error_invalid, "range out of bounds",
1513 return isl_aff_free(aff));
1515 aff = isl_aff_cow(aff);
1519 aff->ls = isl_local_space_drop_dims(aff->ls, type, first, n);
1521 return isl_aff_free(aff);
1523 first += 1 + isl_local_space_offset(aff->ls, type);
1524 aff->v = isl_vec_drop_els(aff->v, first, n);
1526 return isl_aff_free(aff);
1531 /* Project the domain of the affine expression onto its parameter space.
1532 * The affine expression may not involve any of the domain dimensions.
1534 __isl_give isl_aff *isl_aff_project_domain_on_params(__isl_take isl_aff *aff)
1540 n = isl_aff_dim(aff, isl_dim_in);
1541 involves = isl_aff_involves_dims(aff, isl_dim_in, 0, n);
1543 return isl_aff_free(aff);
1545 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
1546 "affine expression involves some of the domain dimensions",
1547 return isl_aff_free(aff));
1548 aff = isl_aff_drop_dims(aff, isl_dim_in, 0, n);
1549 space = isl_aff_get_domain_space(aff);
1550 space = isl_space_params(space);
1551 aff = isl_aff_reset_domain_space(aff, space);
1555 __isl_give isl_aff *isl_aff_insert_dims(__isl_take isl_aff *aff,
1556 enum isl_dim_type type, unsigned first, unsigned n)
1562 if (type == isl_dim_out)
1563 isl_die(aff->v->ctx, isl_error_invalid,
1564 "cannot insert output/set dimensions",
1565 return isl_aff_free(aff));
1566 if (type == isl_dim_in)
1568 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
1571 ctx = isl_aff_get_ctx(aff);
1572 if (first > isl_local_space_dim(aff->ls, type))
1573 isl_die(ctx, isl_error_invalid, "position out of bounds",
1574 return isl_aff_free(aff));
1576 aff = isl_aff_cow(aff);
1580 aff->ls = isl_local_space_insert_dims(aff->ls, type, first, n);
1582 return isl_aff_free(aff);
1584 first += 1 + isl_local_space_offset(aff->ls, type);
1585 aff->v = isl_vec_insert_zero_els(aff->v, first, n);
1587 return isl_aff_free(aff);
1592 __isl_give isl_aff *isl_aff_add_dims(__isl_take isl_aff *aff,
1593 enum isl_dim_type type, unsigned n)
1597 pos = isl_aff_dim(aff, type);
1599 return isl_aff_insert_dims(aff, type, pos, n);
1602 __isl_give isl_pw_aff *isl_pw_aff_add_dims(__isl_take isl_pw_aff *pwaff,
1603 enum isl_dim_type type, unsigned n)
1607 pos = isl_pw_aff_dim(pwaff, type);
1609 return isl_pw_aff_insert_dims(pwaff, type, pos, n);
1612 __isl_give isl_pw_aff *isl_pw_aff_from_aff(__isl_take isl_aff *aff)
1614 isl_set *dom = isl_set_universe(isl_aff_get_domain_space(aff));
1615 return isl_pw_aff_alloc(dom, aff);
1619 #define PW isl_pw_aff
1623 #define EL_IS_ZERO is_empty
1627 #define IS_ZERO is_empty
1630 #undef DEFAULT_IS_ZERO
1631 #define DEFAULT_IS_ZERO 0
1635 #define NO_MOVE_DIMS
1639 #include <isl_pw_templ.c>
1641 static __isl_give isl_set *align_params_pw_pw_set_and(
1642 __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2,
1643 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
1644 __isl_take isl_pw_aff *pwaff2))
1646 if (!pwaff1 || !pwaff2)
1648 if (isl_space_match(pwaff1->dim, isl_dim_param,
1649 pwaff2->dim, isl_dim_param))
1650 return fn(pwaff1, pwaff2);
1651 if (!isl_space_has_named_params(pwaff1->dim) ||
1652 !isl_space_has_named_params(pwaff2->dim))
1653 isl_die(isl_pw_aff_get_ctx(pwaff1), isl_error_invalid,
1654 "unaligned unnamed parameters", goto error);
1655 pwaff1 = isl_pw_aff_align_params(pwaff1, isl_pw_aff_get_space(pwaff2));
1656 pwaff2 = isl_pw_aff_align_params(pwaff2, isl_pw_aff_get_space(pwaff1));
1657 return fn(pwaff1, pwaff2);
1659 isl_pw_aff_free(pwaff1);
1660 isl_pw_aff_free(pwaff2);
1664 /* Compute a piecewise quasi-affine expression with a domain that
1665 * is the union of those of pwaff1 and pwaff2 and such that on each
1666 * cell, the quasi-affine expression is the better (according to cmp)
1667 * of those of pwaff1 and pwaff2. If only one of pwaff1 or pwaff2
1668 * is defined on a given cell, then the associated expression
1669 * is the defined one.
1671 static __isl_give isl_pw_aff *pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
1672 __isl_take isl_pw_aff *pwaff2,
1673 __isl_give isl_basic_set *(*cmp)(__isl_take isl_aff *aff1,
1674 __isl_take isl_aff *aff2))
1681 if (!pwaff1 || !pwaff2)
1684 ctx = isl_space_get_ctx(pwaff1->dim);
1685 if (!isl_space_is_equal(pwaff1->dim, pwaff2->dim))
1686 isl_die(ctx, isl_error_invalid,
1687 "arguments should live in same space", goto error);
1689 if (isl_pw_aff_is_empty(pwaff1)) {
1690 isl_pw_aff_free(pwaff1);
1694 if (isl_pw_aff_is_empty(pwaff2)) {
1695 isl_pw_aff_free(pwaff2);
1699 n = 2 * (pwaff1->n + 1) * (pwaff2->n + 1);
1700 res = isl_pw_aff_alloc_size(isl_space_copy(pwaff1->dim), n);
1702 for (i = 0; i < pwaff1->n; ++i) {
1703 set = isl_set_copy(pwaff1->p[i].set);
1704 for (j = 0; j < pwaff2->n; ++j) {
1705 struct isl_set *common;
1708 common = isl_set_intersect(
1709 isl_set_copy(pwaff1->p[i].set),
1710 isl_set_copy(pwaff2->p[j].set));
1711 better = isl_set_from_basic_set(cmp(
1712 isl_aff_copy(pwaff2->p[j].aff),
1713 isl_aff_copy(pwaff1->p[i].aff)));
1714 better = isl_set_intersect(common, better);
1715 if (isl_set_plain_is_empty(better)) {
1716 isl_set_free(better);
1719 set = isl_set_subtract(set, isl_set_copy(better));
1721 res = isl_pw_aff_add_piece(res, better,
1722 isl_aff_copy(pwaff2->p[j].aff));
1724 res = isl_pw_aff_add_piece(res, set,
1725 isl_aff_copy(pwaff1->p[i].aff));
1728 for (j = 0; j < pwaff2->n; ++j) {
1729 set = isl_set_copy(pwaff2->p[j].set);
1730 for (i = 0; i < pwaff1->n; ++i)
1731 set = isl_set_subtract(set,
1732 isl_set_copy(pwaff1->p[i].set));
1733 res = isl_pw_aff_add_piece(res, set,
1734 isl_aff_copy(pwaff2->p[j].aff));
1737 isl_pw_aff_free(pwaff1);
1738 isl_pw_aff_free(pwaff2);
1742 isl_pw_aff_free(pwaff1);
1743 isl_pw_aff_free(pwaff2);
1747 /* Compute a piecewise quasi-affine expression with a domain that
1748 * is the union of those of pwaff1 and pwaff2 and such that on each
1749 * cell, the quasi-affine expression is the maximum of those of pwaff1
1750 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1751 * cell, then the associated expression is the defined one.
1753 static __isl_give isl_pw_aff *pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
1754 __isl_take isl_pw_aff *pwaff2)
1756 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_ge_basic_set);
1759 __isl_give isl_pw_aff *isl_pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
1760 __isl_take isl_pw_aff *pwaff2)
1762 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
1766 /* Compute a piecewise quasi-affine expression with a domain that
1767 * is the union of those of pwaff1 and pwaff2 and such that on each
1768 * cell, the quasi-affine expression is the minimum of those of pwaff1
1769 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1770 * cell, then the associated expression is the defined one.
1772 static __isl_give isl_pw_aff *pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
1773 __isl_take isl_pw_aff *pwaff2)
1775 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_le_basic_set);
1778 __isl_give isl_pw_aff *isl_pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
1779 __isl_take isl_pw_aff *pwaff2)
1781 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
1785 __isl_give isl_pw_aff *isl_pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
1786 __isl_take isl_pw_aff *pwaff2, int max)
1789 return isl_pw_aff_union_max(pwaff1, pwaff2);
1791 return isl_pw_aff_union_min(pwaff1, pwaff2);
1794 /* Construct a map with as domain the domain of pwaff and
1795 * one-dimensional range corresponding to the affine expressions.
1797 static __isl_give isl_map *map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1806 dim = isl_pw_aff_get_space(pwaff);
1807 map = isl_map_empty(dim);
1809 for (i = 0; i < pwaff->n; ++i) {
1810 isl_basic_map *bmap;
1813 bmap = isl_basic_map_from_aff(isl_aff_copy(pwaff->p[i].aff));
1814 map_i = isl_map_from_basic_map(bmap);
1815 map_i = isl_map_intersect_domain(map_i,
1816 isl_set_copy(pwaff->p[i].set));
1817 map = isl_map_union_disjoint(map, map_i);
1820 isl_pw_aff_free(pwaff);
1825 /* Construct a map with as domain the domain of pwaff and
1826 * one-dimensional range corresponding to the affine expressions.
1828 __isl_give isl_map *isl_map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1832 if (isl_space_is_set(pwaff->dim))
1833 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1834 "space of input is not a map",
1835 return isl_pw_aff_free(pwaff));
1836 return map_from_pw_aff(pwaff);
1839 /* Construct a one-dimensional set with as parameter domain
1840 * the domain of pwaff and the single set dimension
1841 * corresponding to the affine expressions.
1843 __isl_give isl_set *isl_set_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1847 if (!isl_space_is_set(pwaff->dim))
1848 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1849 "space of input is not a set",
1850 return isl_pw_aff_free(pwaff));
1851 return map_from_pw_aff(pwaff);
1854 /* Return a set containing those elements in the domain
1855 * of pwaff where it is non-negative.
1857 __isl_give isl_set *isl_pw_aff_nonneg_set(__isl_take isl_pw_aff *pwaff)
1865 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
1867 for (i = 0; i < pwaff->n; ++i) {
1868 isl_basic_set *bset;
1871 bset = isl_aff_nonneg_basic_set(isl_aff_copy(pwaff->p[i].aff));
1872 set_i = isl_set_from_basic_set(bset);
1873 set_i = isl_set_intersect(set_i, isl_set_copy(pwaff->p[i].set));
1874 set = isl_set_union_disjoint(set, set_i);
1877 isl_pw_aff_free(pwaff);
1882 /* Return a set containing those elements in the domain
1883 * of pwaff where it is zero (if complement is 0) or not zero
1884 * (if complement is 1).
1886 static __isl_give isl_set *pw_aff_zero_set(__isl_take isl_pw_aff *pwaff,
1895 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
1897 for (i = 0; i < pwaff->n; ++i) {
1898 isl_basic_set *bset;
1899 isl_set *set_i, *zero;
1902 rational = isl_set_has_rational(pwaff->p[i].set);
1903 bset = aff_zero_basic_set(isl_aff_copy(pwaff->p[i].aff),
1905 zero = isl_set_from_basic_set(bset);
1906 set_i = isl_set_copy(pwaff->p[i].set);
1908 set_i = isl_set_subtract(set_i, zero);
1910 set_i = isl_set_intersect(set_i, zero);
1911 set = isl_set_union_disjoint(set, set_i);
1914 isl_pw_aff_free(pwaff);
1919 /* Return a set containing those elements in the domain
1920 * of pwaff where it is zero.
1922 __isl_give isl_set *isl_pw_aff_zero_set(__isl_take isl_pw_aff *pwaff)
1924 return pw_aff_zero_set(pwaff, 0);
1927 /* Return a set containing those elements in the domain
1928 * of pwaff where it is not zero.
1930 __isl_give isl_set *isl_pw_aff_non_zero_set(__isl_take isl_pw_aff *pwaff)
1932 return pw_aff_zero_set(pwaff, 1);
1935 /* Return a set containing those elements in the shared domain
1936 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
1938 * We compute the difference on the shared domain and then construct
1939 * the set of values where this difference is non-negative.
1940 * If strict is set, we first subtract 1 from the difference.
1941 * If equal is set, we only return the elements where pwaff1 and pwaff2
1944 static __isl_give isl_set *pw_aff_gte_set(__isl_take isl_pw_aff *pwaff1,
1945 __isl_take isl_pw_aff *pwaff2, int strict, int equal)
1947 isl_set *set1, *set2;
1949 set1 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff1));
1950 set2 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff2));
1951 set1 = isl_set_intersect(set1, set2);
1952 pwaff1 = isl_pw_aff_intersect_domain(pwaff1, isl_set_copy(set1));
1953 pwaff2 = isl_pw_aff_intersect_domain(pwaff2, isl_set_copy(set1));
1954 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_neg(pwaff2));
1957 isl_space *dim = isl_set_get_space(set1);
1959 aff = isl_aff_zero_on_domain(isl_local_space_from_space(dim));
1960 aff = isl_aff_add_constant_si(aff, -1);
1961 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_alloc(set1, aff));
1966 return isl_pw_aff_zero_set(pwaff1);
1967 return isl_pw_aff_nonneg_set(pwaff1);
1970 /* Return a set containing those elements in the shared domain
1971 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
1973 static __isl_give isl_set *pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
1974 __isl_take isl_pw_aff *pwaff2)
1976 return pw_aff_gte_set(pwaff1, pwaff2, 0, 1);
1979 __isl_give isl_set *isl_pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
1980 __isl_take isl_pw_aff *pwaff2)
1982 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_eq_set);
1985 /* Return a set containing those elements in the shared domain
1986 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
1988 static __isl_give isl_set *pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
1989 __isl_take isl_pw_aff *pwaff2)
1991 return pw_aff_gte_set(pwaff1, pwaff2, 0, 0);
1994 __isl_give isl_set *isl_pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
1995 __isl_take isl_pw_aff *pwaff2)
1997 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ge_set);
2000 /* Return a set containing those elements in the shared domain
2001 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
2003 static __isl_give isl_set *pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
2004 __isl_take isl_pw_aff *pwaff2)
2006 return pw_aff_gte_set(pwaff1, pwaff2, 1, 0);
2009 __isl_give isl_set *isl_pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
2010 __isl_take isl_pw_aff *pwaff2)
2012 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_gt_set);
2015 __isl_give isl_set *isl_pw_aff_le_set(__isl_take isl_pw_aff *pwaff1,
2016 __isl_take isl_pw_aff *pwaff2)
2018 return isl_pw_aff_ge_set(pwaff2, pwaff1);
2021 __isl_give isl_set *isl_pw_aff_lt_set(__isl_take isl_pw_aff *pwaff1,
2022 __isl_take isl_pw_aff *pwaff2)
2024 return isl_pw_aff_gt_set(pwaff2, pwaff1);
2027 /* Return a set containing those elements in the shared domain
2028 * of the elements of list1 and list2 where each element in list1
2029 * has the relation specified by "fn" with each element in list2.
2031 static __isl_give isl_set *pw_aff_list_set(__isl_take isl_pw_aff_list *list1,
2032 __isl_take isl_pw_aff_list *list2,
2033 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
2034 __isl_take isl_pw_aff *pwaff2))
2040 if (!list1 || !list2)
2043 ctx = isl_pw_aff_list_get_ctx(list1);
2044 if (list1->n < 1 || list2->n < 1)
2045 isl_die(ctx, isl_error_invalid,
2046 "list should contain at least one element", goto error);
2048 set = isl_set_universe(isl_pw_aff_get_domain_space(list1->p[0]));
2049 for (i = 0; i < list1->n; ++i)
2050 for (j = 0; j < list2->n; ++j) {
2053 set_ij = fn(isl_pw_aff_copy(list1->p[i]),
2054 isl_pw_aff_copy(list2->p[j]));
2055 set = isl_set_intersect(set, set_ij);
2058 isl_pw_aff_list_free(list1);
2059 isl_pw_aff_list_free(list2);
2062 isl_pw_aff_list_free(list1);
2063 isl_pw_aff_list_free(list2);
2067 /* Return a set containing those elements in the shared domain
2068 * of the elements of list1 and list2 where each element in list1
2069 * is equal to each element in list2.
2071 __isl_give isl_set *isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list *list1,
2072 __isl_take isl_pw_aff_list *list2)
2074 return pw_aff_list_set(list1, list2, &isl_pw_aff_eq_set);
2077 __isl_give isl_set *isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list *list1,
2078 __isl_take isl_pw_aff_list *list2)
2080 return pw_aff_list_set(list1, list2, &isl_pw_aff_ne_set);
2083 /* Return a set containing those elements in the shared domain
2084 * of the elements of list1 and list2 where each element in list1
2085 * is less than or equal to each element in list2.
2087 __isl_give isl_set *isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list *list1,
2088 __isl_take isl_pw_aff_list *list2)
2090 return pw_aff_list_set(list1, list2, &isl_pw_aff_le_set);
2093 __isl_give isl_set *isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list *list1,
2094 __isl_take isl_pw_aff_list *list2)
2096 return pw_aff_list_set(list1, list2, &isl_pw_aff_lt_set);
2099 __isl_give isl_set *isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list *list1,
2100 __isl_take isl_pw_aff_list *list2)
2102 return pw_aff_list_set(list1, list2, &isl_pw_aff_ge_set);
2105 __isl_give isl_set *isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list *list1,
2106 __isl_take isl_pw_aff_list *list2)
2108 return pw_aff_list_set(list1, list2, &isl_pw_aff_gt_set);
2112 /* Return a set containing those elements in the shared domain
2113 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
2115 static __isl_give isl_set *pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
2116 __isl_take isl_pw_aff *pwaff2)
2118 isl_set *set_lt, *set_gt;
2120 set_lt = isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1),
2121 isl_pw_aff_copy(pwaff2));
2122 set_gt = isl_pw_aff_gt_set(pwaff1, pwaff2);
2123 return isl_set_union_disjoint(set_lt, set_gt);
2126 __isl_give isl_set *isl_pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
2127 __isl_take isl_pw_aff *pwaff2)
2129 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ne_set);
2132 __isl_give isl_pw_aff *isl_pw_aff_scale_down(__isl_take isl_pw_aff *pwaff,
2137 if (isl_int_is_one(v))
2139 if (!isl_int_is_pos(v))
2140 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
2141 "factor needs to be positive",
2142 return isl_pw_aff_free(pwaff));
2143 pwaff = isl_pw_aff_cow(pwaff);
2149 for (i = 0; i < pwaff->n; ++i) {
2150 pwaff->p[i].aff = isl_aff_scale_down(pwaff->p[i].aff, v);
2151 if (!pwaff->p[i].aff)
2152 return isl_pw_aff_free(pwaff);
2158 __isl_give isl_pw_aff *isl_pw_aff_floor(__isl_take isl_pw_aff *pwaff)
2162 pwaff = isl_pw_aff_cow(pwaff);
2168 for (i = 0; i < pwaff->n; ++i) {
2169 pwaff->p[i].aff = isl_aff_floor(pwaff->p[i].aff);
2170 if (!pwaff->p[i].aff)
2171 return isl_pw_aff_free(pwaff);
2177 __isl_give isl_pw_aff *isl_pw_aff_ceil(__isl_take isl_pw_aff *pwaff)
2181 pwaff = isl_pw_aff_cow(pwaff);
2187 for (i = 0; i < pwaff->n; ++i) {
2188 pwaff->p[i].aff = isl_aff_ceil(pwaff->p[i].aff);
2189 if (!pwaff->p[i].aff)
2190 return isl_pw_aff_free(pwaff);
2196 /* Assuming that "cond1" and "cond2" are disjoint,
2197 * return an affine expression that is equal to pwaff1 on cond1
2198 * and to pwaff2 on cond2.
2200 static __isl_give isl_pw_aff *isl_pw_aff_select(
2201 __isl_take isl_set *cond1, __isl_take isl_pw_aff *pwaff1,
2202 __isl_take isl_set *cond2, __isl_take isl_pw_aff *pwaff2)
2204 pwaff1 = isl_pw_aff_intersect_domain(pwaff1, cond1);
2205 pwaff2 = isl_pw_aff_intersect_domain(pwaff2, cond2);
2207 return isl_pw_aff_add_disjoint(pwaff1, pwaff2);
2210 /* Return an affine expression that is equal to pwaff_true for elements
2211 * where "cond" is non-zero and to pwaff_false for elements where "cond"
2213 * That is, return cond ? pwaff_true : pwaff_false;
2215 __isl_give isl_pw_aff *isl_pw_aff_cond(__isl_take isl_pw_aff *cond,
2216 __isl_take isl_pw_aff *pwaff_true, __isl_take isl_pw_aff *pwaff_false)
2218 isl_set *cond_true, *cond_false;
2220 cond_true = isl_pw_aff_non_zero_set(isl_pw_aff_copy(cond));
2221 cond_false = isl_pw_aff_zero_set(cond);
2222 return isl_pw_aff_select(cond_true, pwaff_true,
2223 cond_false, pwaff_false);
2226 int isl_aff_is_cst(__isl_keep isl_aff *aff)
2231 return isl_seq_first_non_zero(aff->v->el + 2, aff->v->size - 2) == -1;
2234 /* Check whether pwaff is a piecewise constant.
2236 int isl_pw_aff_is_cst(__isl_keep isl_pw_aff *pwaff)
2243 for (i = 0; i < pwaff->n; ++i) {
2244 int is_cst = isl_aff_is_cst(pwaff->p[i].aff);
2245 if (is_cst < 0 || !is_cst)
2252 __isl_give isl_aff *isl_aff_mul(__isl_take isl_aff *aff1,
2253 __isl_take isl_aff *aff2)
2255 if (!isl_aff_is_cst(aff2) && isl_aff_is_cst(aff1))
2256 return isl_aff_mul(aff2, aff1);
2258 if (!isl_aff_is_cst(aff2))
2259 isl_die(isl_aff_get_ctx(aff1), isl_error_invalid,
2260 "at least one affine expression should be constant",
2263 aff1 = isl_aff_cow(aff1);
2267 aff1 = isl_aff_scale(aff1, aff2->v->el[1]);
2268 aff1 = isl_aff_scale_down(aff1, aff2->v->el[0]);
2278 /* Divide "aff1" by "aff2", assuming "aff2" is a piecewise constant.
2280 __isl_give isl_aff *isl_aff_div(__isl_take isl_aff *aff1,
2281 __isl_take isl_aff *aff2)
2286 is_cst = isl_aff_is_cst(aff2);
2290 isl_die(isl_aff_get_ctx(aff2), isl_error_invalid,
2291 "second argument should be a constant", goto error);
2296 neg = isl_int_is_neg(aff2->v->el[1]);
2298 isl_int_neg(aff2->v->el[0], aff2->v->el[0]);
2299 isl_int_neg(aff2->v->el[1], aff2->v->el[1]);
2302 aff1 = isl_aff_scale(aff1, aff2->v->el[0]);
2303 aff1 = isl_aff_scale_down(aff1, aff2->v->el[1]);
2306 isl_int_neg(aff2->v->el[0], aff2->v->el[0]);
2307 isl_int_neg(aff2->v->el[1], aff2->v->el[1]);
2318 static __isl_give isl_pw_aff *pw_aff_add(__isl_take isl_pw_aff *pwaff1,
2319 __isl_take isl_pw_aff *pwaff2)
2321 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_add);
2324 __isl_give isl_pw_aff *isl_pw_aff_add(__isl_take isl_pw_aff *pwaff1,
2325 __isl_take isl_pw_aff *pwaff2)
2327 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_add);
2330 __isl_give isl_pw_aff *isl_pw_aff_union_add(__isl_take isl_pw_aff *pwaff1,
2331 __isl_take isl_pw_aff *pwaff2)
2333 return isl_pw_aff_union_add_(pwaff1, pwaff2);
2336 static __isl_give isl_pw_aff *pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
2337 __isl_take isl_pw_aff *pwaff2)
2339 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_mul);
2342 __isl_give isl_pw_aff *isl_pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
2343 __isl_take isl_pw_aff *pwaff2)
2345 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_mul);
2348 static __isl_give isl_pw_aff *pw_aff_div(__isl_take isl_pw_aff *pa1,
2349 __isl_take isl_pw_aff *pa2)
2351 return isl_pw_aff_on_shared_domain(pa1, pa2, &isl_aff_div);
2354 /* Divide "pa1" by "pa2", assuming "pa2" is a piecewise constant.
2356 __isl_give isl_pw_aff *isl_pw_aff_div(__isl_take isl_pw_aff *pa1,
2357 __isl_take isl_pw_aff *pa2)
2361 is_cst = isl_pw_aff_is_cst(pa2);
2365 isl_die(isl_pw_aff_get_ctx(pa2), isl_error_invalid,
2366 "second argument should be a piecewise constant",
2368 return isl_pw_aff_align_params_pw_pw_and(pa1, pa2, &pw_aff_div);
2370 isl_pw_aff_free(pa1);
2371 isl_pw_aff_free(pa2);
2375 /* Compute the quotient of the integer division of "pa1" by "pa2"
2376 * with rounding towards zero.
2377 * "pa2" is assumed to be a piecewise constant.
2379 * In particular, return
2381 * pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2)
2384 __isl_give isl_pw_aff *isl_pw_aff_tdiv_q(__isl_take isl_pw_aff *pa1,
2385 __isl_take isl_pw_aff *pa2)
2391 is_cst = isl_pw_aff_is_cst(pa2);
2395 isl_die(isl_pw_aff_get_ctx(pa2), isl_error_invalid,
2396 "second argument should be a piecewise constant",
2399 pa1 = isl_pw_aff_div(pa1, pa2);
2401 cond = isl_pw_aff_nonneg_set(isl_pw_aff_copy(pa1));
2402 f = isl_pw_aff_floor(isl_pw_aff_copy(pa1));
2403 c = isl_pw_aff_ceil(pa1);
2404 return isl_pw_aff_cond(isl_set_indicator_function(cond), f, c);
2406 isl_pw_aff_free(pa1);
2407 isl_pw_aff_free(pa2);
2411 /* Compute the remainder of the integer division of "pa1" by "pa2"
2412 * with rounding towards zero.
2413 * "pa2" is assumed to be a piecewise constant.
2415 * In particular, return
2417 * pa1 - pa2 * (pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2))
2420 __isl_give isl_pw_aff *isl_pw_aff_tdiv_r(__isl_take isl_pw_aff *pa1,
2421 __isl_take isl_pw_aff *pa2)
2426 is_cst = isl_pw_aff_is_cst(pa2);
2430 isl_die(isl_pw_aff_get_ctx(pa2), isl_error_invalid,
2431 "second argument should be a piecewise constant",
2433 res = isl_pw_aff_tdiv_q(isl_pw_aff_copy(pa1), isl_pw_aff_copy(pa2));
2434 res = isl_pw_aff_mul(pa2, res);
2435 res = isl_pw_aff_sub(pa1, res);
2438 isl_pw_aff_free(pa1);
2439 isl_pw_aff_free(pa2);
2443 static __isl_give isl_pw_aff *pw_aff_min(__isl_take isl_pw_aff *pwaff1,
2444 __isl_take isl_pw_aff *pwaff2)
2449 dom = isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1)),
2450 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2)));
2451 le = isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1),
2452 isl_pw_aff_copy(pwaff2));
2453 dom = isl_set_subtract(dom, isl_set_copy(le));
2454 return isl_pw_aff_select(le, pwaff1, dom, pwaff2);
2457 __isl_give isl_pw_aff *isl_pw_aff_min(__isl_take isl_pw_aff *pwaff1,
2458 __isl_take isl_pw_aff *pwaff2)
2460 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_min);
2463 static __isl_give isl_pw_aff *pw_aff_max(__isl_take isl_pw_aff *pwaff1,
2464 __isl_take isl_pw_aff *pwaff2)
2469 dom = isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1)),
2470 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2)));
2471 ge = isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1),
2472 isl_pw_aff_copy(pwaff2));
2473 dom = isl_set_subtract(dom, isl_set_copy(ge));
2474 return isl_pw_aff_select(ge, pwaff1, dom, pwaff2);
2477 __isl_give isl_pw_aff *isl_pw_aff_max(__isl_take isl_pw_aff *pwaff1,
2478 __isl_take isl_pw_aff *pwaff2)
2480 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_max);
2483 static __isl_give isl_pw_aff *pw_aff_list_reduce(
2484 __isl_take isl_pw_aff_list *list,
2485 __isl_give isl_pw_aff *(*fn)(__isl_take isl_pw_aff *pwaff1,
2486 __isl_take isl_pw_aff *pwaff2))
2495 ctx = isl_pw_aff_list_get_ctx(list);
2497 isl_die(ctx, isl_error_invalid,
2498 "list should contain at least one element",
2499 return isl_pw_aff_list_free(list));
2501 res = isl_pw_aff_copy(list->p[0]);
2502 for (i = 1; i < list->n; ++i)
2503 res = fn(res, isl_pw_aff_copy(list->p[i]));
2505 isl_pw_aff_list_free(list);
2509 /* Return an isl_pw_aff that maps each element in the intersection of the
2510 * domains of the elements of list to the minimal corresponding affine
2513 __isl_give isl_pw_aff *isl_pw_aff_list_min(__isl_take isl_pw_aff_list *list)
2515 return pw_aff_list_reduce(list, &isl_pw_aff_min);
2518 /* Return an isl_pw_aff that maps each element in the intersection of the
2519 * domains of the elements of list to the maximal corresponding affine
2522 __isl_give isl_pw_aff *isl_pw_aff_list_max(__isl_take isl_pw_aff_list *list)
2524 return pw_aff_list_reduce(list, &isl_pw_aff_max);
2527 /* Mark the domains of "pwaff" as rational.
2529 __isl_give isl_pw_aff *isl_pw_aff_set_rational(__isl_take isl_pw_aff *pwaff)
2533 pwaff = isl_pw_aff_cow(pwaff);
2539 for (i = 0; i < pwaff->n; ++i) {
2540 pwaff->p[i].set = isl_set_set_rational(pwaff->p[i].set);
2541 if (!pwaff->p[i].set)
2542 return isl_pw_aff_free(pwaff);
2548 /* Mark the domains of the elements of "list" as rational.
2550 __isl_give isl_pw_aff_list *isl_pw_aff_list_set_rational(
2551 __isl_take isl_pw_aff_list *list)
2560 for (i = 0; i < list->n; ++i) {
2563 pa = isl_pw_aff_list_get_pw_aff(list, i);
2564 pa = isl_pw_aff_set_rational(pa);
2565 list = isl_pw_aff_list_set_pw_aff(list, i, pa);
2574 #include <isl_multi_templ.c>
2576 /* Create an isl_pw_multi_aff with the given isl_multi_aff on a universe
2579 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_multi_aff(
2580 __isl_take isl_multi_aff *ma)
2582 isl_set *dom = isl_set_universe(isl_multi_aff_get_domain_space(ma));
2583 return isl_pw_multi_aff_alloc(dom, ma);
2586 /* Create a piecewise multi-affine expression in the given space that maps each
2587 * input dimension to the corresponding output dimension.
2589 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_identity(
2590 __isl_take isl_space *space)
2592 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_identity(space));
2595 __isl_give isl_multi_aff *isl_multi_aff_add(__isl_take isl_multi_aff *maff1,
2596 __isl_take isl_multi_aff *maff2)
2601 maff1 = isl_multi_aff_cow(maff1);
2602 if (!maff1 || !maff2)
2605 ctx = isl_multi_aff_get_ctx(maff1);
2606 if (!isl_space_is_equal(maff1->space, maff2->space))
2607 isl_die(ctx, isl_error_invalid,
2608 "spaces don't match", goto error);
2610 for (i = 0; i < maff1->n; ++i) {
2611 maff1->p[i] = isl_aff_add(maff1->p[i],
2612 isl_aff_copy(maff2->p[i]));
2617 isl_multi_aff_free(maff2);
2620 isl_multi_aff_free(maff1);
2621 isl_multi_aff_free(maff2);
2625 /* Given two multi-affine expressions A -> B and C -> D,
2626 * construct a multi-affine expression [A -> C] -> [B -> D].
2628 __isl_give isl_multi_aff *isl_multi_aff_product(
2629 __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2)
2635 int in1, in2, out1, out2;
2637 in1 = isl_multi_aff_dim(ma1, isl_dim_in);
2638 in2 = isl_multi_aff_dim(ma2, isl_dim_in);
2639 out1 = isl_multi_aff_dim(ma1, isl_dim_out);
2640 out2 = isl_multi_aff_dim(ma2, isl_dim_out);
2641 space = isl_space_product(isl_multi_aff_get_space(ma1),
2642 isl_multi_aff_get_space(ma2));
2643 res = isl_multi_aff_alloc(isl_space_copy(space));
2644 space = isl_space_domain(space);
2646 for (i = 0; i < out1; ++i) {
2647 aff = isl_multi_aff_get_aff(ma1, i);
2648 aff = isl_aff_insert_dims(aff, isl_dim_in, in1, in2);
2649 aff = isl_aff_reset_domain_space(aff, isl_space_copy(space));
2650 res = isl_multi_aff_set_aff(res, i, aff);
2653 for (i = 0; i < out2; ++i) {
2654 aff = isl_multi_aff_get_aff(ma2, i);
2655 aff = isl_aff_insert_dims(aff, isl_dim_in, 0, in1);
2656 aff = isl_aff_reset_domain_space(aff, isl_space_copy(space));
2657 res = isl_multi_aff_set_aff(res, out1 + i, aff);
2660 isl_space_free(space);
2661 isl_multi_aff_free(ma1);
2662 isl_multi_aff_free(ma2);
2666 /* Exploit the equalities in "eq" to simplify the affine expressions.
2668 static __isl_give isl_multi_aff *isl_multi_aff_substitute_equalities(
2669 __isl_take isl_multi_aff *maff, __isl_take isl_basic_set *eq)
2673 maff = isl_multi_aff_cow(maff);
2677 for (i = 0; i < maff->n; ++i) {
2678 maff->p[i] = isl_aff_substitute_equalities(maff->p[i],
2679 isl_basic_set_copy(eq));
2684 isl_basic_set_free(eq);
2687 isl_basic_set_free(eq);
2688 isl_multi_aff_free(maff);
2692 __isl_give isl_multi_aff *isl_multi_aff_scale(__isl_take isl_multi_aff *maff,
2697 maff = isl_multi_aff_cow(maff);
2701 for (i = 0; i < maff->n; ++i) {
2702 maff->p[i] = isl_aff_scale(maff->p[i], f);
2704 return isl_multi_aff_free(maff);
2710 __isl_give isl_multi_aff *isl_multi_aff_add_on_domain(__isl_keep isl_set *dom,
2711 __isl_take isl_multi_aff *maff1, __isl_take isl_multi_aff *maff2)
2713 maff1 = isl_multi_aff_add(maff1, maff2);
2714 maff1 = isl_multi_aff_gist(maff1, isl_set_copy(dom));
2718 int isl_multi_aff_is_empty(__isl_keep isl_multi_aff *maff)
2726 int isl_multi_aff_plain_is_equal(__isl_keep isl_multi_aff *maff1,
2727 __isl_keep isl_multi_aff *maff2)
2732 if (!maff1 || !maff2)
2734 if (maff1->n != maff2->n)
2736 equal = isl_space_is_equal(maff1->space, maff2->space);
2737 if (equal < 0 || !equal)
2740 for (i = 0; i < maff1->n; ++i) {
2741 equal = isl_aff_plain_is_equal(maff1->p[i], maff2->p[i]);
2742 if (equal < 0 || !equal)
2749 /* Return the set of domain elements where "ma1" is lexicographically
2750 * smaller than or equal to "ma2".
2752 __isl_give isl_set *isl_multi_aff_lex_le_set(__isl_take isl_multi_aff *ma1,
2753 __isl_take isl_multi_aff *ma2)
2755 return isl_multi_aff_lex_ge_set(ma2, ma1);
2758 /* Return the set of domain elements where "ma1" is lexicographically
2759 * greater than or equal to "ma2".
2761 __isl_give isl_set *isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff *ma1,
2762 __isl_take isl_multi_aff *ma2)
2765 isl_map *map1, *map2;
2768 map1 = isl_map_from_multi_aff(ma1);
2769 map2 = isl_map_from_multi_aff(ma2);
2770 map = isl_map_range_product(map1, map2);
2771 space = isl_space_range(isl_map_get_space(map));
2772 space = isl_space_domain(isl_space_unwrap(space));
2773 ge = isl_map_lex_ge(space);
2774 map = isl_map_intersect_range(map, isl_map_wrap(ge));
2776 return isl_map_domain(map);
2780 #define PW isl_pw_multi_aff
2782 #define EL isl_multi_aff
2784 #define EL_IS_ZERO is_empty
2788 #define IS_ZERO is_empty
2791 #undef DEFAULT_IS_ZERO
2792 #define DEFAULT_IS_ZERO 0
2797 #define NO_INVOLVES_DIMS
2798 #define NO_MOVE_DIMS
2799 #define NO_INSERT_DIMS
2803 #include <isl_pw_templ.c>
2806 #define UNION isl_union_pw_multi_aff
2808 #define PART isl_pw_multi_aff
2810 #define PARTS pw_multi_aff
2811 #define ALIGN_DOMAIN
2815 #include <isl_union_templ.c>
2817 /* Given a function "cmp" that returns the set of elements where
2818 * "ma1" is "better" than "ma2", return the intersection of this
2819 * set with "dom1" and "dom2".
2821 static __isl_give isl_set *shared_and_better(__isl_keep isl_set *dom1,
2822 __isl_keep isl_set *dom2, __isl_keep isl_multi_aff *ma1,
2823 __isl_keep isl_multi_aff *ma2,
2824 __isl_give isl_set *(*cmp)(__isl_take isl_multi_aff *ma1,
2825 __isl_take isl_multi_aff *ma2))
2831 common = isl_set_intersect(isl_set_copy(dom1), isl_set_copy(dom2));
2832 is_empty = isl_set_plain_is_empty(common);
2833 if (is_empty >= 0 && is_empty)
2836 return isl_set_free(common);
2837 better = cmp(isl_multi_aff_copy(ma1), isl_multi_aff_copy(ma2));
2838 better = isl_set_intersect(common, better);
2843 /* Given a function "cmp" that returns the set of elements where
2844 * "ma1" is "better" than "ma2", return a piecewise multi affine
2845 * expression defined on the union of the definition domains
2846 * of "pma1" and "pma2" that maps to the "best" of "pma1" and
2847 * "pma2" on each cell. If only one of the two input functions
2848 * is defined on a given cell, then it is considered the best.
2850 static __isl_give isl_pw_multi_aff *pw_multi_aff_union_opt(
2851 __isl_take isl_pw_multi_aff *pma1,
2852 __isl_take isl_pw_multi_aff *pma2,
2853 __isl_give isl_set *(*cmp)(__isl_take isl_multi_aff *ma1,
2854 __isl_take isl_multi_aff *ma2))
2857 isl_pw_multi_aff *res = NULL;
2859 isl_set *set = NULL;
2864 ctx = isl_space_get_ctx(pma1->dim);
2865 if (!isl_space_is_equal(pma1->dim, pma2->dim))
2866 isl_die(ctx, isl_error_invalid,
2867 "arguments should live in the same space", goto error);
2869 if (isl_pw_multi_aff_is_empty(pma1)) {
2870 isl_pw_multi_aff_free(pma1);
2874 if (isl_pw_multi_aff_is_empty(pma2)) {
2875 isl_pw_multi_aff_free(pma2);
2879 n = 2 * (pma1->n + 1) * (pma2->n + 1);
2880 res = isl_pw_multi_aff_alloc_size(isl_space_copy(pma1->dim), n);
2882 for (i = 0; i < pma1->n; ++i) {
2883 set = isl_set_copy(pma1->p[i].set);
2884 for (j = 0; j < pma2->n; ++j) {
2888 better = shared_and_better(pma2->p[j].set,
2889 pma1->p[i].set, pma2->p[j].maff,
2890 pma1->p[i].maff, cmp);
2891 is_empty = isl_set_plain_is_empty(better);
2892 if (is_empty < 0 || is_empty) {
2893 isl_set_free(better);
2898 set = isl_set_subtract(set, isl_set_copy(better));
2900 res = isl_pw_multi_aff_add_piece(res, better,
2901 isl_multi_aff_copy(pma2->p[j].maff));
2903 res = isl_pw_multi_aff_add_piece(res, set,
2904 isl_multi_aff_copy(pma1->p[i].maff));
2907 for (j = 0; j < pma2->n; ++j) {
2908 set = isl_set_copy(pma2->p[j].set);
2909 for (i = 0; i < pma1->n; ++i)
2910 set = isl_set_subtract(set,
2911 isl_set_copy(pma1->p[i].set));
2912 res = isl_pw_multi_aff_add_piece(res, set,
2913 isl_multi_aff_copy(pma2->p[j].maff));
2916 isl_pw_multi_aff_free(pma1);
2917 isl_pw_multi_aff_free(pma2);
2921 isl_pw_multi_aff_free(pma1);
2922 isl_pw_multi_aff_free(pma2);
2924 return isl_pw_multi_aff_free(res);
2927 static __isl_give isl_pw_multi_aff *pw_multi_aff_union_lexmax(
2928 __isl_take isl_pw_multi_aff *pma1,
2929 __isl_take isl_pw_multi_aff *pma2)
2931 return pw_multi_aff_union_opt(pma1, pma2, &isl_multi_aff_lex_ge_set);
2934 /* Given two piecewise multi affine expressions, return a piecewise
2935 * multi-affine expression defined on the union of the definition domains
2936 * of the inputs that is equal to the lexicographic maximum of the two
2937 * inputs on each cell. If only one of the two inputs is defined on
2938 * a given cell, then it is considered to be the maximum.
2940 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmax(
2941 __isl_take isl_pw_multi_aff *pma1,
2942 __isl_take isl_pw_multi_aff *pma2)
2944 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
2945 &pw_multi_aff_union_lexmax);
2948 static __isl_give isl_pw_multi_aff *pw_multi_aff_union_lexmin(
2949 __isl_take isl_pw_multi_aff *pma1,
2950 __isl_take isl_pw_multi_aff *pma2)
2952 return pw_multi_aff_union_opt(pma1, pma2, &isl_multi_aff_lex_le_set);
2955 /* Given two piecewise multi affine expressions, return a piecewise
2956 * multi-affine expression defined on the union of the definition domains
2957 * of the inputs that is equal to the lexicographic minimum of the two
2958 * inputs on each cell. If only one of the two inputs is defined on
2959 * a given cell, then it is considered to be the minimum.
2961 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmin(
2962 __isl_take isl_pw_multi_aff *pma1,
2963 __isl_take isl_pw_multi_aff *pma2)
2965 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
2966 &pw_multi_aff_union_lexmin);
2969 static __isl_give isl_pw_multi_aff *pw_multi_aff_add(
2970 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2972 return isl_pw_multi_aff_on_shared_domain(pma1, pma2,
2973 &isl_multi_aff_add);
2976 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_add(
2977 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2979 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
2983 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_add(
2984 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2986 return isl_pw_multi_aff_union_add_(pma1, pma2);
2989 /* Given two piecewise multi-affine expressions A -> B and C -> D,
2990 * construct a piecewise multi-affine expression [A -> C] -> [B -> D].
2992 static __isl_give isl_pw_multi_aff *pw_multi_aff_product(
2993 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2997 isl_pw_multi_aff *res;
3002 n = pma1->n * pma2->n;
3003 space = isl_space_product(isl_space_copy(pma1->dim),
3004 isl_space_copy(pma2->dim));
3005 res = isl_pw_multi_aff_alloc_size(space, n);
3007 for (i = 0; i < pma1->n; ++i) {
3008 for (j = 0; j < pma2->n; ++j) {
3012 domain = isl_set_product(isl_set_copy(pma1->p[i].set),
3013 isl_set_copy(pma2->p[j].set));
3014 ma = isl_multi_aff_product(
3015 isl_multi_aff_copy(pma1->p[i].maff),
3016 isl_multi_aff_copy(pma2->p[i].maff));
3017 res = isl_pw_multi_aff_add_piece(res, domain, ma);
3021 isl_pw_multi_aff_free(pma1);
3022 isl_pw_multi_aff_free(pma2);
3025 isl_pw_multi_aff_free(pma1);
3026 isl_pw_multi_aff_free(pma2);
3030 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_product(
3031 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3033 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3034 &pw_multi_aff_product);
3037 /* Construct a map mapping the domain of the piecewise multi-affine expression
3038 * to its range, with each dimension in the range equated to the
3039 * corresponding affine expression on its cell.
3041 __isl_give isl_map *isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
3049 map = isl_map_empty(isl_pw_multi_aff_get_space(pma));
3051 for (i = 0; i < pma->n; ++i) {
3052 isl_multi_aff *maff;
3053 isl_basic_map *bmap;
3056 maff = isl_multi_aff_copy(pma->p[i].maff);
3057 bmap = isl_basic_map_from_multi_aff(maff);
3058 map_i = isl_map_from_basic_map(bmap);
3059 map_i = isl_map_intersect_domain(map_i,
3060 isl_set_copy(pma->p[i].set));
3061 map = isl_map_union_disjoint(map, map_i);
3064 isl_pw_multi_aff_free(pma);
3068 __isl_give isl_set *isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
3073 if (!isl_space_is_set(pma->dim))
3074 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
3075 "isl_pw_multi_aff cannot be converted into an isl_set",
3076 return isl_pw_multi_aff_free(pma));
3078 return isl_map_from_pw_multi_aff(pma);
3081 /* Given a basic map with a single output dimension that is defined
3082 * in terms of the parameters and input dimensions using an equality,
3083 * extract an isl_aff that expresses the output dimension in terms
3084 * of the parameters and input dimensions.
3086 * Since some applications expect the result of isl_pw_multi_aff_from_map
3087 * to only contain integer affine expressions, we compute the floor
3088 * of the expression before returning.
3090 * This function shares some similarities with
3091 * isl_basic_map_has_defining_equality and isl_constraint_get_bound.
3093 static __isl_give isl_aff *extract_isl_aff_from_basic_map(
3094 __isl_take isl_basic_map *bmap)
3099 isl_local_space *ls;
3104 if (isl_basic_map_dim(bmap, isl_dim_out) != 1)
3105 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
3106 "basic map should have a single output dimension",
3108 offset = isl_basic_map_offset(bmap, isl_dim_out);
3109 total = isl_basic_map_total_dim(bmap);
3110 for (i = 0; i < bmap->n_eq; ++i) {
3111 if (isl_int_is_zero(bmap->eq[i][offset]))
3113 if (isl_seq_first_non_zero(bmap->eq[i] + offset + 1,
3114 1 + total - (offset + 1)) != -1)
3118 if (i >= bmap->n_eq)
3119 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
3120 "unable to find suitable equality", goto error);
3121 ls = isl_basic_map_get_local_space(bmap);
3122 aff = isl_aff_alloc(isl_local_space_domain(ls));
3125 if (isl_int_is_neg(bmap->eq[i][offset]))
3126 isl_seq_cpy(aff->v->el + 1, bmap->eq[i], offset);
3128 isl_seq_neg(aff->v->el + 1, bmap->eq[i], offset);
3129 isl_seq_clr(aff->v->el + 1 + offset, aff->v->size - (1 + offset));
3130 isl_int_abs(aff->v->el[0], bmap->eq[i][offset]);
3131 isl_basic_map_free(bmap);
3133 aff = isl_aff_remove_unused_divs(aff);
3134 aff = isl_aff_floor(aff);
3137 isl_basic_map_free(bmap);
3141 /* Given a basic map where each output dimension is defined
3142 * in terms of the parameters and input dimensions using an equality,
3143 * extract an isl_multi_aff that expresses the output dimensions in terms
3144 * of the parameters and input dimensions.
3146 static __isl_give isl_multi_aff *extract_isl_multi_aff_from_basic_map(
3147 __isl_take isl_basic_map *bmap)
3156 ma = isl_multi_aff_alloc(isl_basic_map_get_space(bmap));
3157 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3159 for (i = 0; i < n_out; ++i) {
3160 isl_basic_map *bmap_i;
3163 bmap_i = isl_basic_map_copy(bmap);
3164 bmap_i = isl_basic_map_project_out(bmap_i, isl_dim_out,
3165 i + 1, n_out - (1 + i));
3166 bmap_i = isl_basic_map_project_out(bmap_i, isl_dim_out, 0, i);
3167 aff = extract_isl_aff_from_basic_map(bmap_i);
3168 ma = isl_multi_aff_set_aff(ma, i, aff);
3171 isl_basic_map_free(bmap);
3176 /* Create an isl_pw_multi_aff that is equivalent to
3177 * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain).
3178 * The given basic map is such that each output dimension is defined
3179 * in terms of the parameters and input dimensions using an equality.
3181 static __isl_give isl_pw_multi_aff *plain_pw_multi_aff_from_map(
3182 __isl_take isl_set *domain, __isl_take isl_basic_map *bmap)
3186 ma = extract_isl_multi_aff_from_basic_map(bmap);
3187 return isl_pw_multi_aff_alloc(domain, ma);
3190 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
3191 * This obviously only works if the input "map" is single-valued.
3192 * If so, we compute the lexicographic minimum of the image in the form
3193 * of an isl_pw_multi_aff. Since the image is unique, it is equal
3194 * to its lexicographic minimum.
3195 * If the input is not single-valued, we produce an error.
3197 * As a special case, we first check if all output dimensions are uniquely
3198 * defined in terms of the parameters and input dimensions over the entire
3199 * domain. If so, we extract the desired isl_pw_multi_aff directly
3200 * from the affine hull of "map" and its domain.
3202 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_map(__isl_take isl_map *map)
3206 isl_pw_multi_aff *pma;
3207 isl_basic_map *hull;
3212 hull = isl_map_affine_hull(isl_map_copy(map));
3213 sv = isl_basic_map_plain_is_single_valued(hull);
3215 return plain_pw_multi_aff_from_map(isl_map_domain(map), hull);
3216 isl_basic_map_free(hull);
3220 sv = isl_map_is_single_valued(map);
3224 isl_die(isl_map_get_ctx(map), isl_error_invalid,
3225 "map is not single-valued", goto error);
3226 map = isl_map_make_disjoint(map);
3230 pma = isl_pw_multi_aff_empty(isl_map_get_space(map));
3232 for (i = 0; i < map->n; ++i) {
3233 isl_pw_multi_aff *pma_i;
3234 isl_basic_map *bmap;
3235 bmap = isl_basic_map_copy(map->p[i]);
3236 pma_i = isl_basic_map_lexmin_pw_multi_aff(bmap);
3237 pma = isl_pw_multi_aff_add_disjoint(pma, pma_i);
3247 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_set(__isl_take isl_set *set)
3249 return isl_pw_multi_aff_from_map(set);
3252 /* Return the piecewise affine expression "set ? 1 : 0".
3254 __isl_give isl_pw_aff *isl_set_indicator_function(__isl_take isl_set *set)
3257 isl_space *space = isl_set_get_space(set);
3258 isl_local_space *ls = isl_local_space_from_space(space);
3259 isl_aff *zero = isl_aff_zero_on_domain(isl_local_space_copy(ls));
3260 isl_aff *one = isl_aff_zero_on_domain(ls);
3262 one = isl_aff_add_constant_si(one, 1);
3263 pa = isl_pw_aff_alloc(isl_set_copy(set), one);
3264 set = isl_set_complement(set);
3265 pa = isl_pw_aff_add_disjoint(pa, isl_pw_aff_alloc(set, zero));
3270 /* Plug in "subs" for dimension "type", "pos" of "aff".
3272 * Let i be the dimension to replace and let "subs" be of the form
3276 * and "aff" of the form
3282 * (a f + d g')/(m d)
3284 * where g' is the result of plugging in "subs" in each of the integer
3287 __isl_give isl_aff *isl_aff_substitute(__isl_take isl_aff *aff,
3288 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
3293 aff = isl_aff_cow(aff);
3295 return isl_aff_free(aff);
3297 ctx = isl_aff_get_ctx(aff);
3298 if (!isl_space_is_equal(aff->ls->dim, subs->ls->dim))
3299 isl_die(ctx, isl_error_invalid,
3300 "spaces don't match", return isl_aff_free(aff));
3301 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
3302 isl_die(ctx, isl_error_unsupported,
3303 "cannot handle divs yet", return isl_aff_free(aff));
3305 aff->ls = isl_local_space_substitute(aff->ls, type, pos, subs);
3307 return isl_aff_free(aff);
3309 aff->v = isl_vec_cow(aff->v);
3311 return isl_aff_free(aff);
3313 pos += isl_local_space_offset(aff->ls, type);
3316 isl_seq_substitute(aff->v->el, pos, subs->v->el,
3317 aff->v->size, subs->v->size, v);
3323 /* Plug in "subs" for dimension "type", "pos" in each of the affine
3324 * expressions in "maff".
3326 __isl_give isl_multi_aff *isl_multi_aff_substitute(
3327 __isl_take isl_multi_aff *maff, enum isl_dim_type type, unsigned pos,
3328 __isl_keep isl_aff *subs)
3332 maff = isl_multi_aff_cow(maff);
3334 return isl_multi_aff_free(maff);
3336 if (type == isl_dim_in)
3339 for (i = 0; i < maff->n; ++i) {
3340 maff->p[i] = isl_aff_substitute(maff->p[i], type, pos, subs);
3342 return isl_multi_aff_free(maff);
3348 /* Plug in "subs" for dimension "type", "pos" of "pma".
3350 * pma is of the form
3354 * while subs is of the form
3356 * v' = B_j(v) -> S_j
3358 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
3359 * has a contribution in the result, in particular
3361 * C_ij(S_j) -> M_i(S_j)
3363 * Note that plugging in S_j in C_ij may also result in an empty set
3364 * and this contribution should simply be discarded.
3366 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_substitute(
3367 __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos,
3368 __isl_keep isl_pw_aff *subs)
3371 isl_pw_multi_aff *res;
3374 return isl_pw_multi_aff_free(pma);
3376 n = pma->n * subs->n;
3377 res = isl_pw_multi_aff_alloc_size(isl_space_copy(pma->dim), n);
3379 for (i = 0; i < pma->n; ++i) {
3380 for (j = 0; j < subs->n; ++j) {
3382 isl_multi_aff *res_ij;
3383 common = isl_set_intersect(
3384 isl_set_copy(pma->p[i].set),
3385 isl_set_copy(subs->p[j].set));
3386 common = isl_set_substitute(common,
3387 type, pos, subs->p[j].aff);
3388 if (isl_set_plain_is_empty(common)) {
3389 isl_set_free(common);
3393 res_ij = isl_multi_aff_substitute(
3394 isl_multi_aff_copy(pma->p[i].maff),
3395 type, pos, subs->p[j].aff);
3397 res = isl_pw_multi_aff_add_piece(res, common, res_ij);
3401 isl_pw_multi_aff_free(pma);
3405 /* Extend the local space of "dst" to include the divs
3406 * in the local space of "src".
3408 __isl_give isl_aff *isl_aff_align_divs(__isl_take isl_aff *dst,
3409 __isl_keep isl_aff *src)
3417 return isl_aff_free(dst);
3419 ctx = isl_aff_get_ctx(src);
3420 if (!isl_space_is_equal(src->ls->dim, dst->ls->dim))
3421 isl_die(ctx, isl_error_invalid,
3422 "spaces don't match", goto error);
3424 if (src->ls->div->n_row == 0)
3427 exp1 = isl_alloc_array(ctx, int, src->ls->div->n_row);
3428 exp2 = isl_alloc_array(ctx, int, dst->ls->div->n_row);
3432 div = isl_merge_divs(src->ls->div, dst->ls->div, exp1, exp2);
3433 dst = isl_aff_expand_divs(dst, div, exp2);
3441 return isl_aff_free(dst);
3444 /* Adjust the local spaces of the affine expressions in "maff"
3445 * such that they all have the save divs.
3447 __isl_give isl_multi_aff *isl_multi_aff_align_divs(
3448 __isl_take isl_multi_aff *maff)
3456 maff = isl_multi_aff_cow(maff);
3460 for (i = 1; i < maff->n; ++i)
3461 maff->p[0] = isl_aff_align_divs(maff->p[0], maff->p[i]);
3462 for (i = 1; i < maff->n; ++i) {
3463 maff->p[i] = isl_aff_align_divs(maff->p[i], maff->p[0]);
3465 return isl_multi_aff_free(maff);
3471 __isl_give isl_aff *isl_aff_lift(__isl_take isl_aff *aff)
3473 aff = isl_aff_cow(aff);
3477 aff->ls = isl_local_space_lift(aff->ls);
3479 return isl_aff_free(aff);
3484 /* Lift "maff" to a space with extra dimensions such that the result
3485 * has no more existentially quantified variables.
3486 * If "ls" is not NULL, then *ls is assigned the local space that lies
3487 * at the basis of the lifting applied to "maff".
3489 __isl_give isl_multi_aff *isl_multi_aff_lift(__isl_take isl_multi_aff *maff,
3490 __isl_give isl_local_space **ls)
3504 isl_space *space = isl_multi_aff_get_domain_space(maff);
3505 *ls = isl_local_space_from_space(space);
3507 return isl_multi_aff_free(maff);
3512 maff = isl_multi_aff_cow(maff);
3513 maff = isl_multi_aff_align_divs(maff);
3517 n_div = isl_aff_dim(maff->p[0], isl_dim_div);
3518 space = isl_multi_aff_get_space(maff);
3519 space = isl_space_lift(isl_space_domain(space), n_div);
3520 space = isl_space_extend_domain_with_range(space,
3521 isl_multi_aff_get_space(maff));
3523 return isl_multi_aff_free(maff);
3524 isl_space_free(maff->space);
3525 maff->space = space;
3528 *ls = isl_aff_get_domain_local_space(maff->p[0]);
3530 return isl_multi_aff_free(maff);
3533 for (i = 0; i < maff->n; ++i) {
3534 maff->p[i] = isl_aff_lift(maff->p[i]);
3542 isl_local_space_free(*ls);
3543 return isl_multi_aff_free(maff);
3547 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
3549 __isl_give isl_pw_aff *isl_pw_multi_aff_get_pw_aff(
3550 __isl_keep isl_pw_multi_aff *pma, int pos)
3560 n_out = isl_pw_multi_aff_dim(pma, isl_dim_out);
3561 if (pos < 0 || pos >= n_out)
3562 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
3563 "index out of bounds", return NULL);
3565 space = isl_pw_multi_aff_get_space(pma);
3566 space = isl_space_drop_dims(space, isl_dim_out,
3567 pos + 1, n_out - pos - 1);
3568 space = isl_space_drop_dims(space, isl_dim_out, 0, pos);
3570 pa = isl_pw_aff_alloc_size(space, pma->n);
3571 for (i = 0; i < pma->n; ++i) {
3573 aff = isl_multi_aff_get_aff(pma->p[i].maff, pos);
3574 pa = isl_pw_aff_add_piece(pa, isl_set_copy(pma->p[i].set), aff);
3580 /* Return an isl_pw_multi_aff with the given "set" as domain and
3581 * an unnamed zero-dimensional range.
3583 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_domain(
3584 __isl_take isl_set *set)
3589 space = isl_set_get_space(set);
3590 space = isl_space_from_domain(space);
3591 ma = isl_multi_aff_zero(space);
3592 return isl_pw_multi_aff_alloc(set, ma);
3595 /* Add an isl_pw_multi_aff with the given "set" as domain and
3596 * an unnamed zero-dimensional range to *user.
3598 static int add_pw_multi_aff_from_domain(__isl_take isl_set *set, void *user)
3600 isl_union_pw_multi_aff **upma = user;
3601 isl_pw_multi_aff *pma;
3603 pma = isl_pw_multi_aff_from_domain(set);
3604 *upma = isl_union_pw_multi_aff_add_pw_multi_aff(*upma, pma);
3609 /* Return an isl_union_pw_multi_aff with the given "uset" as domain and
3610 * an unnamed zero-dimensional range.
3612 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_domain(
3613 __isl_take isl_union_set *uset)
3616 isl_union_pw_multi_aff *upma;
3621 space = isl_union_set_get_space(uset);
3622 upma = isl_union_pw_multi_aff_empty(space);
3624 if (isl_union_set_foreach_set(uset,
3625 &add_pw_multi_aff_from_domain, &upma) < 0)
3628 isl_union_set_free(uset);
3631 isl_union_set_free(uset);
3632 isl_union_pw_multi_aff_free(upma);
3636 /* Convert "pma" to an isl_map and add it to *umap.
3638 static int map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma, void *user)
3640 isl_union_map **umap = user;
3643 map = isl_map_from_pw_multi_aff(pma);
3644 *umap = isl_union_map_add_map(*umap, map);
3649 /* Construct a union map mapping the domain of the union
3650 * piecewise multi-affine expression to its range, with each dimension
3651 * in the range equated to the corresponding affine expression on its cell.
3653 __isl_give isl_union_map *isl_union_map_from_union_pw_multi_aff(
3654 __isl_take isl_union_pw_multi_aff *upma)
3657 isl_union_map *umap;
3662 space = isl_union_pw_multi_aff_get_space(upma);
3663 umap = isl_union_map_empty(space);
3665 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma,
3666 &map_from_pw_multi_aff, &umap) < 0)
3669 isl_union_pw_multi_aff_free(upma);
3672 isl_union_pw_multi_aff_free(upma);
3673 isl_union_map_free(umap);
3677 /* Local data for bin_entry and the callback "fn".
3679 struct isl_union_pw_multi_aff_bin_data {
3680 isl_union_pw_multi_aff *upma2;
3681 isl_union_pw_multi_aff *res;
3682 isl_pw_multi_aff *pma;
3683 int (*fn)(void **entry, void *user);
3686 /* Given an isl_pw_multi_aff from upma1, store it in data->pma
3687 * and call data->fn for each isl_pw_multi_aff in data->upma2.
3689 static int bin_entry(void **entry, void *user)
3691 struct isl_union_pw_multi_aff_bin_data *data = user;
3692 isl_pw_multi_aff *pma = *entry;
3695 if (isl_hash_table_foreach(data->upma2->dim->ctx, &data->upma2->table,
3696 data->fn, data) < 0)
3702 /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2".
3703 * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is
3704 * passed as user field) and the isl_pw_multi_aff from upma2 is available
3705 * as *entry. The callback should adjust data->res if desired.
3707 static __isl_give isl_union_pw_multi_aff *bin_op(
3708 __isl_take isl_union_pw_multi_aff *upma1,
3709 __isl_take isl_union_pw_multi_aff *upma2,
3710 int (*fn)(void **entry, void *user))
3713 struct isl_union_pw_multi_aff_bin_data data = { NULL, NULL, NULL, fn };
3715 space = isl_union_pw_multi_aff_get_space(upma2);
3716 upma1 = isl_union_pw_multi_aff_align_params(upma1, space);
3717 space = isl_union_pw_multi_aff_get_space(upma1);
3718 upma2 = isl_union_pw_multi_aff_align_params(upma2, space);
3720 if (!upma1 || !upma2)
3724 data.res = isl_union_pw_multi_aff_alloc(isl_space_copy(upma1->dim),
3726 if (isl_hash_table_foreach(upma1->dim->ctx, &upma1->table,
3727 &bin_entry, &data) < 0)
3730 isl_union_pw_multi_aff_free(upma1);
3731 isl_union_pw_multi_aff_free(upma2);
3734 isl_union_pw_multi_aff_free(upma1);
3735 isl_union_pw_multi_aff_free(upma2);
3736 isl_union_pw_multi_aff_free(data.res);
3740 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
3741 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
3743 static __isl_give isl_pw_multi_aff *pw_multi_aff_range_product(
3744 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3748 space = isl_space_range_product(isl_pw_multi_aff_get_space(pma1),
3749 isl_pw_multi_aff_get_space(pma2));
3750 return isl_pw_multi_aff_on_shared_domain_in(pma1, pma2, space,
3751 &isl_multi_aff_range_product);
3754 /* Given two isl_pw_multi_affs A -> B and C -> D,
3755 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
3757 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_range_product(
3758 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3760 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3761 &pw_multi_aff_range_product);
3764 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
3765 * construct an isl_pw_multi_aff (A * C) -> (B, D).
3767 static __isl_give isl_pw_multi_aff *pw_multi_aff_flat_range_product(
3768 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3772 space = isl_space_range_product(isl_pw_multi_aff_get_space(pma1),
3773 isl_pw_multi_aff_get_space(pma2));
3774 space = isl_space_flatten_range(space);
3775 return isl_pw_multi_aff_on_shared_domain_in(pma1, pma2, space,
3776 &isl_multi_aff_flat_range_product);
3779 /* Given two isl_pw_multi_affs A -> B and C -> D,
3780 * construct an isl_pw_multi_aff (A * C) -> (B, D).
3782 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_flat_range_product(
3783 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3785 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3786 &pw_multi_aff_flat_range_product);
3789 /* If data->pma and *entry have the same domain space, then compute
3790 * their flat range product and the result to data->res.
3792 static int flat_range_product_entry(void **entry, void *user)
3794 struct isl_union_pw_multi_aff_bin_data *data = user;
3795 isl_pw_multi_aff *pma2 = *entry;
3797 if (!isl_space_tuple_match(data->pma->dim, isl_dim_in,
3798 pma2->dim, isl_dim_in))
3801 pma2 = isl_pw_multi_aff_flat_range_product(
3802 isl_pw_multi_aff_copy(data->pma),
3803 isl_pw_multi_aff_copy(pma2));
3805 data->res = isl_union_pw_multi_aff_add_pw_multi_aff(data->res, pma2);
3810 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
3811 * construct an isl_union_pw_multi_aff (A * C) -> (B, D).
3813 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_flat_range_product(
3814 __isl_take isl_union_pw_multi_aff *upma1,
3815 __isl_take isl_union_pw_multi_aff *upma2)
3817 return bin_op(upma1, upma2, &flat_range_product_entry);
3820 /* Replace the affine expressions at position "pos" in "pma" by "pa".
3821 * The parameters are assumed to have been aligned.
3823 * The implementation essentially performs an isl_pw_*_on_shared_domain,
3824 * except that it works on two different isl_pw_* types.
3826 static __isl_give isl_pw_multi_aff *pw_multi_aff_set_pw_aff(
3827 __isl_take isl_pw_multi_aff *pma, unsigned pos,
3828 __isl_take isl_pw_aff *pa)
3831 isl_pw_multi_aff *res = NULL;
3836 if (!isl_space_tuple_match(pma->dim, isl_dim_in, pa->dim, isl_dim_in))
3837 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
3838 "domains don't match", goto error);
3839 if (pos >= isl_pw_multi_aff_dim(pma, isl_dim_out))
3840 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
3841 "index out of bounds", goto error);
3844 res = isl_pw_multi_aff_alloc_size(isl_pw_multi_aff_get_space(pma), n);
3846 for (i = 0; i < pma->n; ++i) {
3847 for (j = 0; j < pa->n; ++j) {
3849 isl_multi_aff *res_ij;
3852 common = isl_set_intersect(isl_set_copy(pma->p[i].set),
3853 isl_set_copy(pa->p[j].set));
3854 empty = isl_set_plain_is_empty(common);
3855 if (empty < 0 || empty) {
3856 isl_set_free(common);
3862 res_ij = isl_multi_aff_set_aff(
3863 isl_multi_aff_copy(pma->p[i].maff), pos,
3864 isl_aff_copy(pa->p[j].aff));
3865 res_ij = isl_multi_aff_gist(res_ij,
3866 isl_set_copy(common));
3868 res = isl_pw_multi_aff_add_piece(res, common, res_ij);
3872 isl_pw_multi_aff_free(pma);
3873 isl_pw_aff_free(pa);
3876 isl_pw_multi_aff_free(pma);
3877 isl_pw_aff_free(pa);
3878 return isl_pw_multi_aff_free(res);
3881 /* Replace the affine expressions at position "pos" in "pma" by "pa".
3883 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_set_pw_aff(
3884 __isl_take isl_pw_multi_aff *pma, unsigned pos,
3885 __isl_take isl_pw_aff *pa)
3889 if (isl_space_match(pma->dim, isl_dim_param, pa->dim, isl_dim_param))
3890 return pw_multi_aff_set_pw_aff(pma, pos, pa);
3891 if (!isl_space_has_named_params(pma->dim) ||
3892 !isl_space_has_named_params(pa->dim))
3893 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
3894 "unaligned unnamed parameters", goto error);
3895 pma = isl_pw_multi_aff_align_params(pma, isl_pw_aff_get_space(pa));
3896 pa = isl_pw_aff_align_params(pa, isl_pw_multi_aff_get_space(pma));
3897 return pw_multi_aff_set_pw_aff(pma, pos, pa);
3899 isl_pw_multi_aff_free(pma);
3900 isl_pw_aff_free(pa);
3907 #include <isl_multi_templ.c>