add isl_multi_aff_lex_{le,ge}_set
[isl.git] / isl_aff.c
blob03516b1c5be3dc25f88763f9e42a16e7d6589648
1 /*
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 GNU LGPLv2.1 license
8 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
9 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
10 * 91893 Orsay, France
11 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
14 #include <isl_ctx_private.h>
15 #define ISL_DIM_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>
24 #include <isl/seq.h>
25 #include <isl/set.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)
31 isl_aff *aff;
33 if (!ls || !v)
34 goto error;
36 aff = isl_calloc_type(v->ctx, struct isl_aff);
37 if (!aff)
38 goto error;
40 aff->ref = 1;
41 aff->ls = ls;
42 aff->v = v;
44 return aff;
45 error:
46 isl_local_space_free(ls);
47 isl_vec_free(v);
48 return NULL;
51 __isl_give isl_aff *isl_aff_alloc(__isl_take isl_local_space *ls)
53 isl_ctx *ctx;
54 isl_vec *v;
55 unsigned total;
57 if (!ls)
58 return NULL;
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",
63 goto error);
64 if (!isl_local_space_is_set(ls))
65 isl_die(ctx, isl_error_invalid,
66 "domain of affine expression should be a set",
67 goto error);
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);
72 error:
73 isl_local_space_free(ls);
74 return NULL;
77 __isl_give isl_aff *isl_aff_zero_on_domain(__isl_take isl_local_space *ls)
79 isl_aff *aff;
81 aff = isl_aff_alloc(ls);
82 if (!aff)
83 return NULL;
85 isl_int_set_si(aff->v->el[0], 1);
86 isl_seq_clr(aff->v->el + 1, aff->v->size - 1);
88 return aff;
91 __isl_give isl_aff *isl_aff_copy(__isl_keep isl_aff *aff)
93 if (!aff)
94 return NULL;
96 aff->ref++;
97 return aff;
100 __isl_give isl_aff *isl_aff_dup(__isl_keep isl_aff *aff)
102 if (!aff)
103 return NULL;
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)
111 if (!aff)
112 return NULL;
114 if (aff->ref == 1)
115 return aff;
116 aff->ref--;
117 return isl_aff_dup(aff);
120 void *isl_aff_free(__isl_take isl_aff *aff)
122 if (!aff)
123 return NULL;
125 if (--aff->ref > 0)
126 return NULL;
128 isl_local_space_free(aff->ls);
129 isl_vec_free(aff->v);
131 free(aff);
133 return NULL;
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)
146 if (!aff)
147 return 0;
148 if (type == isl_dim_out)
149 return 1;
150 if (type == isl_dim_in)
151 type = isl_dim_set;
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)
162 isl_space *space;
163 if (!aff)
164 return NULL;
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);
168 return space;
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)
179 isl_local_space *ls;
180 if (!aff)
181 return NULL;
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);
185 return ls;
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)
194 if (!aff)
195 return NULL;
196 if (type == isl_dim_out)
197 return NULL;
198 if (type == isl_dim_in)
199 type = isl_dim_set;
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);
207 if (!aff || !dim)
208 goto error;
210 aff->ls = isl_local_space_reset_space(aff->ls, dim);
211 if (!aff->ls)
212 return isl_aff_free(aff);
214 return aff;
215 error:
216 isl_aff_free(aff);
217 isl_space_free(dim);
218 return NULL;
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
235 * variables.
237 static __isl_give isl_vec *vec_reorder(__isl_take isl_vec *vec,
238 __isl_take isl_reordering *r, int n_div)
240 isl_vec *res;
241 int i;
243 if (!vec || !r)
244 goto error;
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);
254 isl_vec_free(vec);
255 return res;
256 error:
257 isl_vec_free(vec);
258 isl_reordering_free(r);
259 return NULL;
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);
269 if (!aff)
270 goto error;
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);
280 return aff;
281 error:
282 isl_aff_free(aff);
283 isl_reordering_free(r);
284 return NULL;
287 __isl_give isl_aff *isl_aff_align_params(__isl_take isl_aff *aff,
288 __isl_take isl_space *model)
290 if (!aff || !model)
291 goto error;
293 if (!isl_space_match(aff->ls->dim, isl_dim_param,
294 model, isl_dim_param)) {
295 isl_reordering *exp;
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);
308 return aff;
309 error:
310 isl_space_free(model);
311 isl_aff_free(aff);
312 return NULL;
315 int isl_aff_plain_is_zero(__isl_keep isl_aff *aff)
317 if (!aff)
318 return -1;
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)
325 int equal;
327 if (!aff1 || !aff2)
328 return -1;
330 equal = isl_local_space_is_equal(aff1->ls, aff2->ls);
331 if (equal < 0 || !equal)
332 return 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)
339 if (!aff)
340 return -1;
341 isl_int_set(*v, aff->v->el[0]);
342 return 0;
345 int isl_aff_get_constant(__isl_keep isl_aff *aff, isl_int *v)
347 if (!aff)
348 return -1;
349 isl_int_set(*v, aff->v->el[1]);
350 return 0;
353 int isl_aff_get_coefficient(__isl_keep isl_aff *aff,
354 enum isl_dim_type type, int pos, isl_int *v)
356 if (!aff)
357 return -1;
359 if (type == isl_dim_out)
360 isl_die(aff->v->ctx, isl_error_invalid,
361 "output/set dimension does not have a coefficient",
362 return -1);
363 if (type == isl_dim_in)
364 type = isl_dim_set;
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]);
373 return 0;
376 __isl_give isl_aff *isl_aff_set_denominator(__isl_take isl_aff *aff, isl_int v)
378 aff = isl_aff_cow(aff);
379 if (!aff)
380 return NULL;
382 aff->v = isl_vec_cow(aff->v);
383 if (!aff->v)
384 return isl_aff_free(aff);
386 isl_int_set(aff->v->el[0], v);
388 return aff;
391 __isl_give isl_aff *isl_aff_set_constant(__isl_take isl_aff *aff, isl_int v)
393 aff = isl_aff_cow(aff);
394 if (!aff)
395 return NULL;
397 aff->v = isl_vec_cow(aff->v);
398 if (!aff->v)
399 return isl_aff_free(aff);
401 isl_int_set(aff->v->el[1], v);
403 return aff;
406 __isl_give isl_aff *isl_aff_add_constant(__isl_take isl_aff *aff, isl_int v)
408 if (isl_int_is_zero(v))
409 return aff;
411 aff = isl_aff_cow(aff);
412 if (!aff)
413 return NULL;
415 aff->v = isl_vec_cow(aff->v);
416 if (!aff->v)
417 return isl_aff_free(aff);
419 isl_int_addmul(aff->v->el[1], aff->v->el[0], v);
421 return aff;
424 __isl_give isl_aff *isl_aff_add_constant_si(__isl_take isl_aff *aff, int v)
426 isl_int t;
428 isl_int_init(t);
429 isl_int_set_si(t, v);
430 aff = isl_aff_add_constant(aff, t);
431 isl_int_clear(t);
433 return aff;
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))
441 return aff;
443 aff = isl_aff_cow(aff);
444 if (!aff)
445 return NULL;
447 aff->v = isl_vec_cow(aff->v);
448 if (!aff->v)
449 return isl_aff_free(aff);
451 isl_int_add(aff->v->el[1], aff->v->el[1], v);
453 return aff;
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)
460 isl_int t;
462 if (v == 0)
463 return aff;
465 isl_int_init(t);
466 isl_int_set_si(t, v);
467 aff = isl_aff_add_constant_num(aff, t);
468 isl_int_clear(t);
470 return aff;
473 __isl_give isl_aff *isl_aff_set_constant_si(__isl_take isl_aff *aff, int v)
475 aff = isl_aff_cow(aff);
476 if (!aff)
477 return NULL;
479 aff->v = isl_vec_cow(aff->v);
480 if (!aff->v)
481 return isl_aff_free(aff);
483 isl_int_set_si(aff->v->el[1], v);
485 return aff;
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)
491 if (!aff)
492 return NULL;
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)
499 type = isl_dim_set;
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);
506 if (!aff)
507 return NULL;
509 aff->v = isl_vec_cow(aff->v);
510 if (!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);
516 return aff;
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)
522 if (!aff)
523 return NULL;
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)
530 type = isl_dim_set;
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);
537 if (!aff)
538 return NULL;
540 aff->v = isl_vec_cow(aff->v);
541 if (!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);
547 return aff;
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)
553 if (!aff)
554 return NULL;
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)
561 type = isl_dim_set;
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);
568 if (!aff)
569 return NULL;
571 aff->v = isl_vec_cow(aff->v);
572 if (!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);
578 return aff;
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)
584 isl_int t;
586 isl_int_init(t);
587 isl_int_set_si(t, v);
588 aff = isl_aff_add_coefficient(aff, type, pos, t);
589 isl_int_clear(t);
591 return aff;
594 __isl_give isl_aff *isl_aff_get_div(__isl_keep isl_aff *aff, int pos)
596 if (!aff)
597 return NULL;
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);
605 if (!aff)
606 return NULL;
607 aff->v = isl_vec_cow(aff->v);
608 if (!aff->v)
609 return isl_aff_free(aff);
611 isl_seq_neg(aff->v->el + 1, aff->v->el + 1, aff->v->size - 1);
613 return aff;
616 /* Remove divs from the local space that do not appear in the affine
617 * expression.
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)
625 int pos;
626 int off;
627 int n;
629 if (!aff)
630 return NULL;
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;
636 if (pos == n)
637 return aff;
639 aff = isl_aff_cow(aff);
640 if (!aff)
641 return NULL;
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);
648 return aff;
651 __isl_give isl_aff *isl_aff_normalize(__isl_take isl_aff *aff)
653 if (!aff)
654 return NULL;
655 aff->v = isl_vec_normalize(aff->v);
656 if (!aff->v)
657 return isl_aff_free(aff);
658 aff = isl_aff_remove_unused_divs(aff);
659 return aff;
662 /* Given f, return floor(f).
663 * If f is an integer expression, then just return f.
664 * If f is a constant, then return the constant floor(f).
665 * Otherwise, if f = g/m, write g = q m + r,
666 * create a new div d = [r/m] and return the expression q + d.
667 * The coefficients in r are taken to lie between -m/2 and m/2.
669 __isl_give isl_aff *isl_aff_floor(__isl_take isl_aff *aff)
671 int i;
672 int size;
673 isl_ctx *ctx;
674 isl_vec *div;
676 if (!aff)
677 return NULL;
679 if (isl_int_is_one(aff->v->el[0]))
680 return aff;
682 aff = isl_aff_cow(aff);
683 if (!aff)
684 return NULL;
686 aff->v = isl_vec_cow(aff->v);
687 if (!aff->v)
688 return isl_aff_free(aff);
690 if (isl_aff_is_cst(aff)) {
691 isl_int_fdiv_q(aff->v->el[1], aff->v->el[1], aff->v->el[0]);
692 isl_int_set_si(aff->v->el[0], 1);
693 return aff;
696 div = isl_vec_copy(aff->v);
697 div = isl_vec_cow(div);
698 if (!div)
699 return isl_aff_free(aff);
701 ctx = isl_aff_get_ctx(aff);
702 isl_int_fdiv_q(aff->v->el[0], aff->v->el[0], ctx->two);
703 for (i = 1; i < aff->v->size; ++i) {
704 isl_int_fdiv_r(div->el[i], div->el[i], div->el[0]);
705 isl_int_fdiv_q(aff->v->el[i], aff->v->el[i], div->el[0]);
706 if (isl_int_gt(div->el[i], aff->v->el[0])) {
707 isl_int_sub(div->el[i], div->el[i], div->el[0]);
708 isl_int_add_ui(aff->v->el[i], aff->v->el[i], 1);
712 aff->ls = isl_local_space_add_div(aff->ls, div);
713 if (!aff->ls)
714 return isl_aff_free(aff);
716 size = aff->v->size;
717 aff->v = isl_vec_extend(aff->v, size + 1);
718 if (!aff->v)
719 return isl_aff_free(aff);
720 isl_int_set_si(aff->v->el[0], 1);
721 isl_int_set_si(aff->v->el[size], 1);
723 return aff;
726 /* Compute
728 * aff mod m = aff - m * floor(aff/m)
730 __isl_give isl_aff *isl_aff_mod(__isl_take isl_aff *aff, isl_int m)
732 isl_aff *res;
734 res = isl_aff_copy(aff);
735 aff = isl_aff_scale_down(aff, m);
736 aff = isl_aff_floor(aff);
737 aff = isl_aff_scale(aff, m);
738 res = isl_aff_sub(res, aff);
740 return res;
743 /* Compute
745 * pwaff mod m = pwaff - m * floor(pwaff/m)
747 __isl_give isl_pw_aff *isl_pw_aff_mod(__isl_take isl_pw_aff *pwaff, isl_int m)
749 isl_pw_aff *res;
751 res = isl_pw_aff_copy(pwaff);
752 pwaff = isl_pw_aff_scale_down(pwaff, m);
753 pwaff = isl_pw_aff_floor(pwaff);
754 pwaff = isl_pw_aff_scale(pwaff, m);
755 res = isl_pw_aff_sub(res, pwaff);
757 return res;
760 /* Given f, return ceil(f).
761 * If f is an integer expression, then just return f.
762 * Otherwise, create a new div d = [-f] and return the expression -d.
764 __isl_give isl_aff *isl_aff_ceil(__isl_take isl_aff *aff)
766 if (!aff)
767 return NULL;
769 if (isl_int_is_one(aff->v->el[0]))
770 return aff;
772 aff = isl_aff_neg(aff);
773 aff = isl_aff_floor(aff);
774 aff = isl_aff_neg(aff);
776 return aff;
779 /* Apply the expansion computed by isl_merge_divs.
780 * The expansion itself is given by "exp" while the resulting
781 * list of divs is given by "div".
783 __isl_give isl_aff *isl_aff_expand_divs( __isl_take isl_aff *aff,
784 __isl_take isl_mat *div, int *exp)
786 int i, j;
787 int old_n_div;
788 int new_n_div;
789 int offset;
791 aff = isl_aff_cow(aff);
792 if (!aff || !div)
793 goto error;
795 old_n_div = isl_local_space_dim(aff->ls, isl_dim_div);
796 new_n_div = isl_mat_rows(div);
797 if (new_n_div < old_n_div)
798 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
799 "not an expansion", goto error);
801 aff->v = isl_vec_extend(aff->v, aff->v->size + new_n_div - old_n_div);
802 if (!aff->v)
803 goto error;
805 offset = 1 + isl_local_space_offset(aff->ls, isl_dim_div);
806 j = old_n_div - 1;
807 for (i = new_n_div - 1; i >= 0; --i) {
808 if (j >= 0 && exp[j] == i) {
809 if (i != j)
810 isl_int_swap(aff->v->el[offset + i],
811 aff->v->el[offset + j]);
812 j--;
813 } else
814 isl_int_set_si(aff->v->el[offset + i], 0);
817 aff->ls = isl_local_space_replace_divs(aff->ls, isl_mat_copy(div));
818 if (!aff->ls)
819 goto error;
820 isl_mat_free(div);
821 return aff;
822 error:
823 isl_aff_free(aff);
824 isl_mat_free(div);
825 return NULL;
828 /* Add two affine expressions that live in the same local space.
830 static __isl_give isl_aff *add_expanded(__isl_take isl_aff *aff1,
831 __isl_take isl_aff *aff2)
833 isl_int gcd, f;
835 aff1 = isl_aff_cow(aff1);
836 if (!aff1 || !aff2)
837 goto error;
839 aff1->v = isl_vec_cow(aff1->v);
840 if (!aff1->v)
841 goto error;
843 isl_int_init(gcd);
844 isl_int_init(f);
845 isl_int_gcd(gcd, aff1->v->el[0], aff2->v->el[0]);
846 isl_int_divexact(f, aff2->v->el[0], gcd);
847 isl_seq_scale(aff1->v->el + 1, aff1->v->el + 1, f, aff1->v->size - 1);
848 isl_int_divexact(f, aff1->v->el[0], gcd);
849 isl_seq_addmul(aff1->v->el + 1, f, aff2->v->el + 1, aff1->v->size - 1);
850 isl_int_divexact(f, aff2->v->el[0], gcd);
851 isl_int_mul(aff1->v->el[0], aff1->v->el[0], f);
852 isl_int_clear(f);
853 isl_int_clear(gcd);
855 isl_aff_free(aff2);
856 return aff1;
857 error:
858 isl_aff_free(aff1);
859 isl_aff_free(aff2);
860 return NULL;
863 __isl_give isl_aff *isl_aff_add(__isl_take isl_aff *aff1,
864 __isl_take isl_aff *aff2)
866 isl_ctx *ctx;
867 int *exp1 = NULL;
868 int *exp2 = NULL;
869 isl_mat *div;
871 if (!aff1 || !aff2)
872 goto error;
874 ctx = isl_aff_get_ctx(aff1);
875 if (!isl_space_is_equal(aff1->ls->dim, aff2->ls->dim))
876 isl_die(ctx, isl_error_invalid,
877 "spaces don't match", goto error);
879 if (aff1->ls->div->n_row == 0 && aff2->ls->div->n_row == 0)
880 return add_expanded(aff1, aff2);
882 exp1 = isl_alloc_array(ctx, int, aff1->ls->div->n_row);
883 exp2 = isl_alloc_array(ctx, int, aff2->ls->div->n_row);
884 if (!exp1 || !exp2)
885 goto error;
887 div = isl_merge_divs(aff1->ls->div, aff2->ls->div, exp1, exp2);
888 aff1 = isl_aff_expand_divs(aff1, isl_mat_copy(div), exp1);
889 aff2 = isl_aff_expand_divs(aff2, div, exp2);
890 free(exp1);
891 free(exp2);
893 return add_expanded(aff1, aff2);
894 error:
895 free(exp1);
896 free(exp2);
897 isl_aff_free(aff1);
898 isl_aff_free(aff2);
899 return NULL;
902 __isl_give isl_aff *isl_aff_sub(__isl_take isl_aff *aff1,
903 __isl_take isl_aff *aff2)
905 return isl_aff_add(aff1, isl_aff_neg(aff2));
908 __isl_give isl_aff *isl_aff_scale(__isl_take isl_aff *aff, isl_int f)
910 isl_int gcd;
912 if (isl_int_is_one(f))
913 return aff;
915 aff = isl_aff_cow(aff);
916 if (!aff)
917 return NULL;
918 aff->v = isl_vec_cow(aff->v);
919 if (!aff->v)
920 return isl_aff_free(aff);
922 isl_int_init(gcd);
923 isl_int_gcd(gcd, aff->v->el[0], f);
924 isl_int_divexact(aff->v->el[0], aff->v->el[0], gcd);
925 isl_int_divexact(gcd, f, gcd);
926 isl_seq_scale(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
927 isl_int_clear(gcd);
929 return aff;
932 __isl_give isl_aff *isl_aff_scale_down(__isl_take isl_aff *aff, isl_int f)
934 isl_int gcd;
936 if (isl_int_is_one(f))
937 return aff;
939 aff = isl_aff_cow(aff);
940 if (!aff)
941 return NULL;
942 aff->v = isl_vec_cow(aff->v);
943 if (!aff->v)
944 return isl_aff_free(aff);
946 isl_int_init(gcd);
947 isl_seq_gcd(aff->v->el + 1, aff->v->size - 1, &gcd);
948 isl_int_gcd(gcd, gcd, f);
949 isl_seq_scale_down(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
950 isl_int_divexact(gcd, f, gcd);
951 isl_int_mul(aff->v->el[0], aff->v->el[0], gcd);
952 isl_int_clear(gcd);
954 return aff;
957 __isl_give isl_aff *isl_aff_scale_down_ui(__isl_take isl_aff *aff, unsigned f)
959 isl_int v;
961 if (f == 1)
962 return aff;
964 isl_int_init(v);
965 isl_int_set_ui(v, f);
966 aff = isl_aff_scale_down(aff, v);
967 isl_int_clear(v);
969 return aff;
972 __isl_give isl_aff *isl_aff_set_dim_name(__isl_take isl_aff *aff,
973 enum isl_dim_type type, unsigned pos, const char *s)
975 aff = isl_aff_cow(aff);
976 if (!aff)
977 return NULL;
978 if (type == isl_dim_out)
979 isl_die(aff->v->ctx, isl_error_invalid,
980 "cannot set name of output/set dimension",
981 return isl_aff_free(aff));
982 if (type == isl_dim_in)
983 type = isl_dim_set;
984 aff->ls = isl_local_space_set_dim_name(aff->ls, type, pos, s);
985 if (!aff->ls)
986 return isl_aff_free(aff);
988 return aff;
991 __isl_give isl_aff *isl_aff_set_dim_id(__isl_take isl_aff *aff,
992 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
994 aff = isl_aff_cow(aff);
995 if (!aff)
996 return isl_id_free(id);
997 if (type == isl_dim_out)
998 isl_die(aff->v->ctx, isl_error_invalid,
999 "cannot set name of output/set dimension",
1000 goto error);
1001 if (type == isl_dim_in)
1002 type = isl_dim_set;
1003 aff->ls = isl_local_space_set_dim_id(aff->ls, type, pos, id);
1004 if (!aff->ls)
1005 return isl_aff_free(aff);
1007 return aff;
1008 error:
1009 isl_id_free(id);
1010 isl_aff_free(aff);
1011 return NULL;
1014 /* Exploit the equalities in "eq" to simplify the affine expression
1015 * and the expressions of the integer divisions in the local space.
1016 * The integer divisions in this local space are assumed to appear
1017 * as regular dimensions in "eq".
1019 static __isl_give isl_aff *isl_aff_substitute_equalities_lifted(
1020 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
1022 int i, j;
1023 unsigned total;
1024 unsigned n_div;
1026 if (!eq)
1027 goto error;
1028 if (eq->n_eq == 0) {
1029 isl_basic_set_free(eq);
1030 return aff;
1033 aff = isl_aff_cow(aff);
1034 if (!aff)
1035 goto error;
1037 aff->ls = isl_local_space_substitute_equalities(aff->ls,
1038 isl_basic_set_copy(eq));
1039 if (!aff->ls)
1040 goto error;
1042 total = 1 + isl_space_dim(eq->dim, isl_dim_all);
1043 n_div = eq->n_div;
1044 for (i = 0; i < eq->n_eq; ++i) {
1045 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
1046 if (j < 0 || j == 0 || j >= total)
1047 continue;
1049 isl_seq_elim(aff->v->el + 1, eq->eq[i], j, total,
1050 &aff->v->el[0]);
1053 isl_basic_set_free(eq);
1054 aff = isl_aff_normalize(aff);
1055 return aff;
1056 error:
1057 isl_basic_set_free(eq);
1058 isl_aff_free(aff);
1059 return NULL;
1062 /* Exploit the equalities in "eq" to simplify the affine expression
1063 * and the expressions of the integer divisions in the local space.
1065 static __isl_give isl_aff *isl_aff_substitute_equalities(
1066 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
1068 int n_div;
1070 if (!aff || !eq)
1071 goto error;
1072 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
1073 if (n_div > 0)
1074 eq = isl_basic_set_add(eq, isl_dim_set, n_div);
1075 return isl_aff_substitute_equalities_lifted(aff, eq);
1076 error:
1077 isl_basic_set_free(eq);
1078 isl_aff_free(aff);
1079 return NULL;
1082 /* Look for equalities among the variables shared by context and aff
1083 * and the integer divisions of aff, if any.
1084 * The equalities are then used to eliminate coefficients and/or integer
1085 * divisions from aff.
1087 __isl_give isl_aff *isl_aff_gist(__isl_take isl_aff *aff,
1088 __isl_take isl_set *context)
1090 isl_basic_set *hull;
1091 int n_div;
1093 if (!aff)
1094 goto error;
1095 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
1096 if (n_div > 0) {
1097 isl_basic_set *bset;
1098 isl_local_space *ls;
1099 context = isl_set_add_dims(context, isl_dim_set, n_div);
1100 ls = isl_aff_get_domain_local_space(aff);
1101 bset = isl_basic_set_from_local_space(ls);
1102 bset = isl_basic_set_lift(bset);
1103 bset = isl_basic_set_flatten(bset);
1104 context = isl_set_intersect(context,
1105 isl_set_from_basic_set(bset));
1108 hull = isl_set_affine_hull(context);
1109 return isl_aff_substitute_equalities_lifted(aff, hull);
1110 error:
1111 isl_aff_free(aff);
1112 isl_set_free(context);
1113 return NULL;
1116 __isl_give isl_aff *isl_aff_gist_params(__isl_take isl_aff *aff,
1117 __isl_take isl_set *context)
1119 isl_set *dom_context = isl_set_universe(isl_aff_get_domain_space(aff));
1120 dom_context = isl_set_intersect_params(dom_context, context);
1121 return isl_aff_gist(aff, dom_context);
1124 /* Return a basic set containing those elements in the space
1125 * of aff where it is non-negative.
1127 __isl_give isl_basic_set *isl_aff_nonneg_basic_set(__isl_take isl_aff *aff)
1129 isl_constraint *ineq;
1130 isl_basic_set *bset;
1132 ineq = isl_inequality_from_aff(aff);
1134 bset = isl_basic_set_from_constraint(ineq);
1135 bset = isl_basic_set_simplify(bset);
1136 return bset;
1139 /* Return a basic set containing those elements in the domain space
1140 * of aff where it is negative.
1142 __isl_give isl_basic_set *isl_aff_neg_basic_set(__isl_take isl_aff *aff)
1144 aff = isl_aff_neg(aff);
1145 aff = isl_aff_add_constant_num_si(aff, -1);
1146 return isl_aff_nonneg_basic_set(aff);
1149 /* Return a basic set containing those elements in the space
1150 * of aff where it is zero.
1152 __isl_give isl_basic_set *isl_aff_zero_basic_set(__isl_take isl_aff *aff)
1154 isl_constraint *ineq;
1155 isl_basic_set *bset;
1157 ineq = isl_equality_from_aff(aff);
1159 bset = isl_basic_set_from_constraint(ineq);
1160 bset = isl_basic_set_simplify(bset);
1161 return bset;
1164 /* Return a basic set containing those elements in the shared space
1165 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
1167 __isl_give isl_basic_set *isl_aff_ge_basic_set(__isl_take isl_aff *aff1,
1168 __isl_take isl_aff *aff2)
1170 aff1 = isl_aff_sub(aff1, aff2);
1172 return isl_aff_nonneg_basic_set(aff1);
1175 /* Return a basic set containing those elements in the shared space
1176 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
1178 __isl_give isl_basic_set *isl_aff_le_basic_set(__isl_take isl_aff *aff1,
1179 __isl_take isl_aff *aff2)
1181 return isl_aff_ge_basic_set(aff2, aff1);
1184 __isl_give isl_aff *isl_aff_add_on_domain(__isl_keep isl_set *dom,
1185 __isl_take isl_aff *aff1, __isl_take isl_aff *aff2)
1187 aff1 = isl_aff_add(aff1, aff2);
1188 aff1 = isl_aff_gist(aff1, isl_set_copy(dom));
1189 return aff1;
1192 int isl_aff_is_empty(__isl_keep isl_aff *aff)
1194 if (!aff)
1195 return -1;
1197 return 0;
1200 /* Check whether the given affine expression has non-zero coefficient
1201 * for any dimension in the given range or if any of these dimensions
1202 * appear with non-zero coefficients in any of the integer divisions
1203 * involved in the affine expression.
1205 int isl_aff_involves_dims(__isl_keep isl_aff *aff,
1206 enum isl_dim_type type, unsigned first, unsigned n)
1208 int i;
1209 isl_ctx *ctx;
1210 int *active = NULL;
1211 int involves = 0;
1213 if (!aff)
1214 return -1;
1215 if (n == 0)
1216 return 0;
1218 ctx = isl_aff_get_ctx(aff);
1219 if (first + n > isl_aff_dim(aff, type))
1220 isl_die(ctx, isl_error_invalid,
1221 "range out of bounds", return -1);
1223 active = isl_local_space_get_active(aff->ls, aff->v->el + 2);
1224 if (!active)
1225 goto error;
1227 first += isl_local_space_offset(aff->ls, type) - 1;
1228 for (i = 0; i < n; ++i)
1229 if (active[first + i]) {
1230 involves = 1;
1231 break;
1234 free(active);
1236 return involves;
1237 error:
1238 free(active);
1239 return -1;
1242 __isl_give isl_aff *isl_aff_drop_dims(__isl_take isl_aff *aff,
1243 enum isl_dim_type type, unsigned first, unsigned n)
1245 isl_ctx *ctx;
1247 if (!aff)
1248 return NULL;
1249 if (type == isl_dim_out)
1250 isl_die(aff->v->ctx, isl_error_invalid,
1251 "cannot drop output/set dimension",
1252 return isl_aff_free(aff));
1253 if (type == isl_dim_in)
1254 type = isl_dim_set;
1255 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
1256 return aff;
1258 ctx = isl_aff_get_ctx(aff);
1259 if (first + n > isl_local_space_dim(aff->ls, type))
1260 isl_die(ctx, isl_error_invalid, "range out of bounds",
1261 return isl_aff_free(aff));
1263 aff = isl_aff_cow(aff);
1264 if (!aff)
1265 return NULL;
1267 aff->ls = isl_local_space_drop_dims(aff->ls, type, first, n);
1268 if (!aff->ls)
1269 return isl_aff_free(aff);
1271 first += 1 + isl_local_space_offset(aff->ls, type);
1272 aff->v = isl_vec_drop_els(aff->v, first, n);
1273 if (!aff->v)
1274 return isl_aff_free(aff);
1276 return aff;
1279 /* Project the domain of the affine expression onto its parameter space.
1280 * The affine expression may not involve any of the domain dimensions.
1282 __isl_give isl_aff *isl_aff_project_domain_on_params(__isl_take isl_aff *aff)
1284 isl_space *space;
1285 unsigned n;
1286 int involves;
1288 n = isl_aff_dim(aff, isl_dim_in);
1289 involves = isl_aff_involves_dims(aff, isl_dim_in, 0, n);
1290 if (involves < 0)
1291 return isl_aff_free(aff);
1292 if (involves)
1293 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
1294 "affine expression involves some of the domain dimensions",
1295 return isl_aff_free(aff));
1296 aff = isl_aff_drop_dims(aff, isl_dim_in, 0, n);
1297 space = isl_aff_get_domain_space(aff);
1298 space = isl_space_params(space);
1299 aff = isl_aff_reset_domain_space(aff, space);
1300 return aff;
1303 __isl_give isl_aff *isl_aff_insert_dims(__isl_take isl_aff *aff,
1304 enum isl_dim_type type, unsigned first, unsigned n)
1306 isl_ctx *ctx;
1308 if (!aff)
1309 return NULL;
1310 if (type == isl_dim_out)
1311 isl_die(aff->v->ctx, isl_error_invalid,
1312 "cannot insert output/set dimensions",
1313 return isl_aff_free(aff));
1314 if (type == isl_dim_in)
1315 type = isl_dim_set;
1316 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
1317 return aff;
1319 ctx = isl_aff_get_ctx(aff);
1320 if (first > isl_local_space_dim(aff->ls, type))
1321 isl_die(ctx, isl_error_invalid, "position out of bounds",
1322 return isl_aff_free(aff));
1324 aff = isl_aff_cow(aff);
1325 if (!aff)
1326 return NULL;
1328 aff->ls = isl_local_space_insert_dims(aff->ls, type, first, n);
1329 if (!aff->ls)
1330 return isl_aff_free(aff);
1332 first += 1 + isl_local_space_offset(aff->ls, type);
1333 aff->v = isl_vec_insert_zero_els(aff->v, first, n);
1334 if (!aff->v)
1335 return isl_aff_free(aff);
1337 return aff;
1340 __isl_give isl_aff *isl_aff_add_dims(__isl_take isl_aff *aff,
1341 enum isl_dim_type type, unsigned n)
1343 unsigned pos;
1345 pos = isl_aff_dim(aff, type);
1347 return isl_aff_insert_dims(aff, type, pos, n);
1350 __isl_give isl_pw_aff *isl_pw_aff_add_dims(__isl_take isl_pw_aff *pwaff,
1351 enum isl_dim_type type, unsigned n)
1353 unsigned pos;
1355 pos = isl_pw_aff_dim(pwaff, type);
1357 return isl_pw_aff_insert_dims(pwaff, type, pos, n);
1360 __isl_give isl_pw_aff *isl_pw_aff_from_aff(__isl_take isl_aff *aff)
1362 isl_set *dom = isl_set_universe(isl_aff_get_domain_space(aff));
1363 return isl_pw_aff_alloc(dom, aff);
1366 #undef PW
1367 #define PW isl_pw_aff
1368 #undef EL
1369 #define EL isl_aff
1370 #undef EL_IS_ZERO
1371 #define EL_IS_ZERO is_empty
1372 #undef ZERO
1373 #define ZERO empty
1374 #undef IS_ZERO
1375 #define IS_ZERO is_empty
1376 #undef FIELD
1377 #define FIELD aff
1378 #undef DEFAULT_IS_ZERO
1379 #define DEFAULT_IS_ZERO 0
1381 #define NO_EVAL
1382 #define NO_OPT
1383 #define NO_MOVE_DIMS
1384 #define NO_LIFT
1385 #define NO_MORPH
1387 #include <isl_pw_templ.c>
1389 static __isl_give isl_set *align_params_pw_pw_set_and(
1390 __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2,
1391 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
1392 __isl_take isl_pw_aff *pwaff2))
1394 if (!pwaff1 || !pwaff2)
1395 goto error;
1396 if (isl_space_match(pwaff1->dim, isl_dim_param,
1397 pwaff2->dim, isl_dim_param))
1398 return fn(pwaff1, pwaff2);
1399 if (!isl_space_has_named_params(pwaff1->dim) ||
1400 !isl_space_has_named_params(pwaff2->dim))
1401 isl_die(isl_pw_aff_get_ctx(pwaff1), isl_error_invalid,
1402 "unaligned unnamed parameters", goto error);
1403 pwaff1 = isl_pw_aff_align_params(pwaff1, isl_pw_aff_get_space(pwaff2));
1404 pwaff2 = isl_pw_aff_align_params(pwaff2, isl_pw_aff_get_space(pwaff1));
1405 return fn(pwaff1, pwaff2);
1406 error:
1407 isl_pw_aff_free(pwaff1);
1408 isl_pw_aff_free(pwaff2);
1409 return NULL;
1412 /* Compute a piecewise quasi-affine expression with a domain that
1413 * is the union of those of pwaff1 and pwaff2 and such that on each
1414 * cell, the quasi-affine expression is the better (according to cmp)
1415 * of those of pwaff1 and pwaff2. If only one of pwaff1 or pwaff2
1416 * is defined on a given cell, then the associated expression
1417 * is the defined one.
1419 static __isl_give isl_pw_aff *pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
1420 __isl_take isl_pw_aff *pwaff2,
1421 __isl_give isl_basic_set *(*cmp)(__isl_take isl_aff *aff1,
1422 __isl_take isl_aff *aff2))
1424 int i, j, n;
1425 isl_pw_aff *res;
1426 isl_ctx *ctx;
1427 isl_set *set;
1429 if (!pwaff1 || !pwaff2)
1430 goto error;
1432 ctx = isl_space_get_ctx(pwaff1->dim);
1433 if (!isl_space_is_equal(pwaff1->dim, pwaff2->dim))
1434 isl_die(ctx, isl_error_invalid,
1435 "arguments should live in same space", goto error);
1437 if (isl_pw_aff_is_empty(pwaff1)) {
1438 isl_pw_aff_free(pwaff1);
1439 return pwaff2;
1442 if (isl_pw_aff_is_empty(pwaff2)) {
1443 isl_pw_aff_free(pwaff2);
1444 return pwaff1;
1447 n = 2 * (pwaff1->n + 1) * (pwaff2->n + 1);
1448 res = isl_pw_aff_alloc_size(isl_space_copy(pwaff1->dim), n);
1450 for (i = 0; i < pwaff1->n; ++i) {
1451 set = isl_set_copy(pwaff1->p[i].set);
1452 for (j = 0; j < pwaff2->n; ++j) {
1453 struct isl_set *common;
1454 isl_set *better;
1456 common = isl_set_intersect(
1457 isl_set_copy(pwaff1->p[i].set),
1458 isl_set_copy(pwaff2->p[j].set));
1459 better = isl_set_from_basic_set(cmp(
1460 isl_aff_copy(pwaff2->p[j].aff),
1461 isl_aff_copy(pwaff1->p[i].aff)));
1462 better = isl_set_intersect(common, better);
1463 if (isl_set_plain_is_empty(better)) {
1464 isl_set_free(better);
1465 continue;
1467 set = isl_set_subtract(set, isl_set_copy(better));
1469 res = isl_pw_aff_add_piece(res, better,
1470 isl_aff_copy(pwaff2->p[j].aff));
1472 res = isl_pw_aff_add_piece(res, set,
1473 isl_aff_copy(pwaff1->p[i].aff));
1476 for (j = 0; j < pwaff2->n; ++j) {
1477 set = isl_set_copy(pwaff2->p[j].set);
1478 for (i = 0; i < pwaff1->n; ++i)
1479 set = isl_set_subtract(set,
1480 isl_set_copy(pwaff1->p[i].set));
1481 res = isl_pw_aff_add_piece(res, set,
1482 isl_aff_copy(pwaff2->p[j].aff));
1485 isl_pw_aff_free(pwaff1);
1486 isl_pw_aff_free(pwaff2);
1488 return res;
1489 error:
1490 isl_pw_aff_free(pwaff1);
1491 isl_pw_aff_free(pwaff2);
1492 return NULL;
1495 /* Compute a piecewise quasi-affine expression with a domain that
1496 * is the union of those of pwaff1 and pwaff2 and such that on each
1497 * cell, the quasi-affine expression is the maximum of those of pwaff1
1498 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1499 * cell, then the associated expression is the defined one.
1501 static __isl_give isl_pw_aff *pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
1502 __isl_take isl_pw_aff *pwaff2)
1504 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_ge_basic_set);
1507 __isl_give isl_pw_aff *isl_pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
1508 __isl_take isl_pw_aff *pwaff2)
1510 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
1511 &pw_aff_union_max);
1514 /* Compute a piecewise quasi-affine expression with a domain that
1515 * is the union of those of pwaff1 and pwaff2 and such that on each
1516 * cell, the quasi-affine expression is the minimum of those of pwaff1
1517 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1518 * cell, then the associated expression is the defined one.
1520 static __isl_give isl_pw_aff *pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
1521 __isl_take isl_pw_aff *pwaff2)
1523 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_le_basic_set);
1526 __isl_give isl_pw_aff *isl_pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
1527 __isl_take isl_pw_aff *pwaff2)
1529 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
1530 &pw_aff_union_min);
1533 __isl_give isl_pw_aff *isl_pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
1534 __isl_take isl_pw_aff *pwaff2, int max)
1536 if (max)
1537 return isl_pw_aff_union_max(pwaff1, pwaff2);
1538 else
1539 return isl_pw_aff_union_min(pwaff1, pwaff2);
1542 /* Construct a map with as domain the domain of pwaff and
1543 * one-dimensional range corresponding to the affine expressions.
1545 static __isl_give isl_map *map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1547 int i;
1548 isl_space *dim;
1549 isl_map *map;
1551 if (!pwaff)
1552 return NULL;
1554 dim = isl_pw_aff_get_space(pwaff);
1555 map = isl_map_empty(dim);
1557 for (i = 0; i < pwaff->n; ++i) {
1558 isl_basic_map *bmap;
1559 isl_map *map_i;
1561 bmap = isl_basic_map_from_aff(isl_aff_copy(pwaff->p[i].aff));
1562 map_i = isl_map_from_basic_map(bmap);
1563 map_i = isl_map_intersect_domain(map_i,
1564 isl_set_copy(pwaff->p[i].set));
1565 map = isl_map_union_disjoint(map, map_i);
1568 isl_pw_aff_free(pwaff);
1570 return map;
1573 /* Construct a map with as domain the domain of pwaff and
1574 * one-dimensional range corresponding to the affine expressions.
1576 __isl_give isl_map *isl_map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1578 if (!pwaff)
1579 return NULL;
1580 if (isl_space_is_set(pwaff->dim))
1581 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1582 "space of input is not a map",
1583 return isl_pw_aff_free(pwaff));
1584 return map_from_pw_aff(pwaff);
1587 /* Construct a one-dimensional set with as parameter domain
1588 * the domain of pwaff and the single set dimension
1589 * corresponding to the affine expressions.
1591 __isl_give isl_set *isl_set_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1593 if (!pwaff)
1594 return NULL;
1595 if (!isl_space_is_set(pwaff->dim))
1596 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1597 "space of input is not a set",
1598 return isl_pw_aff_free(pwaff));
1599 return map_from_pw_aff(pwaff);
1602 /* Return a set containing those elements in the domain
1603 * of pwaff where it is non-negative.
1605 __isl_give isl_set *isl_pw_aff_nonneg_set(__isl_take isl_pw_aff *pwaff)
1607 int i;
1608 isl_set *set;
1610 if (!pwaff)
1611 return NULL;
1613 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
1615 for (i = 0; i < pwaff->n; ++i) {
1616 isl_basic_set *bset;
1617 isl_set *set_i;
1619 bset = isl_aff_nonneg_basic_set(isl_aff_copy(pwaff->p[i].aff));
1620 set_i = isl_set_from_basic_set(bset);
1621 set_i = isl_set_intersect(set_i, isl_set_copy(pwaff->p[i].set));
1622 set = isl_set_union_disjoint(set, set_i);
1625 isl_pw_aff_free(pwaff);
1627 return set;
1630 /* Return a set containing those elements in the domain
1631 * of pwaff where it is zero (if complement is 0) or not zero
1632 * (if complement is 1).
1634 static __isl_give isl_set *pw_aff_zero_set(__isl_take isl_pw_aff *pwaff,
1635 int complement)
1637 int i;
1638 isl_set *set;
1640 if (!pwaff)
1641 return NULL;
1643 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
1645 for (i = 0; i < pwaff->n; ++i) {
1646 isl_basic_set *bset;
1647 isl_set *set_i, *zero;
1649 bset = isl_aff_zero_basic_set(isl_aff_copy(pwaff->p[i].aff));
1650 zero = isl_set_from_basic_set(bset);
1651 set_i = isl_set_copy(pwaff->p[i].set);
1652 if (complement)
1653 set_i = isl_set_subtract(set_i, zero);
1654 else
1655 set_i = isl_set_intersect(set_i, zero);
1656 set = isl_set_union_disjoint(set, set_i);
1659 isl_pw_aff_free(pwaff);
1661 return set;
1664 /* Return a set containing those elements in the domain
1665 * of pwaff where it is zero.
1667 __isl_give isl_set *isl_pw_aff_zero_set(__isl_take isl_pw_aff *pwaff)
1669 return pw_aff_zero_set(pwaff, 0);
1672 /* Return a set containing those elements in the domain
1673 * of pwaff where it is not zero.
1675 __isl_give isl_set *isl_pw_aff_non_zero_set(__isl_take isl_pw_aff *pwaff)
1677 return pw_aff_zero_set(pwaff, 1);
1680 /* Return a set containing those elements in the shared domain
1681 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
1683 * We compute the difference on the shared domain and then construct
1684 * the set of values where this difference is non-negative.
1685 * If strict is set, we first subtract 1 from the difference.
1686 * If equal is set, we only return the elements where pwaff1 and pwaff2
1687 * are equal.
1689 static __isl_give isl_set *pw_aff_gte_set(__isl_take isl_pw_aff *pwaff1,
1690 __isl_take isl_pw_aff *pwaff2, int strict, int equal)
1692 isl_set *set1, *set2;
1694 set1 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff1));
1695 set2 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff2));
1696 set1 = isl_set_intersect(set1, set2);
1697 pwaff1 = isl_pw_aff_intersect_domain(pwaff1, isl_set_copy(set1));
1698 pwaff2 = isl_pw_aff_intersect_domain(pwaff2, isl_set_copy(set1));
1699 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_neg(pwaff2));
1701 if (strict) {
1702 isl_space *dim = isl_set_get_space(set1);
1703 isl_aff *aff;
1704 aff = isl_aff_zero_on_domain(isl_local_space_from_space(dim));
1705 aff = isl_aff_add_constant_si(aff, -1);
1706 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_alloc(set1, aff));
1707 } else
1708 isl_set_free(set1);
1710 if (equal)
1711 return isl_pw_aff_zero_set(pwaff1);
1712 return isl_pw_aff_nonneg_set(pwaff1);
1715 /* Return a set containing those elements in the shared domain
1716 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
1718 static __isl_give isl_set *pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
1719 __isl_take isl_pw_aff *pwaff2)
1721 return pw_aff_gte_set(pwaff1, pwaff2, 0, 1);
1724 __isl_give isl_set *isl_pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
1725 __isl_take isl_pw_aff *pwaff2)
1727 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_eq_set);
1730 /* Return a set containing those elements in the shared domain
1731 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
1733 static __isl_give isl_set *pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
1734 __isl_take isl_pw_aff *pwaff2)
1736 return pw_aff_gte_set(pwaff1, pwaff2, 0, 0);
1739 __isl_give isl_set *isl_pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
1740 __isl_take isl_pw_aff *pwaff2)
1742 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ge_set);
1745 /* Return a set containing those elements in the shared domain
1746 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
1748 static __isl_give isl_set *pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
1749 __isl_take isl_pw_aff *pwaff2)
1751 return pw_aff_gte_set(pwaff1, pwaff2, 1, 0);
1754 __isl_give isl_set *isl_pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
1755 __isl_take isl_pw_aff *pwaff2)
1757 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_gt_set);
1760 __isl_give isl_set *isl_pw_aff_le_set(__isl_take isl_pw_aff *pwaff1,
1761 __isl_take isl_pw_aff *pwaff2)
1763 return isl_pw_aff_ge_set(pwaff2, pwaff1);
1766 __isl_give isl_set *isl_pw_aff_lt_set(__isl_take isl_pw_aff *pwaff1,
1767 __isl_take isl_pw_aff *pwaff2)
1769 return isl_pw_aff_gt_set(pwaff2, pwaff1);
1772 /* Return a set containing those elements in the shared domain
1773 * of the elements of list1 and list2 where each element in list1
1774 * has the relation specified by "fn" with each element in list2.
1776 static __isl_give isl_set *pw_aff_list_set(__isl_take isl_pw_aff_list *list1,
1777 __isl_take isl_pw_aff_list *list2,
1778 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
1779 __isl_take isl_pw_aff *pwaff2))
1781 int i, j;
1782 isl_ctx *ctx;
1783 isl_set *set;
1785 if (!list1 || !list2)
1786 goto error;
1788 ctx = isl_pw_aff_list_get_ctx(list1);
1789 if (list1->n < 1 || list2->n < 1)
1790 isl_die(ctx, isl_error_invalid,
1791 "list should contain at least one element", goto error);
1793 set = isl_set_universe(isl_pw_aff_get_domain_space(list1->p[0]));
1794 for (i = 0; i < list1->n; ++i)
1795 for (j = 0; j < list2->n; ++j) {
1796 isl_set *set_ij;
1798 set_ij = fn(isl_pw_aff_copy(list1->p[i]),
1799 isl_pw_aff_copy(list2->p[j]));
1800 set = isl_set_intersect(set, set_ij);
1803 isl_pw_aff_list_free(list1);
1804 isl_pw_aff_list_free(list2);
1805 return set;
1806 error:
1807 isl_pw_aff_list_free(list1);
1808 isl_pw_aff_list_free(list2);
1809 return NULL;
1812 /* Return a set containing those elements in the shared domain
1813 * of the elements of list1 and list2 where each element in list1
1814 * is equal to each element in list2.
1816 __isl_give isl_set *isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list *list1,
1817 __isl_take isl_pw_aff_list *list2)
1819 return pw_aff_list_set(list1, list2, &isl_pw_aff_eq_set);
1822 __isl_give isl_set *isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list *list1,
1823 __isl_take isl_pw_aff_list *list2)
1825 return pw_aff_list_set(list1, list2, &isl_pw_aff_ne_set);
1828 /* Return a set containing those elements in the shared domain
1829 * of the elements of list1 and list2 where each element in list1
1830 * is less than or equal to each element in list2.
1832 __isl_give isl_set *isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list *list1,
1833 __isl_take isl_pw_aff_list *list2)
1835 return pw_aff_list_set(list1, list2, &isl_pw_aff_le_set);
1838 __isl_give isl_set *isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list *list1,
1839 __isl_take isl_pw_aff_list *list2)
1841 return pw_aff_list_set(list1, list2, &isl_pw_aff_lt_set);
1844 __isl_give isl_set *isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list *list1,
1845 __isl_take isl_pw_aff_list *list2)
1847 return pw_aff_list_set(list1, list2, &isl_pw_aff_ge_set);
1850 __isl_give isl_set *isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list *list1,
1851 __isl_take isl_pw_aff_list *list2)
1853 return pw_aff_list_set(list1, list2, &isl_pw_aff_gt_set);
1857 /* Return a set containing those elements in the shared domain
1858 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
1860 static __isl_give isl_set *pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
1861 __isl_take isl_pw_aff *pwaff2)
1863 isl_set *set_lt, *set_gt;
1865 set_lt = isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1),
1866 isl_pw_aff_copy(pwaff2));
1867 set_gt = isl_pw_aff_gt_set(pwaff1, pwaff2);
1868 return isl_set_union_disjoint(set_lt, set_gt);
1871 __isl_give isl_set *isl_pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
1872 __isl_take isl_pw_aff *pwaff2)
1874 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ne_set);
1877 __isl_give isl_pw_aff *isl_pw_aff_scale_down(__isl_take isl_pw_aff *pwaff,
1878 isl_int v)
1880 int i;
1882 if (isl_int_is_one(v))
1883 return pwaff;
1884 if (!isl_int_is_pos(v))
1885 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1886 "factor needs to be positive",
1887 return isl_pw_aff_free(pwaff));
1888 pwaff = isl_pw_aff_cow(pwaff);
1889 if (!pwaff)
1890 return NULL;
1891 if (pwaff->n == 0)
1892 return pwaff;
1894 for (i = 0; i < pwaff->n; ++i) {
1895 pwaff->p[i].aff = isl_aff_scale_down(pwaff->p[i].aff, v);
1896 if (!pwaff->p[i].aff)
1897 return isl_pw_aff_free(pwaff);
1900 return pwaff;
1903 __isl_give isl_pw_aff *isl_pw_aff_floor(__isl_take isl_pw_aff *pwaff)
1905 int i;
1907 pwaff = isl_pw_aff_cow(pwaff);
1908 if (!pwaff)
1909 return NULL;
1910 if (pwaff->n == 0)
1911 return pwaff;
1913 for (i = 0; i < pwaff->n; ++i) {
1914 pwaff->p[i].aff = isl_aff_floor(pwaff->p[i].aff);
1915 if (!pwaff->p[i].aff)
1916 return isl_pw_aff_free(pwaff);
1919 return pwaff;
1922 __isl_give isl_pw_aff *isl_pw_aff_ceil(__isl_take isl_pw_aff *pwaff)
1924 int i;
1926 pwaff = isl_pw_aff_cow(pwaff);
1927 if (!pwaff)
1928 return NULL;
1929 if (pwaff->n == 0)
1930 return pwaff;
1932 for (i = 0; i < pwaff->n; ++i) {
1933 pwaff->p[i].aff = isl_aff_ceil(pwaff->p[i].aff);
1934 if (!pwaff->p[i].aff)
1935 return isl_pw_aff_free(pwaff);
1938 return pwaff;
1941 /* Assuming that "cond1" and "cond2" are disjoint,
1942 * return an affine expression that is equal to pwaff1 on cond1
1943 * and to pwaff2 on cond2.
1945 static __isl_give isl_pw_aff *isl_pw_aff_select(
1946 __isl_take isl_set *cond1, __isl_take isl_pw_aff *pwaff1,
1947 __isl_take isl_set *cond2, __isl_take isl_pw_aff *pwaff2)
1949 pwaff1 = isl_pw_aff_intersect_domain(pwaff1, cond1);
1950 pwaff2 = isl_pw_aff_intersect_domain(pwaff2, cond2);
1952 return isl_pw_aff_add_disjoint(pwaff1, pwaff2);
1955 /* Return an affine expression that is equal to pwaff_true for elements
1956 * where "cond" is non-zero and to pwaff_false for elements where "cond"
1957 * is zero.
1958 * That is, return cond ? pwaff_true : pwaff_false;
1960 __isl_give isl_pw_aff *isl_pw_aff_cond(__isl_take isl_pw_aff *cond,
1961 __isl_take isl_pw_aff *pwaff_true, __isl_take isl_pw_aff *pwaff_false)
1963 isl_set *cond_true, *cond_false;
1965 cond_true = isl_pw_aff_non_zero_set(isl_pw_aff_copy(cond));
1966 cond_false = isl_pw_aff_zero_set(cond);
1967 return isl_pw_aff_select(cond_true, pwaff_true,
1968 cond_false, pwaff_false);
1971 int isl_aff_is_cst(__isl_keep isl_aff *aff)
1973 if (!aff)
1974 return -1;
1976 return isl_seq_first_non_zero(aff->v->el + 2, aff->v->size - 2) == -1;
1979 /* Check whether pwaff is a piecewise constant.
1981 int isl_pw_aff_is_cst(__isl_keep isl_pw_aff *pwaff)
1983 int i;
1985 if (!pwaff)
1986 return -1;
1988 for (i = 0; i < pwaff->n; ++i) {
1989 int is_cst = isl_aff_is_cst(pwaff->p[i].aff);
1990 if (is_cst < 0 || !is_cst)
1991 return is_cst;
1994 return 1;
1997 __isl_give isl_aff *isl_aff_mul(__isl_take isl_aff *aff1,
1998 __isl_take isl_aff *aff2)
2000 if (!isl_aff_is_cst(aff2) && isl_aff_is_cst(aff1))
2001 return isl_aff_mul(aff2, aff1);
2003 if (!isl_aff_is_cst(aff2))
2004 isl_die(isl_aff_get_ctx(aff1), isl_error_invalid,
2005 "at least one affine expression should be constant",
2006 goto error);
2008 aff1 = isl_aff_cow(aff1);
2009 if (!aff1 || !aff2)
2010 goto error;
2012 aff1 = isl_aff_scale(aff1, aff2->v->el[1]);
2013 aff1 = isl_aff_scale_down(aff1, aff2->v->el[0]);
2015 isl_aff_free(aff2);
2016 return aff1;
2017 error:
2018 isl_aff_free(aff1);
2019 isl_aff_free(aff2);
2020 return NULL;
2023 static __isl_give isl_pw_aff *pw_aff_add(__isl_take isl_pw_aff *pwaff1,
2024 __isl_take isl_pw_aff *pwaff2)
2026 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_add);
2029 __isl_give isl_pw_aff *isl_pw_aff_add(__isl_take isl_pw_aff *pwaff1,
2030 __isl_take isl_pw_aff *pwaff2)
2032 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_add);
2035 __isl_give isl_pw_aff *isl_pw_aff_union_add(__isl_take isl_pw_aff *pwaff1,
2036 __isl_take isl_pw_aff *pwaff2)
2038 return isl_pw_aff_union_add_(pwaff1, pwaff2);
2041 static __isl_give isl_pw_aff *pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
2042 __isl_take isl_pw_aff *pwaff2)
2044 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_mul);
2047 __isl_give isl_pw_aff *isl_pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
2048 __isl_take isl_pw_aff *pwaff2)
2050 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_mul);
2053 static __isl_give isl_pw_aff *pw_aff_min(__isl_take isl_pw_aff *pwaff1,
2054 __isl_take isl_pw_aff *pwaff2)
2056 isl_set *le;
2057 isl_set *dom;
2059 dom = isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1)),
2060 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2)));
2061 le = isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1),
2062 isl_pw_aff_copy(pwaff2));
2063 dom = isl_set_subtract(dom, isl_set_copy(le));
2064 return isl_pw_aff_select(le, pwaff1, dom, pwaff2);
2067 __isl_give isl_pw_aff *isl_pw_aff_min(__isl_take isl_pw_aff *pwaff1,
2068 __isl_take isl_pw_aff *pwaff2)
2070 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_min);
2073 static __isl_give isl_pw_aff *pw_aff_max(__isl_take isl_pw_aff *pwaff1,
2074 __isl_take isl_pw_aff *pwaff2)
2076 isl_set *ge;
2077 isl_set *dom;
2079 dom = isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1)),
2080 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2)));
2081 ge = isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1),
2082 isl_pw_aff_copy(pwaff2));
2083 dom = isl_set_subtract(dom, isl_set_copy(ge));
2084 return isl_pw_aff_select(ge, pwaff1, dom, pwaff2);
2087 __isl_give isl_pw_aff *isl_pw_aff_max(__isl_take isl_pw_aff *pwaff1,
2088 __isl_take isl_pw_aff *pwaff2)
2090 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_max);
2093 static __isl_give isl_pw_aff *pw_aff_list_reduce(
2094 __isl_take isl_pw_aff_list *list,
2095 __isl_give isl_pw_aff *(*fn)(__isl_take isl_pw_aff *pwaff1,
2096 __isl_take isl_pw_aff *pwaff2))
2098 int i;
2099 isl_ctx *ctx;
2100 isl_pw_aff *res;
2102 if (!list)
2103 return NULL;
2105 ctx = isl_pw_aff_list_get_ctx(list);
2106 if (list->n < 1)
2107 isl_die(ctx, isl_error_invalid,
2108 "list should contain at least one element",
2109 return isl_pw_aff_list_free(list));
2111 res = isl_pw_aff_copy(list->p[0]);
2112 for (i = 1; i < list->n; ++i)
2113 res = fn(res, isl_pw_aff_copy(list->p[i]));
2115 isl_pw_aff_list_free(list);
2116 return res;
2119 /* Return an isl_pw_aff that maps each element in the intersection of the
2120 * domains of the elements of list to the minimal corresponding affine
2121 * expression.
2123 __isl_give isl_pw_aff *isl_pw_aff_list_min(__isl_take isl_pw_aff_list *list)
2125 return pw_aff_list_reduce(list, &isl_pw_aff_min);
2128 /* Return an isl_pw_aff that maps each element in the intersection of the
2129 * domains of the elements of list to the maximal corresponding affine
2130 * expression.
2132 __isl_give isl_pw_aff *isl_pw_aff_list_max(__isl_take isl_pw_aff_list *list)
2134 return pw_aff_list_reduce(list, &isl_pw_aff_max);
2137 #undef BASE
2138 #define BASE aff
2140 #include <isl_multi_templ.c>
2142 /* Construct an isl_multi_aff in the given space with value zero in
2143 * each of the output dimensions.
2145 __isl_give isl_multi_aff *isl_multi_aff_zero(__isl_take isl_space *space)
2147 int n;
2148 isl_multi_aff *ma;
2150 if (!space)
2151 return NULL;
2153 n = isl_space_dim(space , isl_dim_out);
2154 ma = isl_multi_aff_alloc(isl_space_copy(space));
2156 if (!n)
2157 isl_space_free(space);
2158 else {
2159 int i;
2160 isl_local_space *ls;
2161 isl_aff *aff;
2163 space = isl_space_domain(space);
2164 ls = isl_local_space_from_space(space);
2165 aff = isl_aff_zero_on_domain(ls);
2167 for (i = 0; i < n; ++i)
2168 ma = isl_multi_aff_set_aff(ma, i, isl_aff_copy(aff));
2170 isl_aff_free(aff);
2173 return ma;
2176 /* Create an isl_multi_aff in the given space that maps each
2177 * input dimension to the corresponding output dimension.
2179 __isl_give isl_multi_aff *isl_multi_aff_identity(__isl_take isl_space *space)
2181 int n;
2182 isl_multi_aff *ma;
2184 if (!space)
2185 return NULL;
2187 if (isl_space_is_set(space))
2188 isl_die(isl_space_get_ctx(space), isl_error_invalid,
2189 "expecting map space", goto error);
2191 n = isl_space_dim(space, isl_dim_out);
2192 if (n != isl_space_dim(space, isl_dim_in))
2193 isl_die(isl_space_get_ctx(space), isl_error_invalid,
2194 "number of input and output dimensions needs to be "
2195 "the same", goto error);
2197 ma = isl_multi_aff_alloc(isl_space_copy(space));
2199 if (!n)
2200 isl_space_free(space);
2201 else {
2202 int i;
2203 isl_local_space *ls;
2204 isl_aff *aff;
2206 space = isl_space_domain(space);
2207 ls = isl_local_space_from_space(space);
2208 aff = isl_aff_zero_on_domain(ls);
2210 for (i = 0; i < n; ++i) {
2211 isl_aff *aff_i;
2212 aff_i = isl_aff_copy(aff);
2213 aff_i = isl_aff_add_coefficient_si(aff_i,
2214 isl_dim_in, i, 1);
2215 ma = isl_multi_aff_set_aff(ma, i, aff_i);
2218 isl_aff_free(aff);
2221 return ma;
2222 error:
2223 isl_space_free(space);
2224 return NULL;
2227 /* Create an isl_pw_multi_aff with the given isl_multi_aff on a universe
2228 * domain.
2230 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_multi_aff(
2231 __isl_take isl_multi_aff *ma)
2233 isl_set *dom = isl_set_universe(isl_multi_aff_get_domain_space(ma));
2234 return isl_pw_multi_aff_alloc(dom, ma);
2237 __isl_give isl_multi_aff *isl_multi_aff_add(__isl_take isl_multi_aff *maff1,
2238 __isl_take isl_multi_aff *maff2)
2240 int i;
2241 isl_ctx *ctx;
2243 maff1 = isl_multi_aff_cow(maff1);
2244 if (!maff1 || !maff2)
2245 goto error;
2247 ctx = isl_multi_aff_get_ctx(maff1);
2248 if (!isl_space_is_equal(maff1->space, maff2->space))
2249 isl_die(ctx, isl_error_invalid,
2250 "spaces don't match", goto error);
2252 for (i = 0; i < maff1->n; ++i) {
2253 maff1->p[i] = isl_aff_add(maff1->p[i],
2254 isl_aff_copy(maff2->p[i]));
2255 if (!maff1->p[i])
2256 goto error;
2259 isl_multi_aff_free(maff2);
2260 return maff1;
2261 error:
2262 isl_multi_aff_free(maff1);
2263 isl_multi_aff_free(maff2);
2264 return NULL;
2267 /* Exploit the equalities in "eq" to simplify the affine expressions.
2269 static __isl_give isl_multi_aff *isl_multi_aff_substitute_equalities(
2270 __isl_take isl_multi_aff *maff, __isl_take isl_basic_set *eq)
2272 int i;
2274 maff = isl_multi_aff_cow(maff);
2275 if (!maff || !eq)
2276 goto error;
2278 for (i = 0; i < maff->n; ++i) {
2279 maff->p[i] = isl_aff_substitute_equalities(maff->p[i],
2280 isl_basic_set_copy(eq));
2281 if (!maff->p[i])
2282 goto error;
2285 isl_basic_set_free(eq);
2286 return maff;
2287 error:
2288 isl_basic_set_free(eq);
2289 isl_multi_aff_free(maff);
2290 return NULL;
2293 __isl_give isl_multi_aff *isl_multi_aff_scale(__isl_take isl_multi_aff *maff,
2294 isl_int f)
2296 int i;
2298 maff = isl_multi_aff_cow(maff);
2299 if (!maff)
2300 return NULL;
2302 for (i = 0; i < maff->n; ++i) {
2303 maff->p[i] = isl_aff_scale(maff->p[i], f);
2304 if (!maff->p[i])
2305 return isl_multi_aff_free(maff);
2308 return maff;
2311 __isl_give isl_multi_aff *isl_multi_aff_add_on_domain(__isl_keep isl_set *dom,
2312 __isl_take isl_multi_aff *maff1, __isl_take isl_multi_aff *maff2)
2314 maff1 = isl_multi_aff_add(maff1, maff2);
2315 maff1 = isl_multi_aff_gist(maff1, isl_set_copy(dom));
2316 return maff1;
2319 int isl_multi_aff_is_empty(__isl_keep isl_multi_aff *maff)
2321 if (!maff)
2322 return -1;
2324 return 0;
2327 int isl_multi_aff_plain_is_equal(__isl_keep isl_multi_aff *maff1,
2328 __isl_keep isl_multi_aff *maff2)
2330 int i;
2331 int equal;
2333 if (!maff1 || !maff2)
2334 return -1;
2335 if (maff1->n != maff2->n)
2336 return 0;
2337 equal = isl_space_is_equal(maff1->space, maff2->space);
2338 if (equal < 0 || !equal)
2339 return equal;
2341 for (i = 0; i < maff1->n; ++i) {
2342 equal = isl_aff_plain_is_equal(maff1->p[i], maff2->p[i]);
2343 if (equal < 0 || !equal)
2344 return equal;
2347 return 1;
2350 __isl_give isl_multi_aff *isl_multi_aff_set_dim_name(
2351 __isl_take isl_multi_aff *maff,
2352 enum isl_dim_type type, unsigned pos, const char *s)
2354 int i;
2356 maff = isl_multi_aff_cow(maff);
2357 if (!maff)
2358 return NULL;
2360 maff->space = isl_space_set_dim_name(maff->space, type, pos, s);
2361 if (!maff->space)
2362 return isl_multi_aff_free(maff);
2364 if (type == isl_dim_out)
2365 return maff;
2366 for (i = 0; i < maff->n; ++i) {
2367 maff->p[i] = isl_aff_set_dim_name(maff->p[i], type, pos, s);
2368 if (!maff->p[i])
2369 return isl_multi_aff_free(maff);
2372 return maff;
2375 __isl_give isl_multi_aff *isl_multi_aff_drop_dims(__isl_take isl_multi_aff *maff,
2376 enum isl_dim_type type, unsigned first, unsigned n)
2378 int i;
2380 maff = isl_multi_aff_cow(maff);
2381 if (!maff)
2382 return NULL;
2384 maff->space = isl_space_drop_dims(maff->space, type, first, n);
2385 if (!maff->space)
2386 return isl_multi_aff_free(maff);
2388 if (type == isl_dim_out) {
2389 for (i = 0; i < n; ++i)
2390 isl_aff_free(maff->p[first + i]);
2391 for (i = first; i + n < maff->n; ++i)
2392 maff->p[i] = maff->p[i + n];
2393 maff->n -= n;
2394 return maff;
2397 for (i = 0; i < maff->n; ++i) {
2398 maff->p[i] = isl_aff_drop_dims(maff->p[i], type, first, n);
2399 if (!maff->p[i])
2400 return isl_multi_aff_free(maff);
2403 return maff;
2406 /* Return the set of domain elements where "ma1" is lexicographically
2407 * smaller than or equal to "ma2".
2409 __isl_give isl_set *isl_multi_aff_lex_le_set(__isl_take isl_multi_aff *ma1,
2410 __isl_take isl_multi_aff *ma2)
2412 return isl_multi_aff_lex_ge_set(ma2, ma1);
2415 /* Return the set of domain elements where "ma1" is lexicographically
2416 * greater than or equal to "ma2".
2418 __isl_give isl_set *isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff *ma1,
2419 __isl_take isl_multi_aff *ma2)
2421 isl_space *space;
2422 isl_map *map1, *map2;
2423 isl_map *map, *ge;
2425 map1 = isl_map_from_multi_aff(ma1);
2426 map2 = isl_map_from_multi_aff(ma2);
2427 map = isl_map_range_product(map1, map2);
2428 space = isl_space_range(isl_map_get_space(map));
2429 space = isl_space_domain(isl_space_unwrap(space));
2430 ge = isl_map_lex_ge(space);
2431 map = isl_map_intersect_range(map, isl_map_wrap(ge));
2433 return isl_map_domain(map);
2436 #undef PW
2437 #define PW isl_pw_multi_aff
2438 #undef EL
2439 #define EL isl_multi_aff
2440 #undef EL_IS_ZERO
2441 #define EL_IS_ZERO is_empty
2442 #undef ZERO
2443 #define ZERO empty
2444 #undef IS_ZERO
2445 #define IS_ZERO is_empty
2446 #undef FIELD
2447 #define FIELD maff
2448 #undef DEFAULT_IS_ZERO
2449 #define DEFAULT_IS_ZERO 0
2451 #define NO_NEG
2452 #define NO_EVAL
2453 #define NO_OPT
2454 #define NO_INVOLVES_DIMS
2455 #define NO_MOVE_DIMS
2456 #define NO_INSERT_DIMS
2457 #define NO_LIFT
2458 #define NO_MORPH
2460 #include <isl_pw_templ.c>
2462 #undef UNION
2463 #define UNION isl_union_pw_multi_aff
2464 #undef PART
2465 #define PART isl_pw_multi_aff
2466 #undef PARTS
2467 #define PARTS pw_multi_aff
2468 #define ALIGN_DOMAIN
2470 #define NO_EVAL
2472 #include <isl_union_templ.c>
2474 static __isl_give isl_pw_multi_aff *pw_multi_aff_add(
2475 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2477 return isl_pw_multi_aff_on_shared_domain(pma1, pma2,
2478 &isl_multi_aff_add);
2481 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_add(
2482 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2484 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
2485 &pw_multi_aff_add);
2488 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_add(
2489 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2491 return isl_pw_multi_aff_union_add_(pma1, pma2);
2494 /* Construct a map mapping the domain of the piecewise multi-affine expression
2495 * to its range, with each dimension in the range equated to the
2496 * corresponding affine expression on its cell.
2498 __isl_give isl_map *isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
2500 int i;
2501 isl_map *map;
2503 if (!pma)
2504 return NULL;
2506 map = isl_map_empty(isl_pw_multi_aff_get_space(pma));
2508 for (i = 0; i < pma->n; ++i) {
2509 isl_multi_aff *maff;
2510 isl_basic_map *bmap;
2511 isl_map *map_i;
2513 maff = isl_multi_aff_copy(pma->p[i].maff);
2514 bmap = isl_basic_map_from_multi_aff(maff);
2515 map_i = isl_map_from_basic_map(bmap);
2516 map_i = isl_map_intersect_domain(map_i,
2517 isl_set_copy(pma->p[i].set));
2518 map = isl_map_union_disjoint(map, map_i);
2521 isl_pw_multi_aff_free(pma);
2522 return map;
2525 __isl_give isl_set *isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
2527 if (!isl_space_is_set(pma->dim))
2528 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
2529 "isl_pw_multi_aff cannot be converted into an isl_set",
2530 return isl_pw_multi_aff_free(pma));
2532 return isl_map_from_pw_multi_aff(pma);
2535 /* Given a basic map with a single output dimension that is defined
2536 * in terms of the parameters and input dimensions using an equality,
2537 * extract an isl_aff that expresses the output dimension in terms
2538 * of the parameters and input dimensions.
2540 * Since some applications expect the result of isl_pw_multi_aff_from_map
2541 * to only contain integer affine expressions, we compute the floor
2542 * of the expression before returning.
2544 * This function shares some similarities with
2545 * isl_basic_map_has_defining_equality and isl_constraint_get_bound.
2547 static __isl_give isl_aff *extract_isl_aff_from_basic_map(
2548 __isl_take isl_basic_map *bmap)
2550 int i;
2551 unsigned offset;
2552 unsigned total;
2553 isl_local_space *ls;
2554 isl_aff *aff;
2556 if (!bmap)
2557 return NULL;
2558 if (isl_basic_map_dim(bmap, isl_dim_out) != 1)
2559 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
2560 "basic map should have a single output dimension",
2561 goto error);
2562 offset = isl_basic_map_offset(bmap, isl_dim_out);
2563 total = isl_basic_map_total_dim(bmap);
2564 for (i = 0; i < bmap->n_eq; ++i) {
2565 if (isl_int_is_zero(bmap->eq[i][offset]))
2566 continue;
2567 if (isl_seq_first_non_zero(bmap->eq[i] + offset + 1,
2568 1 + total - (offset + 1)) != -1)
2569 continue;
2570 break;
2572 if (i >= bmap->n_eq)
2573 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
2574 "unable to find suitable equality", goto error);
2575 ls = isl_basic_map_get_local_space(bmap);
2576 aff = isl_aff_alloc(isl_local_space_domain(ls));
2577 if (!aff)
2578 goto error;
2579 if (isl_int_is_neg(bmap->eq[i][offset]))
2580 isl_seq_cpy(aff->v->el + 1, bmap->eq[i], offset);
2581 else
2582 isl_seq_neg(aff->v->el + 1, bmap->eq[i], offset);
2583 isl_seq_clr(aff->v->el + 1 + offset, aff->v->size - (1 + offset));
2584 isl_int_abs(aff->v->el[0], bmap->eq[i][offset]);
2585 isl_basic_map_free(bmap);
2587 aff = isl_aff_remove_unused_divs(aff);
2588 aff = isl_aff_floor(aff);
2589 return aff;
2590 error:
2591 isl_basic_map_free(bmap);
2592 return NULL;
2595 /* Given a basic map where each output dimension is defined
2596 * in terms of the parameters and input dimensions using an equality,
2597 * extract an isl_multi_aff that expresses the output dimensions in terms
2598 * of the parameters and input dimensions.
2600 static __isl_give isl_multi_aff *extract_isl_multi_aff_from_basic_map(
2601 __isl_take isl_basic_map *bmap)
2603 int i;
2604 unsigned n_out;
2605 isl_multi_aff *ma;
2607 if (!bmap)
2608 return NULL;
2610 ma = isl_multi_aff_alloc(isl_basic_map_get_space(bmap));
2611 n_out = isl_basic_map_dim(bmap, isl_dim_out);
2613 for (i = 0; i < n_out; ++i) {
2614 isl_basic_map *bmap_i;
2615 isl_aff *aff;
2617 bmap_i = isl_basic_map_copy(bmap);
2618 bmap_i = isl_basic_map_project_out(bmap_i, isl_dim_out,
2619 i + 1, n_out - (1 + i));
2620 bmap_i = isl_basic_map_project_out(bmap_i, isl_dim_out, 0, i);
2621 aff = extract_isl_aff_from_basic_map(bmap_i);
2622 ma = isl_multi_aff_set_aff(ma, i, aff);
2625 isl_basic_map_free(bmap);
2627 return ma;
2630 /* Create an isl_pw_multi_aff that is equivalent to
2631 * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain).
2632 * The given basic map is such that each output dimension is defined
2633 * in terms of the parameters and input dimensions using an equality.
2635 static __isl_give isl_pw_multi_aff *plain_pw_multi_aff_from_map(
2636 __isl_take isl_set *domain, __isl_take isl_basic_map *bmap)
2638 isl_multi_aff *ma;
2640 ma = extract_isl_multi_aff_from_basic_map(bmap);
2641 return isl_pw_multi_aff_alloc(domain, ma);
2644 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
2645 * This obivously only works if the input "map" is single-valued.
2646 * If so, we compute the lexicographic minimum of the image in the form
2647 * of an isl_pw_multi_aff. Since the image is unique, it is equal
2648 * to its lexicographic minimum.
2649 * If the input is not single-valued, we produce an error.
2651 * As a special case, we first check if all output dimensions are uniquely
2652 * defined in terms of the parameters and input dimensions over the entire
2653 * domain. If so, we extract the desired isl_pw_multi_aff directly
2654 * from the affine hull of "map" and its domain.
2656 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_map(__isl_take isl_map *map)
2658 int i;
2659 int sv;
2660 isl_pw_multi_aff *pma;
2661 isl_basic_map *hull;
2663 if (!map)
2664 return NULL;
2666 hull = isl_map_affine_hull(isl_map_copy(map));
2667 sv = isl_basic_map_plain_is_single_valued(hull);
2668 if (sv >= 0 && sv)
2669 return plain_pw_multi_aff_from_map(isl_map_domain(map), hull);
2670 isl_basic_map_free(hull);
2671 if (sv < 0)
2672 goto error;
2674 sv = isl_map_is_single_valued(map);
2675 if (sv < 0)
2676 goto error;
2677 if (!sv)
2678 isl_die(isl_map_get_ctx(map), isl_error_invalid,
2679 "map is not single-valued", goto error);
2680 map = isl_map_make_disjoint(map);
2681 if (!map)
2682 return NULL;
2684 pma = isl_pw_multi_aff_empty(isl_map_get_space(map));
2686 for (i = 0; i < map->n; ++i) {
2687 isl_pw_multi_aff *pma_i;
2688 isl_basic_map *bmap;
2689 bmap = isl_basic_map_copy(map->p[i]);
2690 pma_i = isl_basic_map_lexmin_pw_multi_aff(bmap);
2691 pma = isl_pw_multi_aff_add_disjoint(pma, pma_i);
2694 isl_map_free(map);
2695 return pma;
2696 error:
2697 isl_map_free(map);
2698 return NULL;
2701 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_set(__isl_take isl_set *set)
2703 return isl_pw_multi_aff_from_map(set);
2706 /* Return the piecewise affine expression "set ? 1 : 0".
2708 __isl_give isl_pw_aff *isl_set_indicator_function(__isl_take isl_set *set)
2710 isl_pw_aff *pa;
2711 isl_space *space = isl_set_get_space(set);
2712 isl_local_space *ls = isl_local_space_from_space(space);
2713 isl_aff *zero = isl_aff_zero_on_domain(isl_local_space_copy(ls));
2714 isl_aff *one = isl_aff_zero_on_domain(ls);
2716 one = isl_aff_add_constant_si(one, 1);
2717 pa = isl_pw_aff_alloc(isl_set_copy(set), one);
2718 set = isl_set_complement(set);
2719 pa = isl_pw_aff_add_disjoint(pa, isl_pw_aff_alloc(set, zero));
2721 return pa;
2724 /* Plug in "subs" for dimension "type", "pos" of "aff".
2726 * Let i be the dimension to replace and let "subs" be of the form
2728 * f/d
2730 * and "aff" of the form
2732 * (a i + g)/m
2734 * The result is
2736 * floor((a f + d g')/(m d))
2738 * where g' is the result of plugging in "subs" in each of the integer
2739 * divisions in g.
2741 __isl_give isl_aff *isl_aff_substitute(__isl_take isl_aff *aff,
2742 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
2744 isl_ctx *ctx;
2745 isl_int v;
2747 aff = isl_aff_cow(aff);
2748 if (!aff || !subs)
2749 return isl_aff_free(aff);
2751 ctx = isl_aff_get_ctx(aff);
2752 if (!isl_space_is_equal(aff->ls->dim, subs->ls->dim))
2753 isl_die(ctx, isl_error_invalid,
2754 "spaces don't match", return isl_aff_free(aff));
2755 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
2756 isl_die(ctx, isl_error_unsupported,
2757 "cannot handle divs yet", return isl_aff_free(aff));
2759 aff->ls = isl_local_space_substitute(aff->ls, type, pos, subs);
2760 if (!aff->ls)
2761 return isl_aff_free(aff);
2763 aff->v = isl_vec_cow(aff->v);
2764 if (!aff->v)
2765 return isl_aff_free(aff);
2767 pos += isl_local_space_offset(aff->ls, type);
2769 isl_int_init(v);
2770 isl_int_set(v, aff->v->el[1 + pos]);
2771 isl_int_set_si(aff->v->el[1 + pos], 0);
2772 isl_seq_combine(aff->v->el + 1, subs->v->el[0], aff->v->el + 1,
2773 v, subs->v->el + 1, subs->v->size - 1);
2774 isl_int_mul(aff->v->el[0], aff->v->el[0], subs->v->el[0]);
2775 isl_int_clear(v);
2777 return aff;
2780 /* Plug in "subs" for dimension "type", "pos" in each of the affine
2781 * expressions in "maff".
2783 __isl_give isl_multi_aff *isl_multi_aff_substitute(
2784 __isl_take isl_multi_aff *maff, enum isl_dim_type type, unsigned pos,
2785 __isl_keep isl_aff *subs)
2787 int i;
2789 maff = isl_multi_aff_cow(maff);
2790 if (!maff || !subs)
2791 return isl_multi_aff_free(maff);
2793 if (type == isl_dim_in)
2794 type = isl_dim_set;
2796 for (i = 0; i < maff->n; ++i) {
2797 maff->p[i] = isl_aff_substitute(maff->p[i], type, pos, subs);
2798 if (!maff->p[i])
2799 return isl_multi_aff_free(maff);
2802 return maff;
2805 /* Plug in "subs" for dimension "type", "pos" of "pma".
2807 * pma is of the form
2809 * A_i(v) -> M_i(v)
2811 * while subs is of the form
2813 * v' = B_j(v) -> S_j
2815 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
2816 * has a contribution in the result, in particular
2818 * C_ij(S_j) -> M_i(S_j)
2820 * Note that plugging in S_j in C_ij may also result in an empty set
2821 * and this contribution should simply be discarded.
2823 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_substitute(
2824 __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos,
2825 __isl_keep isl_pw_aff *subs)
2827 int i, j, n;
2828 isl_pw_multi_aff *res;
2830 if (!pma || !subs)
2831 return isl_pw_multi_aff_free(pma);
2833 n = pma->n * subs->n;
2834 res = isl_pw_multi_aff_alloc_size(isl_space_copy(pma->dim), n);
2836 for (i = 0; i < pma->n; ++i) {
2837 for (j = 0; j < subs->n; ++j) {
2838 isl_set *common;
2839 isl_multi_aff *res_ij;
2840 common = isl_set_intersect(
2841 isl_set_copy(pma->p[i].set),
2842 isl_set_copy(subs->p[j].set));
2843 common = isl_set_substitute(common,
2844 type, pos, subs->p[j].aff);
2845 if (isl_set_plain_is_empty(common)) {
2846 isl_set_free(common);
2847 continue;
2850 res_ij = isl_multi_aff_substitute(
2851 isl_multi_aff_copy(pma->p[i].maff),
2852 type, pos, subs->p[j].aff);
2854 res = isl_pw_multi_aff_add_piece(res, common, res_ij);
2858 isl_pw_multi_aff_free(pma);
2859 return res;
2862 /* Extend the local space of "dst" to include the divs
2863 * in the local space of "src".
2865 __isl_give isl_aff *isl_aff_align_divs(__isl_take isl_aff *dst,
2866 __isl_keep isl_aff *src)
2868 isl_ctx *ctx;
2869 int *exp1 = NULL;
2870 int *exp2 = NULL;
2871 isl_mat *div;
2873 if (!src || !dst)
2874 return isl_aff_free(dst);
2876 ctx = isl_aff_get_ctx(src);
2877 if (!isl_space_is_equal(src->ls->dim, dst->ls->dim))
2878 isl_die(ctx, isl_error_invalid,
2879 "spaces don't match", goto error);
2881 if (src->ls->div->n_row == 0)
2882 return dst;
2884 exp1 = isl_alloc_array(ctx, int, src->ls->div->n_row);
2885 exp2 = isl_alloc_array(ctx, int, dst->ls->div->n_row);
2886 if (!exp1 || !exp2)
2887 goto error;
2889 div = isl_merge_divs(src->ls->div, dst->ls->div, exp1, exp2);
2890 dst = isl_aff_expand_divs(dst, div, exp2);
2891 free(exp1);
2892 free(exp2);
2894 return dst;
2895 error:
2896 free(exp1);
2897 free(exp2);
2898 return isl_aff_free(dst);
2901 /* Adjust the local spaces of the affine expressions in "maff"
2902 * such that they all have the save divs.
2904 __isl_give isl_multi_aff *isl_multi_aff_align_divs(
2905 __isl_take isl_multi_aff *maff)
2907 int i;
2909 if (!maff)
2910 return NULL;
2911 if (maff->n == 0)
2912 return maff;
2913 maff = isl_multi_aff_cow(maff);
2914 if (!maff)
2915 return NULL;
2917 for (i = 1; i < maff->n; ++i)
2918 maff->p[0] = isl_aff_align_divs(maff->p[0], maff->p[i]);
2919 for (i = 1; i < maff->n; ++i) {
2920 maff->p[i] = isl_aff_align_divs(maff->p[i], maff->p[0]);
2921 if (!maff->p[i])
2922 return isl_multi_aff_free(maff);
2925 return maff;
2928 __isl_give isl_aff *isl_aff_lift(__isl_take isl_aff *aff)
2930 aff = isl_aff_cow(aff);
2931 if (!aff)
2932 return NULL;
2934 aff->ls = isl_local_space_lift(aff->ls);
2935 if (!aff->ls)
2936 return isl_aff_free(aff);
2938 return aff;
2941 /* Lift "maff" to a space with extra dimensions such that the result
2942 * has no more existentially quantified variables.
2943 * If "ls" is not NULL, then *ls is assigned the local space that lies
2944 * at the basis of the lifting applied to "maff".
2946 __isl_give isl_multi_aff *isl_multi_aff_lift(__isl_take isl_multi_aff *maff,
2947 __isl_give isl_local_space **ls)
2949 int i;
2950 isl_space *space;
2951 unsigned n_div;
2953 if (ls)
2954 *ls = NULL;
2956 if (!maff)
2957 return NULL;
2959 if (maff->n == 0) {
2960 if (ls) {
2961 isl_space *space = isl_multi_aff_get_domain_space(maff);
2962 *ls = isl_local_space_from_space(space);
2963 if (!*ls)
2964 return isl_multi_aff_free(maff);
2966 return maff;
2969 maff = isl_multi_aff_cow(maff);
2970 maff = isl_multi_aff_align_divs(maff);
2971 if (!maff)
2972 return NULL;
2974 n_div = isl_aff_dim(maff->p[0], isl_dim_div);
2975 space = isl_multi_aff_get_space(maff);
2976 space = isl_space_lift(isl_space_domain(space), n_div);
2977 space = isl_space_extend_domain_with_range(space,
2978 isl_multi_aff_get_space(maff));
2979 if (!space)
2980 return isl_multi_aff_free(maff);
2981 isl_space_free(maff->space);
2982 maff->space = space;
2984 if (ls) {
2985 *ls = isl_aff_get_domain_local_space(maff->p[0]);
2986 if (!*ls)
2987 return isl_multi_aff_free(maff);
2990 for (i = 0; i < maff->n; ++i) {
2991 maff->p[i] = isl_aff_lift(maff->p[i]);
2992 if (!maff->p[i])
2993 goto error;
2996 return maff;
2997 error:
2998 if (ls)
2999 isl_local_space_free(*ls);
3000 return isl_multi_aff_free(maff);
3004 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
3006 __isl_give isl_pw_aff *isl_pw_multi_aff_get_pw_aff(
3007 __isl_keep isl_pw_multi_aff *pma, int pos)
3009 int i;
3010 int n_out;
3011 isl_space *space;
3012 isl_pw_aff *pa;
3014 if (!pma)
3015 return NULL;
3017 n_out = isl_pw_multi_aff_dim(pma, isl_dim_out);
3018 if (pos < 0 || pos >= n_out)
3019 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
3020 "index out of bounds", return NULL);
3022 space = isl_pw_multi_aff_get_space(pma);
3023 space = isl_space_drop_dims(space, isl_dim_out,
3024 pos + 1, n_out - pos - 1);
3025 space = isl_space_drop_dims(space, isl_dim_out, 0, pos);
3027 pa = isl_pw_aff_alloc_size(space, pma->n);
3028 for (i = 0; i < pma->n; ++i) {
3029 isl_aff *aff;
3030 aff = isl_multi_aff_get_aff(pma->p[i].maff, pos);
3031 pa = isl_pw_aff_add_piece(pa, isl_set_copy(pma->p[i].set), aff);
3034 return pa;
3037 /* Return an isl_pw_multi_aff with the given "set" as domain and
3038 * an unnamed zero-dimensional range.
3040 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_domain(
3041 __isl_take isl_set *set)
3043 isl_multi_aff *ma;
3044 isl_space *space;
3046 space = isl_set_get_space(set);
3047 space = isl_space_from_domain(space);
3048 ma = isl_multi_aff_zero(space);
3049 return isl_pw_multi_aff_alloc(set, ma);
3052 /* Add an isl_pw_multi_aff with the given "set" as domain and
3053 * an unnamed zero-dimensional range to *user.
3055 static int add_pw_multi_aff_from_domain(__isl_take isl_set *set, void *user)
3057 isl_union_pw_multi_aff **upma = user;
3058 isl_pw_multi_aff *pma;
3060 pma = isl_pw_multi_aff_from_domain(set);
3061 *upma = isl_union_pw_multi_aff_add_pw_multi_aff(*upma, pma);
3063 return 0;
3066 /* Return an isl_union_pw_multi_aff with the given "uset" as domain and
3067 * an unnamed zero-dimensional range.
3069 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_domain(
3070 __isl_take isl_union_set *uset)
3072 isl_space *space;
3073 isl_union_pw_multi_aff *upma;
3075 if (!uset)
3076 return NULL;
3078 space = isl_union_set_get_space(uset);
3079 upma = isl_union_pw_multi_aff_empty(space);
3081 if (isl_union_set_foreach_set(uset,
3082 &add_pw_multi_aff_from_domain, &upma) < 0)
3083 goto error;
3085 isl_union_set_free(uset);
3086 return upma;
3087 error:
3088 isl_union_set_free(uset);
3089 isl_union_pw_multi_aff_free(upma);
3090 return NULL;
3093 /* Convert "pma" to an isl_map and add it to *umap.
3095 static int map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma, void *user)
3097 isl_union_map **umap = user;
3098 isl_map *map;
3100 map = isl_map_from_pw_multi_aff(pma);
3101 *umap = isl_union_map_add_map(*umap, map);
3103 return 0;
3106 /* Construct a union map mapping the domain of the union
3107 * piecewise multi-affine expression to its range, with each dimension
3108 * in the range equated to the corresponding affine expression on its cell.
3110 __isl_give isl_union_map *isl_union_map_from_union_pw_multi_aff(
3111 __isl_take isl_union_pw_multi_aff *upma)
3113 isl_space *space;
3114 isl_union_map *umap;
3116 if (!upma)
3117 return NULL;
3119 space = isl_union_pw_multi_aff_get_space(upma);
3120 umap = isl_union_map_empty(space);
3122 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma,
3123 &map_from_pw_multi_aff, &umap) < 0)
3124 goto error;
3126 isl_union_pw_multi_aff_free(upma);
3127 return umap;
3128 error:
3129 isl_union_pw_multi_aff_free(upma);
3130 isl_union_map_free(umap);
3131 return NULL;
3134 /* Local data for bin_entry and the callback "fn".
3136 struct isl_union_pw_multi_aff_bin_data {
3137 isl_union_pw_multi_aff *upma2;
3138 isl_union_pw_multi_aff *res;
3139 isl_pw_multi_aff *pma;
3140 int (*fn)(void **entry, void *user);
3143 /* Given an isl_pw_multi_aff from upma1, store it in data->pma
3144 * and call data->fn for each isl_pw_multi_aff in data->upma2.
3146 static int bin_entry(void **entry, void *user)
3148 struct isl_union_pw_multi_aff_bin_data *data = user;
3149 isl_pw_multi_aff *pma = *entry;
3151 data->pma = pma;
3152 if (isl_hash_table_foreach(data->upma2->dim->ctx, &data->upma2->table,
3153 data->fn, data) < 0)
3154 return -1;
3156 return 0;
3159 /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2".
3160 * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is
3161 * passed as user field) and the isl_pw_multi_aff from upma2 is available
3162 * as *entry. The callback should adjust data->res if desired.
3164 static __isl_give isl_union_pw_multi_aff *bin_op(
3165 __isl_take isl_union_pw_multi_aff *upma1,
3166 __isl_take isl_union_pw_multi_aff *upma2,
3167 int (*fn)(void **entry, void *user))
3169 isl_space *space;
3170 struct isl_union_pw_multi_aff_bin_data data = { NULL, NULL, NULL, fn };
3172 space = isl_union_pw_multi_aff_get_space(upma2);
3173 upma1 = isl_union_pw_multi_aff_align_params(upma1, space);
3174 space = isl_union_pw_multi_aff_get_space(upma1);
3175 upma2 = isl_union_pw_multi_aff_align_params(upma2, space);
3177 if (!upma1 || !upma2)
3178 goto error;
3180 data.upma2 = upma2;
3181 data.res = isl_union_pw_multi_aff_alloc(isl_space_copy(upma1->dim),
3182 upma1->table.n);
3183 if (isl_hash_table_foreach(upma1->dim->ctx, &upma1->table,
3184 &bin_entry, &data) < 0)
3185 goto error;
3187 isl_union_pw_multi_aff_free(upma1);
3188 isl_union_pw_multi_aff_free(upma2);
3189 return data.res;
3190 error:
3191 isl_union_pw_multi_aff_free(upma1);
3192 isl_union_pw_multi_aff_free(upma2);
3193 isl_union_pw_multi_aff_free(data.res);
3194 return NULL;
3197 /* Given two isl_multi_affs A -> B and C -> D,
3198 * construct an isl_multi_aff (A * C) -> (B, D).
3200 __isl_give isl_multi_aff *isl_multi_aff_flat_range_product(
3201 __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2)
3203 int i, n1, n2;
3204 isl_aff *aff;
3205 isl_space *space;
3206 isl_multi_aff *res;
3208 if (!ma1 || !ma2)
3209 goto error;
3211 space = isl_space_range_product(isl_multi_aff_get_space(ma1),
3212 isl_multi_aff_get_space(ma2));
3213 space = isl_space_flatten_range(space);
3214 res = isl_multi_aff_alloc(space);
3216 n1 = isl_multi_aff_dim(ma1, isl_dim_out);
3217 n2 = isl_multi_aff_dim(ma2, isl_dim_out);
3219 for (i = 0; i < n1; ++i) {
3220 aff = isl_multi_aff_get_aff(ma1, i);
3221 res = isl_multi_aff_set_aff(res, i, aff);
3224 for (i = 0; i < n2; ++i) {
3225 aff = isl_multi_aff_get_aff(ma2, i);
3226 res = isl_multi_aff_set_aff(res, n1 + i, aff);
3229 isl_multi_aff_free(ma1);
3230 isl_multi_aff_free(ma2);
3231 return res;
3232 error:
3233 isl_multi_aff_free(ma1);
3234 isl_multi_aff_free(ma2);
3235 return NULL;
3238 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
3239 * construct an isl_pw_multi_aff (A * C) -> (B, D).
3241 static __isl_give isl_pw_multi_aff *pw_multi_aff_flat_range_product(
3242 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3244 isl_space *space;
3246 space = isl_space_range_product(isl_pw_multi_aff_get_space(pma1),
3247 isl_pw_multi_aff_get_space(pma2));
3248 space = isl_space_flatten_range(space);
3249 return isl_pw_multi_aff_on_shared_domain_in(pma1, pma2, space,
3250 &isl_multi_aff_flat_range_product);
3253 /* Given two isl_pw_multi_affs A -> B and C -> D,
3254 * construct an isl_pw_multi_aff (A * C) -> (B, D).
3256 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_flat_range_product(
3257 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3259 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3260 &pw_multi_aff_flat_range_product);
3263 /* If data->pma and *entry have the same domain space, then compute
3264 * their flat range product and the result to data->res.
3266 static int flat_range_product_entry(void **entry, void *user)
3268 struct isl_union_pw_multi_aff_bin_data *data = user;
3269 isl_pw_multi_aff *pma2 = *entry;
3271 if (!isl_space_tuple_match(data->pma->dim, isl_dim_in,
3272 pma2->dim, isl_dim_in))
3273 return 0;
3275 pma2 = isl_pw_multi_aff_flat_range_product(
3276 isl_pw_multi_aff_copy(data->pma),
3277 isl_pw_multi_aff_copy(pma2));
3279 data->res = isl_union_pw_multi_aff_add_pw_multi_aff(data->res, pma2);
3281 return 0;
3284 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
3285 * construct an isl_union_pw_multi_aff (A * C) -> (B, D).
3287 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_flat_range_product(
3288 __isl_take isl_union_pw_multi_aff *upma1,
3289 __isl_take isl_union_pw_multi_aff *upma2)
3291 return bin_op(upma1, upma2, &flat_range_product_entry);