2 * Copyright 2010 INRIA Saclay
4 * Use of this software is governed by the GNU LGPLv2.1 license
6 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
7 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
13 #include <isl_polynomial_private.h>
14 #include <isl_point_private.h>
15 #include <isl_dim_private.h>
16 #include <isl_map_private.h>
18 static unsigned pos(__isl_keep isl_dim *dim, enum isl_dim_type type)
21 case isl_dim_param: return 0;
22 case isl_dim_in: return dim->nparam;
23 case isl_dim_out: return dim->nparam + dim->n_in;
27 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
35 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
40 isl_assert(up->ctx, up->var < 0, return NULL);
42 return (struct isl_upoly_cst *)up;
45 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
50 isl_assert(up->ctx, up->var >= 0, return NULL);
52 return (struct isl_upoly_rec *)up;
55 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
56 __isl_keep struct isl_upoly *up2)
59 struct isl_upoly_rec *rec1, *rec2;
65 if (up1->var != up2->var)
67 if (isl_upoly_is_cst(up1)) {
68 struct isl_upoly_cst *cst1, *cst2;
69 cst1 = isl_upoly_as_cst(up1);
70 cst2 = isl_upoly_as_cst(up2);
73 return isl_int_eq(cst1->n, cst2->n) &&
74 isl_int_eq(cst1->d, cst2->d);
77 rec1 = isl_upoly_as_rec(up1);
78 rec2 = isl_upoly_as_rec(up2);
82 if (rec1->n != rec2->n)
85 for (i = 0; i < rec1->n; ++i) {
86 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
94 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
96 struct isl_upoly_cst *cst;
100 if (!isl_upoly_is_cst(up))
103 cst = isl_upoly_as_cst(up);
107 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
110 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
112 struct isl_upoly_cst *cst;
116 if (!isl_upoly_is_cst(up))
119 cst = isl_upoly_as_cst(up);
123 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
126 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
128 struct isl_upoly_cst *cst;
132 if (!isl_upoly_is_cst(up))
135 cst = isl_upoly_as_cst(up);
139 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
142 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
144 struct isl_upoly_cst *cst;
148 if (!isl_upoly_is_cst(up))
151 cst = isl_upoly_as_cst(up);
155 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
158 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
160 struct isl_upoly_cst *cst;
164 if (!isl_upoly_is_cst(up))
167 cst = isl_upoly_as_cst(up);
171 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
174 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
176 struct isl_upoly_cst *cst;
180 if (!isl_upoly_is_cst(up))
183 cst = isl_upoly_as_cst(up);
187 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
190 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
192 struct isl_upoly_cst *cst;
194 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
203 isl_int_init(cst->n);
204 isl_int_init(cst->d);
209 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
211 struct isl_upoly_cst *cst;
213 cst = isl_upoly_cst_alloc(ctx);
217 isl_int_set_si(cst->n, 0);
218 isl_int_set_si(cst->d, 1);
223 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
225 struct isl_upoly_cst *cst;
227 cst = isl_upoly_cst_alloc(ctx);
231 isl_int_set_si(cst->n, 1);
232 isl_int_set_si(cst->d, 0);
237 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
239 struct isl_upoly_cst *cst;
241 cst = isl_upoly_cst_alloc(ctx);
245 isl_int_set_si(cst->n, 0);
246 isl_int_set_si(cst->d, 0);
251 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
252 isl_int n, isl_int d)
254 struct isl_upoly_cst *cst;
256 cst = isl_upoly_cst_alloc(ctx);
260 isl_int_set(cst->n, n);
261 isl_int_set(cst->d, d);
266 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
269 struct isl_upoly_rec *rec;
271 isl_assert(ctx, var >= 0, return NULL);
272 isl_assert(ctx, size >= 0, return NULL);
273 rec = isl_calloc(dim->ctx, struct isl_upoly_rec,
274 sizeof(struct isl_upoly_rec) +
275 (size - 1) * sizeof(struct isl_upoly *));
289 isl_upoly_free(&rec->up);
293 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
295 struct isl_upoly_cst *cst;
300 return isl_upoly_is_zero(qp->upoly);
303 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
305 struct isl_upoly_cst *cst;
310 return isl_upoly_is_one(qp->upoly);
313 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
315 isl_int_clear(cst->n);
316 isl_int_clear(cst->d);
319 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
323 for (i = 0; i < rec->n; ++i)
324 isl_upoly_free(rec->p[i]);
327 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
336 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
338 struct isl_upoly_cst *cst;
339 struct isl_upoly_cst *dup;
341 cst = isl_upoly_as_cst(up);
345 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
348 isl_int_set(dup->n, cst->n);
349 isl_int_set(dup->d, cst->d);
354 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
357 struct isl_upoly_rec *rec;
358 struct isl_upoly_rec *dup;
360 rec = isl_upoly_as_rec(up);
364 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
368 for (i = 0; i < rec->n; ++i) {
369 dup->p[i] = isl_upoly_copy(rec->p[i]);
377 isl_upoly_free(&dup->up);
381 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
383 struct isl_upoly *dup;
388 if (isl_upoly_is_cst(up))
389 return isl_upoly_dup_cst(up);
391 return isl_upoly_dup_rec(up);
394 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
402 return isl_upoly_dup(up);
405 void isl_upoly_free(__isl_take struct isl_upoly *up)
414 upoly_free_cst((struct isl_upoly_cst *)up);
416 upoly_free_rec((struct isl_upoly_rec *)up);
418 isl_ctx_deref(up->ctx);
422 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
427 isl_int_gcd(gcd, cst->n, cst->d);
428 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
429 isl_int_divexact(cst->n, cst->n, gcd);
430 isl_int_divexact(cst->d, cst->d, gcd);
435 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
436 __isl_take struct isl_upoly *up2)
438 struct isl_upoly_cst *cst1;
439 struct isl_upoly_cst *cst2;
441 up1 = isl_upoly_cow(up1);
445 cst1 = isl_upoly_as_cst(up1);
446 cst2 = isl_upoly_as_cst(up2);
448 if (isl_int_eq(cst1->d, cst2->d))
449 isl_int_add(cst1->n, cst1->n, cst2->n);
451 isl_int_mul(cst1->n, cst1->n, cst2->d);
452 isl_int_addmul(cst1->n, cst2->n, cst1->d);
453 isl_int_mul(cst1->d, cst1->d, cst2->d);
456 isl_upoly_cst_reduce(cst1);
466 static __isl_give struct isl_upoly *replace_by_zero(
467 __isl_take struct isl_upoly *up)
475 return isl_upoly_zero(ctx);
478 static __isl_give struct isl_upoly *replace_by_constant_term(
479 __isl_take struct isl_upoly *up)
481 struct isl_upoly_rec *rec;
482 struct isl_upoly *cst;
487 rec = isl_upoly_as_rec(up);
490 cst = isl_upoly_copy(rec->p[0]);
498 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
499 __isl_take struct isl_upoly *up2)
502 struct isl_upoly_rec *rec1, *rec2;
507 if (isl_upoly_is_nan(up1)) {
512 if (isl_upoly_is_nan(up2)) {
517 if (isl_upoly_is_zero(up1)) {
522 if (isl_upoly_is_zero(up2)) {
527 if (up1->var < up2->var)
528 return isl_upoly_sum(up2, up1);
530 if (up2->var < up1->var) {
531 struct isl_upoly_rec *rec;
532 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
536 up1 = isl_upoly_cow(up1);
537 rec = isl_upoly_as_rec(up1);
540 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
542 up1 = replace_by_constant_term(up1);
546 if (isl_upoly_is_cst(up1))
547 return isl_upoly_sum_cst(up1, up2);
549 rec1 = isl_upoly_as_rec(up1);
550 rec2 = isl_upoly_as_rec(up2);
554 if (rec1->n < rec2->n)
555 return isl_upoly_sum(up2, up1);
557 up1 = isl_upoly_cow(up1);
558 rec1 = isl_upoly_as_rec(up1);
562 for (i = rec2->n - 1; i >= 0; --i) {
563 rec1->p[i] = isl_upoly_sum(rec1->p[i],
564 isl_upoly_copy(rec2->p[i]));
567 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
568 isl_upoly_free(rec1->p[i]);
574 up1 = replace_by_zero(up1);
575 else if (rec1->n == 1)
576 up1 = replace_by_constant_term(up1);
587 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
589 struct isl_upoly_cst *cst;
591 if (isl_upoly_is_zero(up))
594 up = isl_upoly_cow(up);
598 cst = isl_upoly_as_cst(up);
600 isl_int_neg(cst->n, cst->n);
605 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
608 struct isl_upoly_rec *rec;
613 if (isl_upoly_is_cst(up))
614 return isl_upoly_neg_cst(up);
616 up = isl_upoly_cow(up);
617 rec = isl_upoly_as_rec(up);
621 for (i = 0; i < rec->n; ++i) {
622 rec->p[i] = isl_upoly_neg(rec->p[i]);
633 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
634 __isl_take struct isl_upoly *up2)
636 struct isl_upoly_cst *cst1;
637 struct isl_upoly_cst *cst2;
639 up1 = isl_upoly_cow(up1);
643 cst1 = isl_upoly_as_cst(up1);
644 cst2 = isl_upoly_as_cst(up2);
646 isl_int_mul(cst1->n, cst1->n, cst2->n);
647 isl_int_mul(cst1->d, cst1->d, cst2->d);
649 isl_upoly_cst_reduce(cst1);
659 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
660 __isl_take struct isl_upoly *up2)
662 struct isl_upoly_rec *rec1;
663 struct isl_upoly_rec *rec2;
664 struct isl_upoly_rec *res;
668 rec1 = isl_upoly_as_rec(up1);
669 rec2 = isl_upoly_as_rec(up2);
672 size = rec1->n + rec2->n - 1;
673 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
677 for (i = 0; i < rec1->n; ++i) {
678 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
679 isl_upoly_copy(rec1->p[i]));
684 for (; i < size; ++i) {
685 res->p[i] = isl_upoly_zero(up1->ctx);
690 for (i = 0; i < rec1->n; ++i) {
691 for (j = 1; j < rec2->n; ++j) {
692 struct isl_upoly *up;
693 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
694 isl_upoly_copy(rec1->p[i]));
695 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
708 isl_upoly_free(&res->up);
712 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
713 __isl_take struct isl_upoly *up2)
718 if (isl_upoly_is_nan(up1)) {
723 if (isl_upoly_is_nan(up2)) {
728 if (isl_upoly_is_zero(up1)) {
733 if (isl_upoly_is_zero(up2)) {
738 if (isl_upoly_is_one(up1)) {
743 if (isl_upoly_is_one(up2)) {
748 if (up1->var < up2->var)
749 return isl_upoly_mul(up2, up1);
751 if (up2->var < up1->var) {
753 struct isl_upoly_rec *rec;
754 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
755 isl_ctx *ctx = up1->ctx;
758 return isl_upoly_nan(ctx);
760 up1 = isl_upoly_cow(up1);
761 rec = isl_upoly_as_rec(up1);
765 for (i = 0; i < rec->n; ++i) {
766 rec->p[i] = isl_upoly_mul(rec->p[i],
767 isl_upoly_copy(up2));
775 if (isl_upoly_is_cst(up1))
776 return isl_upoly_mul_cst(up1, up2);
778 return isl_upoly_mul_rec(up1, up2);
785 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
788 struct isl_qpolynomial *qp;
794 total = isl_dim_total(dim);
796 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
801 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
810 isl_qpolynomial_free(qp);
814 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
823 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
825 struct isl_qpolynomial *dup;
830 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row);
833 isl_mat_free(dup->div);
834 dup->div = isl_mat_copy(qp->div);
837 dup->upoly = isl_upoly_copy(qp->upoly);
843 isl_qpolynomial_free(dup);
847 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
855 return isl_qpolynomial_dup(qp);
858 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
866 isl_dim_free(qp->dim);
867 isl_mat_free(qp->div);
868 isl_upoly_free(qp->upoly);
873 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
878 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
879 div1->n_col >= div2->n_col, return -1);
881 if (div1->n_row == div2->n_row)
882 return isl_mat_is_equal(div1, div2);
886 div1->n_row = div2->n_row;
887 div1->n_col = div2->n_col;
889 equal = isl_mat_is_equal(div1, div2);
897 static void expand_row(__isl_keep isl_mat *dst, int d,
898 __isl_keep isl_mat *src, int s, int *exp)
901 unsigned c = src->n_col - src->n_row;
903 isl_seq_cpy(dst->row[d], src->row[s], c);
904 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
906 for (i = 0; i < s; ++i)
907 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
910 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
914 li = isl_seq_last_non_zero(div->row[i], div->n_col);
915 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
920 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
923 struct isl_div_sort_info {
928 static int div_sort_cmp(const void *p1, const void *p2)
930 const struct isl_div_sort_info *i1, *i2;
931 i1 = (const struct isl_div_sort_info *) p1;
932 i2 = (const struct isl_div_sort_info *) p2;
934 return cmp_row(i1->div, i1->row, i2->row);
937 static __isl_give isl_mat *sort_divs(__isl_take isl_mat *div)
940 struct isl_div_sort_info *array = NULL;
948 array = isl_alloc_array(div->ctx, struct isl_div_sort_info, div->n_row);
949 pos = isl_alloc_array(div->ctx, int, div->n_row);
953 for (i = 0; i < div->n_row; ++i) {
959 qsort(array, div->n_row, sizeof(struct isl_div_sort_info),
962 for (i = 0; i < div->n_row; ++i) {
964 if (pos[array[i].row] == i)
966 div = isl_mat_cow(div);
967 div = isl_mat_swap_rows(div, i, pos[array[i].row]);
968 t = pos[array[i].row];
969 pos[array[i].row] = pos[i];
983 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
984 __isl_keep isl_mat *div2, int *exp1, int *exp2)
988 unsigned d = div1->n_col - div1->n_row;
990 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
991 d + div1->n_row + div2->n_row);
995 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
998 expand_row(div, k, div1, i, exp1);
999 expand_row(div, k + 1, div2, j, exp2);
1001 cmp = cmp_row(div, k, k + 1);
1005 } else if (cmp < 0) {
1009 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1012 for (; i < div1->n_row; ++i, ++k) {
1013 expand_row(div, k, div1, i, exp1);
1016 for (; j < div2->n_row; ++j, ++k) {
1017 expand_row(div, k, div2, j, exp2);
1027 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1028 int *exp, int first)
1031 struct isl_upoly_rec *rec;
1033 if (isl_upoly_is_cst(up))
1036 if (up->var < first)
1039 if (exp[up->var - first] == up->var - first)
1042 up = isl_upoly_cow(up);
1046 up->var = exp[up->var - first] + first;
1048 rec = isl_upoly_as_rec(up);
1052 for (i = 0; i < rec->n; ++i) {
1053 rec->p[i] = expand(rec->p[i], exp, first);
1064 static __isl_give isl_qpolynomial *with_merged_divs(
1065 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1066 __isl_take isl_qpolynomial *qp2),
1067 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1071 isl_mat *div = NULL;
1073 qp1 = isl_qpolynomial_cow(qp1);
1074 qp2 = isl_qpolynomial_cow(qp2);
1079 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1080 qp1->div->n_col >= qp2->div->n_col, goto error);
1082 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1083 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1087 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1091 isl_mat_free(qp1->div);
1092 qp1->div = isl_mat_copy(div);
1093 isl_mat_free(qp2->div);
1094 qp2->div = isl_mat_copy(div);
1096 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1097 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1099 if (!qp1->upoly || !qp2->upoly)
1106 return fn(qp1, qp2);
1111 isl_qpolynomial_free(qp1);
1112 isl_qpolynomial_free(qp2);
1116 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1117 __isl_take isl_qpolynomial *qp2)
1119 qp1 = isl_qpolynomial_cow(qp1);
1124 if (qp1->div->n_row < qp2->div->n_row)
1125 return isl_qpolynomial_add(qp2, qp1);
1127 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1128 if (!compatible_divs(qp1->div, qp2->div))
1129 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1131 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1135 isl_qpolynomial_free(qp2);
1139 isl_qpolynomial_free(qp1);
1140 isl_qpolynomial_free(qp2);
1144 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1145 __isl_take isl_qpolynomial *qp2)
1147 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1150 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1152 qp = isl_qpolynomial_cow(qp);
1157 qp->upoly = isl_upoly_neg(qp->upoly);
1163 isl_qpolynomial_free(qp);
1167 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1168 __isl_take isl_qpolynomial *qp2)
1170 qp1 = isl_qpolynomial_cow(qp1);
1175 if (qp1->div->n_row < qp2->div->n_row)
1176 return isl_qpolynomial_mul(qp2, qp1);
1178 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1179 if (!compatible_divs(qp1->div, qp2->div))
1180 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1182 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1186 isl_qpolynomial_free(qp2);
1190 isl_qpolynomial_free(qp1);
1191 isl_qpolynomial_free(qp2);
1195 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1197 struct isl_qpolynomial *qp;
1198 struct isl_upoly_cst *cst;
1200 qp = isl_qpolynomial_alloc(dim, 0);
1204 qp->upoly = isl_upoly_zero(dim->ctx);
1210 isl_qpolynomial_free(qp);
1214 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1216 struct isl_qpolynomial *qp;
1217 struct isl_upoly_cst *cst;
1219 qp = isl_qpolynomial_alloc(dim, 0);
1223 qp->upoly = isl_upoly_infty(dim->ctx);
1229 isl_qpolynomial_free(qp);
1233 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1235 struct isl_qpolynomial *qp;
1236 struct isl_upoly_cst *cst;
1238 qp = isl_qpolynomial_alloc(dim, 0);
1242 qp->upoly = isl_upoly_nan(dim->ctx);
1248 isl_qpolynomial_free(qp);
1252 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1255 struct isl_qpolynomial *qp;
1256 struct isl_upoly_cst *cst;
1258 qp = isl_qpolynomial_alloc(dim, 0);
1262 qp->upoly = isl_upoly_zero(dim->ctx);
1265 cst = isl_upoly_as_cst(qp->upoly);
1266 isl_int_set(cst->n, v);
1270 isl_qpolynomial_free(qp);
1274 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1275 isl_int *n, isl_int *d)
1277 struct isl_upoly_cst *cst;
1282 if (!isl_upoly_is_cst(qp->upoly))
1285 cst = isl_upoly_as_cst(qp->upoly);
1290 isl_int_set(*n, cst->n);
1292 isl_int_set(*d, cst->d);
1297 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1298 __isl_keep isl_qpolynomial *qp2)
1303 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1306 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1309 struct isl_upoly_rec *rec;
1311 if (isl_upoly_is_cst(up)) {
1312 struct isl_upoly_cst *cst;
1313 cst = isl_upoly_as_cst(up);
1316 isl_int_lcm(*d, *d, cst->d);
1320 rec = isl_upoly_as_rec(up);
1324 for (i = 0; i < rec->n; ++i)
1325 upoly_update_den(rec->p[i], d);
1328 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1330 isl_int_set_si(*d, 1);
1333 upoly_update_den(qp->upoly, d);
1336 __isl_give struct isl_upoly *isl_upoly_pow(isl_ctx *ctx, int pos, int power)
1339 struct isl_upoly *up;
1340 struct isl_upoly_rec *rec;
1341 struct isl_upoly_cst *cst;
1343 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
1346 for (i = 0; i < 1 + power; ++i) {
1347 rec->p[i] = isl_upoly_zero(ctx);
1352 cst = isl_upoly_as_cst(rec->p[power]);
1353 isl_int_set_si(cst->n, 1);
1357 isl_upoly_free(&rec->up);
1361 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1364 struct isl_qpolynomial *qp;
1365 struct isl_ctx *ctx;
1372 qp = isl_qpolynomial_alloc(dim, 0);
1376 qp->upoly = isl_upoly_pow(ctx, pos, power);
1382 isl_qpolynomial_free(qp);
1386 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1387 enum isl_dim_type type, unsigned pos)
1392 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1393 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1395 if (type == isl_dim_set)
1396 pos += isl_dim_size(dim, isl_dim_param);
1398 return isl_qpolynomial_pow(dim, pos, 1);
1404 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1407 struct isl_qpolynomial *qp = NULL;
1408 struct isl_upoly_rec *rec;
1409 struct isl_upoly_cst *cst;
1415 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1417 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1);
1421 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1422 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1424 pos = isl_dim_total(qp->dim);
1425 qp->upoly = &isl_upoly_alloc_rec(div->ctx, pos, 1 + power)->up;
1428 rec = isl_upoly_as_rec(qp->upoly);
1429 for (i = 0; i < 1 + power; ++i) {
1430 rec->p[i] = isl_upoly_zero(div->ctx);
1435 cst = isl_upoly_as_cst(rec->p[power]);
1436 isl_int_set_si(cst->n, 1);
1442 isl_qpolynomial_free(qp);
1447 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1449 return isl_qpolynomial_div_pow(div, 1);
1452 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1453 const isl_int n, const isl_int d)
1455 struct isl_qpolynomial *qp;
1456 struct isl_upoly_cst *cst;
1458 qp = isl_qpolynomial_alloc(dim, 0);
1462 qp->upoly = isl_upoly_zero(dim->ctx);
1465 cst = isl_upoly_as_cst(qp->upoly);
1466 isl_int_set(cst->n, n);
1467 isl_int_set(cst->d, d);
1471 isl_qpolynomial_free(qp);
1475 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1477 struct isl_upoly_rec *rec;
1483 if (isl_upoly_is_cst(up))
1487 active[up->var] = 1;
1489 rec = isl_upoly_as_rec(up);
1490 for (i = 0; i < rec->n; ++i)
1491 if (up_set_active(rec->p[i], active, d) < 0)
1497 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1500 int d = isl_dim_total(qp->dim);
1505 for (i = 0; i < d; ++i)
1506 for (j = 0; j < qp->div->n_row; ++j) {
1507 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1513 return up_set_active(qp->upoly, active, d);
1516 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1517 enum isl_dim_type type, unsigned first, unsigned n)
1528 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1530 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1531 type == isl_dim_set, return -1);
1533 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1534 if (set_active(qp, active) < 0)
1537 if (type == isl_dim_set)
1538 first += isl_dim_size(qp->dim, isl_dim_param);
1539 for (i = 0; i < n; ++i)
1540 if (active[first + i]) {
1553 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1554 unsigned first, unsigned n)
1557 struct isl_upoly_rec *rec;
1561 if (n == 0 || up->var < 0 || up->var < first)
1563 if (up->var < first + n) {
1564 up = replace_by_constant_term(up);
1565 return isl_upoly_drop(up, first, n);
1567 up = isl_upoly_cow(up);
1571 rec = isl_upoly_as_rec(up);
1575 for (i = 0; i < rec->n; ++i) {
1576 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1587 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1588 __isl_take isl_qpolynomial *qp,
1589 enum isl_dim_type type, unsigned first, unsigned n)
1596 qp = isl_qpolynomial_cow(qp);
1600 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1602 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1603 type == isl_dim_set, goto error);
1605 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1609 if (type == isl_dim_set)
1610 first += isl_dim_size(qp->dim, isl_dim_param);
1612 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1616 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1622 isl_qpolynomial_free(qp);
1627 #define PW isl_pw_qpolynomial
1629 #define EL isl_qpolynomial
1631 #define IS_ZERO is_zero
1637 #include <isl_pw_templ.c>
1639 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
1647 if (!isl_set_fast_is_universe(pwqp->p[0].set))
1650 return isl_qpolynomial_is_one(pwqp->p[0].qp);
1653 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
1654 __isl_take isl_pw_qpolynomial *pwqp1,
1655 __isl_take isl_pw_qpolynomial *pwqp2)
1658 struct isl_pw_qpolynomial *res;
1661 if (!pwqp1 || !pwqp2)
1664 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
1667 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
1668 isl_pw_qpolynomial_free(pwqp2);
1672 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
1673 isl_pw_qpolynomial_free(pwqp1);
1677 if (isl_pw_qpolynomial_is_one(pwqp1)) {
1678 isl_pw_qpolynomial_free(pwqp1);
1682 if (isl_pw_qpolynomial_is_one(pwqp2)) {
1683 isl_pw_qpolynomial_free(pwqp2);
1687 n = pwqp1->n * pwqp2->n;
1688 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
1690 for (i = 0; i < pwqp1->n; ++i) {
1691 for (j = 0; j < pwqp2->n; ++j) {
1692 struct isl_set *common;
1693 struct isl_qpolynomial *prod;
1694 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
1695 isl_set_copy(pwqp2->p[j].set));
1696 if (isl_set_fast_is_empty(common)) {
1697 isl_set_free(common);
1701 prod = isl_qpolynomial_mul(
1702 isl_qpolynomial_copy(pwqp1->p[i].qp),
1703 isl_qpolynomial_copy(pwqp2->p[j].qp));
1705 res = isl_pw_qpolynomial_add_piece(res, common, prod);
1709 isl_pw_qpolynomial_free(pwqp1);
1710 isl_pw_qpolynomial_free(pwqp2);
1714 isl_pw_qpolynomial_free(pwqp1);
1715 isl_pw_qpolynomial_free(pwqp2);
1719 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
1720 __isl_take isl_pw_qpolynomial *pwqp)
1723 struct isl_pw_qpolynomial *res;
1729 if (isl_pw_qpolynomial_is_zero(pwqp))
1732 pwqp = isl_pw_qpolynomial_cow(pwqp);
1734 for (i = 0; i < pwqp->n; ++i) {
1735 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
1742 isl_pw_qpolynomial_free(pwqp);
1746 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
1747 __isl_take isl_pw_qpolynomial *pwqp1,
1748 __isl_take isl_pw_qpolynomial *pwqp2)
1750 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
1753 __isl_give struct isl_upoly *isl_upoly_eval(
1754 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
1757 struct isl_upoly_rec *rec;
1758 struct isl_upoly *res;
1759 struct isl_upoly *base;
1761 if (isl_upoly_is_cst(up)) {
1766 rec = isl_upoly_as_rec(up);
1770 isl_assert(up->ctx, rec->n >= 1, goto error);
1772 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
1774 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
1777 for (i = rec->n - 2; i >= 0; --i) {
1778 res = isl_upoly_mul(res, isl_upoly_copy(base));
1779 res = isl_upoly_sum(res,
1780 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
1781 isl_vec_copy(vec)));
1784 isl_upoly_free(base);
1794 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
1795 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
1798 struct isl_upoly *up;
1803 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
1805 if (qp->div->n_row == 0)
1806 ext = isl_vec_copy(pnt->vec);
1809 unsigned dim = isl_dim_total(qp->dim);
1810 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
1814 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
1815 for (i = 0; i < qp->div->n_row; ++i) {
1816 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
1817 1 + dim + i, &ext->el[1+dim+i]);
1818 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
1819 qp->div->row[i][0]);
1823 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
1827 dim = isl_dim_copy(qp->dim);
1828 isl_qpolynomial_free(qp);
1829 isl_point_free(pnt);
1831 qp = isl_qpolynomial_alloc(dim, 0);
1839 isl_qpolynomial_free(qp);
1840 isl_point_free(pnt);
1844 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
1845 __isl_keep struct isl_upoly_cst *cst2)
1850 isl_int_mul(t, cst1->n, cst2->d);
1851 isl_int_submul(t, cst2->n, cst1->d);
1852 cmp = isl_int_sgn(t);
1857 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
1858 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1860 struct isl_upoly_cst *cst1, *cst2;
1865 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1866 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1867 cst1 = isl_upoly_as_cst(qp1->upoly);
1868 cst2 = isl_upoly_as_cst(qp2->upoly);
1869 cmp = isl_upoly_cmp(cst1, cst2);
1872 isl_qpolynomial_free(qp2);
1874 isl_qpolynomial_free(qp1);
1879 isl_qpolynomial_free(qp1);
1880 isl_qpolynomial_free(qp2);
1884 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
1885 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1887 struct isl_upoly_cst *cst1, *cst2;
1892 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1893 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1894 cst1 = isl_upoly_as_cst(qp1->upoly);
1895 cst2 = isl_upoly_as_cst(qp2->upoly);
1896 cmp = isl_upoly_cmp(cst1, cst2);
1899 isl_qpolynomial_free(qp2);
1901 isl_qpolynomial_free(qp1);
1906 isl_qpolynomial_free(qp1);
1907 isl_qpolynomial_free(qp2);
1911 static int *reordering_move(isl_ctx *ctx,
1912 unsigned len, unsigned dst, unsigned src, unsigned n)
1917 reordering = isl_alloc_array(ctx, int, len);
1922 for (i = 0; i < dst; ++i)
1924 for (i = 0; i < n; ++i)
1925 reordering[src + i] = dst + i;
1926 for (i = 0; i < src - dst; ++i)
1927 reordering[dst + i] = dst + n + i;
1928 for (i = 0; i < len - src - n; ++i)
1929 reordering[src + n + i] = src + n + i;
1931 for (i = 0; i < src; ++i)
1933 for (i = 0; i < n; ++i)
1934 reordering[src + i] = dst + i;
1935 for (i = 0; i < dst - src; ++i)
1936 reordering[src + n + i] = src + i;
1937 for (i = 0; i < len - dst - n; ++i)
1938 reordering[dst + n + i] = dst + n + i;
1944 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
1948 struct isl_upoly_rec *rec;
1949 struct isl_upoly *base;
1950 struct isl_upoly *res;
1952 if (isl_upoly_is_cst(up))
1955 rec = isl_upoly_as_rec(up);
1959 isl_assert(up->ctx, rec->n >= 1, goto error);
1961 base = isl_upoly_pow(up->ctx, r[up->var], 1);
1962 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
1964 for (i = rec->n - 2; i >= 0; --i) {
1965 res = isl_upoly_mul(res, isl_upoly_copy(base));
1966 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
1969 isl_upoly_free(base);
1978 __isl_give isl_qpolynomial *isl_qpolynomial_move(__isl_take isl_qpolynomial *qp,
1979 enum isl_dim_type dst_type, unsigned dst_pos,
1980 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1986 qp = isl_qpolynomial_cow(qp);
1990 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
1993 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
1994 g_src_pos = pos(qp->dim, src_type) + src_pos;
1995 if (dst_type > src_type)
1998 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
1999 qp->div = sort_divs(qp->div);
2003 reordering = reordering_move(qp->dim->ctx,
2004 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2008 qp->upoly = reorder(qp->upoly, reordering);
2013 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2019 isl_qpolynomial_free(qp);
2023 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_move(
2024 __isl_take isl_pw_qpolynomial *pwqp,
2025 enum isl_dim_type dst_type, unsigned dst_pos,
2026 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2030 pwqp = isl_pw_qpolynomial_cow(pwqp);
2034 pwqp->dim = isl_dim_move(pwqp->dim,
2035 dst_type, dst_pos, src_type, src_pos, n);
2039 for (i = 0; i < pwqp->n; ++i) {
2040 pwqp->p[i].set = isl_set_move(pwqp->p[i].set, dst_type, dst_pos,
2041 src_type, src_pos, n);
2042 if (!pwqp->p[i].set)
2044 pwqp->p[i].qp = isl_qpolynomial_move(pwqp->p[i].qp,
2045 dst_type, dst_pos, src_type, src_pos, n);
2052 isl_pw_qpolynomial_free(pwqp);
2056 __isl_give isl_dim *isl_pw_qpolynomial_get_dim(
2057 __isl_keep isl_pw_qpolynomial *pwqp)
2062 return isl_dim_copy(pwqp->dim);
2065 unsigned isl_pw_qpolynomial_dim(__isl_keep isl_pw_qpolynomial *pwqp,
2066 enum isl_dim_type type)
2068 return pwqp ? isl_dim_size(pwqp->dim, type) : 0;
2071 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2072 __isl_take isl_mat *div)
2080 n = isl_dim_total(dim) + div->n_row;
2082 term = isl_calloc(dim->ctx, struct isl_term,
2083 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2090 isl_int_init(term->n);
2091 isl_int_init(term->d);
2100 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
2109 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
2118 total = isl_dim_total(term->dim) + term->div->n_row;
2120 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
2124 isl_int_set(dup->n, term->n);
2125 isl_int_set(dup->d, term->d);
2127 for (i = 0; i < total; ++i)
2128 dup->pow[i] = term->pow[i];
2133 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
2141 return isl_term_dup(term);
2144 void isl_term_free(__isl_take isl_term *term)
2149 if (--term->ref > 0)
2152 isl_dim_free(term->dim);
2153 isl_mat_free(term->div);
2154 isl_int_clear(term->n);
2155 isl_int_clear(term->d);
2159 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
2167 case isl_dim_out: return isl_dim_size(term->dim, type);
2168 case isl_dim_div: return term->div->n_row;
2169 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
2173 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
2175 return term ? term->dim->ctx : NULL;
2178 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
2182 isl_int_set(*n, term->n);
2185 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
2189 isl_int_set(*d, term->d);
2192 int isl_term_get_exp(__isl_keep isl_term *term,
2193 enum isl_dim_type type, unsigned pos)
2198 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
2200 if (type >= isl_dim_set)
2201 pos += isl_dim_size(term->dim, isl_dim_param);
2202 if (type >= isl_dim_div)
2203 pos += isl_dim_size(term->dim, isl_dim_set);
2205 return term->pow[pos];
2208 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
2210 isl_basic_map *bmap;
2217 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
2220 total = term->div->n_col - term->div->n_row - 2;
2221 /* No nested divs for now */
2222 isl_assert(term->dim->ctx,
2223 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
2224 term->div->n_row) == -1,
2227 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
2228 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
2231 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
2233 return isl_basic_map_div(bmap, k);
2235 isl_basic_map_free(bmap);
2239 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
2240 int (*fn)(__isl_take isl_term *term, void *user),
2241 __isl_take isl_term *term, void *user)
2244 struct isl_upoly_rec *rec;
2249 if (isl_upoly_is_zero(up))
2252 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
2253 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
2254 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
2256 if (isl_upoly_is_cst(up)) {
2257 struct isl_upoly_cst *cst;
2258 cst = isl_upoly_as_cst(up);
2261 term = isl_term_cow(term);
2264 isl_int_set(term->n, cst->n);
2265 isl_int_set(term->d, cst->d);
2266 if (fn(isl_term_copy(term), user) < 0)
2271 rec = isl_upoly_as_rec(up);
2275 for (i = 0; i < rec->n; ++i) {
2276 term = isl_term_cow(term);
2279 term->pow[up->var] = i;
2280 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
2284 term->pow[up->var] = 0;
2288 isl_term_free(term);
2292 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
2293 int (*fn)(__isl_take isl_term *term, void *user), void *user)
2300 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
2304 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
2306 isl_term_free(term);
2308 return term ? 0 : -1;
2311 int isl_pw_qpolynomial_foreach_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2312 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2313 void *user), void *user)
2320 for (i = 0; i < pwqp->n; ++i)
2321 if (fn(isl_set_copy(pwqp->p[i].set),
2322 isl_qpolynomial_copy(pwqp->p[i].qp), user) < 0)
2328 static int any_divs(__isl_keep isl_set *set)
2335 for (i = 0; i < set->n; ++i)
2336 if (set->p[i]->n_div > 0)
2342 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
2343 __isl_take isl_dim *dim)
2348 if (isl_dim_equal(qp->dim, dim)) {
2353 qp = isl_qpolynomial_cow(qp);
2357 if (qp->div->n_row) {
2363 extra = isl_dim_size(dim, isl_dim_set) -
2364 isl_dim_size(qp->dim, isl_dim_set);
2365 total = isl_dim_total(qp->dim);
2366 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
2369 for (i = 0; i < qp->div->n_row; ++i)
2371 qp->upoly = expand(qp->upoly, exp, total);
2375 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
2378 for (i = 0; i < qp->div->n_row; ++i)
2379 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
2382 isl_dim_free(qp->dim);
2388 isl_qpolynomial_free(qp);
2392 static int foreach_lifted_subset(__isl_take isl_set *set,
2393 __isl_take isl_qpolynomial *qp,
2394 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2395 void *user), void *user)
2402 for (i = 0; i < set->n; ++i) {
2404 isl_qpolynomial *copy;
2406 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
2407 lift = isl_set_lift(lift);
2409 copy = isl_qpolynomial_copy(qp);
2410 copy = isl_qpolynomial_lift(copy, isl_set_get_dim(lift));
2412 if (fn(lift, copy, user) < 0)
2417 isl_qpolynomial_free(qp);
2422 isl_qpolynomial_free(qp);
2426 int isl_pw_qpolynomial_foreach_lifted_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2427 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2428 void *user), void *user)
2435 for (i = 0; i < pwqp->n; ++i) {
2437 isl_qpolynomial *qp;
2439 set = isl_set_copy(pwqp->p[i].set);
2440 qp = isl_qpolynomial_copy(pwqp->p[i].qp);
2441 if (!any_divs(set)) {
2442 if (fn(set, qp, user) < 0)
2446 if (foreach_lifted_subset(set, qp, fn, user) < 0)
2453 /* For each parameter or variable that does not appear in qp,
2454 * first eliminate the variable from all constraints and then set it to zero.
2456 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
2457 __isl_keep isl_qpolynomial *qp)
2468 d = isl_dim_total(set->dim);
2469 active = isl_calloc_array(set->ctx, int, d);
2470 if (set_active(qp, active) < 0)
2473 for (i = 0; i < d; ++i)
2482 nparam = isl_dim_size(set->dim, isl_dim_param);
2483 nvar = isl_dim_size(set->dim, isl_dim_set);
2484 for (i = 0; i < nparam; ++i) {
2487 set = isl_set_eliminate(set, isl_dim_param, i, 1);
2488 set = isl_set_fix_si(set, isl_dim_param, i, 0);
2490 for (i = 0; i < nvar; ++i) {
2493 set = isl_set_eliminate(set, isl_dim_set, i, 1);
2494 set = isl_set_fix_si(set, isl_dim_set, i, 0);
2506 struct isl_max_data {
2507 isl_qpolynomial *qp;
2509 isl_qpolynomial *max;
2512 static int max_fn(__isl_take isl_point *pnt, void *user)
2514 struct isl_max_data *data = (struct isl_max_data *)user;
2515 isl_qpolynomial *val;
2517 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
2522 data->max = isl_qpolynomial_max_cst(data->max, val);
2528 static __isl_give isl_qpolynomial *guarded_qpolynomial_max(
2529 __isl_take isl_set *set, __isl_take isl_qpolynomial *qp)
2531 struct isl_max_data data = { NULL, 1, NULL };
2536 if (isl_upoly_is_cst(qp->upoly)) {
2541 set = fix_inactive(set, qp);
2544 if (isl_set_foreach_point(set, max_fn, &data) < 0)
2548 isl_qpolynomial_free(qp);
2552 isl_qpolynomial_free(qp);
2553 isl_qpolynomial_free(data.max);
2557 /* Compute the maximal value attained by the piecewise quasipolynomial
2558 * on its domain or zero if the domain is empty.
2559 * In the worst case, the domain is scanned completely,
2560 * so the domain is assumed to be bounded.
2562 __isl_give isl_qpolynomial *isl_pw_qpolynomial_max(
2563 __isl_take isl_pw_qpolynomial *pwqp)
2566 isl_qpolynomial *max;
2572 isl_dim *dim = isl_dim_copy(pwqp->dim);
2573 isl_pw_qpolynomial_free(pwqp);
2574 return isl_qpolynomial_zero(dim);
2577 max = guarded_qpolynomial_max(isl_set_copy(pwqp->p[0].set),
2578 isl_qpolynomial_copy(pwqp->p[0].qp));
2579 for (i = 1; i < pwqp->n; ++i) {
2580 isl_qpolynomial *max_i;
2581 max_i = guarded_qpolynomial_max(isl_set_copy(pwqp->p[i].set),
2582 isl_qpolynomial_copy(pwqp->p[i].qp));
2583 max = isl_qpolynomial_max_cst(max, max_i);
2586 isl_pw_qpolynomial_free(pwqp);