2 #include <isl_polynomial_private.h>
3 #include <isl_point_private.h>
4 #include <isl_dim_private.h>
5 #include <isl_map_private.h>
7 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
15 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
20 isl_assert(up->ctx, up->var < 0, return NULL);
22 return (struct isl_upoly_cst *)up;
25 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
30 isl_assert(up->ctx, up->var >= 0, return NULL);
32 return (struct isl_upoly_rec *)up;
35 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
36 __isl_keep struct isl_upoly *up2)
39 struct isl_upoly_rec *rec1, *rec2;
45 if (up1->var != up2->var)
47 if (isl_upoly_is_cst(up1)) {
48 struct isl_upoly_cst *cst1, *cst2;
49 cst1 = isl_upoly_as_cst(up1);
50 cst2 = isl_upoly_as_cst(up2);
53 return isl_int_eq(cst1->n, cst2->n) &&
54 isl_int_eq(cst1->d, cst2->d);
57 rec1 = isl_upoly_as_rec(up1);
58 rec2 = isl_upoly_as_rec(up2);
62 if (rec1->n != rec2->n)
65 for (i = 0; i < rec1->n; ++i) {
66 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
74 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
76 struct isl_upoly_cst *cst;
80 if (!isl_upoly_is_cst(up))
83 cst = isl_upoly_as_cst(up);
87 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
90 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
92 struct isl_upoly_cst *cst;
96 if (!isl_upoly_is_cst(up))
99 cst = isl_upoly_as_cst(up);
103 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
106 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
108 struct isl_upoly_cst *cst;
112 if (!isl_upoly_is_cst(up))
115 cst = isl_upoly_as_cst(up);
119 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
122 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
124 struct isl_upoly_cst *cst;
128 if (!isl_upoly_is_cst(up))
131 cst = isl_upoly_as_cst(up);
135 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
138 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
140 struct isl_upoly_cst *cst;
144 if (!isl_upoly_is_cst(up))
147 cst = isl_upoly_as_cst(up);
151 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
154 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
156 struct isl_upoly_cst *cst;
160 if (!isl_upoly_is_cst(up))
163 cst = isl_upoly_as_cst(up);
167 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
170 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
172 struct isl_upoly_cst *cst;
174 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
183 isl_int_init(cst->n);
184 isl_int_init(cst->d);
189 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
191 struct isl_upoly_cst *cst;
193 cst = isl_upoly_cst_alloc(ctx);
197 isl_int_set_si(cst->n, 0);
198 isl_int_set_si(cst->d, 1);
203 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
205 struct isl_upoly_cst *cst;
207 cst = isl_upoly_cst_alloc(ctx);
211 isl_int_set_si(cst->n, 1);
212 isl_int_set_si(cst->d, 0);
217 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
219 struct isl_upoly_cst *cst;
221 cst = isl_upoly_cst_alloc(ctx);
225 isl_int_set_si(cst->n, 0);
226 isl_int_set_si(cst->d, 0);
231 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
232 isl_int n, isl_int d)
234 struct isl_upoly_cst *cst;
236 cst = isl_upoly_cst_alloc(ctx);
240 isl_int_set(cst->n, n);
241 isl_int_set(cst->d, d);
246 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
249 struct isl_upoly_rec *rec;
251 isl_assert(ctx, var >= 0, return NULL);
252 isl_assert(ctx, size >= 0, return NULL);
253 rec = isl_calloc(dim->ctx, struct isl_upoly_rec,
254 sizeof(struct isl_upoly_rec) +
255 (size - 1) * sizeof(struct isl_upoly *));
269 isl_upoly_free(&rec->up);
273 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
275 struct isl_upoly_cst *cst;
280 return isl_upoly_is_zero(qp->upoly);
283 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
285 struct isl_upoly_cst *cst;
290 return isl_upoly_is_one(qp->upoly);
293 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
295 isl_int_clear(cst->n);
296 isl_int_clear(cst->d);
299 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
303 for (i = 0; i < rec->n; ++i)
304 isl_upoly_free(rec->p[i]);
307 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
316 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
318 struct isl_upoly_cst *cst;
319 struct isl_upoly_cst *dup;
321 cst = isl_upoly_as_cst(up);
325 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
328 isl_int_set(dup->n, cst->n);
329 isl_int_set(dup->d, cst->d);
334 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
337 struct isl_upoly_rec *rec;
338 struct isl_upoly_rec *dup;
340 rec = isl_upoly_as_rec(up);
344 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
348 for (i = 0; i < rec->n; ++i) {
349 dup->p[i] = isl_upoly_copy(rec->p[i]);
357 isl_upoly_free(&dup->up);
361 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
363 struct isl_upoly *dup;
368 if (isl_upoly_is_cst(up))
369 return isl_upoly_dup_cst(up);
371 return isl_upoly_dup_rec(up);
374 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
382 return isl_upoly_dup(up);
385 void isl_upoly_free(__isl_take struct isl_upoly *up)
394 upoly_free_cst((struct isl_upoly_cst *)up);
396 upoly_free_rec((struct isl_upoly_rec *)up);
398 isl_ctx_deref(up->ctx);
402 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
407 isl_int_gcd(gcd, cst->n, cst->d);
408 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
409 isl_int_divexact(cst->n, cst->n, gcd);
410 isl_int_divexact(cst->d, cst->d, gcd);
415 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
416 __isl_take struct isl_upoly *up2)
418 struct isl_upoly_cst *cst1;
419 struct isl_upoly_cst *cst2;
421 up1 = isl_upoly_cow(up1);
425 cst1 = isl_upoly_as_cst(up1);
426 cst2 = isl_upoly_as_cst(up2);
428 if (isl_int_eq(cst1->d, cst2->d))
429 isl_int_add(cst1->n, cst1->n, cst2->n);
431 isl_int_mul(cst1->n, cst1->n, cst2->d);
432 isl_int_addmul(cst1->n, cst2->n, cst1->d);
433 isl_int_mul(cst1->d, cst1->d, cst2->d);
436 isl_upoly_cst_reduce(cst1);
446 static __isl_give struct isl_upoly *replace_by_zero(
447 __isl_take struct isl_upoly *up)
455 return isl_upoly_zero(ctx);
458 static __isl_give struct isl_upoly *replace_by_constant_term(
459 __isl_take struct isl_upoly *up)
461 struct isl_upoly_rec *rec;
462 struct isl_upoly *cst;
467 rec = isl_upoly_as_rec(up);
470 cst = isl_upoly_copy(rec->p[0]);
478 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
479 __isl_take struct isl_upoly *up2)
482 struct isl_upoly_rec *rec1, *rec2;
487 if (isl_upoly_is_nan(up1)) {
492 if (isl_upoly_is_nan(up2)) {
497 if (isl_upoly_is_zero(up1)) {
502 if (isl_upoly_is_zero(up2)) {
507 if (up1->var < up2->var)
508 return isl_upoly_sum(up2, up1);
510 if (up2->var < up1->var) {
511 struct isl_upoly_rec *rec;
512 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
516 up1 = isl_upoly_cow(up1);
517 rec = isl_upoly_as_rec(up1);
520 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
522 up1 = replace_by_constant_term(up1);
526 if (isl_upoly_is_cst(up1))
527 return isl_upoly_sum_cst(up1, up2);
529 rec1 = isl_upoly_as_rec(up1);
530 rec2 = isl_upoly_as_rec(up2);
534 if (rec1->n < rec2->n)
535 return isl_upoly_sum(up2, up1);
537 up1 = isl_upoly_cow(up1);
538 rec1 = isl_upoly_as_rec(up1);
542 for (i = rec2->n - 1; i >= 0; --i) {
543 rec1->p[i] = isl_upoly_sum(rec1->p[i],
544 isl_upoly_copy(rec2->p[i]));
547 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
548 isl_upoly_free(rec1->p[i]);
554 up1 = replace_by_zero(up1);
555 else if (rec1->n == 1)
556 up1 = replace_by_constant_term(up1);
567 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
569 struct isl_upoly_cst *cst;
571 if (isl_upoly_is_zero(up))
574 up = isl_upoly_cow(up);
578 cst = isl_upoly_as_cst(up);
580 isl_int_neg(cst->n, cst->n);
585 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
588 struct isl_upoly_rec *rec;
593 if (isl_upoly_is_cst(up))
594 return isl_upoly_neg_cst(up);
596 up = isl_upoly_cow(up);
597 rec = isl_upoly_as_rec(up);
601 for (i = 0; i < rec->n; ++i) {
602 rec->p[i] = isl_upoly_neg(rec->p[i]);
613 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
614 __isl_take struct isl_upoly *up2)
616 struct isl_upoly_cst *cst1;
617 struct isl_upoly_cst *cst2;
619 up1 = isl_upoly_cow(up1);
623 cst1 = isl_upoly_as_cst(up1);
624 cst2 = isl_upoly_as_cst(up2);
626 isl_int_mul(cst1->n, cst1->n, cst2->n);
627 isl_int_mul(cst1->d, cst1->d, cst2->d);
629 isl_upoly_cst_reduce(cst1);
639 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
640 __isl_take struct isl_upoly *up2)
642 struct isl_upoly_rec *rec1;
643 struct isl_upoly_rec *rec2;
644 struct isl_upoly_rec *res;
648 rec1 = isl_upoly_as_rec(up1);
649 rec2 = isl_upoly_as_rec(up2);
652 size = rec1->n + rec2->n - 1;
653 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
657 for (i = 0; i < rec1->n; ++i) {
658 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
659 isl_upoly_copy(rec1->p[i]));
664 for (; i < size; ++i) {
665 res->p[i] = isl_upoly_zero(up1->ctx);
670 for (i = 0; i < rec1->n; ++i) {
671 for (j = 1; j < rec2->n; ++j) {
672 struct isl_upoly *up;
673 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
674 isl_upoly_copy(rec1->p[i]));
675 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
688 isl_upoly_free(&res->up);
692 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
693 __isl_take struct isl_upoly *up2)
698 if (isl_upoly_is_nan(up1)) {
703 if (isl_upoly_is_nan(up2)) {
708 if (isl_upoly_is_zero(up1)) {
713 if (isl_upoly_is_zero(up2)) {
718 if (isl_upoly_is_one(up1)) {
723 if (isl_upoly_is_one(up2)) {
728 if (up1->var < up2->var)
729 return isl_upoly_mul(up2, up1);
731 if (up2->var < up1->var) {
733 struct isl_upoly_rec *rec;
734 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
735 isl_ctx *ctx = up1->ctx;
738 return isl_upoly_nan(ctx);
740 up1 = isl_upoly_cow(up1);
741 rec = isl_upoly_as_rec(up1);
745 for (i = 0; i < rec->n; ++i) {
746 rec->p[i] = isl_upoly_mul(rec->p[i],
747 isl_upoly_copy(up2));
755 if (isl_upoly_is_cst(up1))
756 return isl_upoly_mul_cst(up1, up2);
758 return isl_upoly_mul_rec(up1, up2);
765 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
768 struct isl_qpolynomial *qp;
774 total = isl_dim_total(dim);
776 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
781 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
790 isl_qpolynomial_free(qp);
794 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
803 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
805 struct isl_qpolynomial *dup;
810 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row);
813 isl_mat_free(dup->div);
814 dup->div = isl_mat_copy(qp->div);
817 dup->upoly = isl_upoly_copy(qp->upoly);
823 isl_qpolynomial_free(dup);
827 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
835 return isl_qpolynomial_dup(qp);
838 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
846 isl_dim_free(qp->dim);
847 isl_mat_free(qp->div);
848 isl_upoly_free(qp->upoly);
853 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
858 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
859 div1->n_col >= div2->n_col, return -1);
861 if (div1->n_row == div2->n_row)
862 return isl_mat_is_equal(div1, div2);
866 div1->n_row = div2->n_row;
867 div1->n_col = div2->n_col;
869 equal = isl_mat_is_equal(div1, div2);
877 static void expand_row(__isl_keep isl_mat *dst, int d,
878 __isl_keep isl_mat *src, int s, int *exp)
881 unsigned c = src->n_col - src->n_row;
883 isl_seq_cpy(dst->row[d], src->row[s], c);
884 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
886 for (i = 0; i < s; ++i)
887 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
890 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
894 li = isl_seq_last_non_zero(div->row[i], div->n_col);
895 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
900 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
903 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
904 __isl_keep isl_mat *div2, int *exp1, int *exp2)
908 unsigned d = div1->n_col - div1->n_row;
910 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
911 d + div1->n_row + div2->n_row);
915 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
918 expand_row(div, k, div1, i, exp1);
919 expand_row(div, k + 1, div2, j, exp2);
921 cmp = cmp_row(div, k, k + 1);
925 } else if (cmp < 0) {
929 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
932 for (; i < div1->n_row; ++i, ++k) {
933 expand_row(div, k, div1, i, exp1);
936 for (; j < div2->n_row; ++j, ++k) {
937 expand_row(div, k, div2, j, exp2);
947 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
951 struct isl_upoly_rec *rec;
953 if (isl_upoly_is_cst(up))
959 if (exp[up->var - first] == up->var - first)
962 up = isl_upoly_cow(up);
966 up->var = exp[up->var - first] + first;
968 rec = isl_upoly_as_rec(up);
972 for (i = 0; i < rec->n; ++i) {
973 rec->p[i] = expand(rec->p[i], exp, first);
984 static __isl_give isl_qpolynomial *with_merged_divs(
985 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
986 __isl_take isl_qpolynomial *qp2),
987 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
993 qp1 = isl_qpolynomial_cow(qp1);
994 qp2 = isl_qpolynomial_cow(qp2);
999 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1000 qp1->div->n_col >= qp2->div->n_col, goto error);
1002 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1003 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1007 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1011 isl_mat_free(qp1->div);
1012 qp1->div = isl_mat_copy(div);
1013 isl_mat_free(qp2->div);
1014 qp2->div = isl_mat_copy(div);
1016 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1017 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1019 if (!qp1->upoly || !qp2->upoly)
1026 return fn(qp1, qp2);
1031 isl_qpolynomial_free(qp1);
1032 isl_qpolynomial_free(qp2);
1036 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1037 __isl_take isl_qpolynomial *qp2)
1039 qp1 = isl_qpolynomial_cow(qp1);
1044 if (qp1->div->n_row < qp2->div->n_row)
1045 return isl_qpolynomial_add(qp2, qp1);
1047 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1048 if (!compatible_divs(qp1->div, qp2->div))
1049 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1051 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1055 isl_qpolynomial_free(qp2);
1059 isl_qpolynomial_free(qp1);
1060 isl_qpolynomial_free(qp2);
1064 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1065 __isl_take isl_qpolynomial *qp2)
1067 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1070 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1072 qp = isl_qpolynomial_cow(qp);
1077 qp->upoly = isl_upoly_neg(qp->upoly);
1083 isl_qpolynomial_free(qp);
1087 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1088 __isl_take isl_qpolynomial *qp2)
1090 qp1 = isl_qpolynomial_cow(qp1);
1095 if (qp1->div->n_row < qp2->div->n_row)
1096 return isl_qpolynomial_mul(qp2, qp1);
1098 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1099 if (!compatible_divs(qp1->div, qp2->div))
1100 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1102 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1106 isl_qpolynomial_free(qp2);
1110 isl_qpolynomial_free(qp1);
1111 isl_qpolynomial_free(qp2);
1115 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1117 struct isl_qpolynomial *qp;
1118 struct isl_upoly_cst *cst;
1120 qp = isl_qpolynomial_alloc(dim, 0);
1124 qp->upoly = isl_upoly_zero(dim->ctx);
1130 isl_qpolynomial_free(qp);
1134 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1136 struct isl_qpolynomial *qp;
1137 struct isl_upoly_cst *cst;
1139 qp = isl_qpolynomial_alloc(dim, 0);
1143 qp->upoly = isl_upoly_infty(dim->ctx);
1149 isl_qpolynomial_free(qp);
1153 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1155 struct isl_qpolynomial *qp;
1156 struct isl_upoly_cst *cst;
1158 qp = isl_qpolynomial_alloc(dim, 0);
1162 qp->upoly = isl_upoly_nan(dim->ctx);
1168 isl_qpolynomial_free(qp);
1172 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1175 struct isl_qpolynomial *qp;
1176 struct isl_upoly_cst *cst;
1178 qp = isl_qpolynomial_alloc(dim, 0);
1182 qp->upoly = isl_upoly_zero(dim->ctx);
1185 cst = isl_upoly_as_cst(qp->upoly);
1186 isl_int_set(cst->n, v);
1190 isl_qpolynomial_free(qp);
1194 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1195 isl_int *n, isl_int *d)
1197 struct isl_upoly_cst *cst;
1202 if (!isl_upoly_is_cst(qp->upoly))
1205 cst = isl_upoly_as_cst(qp->upoly);
1210 isl_int_set(*n, cst->n);
1212 isl_int_set(*d, cst->d);
1217 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1218 __isl_keep isl_qpolynomial *qp2)
1223 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1226 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1229 struct isl_upoly_rec *rec;
1231 if (isl_upoly_is_cst(up)) {
1232 struct isl_upoly_cst *cst;
1233 cst = isl_upoly_as_cst(up);
1236 isl_int_lcm(*d, *d, cst->d);
1240 rec = isl_upoly_as_rec(up);
1244 for (i = 0; i < rec->n; ++i)
1245 upoly_update_den(rec->p[i], d);
1248 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1250 isl_int_set_si(*d, 1);
1253 upoly_update_den(qp->upoly, d);
1256 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1260 struct isl_qpolynomial *qp;
1261 struct isl_upoly_rec *rec;
1262 struct isl_upoly_cst *cst;
1263 struct isl_ctx *ctx;
1270 qp = isl_qpolynomial_alloc(dim, 0);
1274 qp->upoly = &isl_upoly_alloc_rec(ctx, pos, 1 + power)->up;
1277 rec = isl_upoly_as_rec(qp->upoly);
1278 for (i = 0; i < 1 + power; ++i) {
1279 rec->p[i] = isl_upoly_zero(ctx);
1284 cst = isl_upoly_as_cst(rec->p[power]);
1285 isl_int_set_si(cst->n, 1);
1289 isl_qpolynomial_free(qp);
1293 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1294 enum isl_dim_type type, unsigned pos)
1299 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1300 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1302 if (type == isl_dim_set)
1303 pos += isl_dim_size(dim, isl_dim_param);
1305 return isl_qpolynomial_pow(dim, pos, 1);
1311 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1314 struct isl_qpolynomial *qp = NULL;
1315 struct isl_upoly_rec *rec;
1316 struct isl_upoly_cst *cst;
1322 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1324 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1);
1328 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1329 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1331 pos = isl_dim_total(qp->dim);
1332 qp->upoly = &isl_upoly_alloc_rec(div->ctx, pos, 1 + power)->up;
1335 rec = isl_upoly_as_rec(qp->upoly);
1336 for (i = 0; i < 1 + power; ++i) {
1337 rec->p[i] = isl_upoly_zero(div->ctx);
1342 cst = isl_upoly_as_cst(rec->p[power]);
1343 isl_int_set_si(cst->n, 1);
1349 isl_qpolynomial_free(qp);
1354 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1356 return isl_qpolynomial_div_pow(div, 1);
1359 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1360 const isl_int n, const isl_int d)
1362 struct isl_qpolynomial *qp;
1363 struct isl_upoly_cst *cst;
1365 qp = isl_qpolynomial_alloc(dim, 0);
1369 qp->upoly = isl_upoly_zero(dim->ctx);
1372 cst = isl_upoly_as_cst(qp->upoly);
1373 isl_int_set(cst->n, n);
1374 isl_int_set(cst->d, d);
1378 isl_qpolynomial_free(qp);
1382 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1384 struct isl_upoly_rec *rec;
1390 if (isl_upoly_is_cst(up))
1394 active[up->var] = 1;
1396 rec = isl_upoly_as_rec(up);
1397 for (i = 0; i < rec->n; ++i)
1398 if (up_set_active(rec->p[i], active, d) < 0)
1404 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1407 int d = isl_dim_total(qp->dim);
1412 for (i = 0; i < d; ++i)
1413 for (j = 0; j < qp->div->n_row; ++j) {
1414 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1420 return up_set_active(qp->upoly, active, d);
1423 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1424 enum isl_dim_type type, unsigned first, unsigned n)
1435 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1437 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1438 type == isl_dim_set, return -1);
1440 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1441 if (set_active(qp, active) < 0)
1444 if (type == isl_dim_set)
1445 first += isl_dim_size(qp->dim, isl_dim_param);
1446 for (i = 0; i < n; ++i)
1447 if (active[first + i]) {
1460 int isl_qpolynomial_fold_involves_dims(__isl_keep isl_qpolynomial_fold *fold,
1461 enum isl_dim_type type, unsigned first, unsigned n)
1467 if (fold->n == 0 || n == 0)
1470 for (i = 0; i < fold->n; ++i) {
1471 int involves = isl_qpolynomial_involves_dims(fold->qp[i],
1473 if (involves < 0 || involves)
1479 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1480 unsigned first, unsigned n)
1483 struct isl_upoly_rec *rec;
1487 if (n == 0 || up->var < 0 || up->var < first)
1489 if (up->var < first + n) {
1490 up = replace_by_constant_term(up);
1491 return isl_upoly_drop(up, first, n);
1493 up = isl_upoly_cow(up);
1497 rec = isl_upoly_as_rec(up);
1501 for (i = 0; i < rec->n; ++i) {
1502 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1513 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1514 __isl_take isl_qpolynomial *qp,
1515 enum isl_dim_type type, unsigned first, unsigned n)
1522 qp = isl_qpolynomial_cow(qp);
1526 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1528 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1529 type == isl_dim_set, goto error);
1531 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1535 if (type == isl_dim_set)
1536 first += isl_dim_size(qp->dim, isl_dim_param);
1538 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1542 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1548 isl_qpolynomial_free(qp);
1552 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_drop_dims(
1553 __isl_take isl_qpolynomial_fold *fold,
1554 enum isl_dim_type type, unsigned first, unsigned n)
1563 fold = isl_qpolynomial_fold_cow(fold);
1566 fold->dim = isl_dim_drop(fold->dim, type, first, n);
1570 for (i = 0; i < fold->n; ++i) {
1571 fold->qp[i] = isl_qpolynomial_drop_dims(fold->qp[i],
1579 isl_qpolynomial_fold_free(fold);
1584 #define PW isl_pw_qpolynomial
1586 #define EL isl_qpolynomial
1588 #define IS_ZERO is_zero
1594 #include <isl_pw_templ.c>
1597 #define PW isl_pw_qpolynomial_fold
1599 #define EL isl_qpolynomial_fold
1601 #define IS_ZERO is_empty
1607 #include <isl_pw_templ.c>
1609 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
1617 if (!isl_set_fast_is_universe(pwqp->p[0].set))
1620 return isl_qpolynomial_is_one(pwqp->p[0].qp);
1623 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
1624 __isl_take isl_pw_qpolynomial *pwqp1,
1625 __isl_take isl_pw_qpolynomial *pwqp2)
1628 struct isl_pw_qpolynomial *res;
1631 if (!pwqp1 || !pwqp2)
1634 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
1637 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
1638 isl_pw_qpolynomial_free(pwqp2);
1642 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
1643 isl_pw_qpolynomial_free(pwqp1);
1647 if (isl_pw_qpolynomial_is_one(pwqp1)) {
1648 isl_pw_qpolynomial_free(pwqp1);
1652 if (isl_pw_qpolynomial_is_one(pwqp2)) {
1653 isl_pw_qpolynomial_free(pwqp2);
1657 n = pwqp1->n * pwqp2->n;
1658 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
1660 for (i = 0; i < pwqp1->n; ++i) {
1661 for (j = 0; j < pwqp2->n; ++j) {
1662 struct isl_set *common;
1663 struct isl_qpolynomial *prod;
1664 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
1665 isl_set_copy(pwqp2->p[j].set));
1666 if (isl_set_fast_is_empty(common)) {
1667 isl_set_free(common);
1671 prod = isl_qpolynomial_mul(
1672 isl_qpolynomial_copy(pwqp1->p[i].qp),
1673 isl_qpolynomial_copy(pwqp2->p[j].qp));
1675 res = isl_pw_qpolynomial_add_piece(res, common, prod);
1679 isl_pw_qpolynomial_free(pwqp1);
1680 isl_pw_qpolynomial_free(pwqp2);
1684 isl_pw_qpolynomial_free(pwqp1);
1685 isl_pw_qpolynomial_free(pwqp2);
1689 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
1690 __isl_take isl_pw_qpolynomial *pwqp)
1693 struct isl_pw_qpolynomial *res;
1699 if (isl_pw_qpolynomial_is_zero(pwqp))
1702 pwqp = isl_pw_qpolynomial_cow(pwqp);
1704 for (i = 0; i < pwqp->n; ++i) {
1705 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
1712 isl_pw_qpolynomial_free(pwqp);
1716 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
1717 __isl_take isl_pw_qpolynomial *pwqp1,
1718 __isl_take isl_pw_qpolynomial *pwqp2)
1720 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
1723 __isl_give struct isl_upoly *isl_upoly_eval(
1724 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
1727 struct isl_upoly_rec *rec;
1728 struct isl_upoly *res;
1729 struct isl_upoly *base;
1731 if (isl_upoly_is_cst(up)) {
1736 rec = isl_upoly_as_rec(up);
1740 isl_assert(up->ctx, rec->n >= 1, goto error);
1742 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
1744 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
1747 for (i = rec->n - 2; i >= 0; --i) {
1748 res = isl_upoly_mul(res, isl_upoly_copy(base));
1749 res = isl_upoly_sum(res,
1750 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
1751 isl_vec_copy(vec)));
1754 isl_upoly_free(base);
1764 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
1765 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
1768 struct isl_upoly *up;
1773 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
1775 if (qp->div->n_row == 0)
1776 ext = isl_vec_copy(pnt->vec);
1779 unsigned dim = isl_dim_total(qp->dim);
1780 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
1784 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
1785 for (i = 0; i < qp->div->n_row; ++i) {
1786 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
1787 1 + dim + i, &ext->el[1+dim+i]);
1788 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
1789 qp->div->row[i][0]);
1793 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
1797 dim = isl_dim_copy(qp->dim);
1798 isl_qpolynomial_free(qp);
1799 isl_point_free(pnt);
1801 qp = isl_qpolynomial_alloc(dim, 0);
1809 isl_qpolynomial_free(qp);
1810 isl_point_free(pnt);
1814 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
1815 __isl_keep struct isl_upoly_cst *cst2)
1820 isl_int_mul(t, cst1->n, cst2->d);
1821 isl_int_submul(t, cst2->n, cst1->d);
1822 cmp = isl_int_sgn(t);
1827 static __isl_give isl_qpolynomial *qpolynomial_min(
1828 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1830 struct isl_upoly_cst *cst1, *cst2;
1835 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1836 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1837 cst1 = isl_upoly_as_cst(qp1->upoly);
1838 cst2 = isl_upoly_as_cst(qp2->upoly);
1839 cmp = isl_upoly_cmp(cst1, cst2);
1842 isl_qpolynomial_free(qp2);
1844 isl_qpolynomial_free(qp1);
1849 isl_qpolynomial_free(qp1);
1850 isl_qpolynomial_free(qp2);
1854 static __isl_give isl_qpolynomial *qpolynomial_max(
1855 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1857 struct isl_upoly_cst *cst1, *cst2;
1862 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1863 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1864 cst1 = isl_upoly_as_cst(qp1->upoly);
1865 cst2 = isl_upoly_as_cst(qp2->upoly);
1866 cmp = isl_upoly_cmp(cst1, cst2);
1869 isl_qpolynomial_free(qp2);
1871 isl_qpolynomial_free(qp1);
1876 isl_qpolynomial_free(qp1);
1877 isl_qpolynomial_free(qp2);
1881 int isl_qpolynomial_fold_is_equal(__isl_keep isl_qpolynomial_fold *fold1,
1882 __isl_keep isl_qpolynomial_fold *fold2)
1886 if (!fold1 || !fold2)
1889 if (fold1->n != fold2->n)
1892 /* We probably want to sort the qps first... */
1893 for (i = 0; i < fold1->n; ++i) {
1894 int eq = isl_qpolynomial_is_equal(fold1->qp[i], fold2->qp[i]);
1902 __isl_give isl_qpolynomial *isl_qpolynomial_fold_eval(
1903 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_point *pnt)
1905 isl_qpolynomial *qp;
1909 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, fold->dim), goto error);
1910 isl_assert(pnt->dim->ctx,
1911 fold->type == isl_fold_max || fold->type == isl_fold_min,
1915 qp = isl_qpolynomial_zero(isl_dim_copy(fold->dim));
1918 qp = isl_qpolynomial_eval(isl_qpolynomial_copy(fold->qp[0]),
1919 isl_point_copy(pnt));
1920 for (i = 1; i < fold->n; ++i) {
1921 isl_qpolynomial *qp_i;
1922 qp_i = isl_qpolynomial_eval(
1923 isl_qpolynomial_copy(fold->qp[i]),
1924 isl_point_copy(pnt));
1925 if (fold->type == isl_fold_max)
1926 qp = qpolynomial_max(qp, qp_i);
1928 qp = qpolynomial_min(qp, qp_i);
1931 isl_qpolynomial_fold_free(fold);
1932 isl_point_free(pnt);
1936 isl_qpolynomial_fold_free(fold);
1937 isl_point_free(pnt);
1941 __isl_give isl_qpolynomial *isl_qpolynomial_move(__isl_take isl_qpolynomial *qp,
1942 enum isl_dim_type dst_type, unsigned dst_pos,
1943 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1948 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
1952 /* Do something to polynomials when needed; later */
1956 isl_qpolynomial_free(qp);
1960 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_move(
1961 __isl_take isl_pw_qpolynomial *pwqp,
1962 enum isl_dim_type dst_type, unsigned dst_pos,
1963 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1970 pwqp->dim = isl_dim_move(pwqp->dim,
1971 dst_type, dst_pos, src_type, src_pos, n);
1975 for (i = 0; i < pwqp->n; ++i) {
1976 pwqp->p[i].set = isl_set_move(pwqp->p[i].set, dst_type, dst_pos,
1977 src_type, src_pos, n);
1978 if (!pwqp->p[i].set)
1980 pwqp->p[i].qp = isl_qpolynomial_move(pwqp->p[i].qp,
1981 dst_type, dst_pos, src_type, src_pos, n);
1988 isl_pw_qpolynomial_free(pwqp);
1992 __isl_give isl_dim *isl_pw_qpolynomial_get_dim(
1993 __isl_keep isl_pw_qpolynomial *pwqp)
1998 return isl_dim_copy(pwqp->dim);
2001 unsigned isl_pw_qpolynomial_dim(__isl_keep isl_pw_qpolynomial *pwqp,
2002 enum isl_dim_type type)
2004 return pwqp ? isl_dim_size(pwqp->dim, type) : 0;
2007 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2008 __isl_take isl_mat *div)
2016 n = isl_dim_total(dim) + div->n_row;
2018 term = isl_calloc(dim->ctx, struct isl_term,
2019 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2026 isl_int_init(term->n);
2027 isl_int_init(term->d);
2036 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
2045 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
2054 total = isl_dim_total(term->dim) + term->div->n_row;
2056 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
2060 isl_int_set(dup->n, term->n);
2061 isl_int_set(dup->d, term->d);
2063 for (i = 0; i < total; ++i)
2064 dup->pow[i] = term->pow[i];
2069 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
2077 return isl_term_dup(term);
2080 void isl_term_free(__isl_take isl_term *term)
2085 if (--term->ref > 0)
2088 isl_dim_free(term->dim);
2089 isl_mat_free(term->div);
2090 isl_int_clear(term->n);
2091 isl_int_clear(term->d);
2095 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
2103 case isl_dim_out: return isl_dim_size(term->dim, type);
2104 case isl_dim_div: return term->div->n_row;
2105 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
2109 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
2111 return term ? term->dim->ctx : NULL;
2114 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
2118 isl_int_set(*n, term->n);
2121 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
2125 isl_int_set(*d, term->d);
2128 int isl_term_get_exp(__isl_keep isl_term *term,
2129 enum isl_dim_type type, unsigned pos)
2134 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
2136 if (type >= isl_dim_set)
2137 pos += isl_dim_size(term->dim, isl_dim_param);
2138 if (type >= isl_dim_div)
2139 pos += isl_dim_size(term->dim, isl_dim_set);
2141 return term->pow[pos];
2144 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
2146 isl_basic_map *bmap;
2153 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
2156 total = term->div->n_col - term->div->n_row - 2;
2157 /* No nested divs for now */
2158 isl_assert(term->dim->ctx,
2159 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
2160 term->div->n_row) == -1,
2163 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
2164 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
2167 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
2169 return isl_basic_map_div(bmap, k);
2171 isl_basic_map_free(bmap);
2175 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
2176 int (*fn)(__isl_take isl_term *term, void *user),
2177 __isl_take isl_term *term, void *user)
2180 struct isl_upoly_rec *rec;
2185 if (isl_upoly_is_zero(up))
2188 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
2189 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
2190 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
2192 if (isl_upoly_is_cst(up)) {
2193 struct isl_upoly_cst *cst;
2194 cst = isl_upoly_as_cst(up);
2197 term = isl_term_cow(term);
2200 isl_int_set(term->n, cst->n);
2201 isl_int_set(term->d, cst->d);
2202 if (fn(isl_term_copy(term), user) < 0)
2207 rec = isl_upoly_as_rec(up);
2211 for (i = 0; i < rec->n; ++i) {
2212 term = isl_term_cow(term);
2215 term->pow[up->var] = i;
2216 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
2220 term->pow[up->var] = 0;
2224 isl_term_free(term);
2228 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
2229 int (*fn)(__isl_take isl_term *term, void *user), void *user)
2236 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
2240 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
2242 isl_term_free(term);
2244 return term ? 0 : -1;
2247 int isl_pw_qpolynomial_foreach_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2248 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2249 void *user), void *user)
2256 for (i = 0; i < pwqp->n; ++i)
2257 if (fn(isl_set_copy(pwqp->p[i].set),
2258 isl_qpolynomial_copy(pwqp->p[i].qp), user) < 0)
2264 static int any_divs(__isl_keep isl_set *set)
2271 for (i = 0; i < set->n; ++i)
2272 if (set->p[i]->n_div > 0)
2278 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
2279 __isl_take isl_dim *dim)
2284 if (isl_dim_equal(qp->dim, dim)) {
2289 qp = isl_qpolynomial_cow(qp);
2293 if (qp->div->n_row) {
2299 extra = isl_dim_size(dim, isl_dim_set) -
2300 isl_dim_size(qp->dim, isl_dim_set);
2301 total = isl_dim_total(qp->dim);
2302 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
2305 for (i = 0; i < qp->div->n_row; ++i)
2307 qp->upoly = expand(qp->upoly, exp, total);
2311 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
2314 for (i = 0; i < qp->div->n_row; ++i)
2315 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
2318 isl_dim_free(qp->dim);
2324 isl_qpolynomial_free(qp);
2328 static int foreach_lifted_subset(__isl_take isl_set *set,
2329 __isl_take isl_qpolynomial *qp,
2330 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2331 void *user), void *user)
2338 for (i = 0; i < set->n; ++i) {
2340 isl_qpolynomial *copy;
2342 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
2343 lift = isl_set_lift(lift);
2345 copy = isl_qpolynomial_copy(qp);
2346 copy = isl_qpolynomial_lift(copy, isl_set_get_dim(lift));
2348 if (fn(lift, copy, user) < 0)
2353 isl_qpolynomial_free(qp);
2358 isl_qpolynomial_free(qp);
2362 int isl_pw_qpolynomial_foreach_lifted_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2363 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2364 void *user), void *user)
2371 for (i = 0; i < pwqp->n; ++i) {
2373 isl_qpolynomial *qp;
2375 set = isl_set_copy(pwqp->p[i].set);
2376 qp = isl_qpolynomial_copy(pwqp->p[i].qp);
2377 if (!any_divs(set)) {
2378 if (fn(set, qp, user) < 0)
2382 if (foreach_lifted_subset(set, qp, fn, user) < 0)
2389 static __isl_give isl_qpolynomial_fold *qpolynomial_fold_alloc(
2390 enum isl_fold type, __isl_take isl_dim *dim, int n)
2392 isl_qpolynomial_fold *fold;
2397 isl_assert(dim->ctx, n >= 0, goto error);
2398 fold = isl_alloc(dim->ctx, struct isl_qpolynomial_fold,
2399 sizeof(struct isl_qpolynomial_fold) +
2400 (n - 1) * sizeof(struct isl_qpolynomial *));
2416 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_empty(enum isl_fold type,
2417 __isl_take isl_dim *dim)
2419 return qpolynomial_fold_alloc(type, dim, 0);
2422 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_alloc(
2423 enum isl_fold type, __isl_take isl_qpolynomial *qp)
2425 isl_qpolynomial_fold *fold;
2430 fold = qpolynomial_fold_alloc(type, isl_dim_copy(qp->dim), 1);
2439 isl_qpolynomial_fold_free(fold);
2440 isl_qpolynomial_free(qp);
2444 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_copy(
2445 __isl_keep isl_qpolynomial_fold *fold)
2454 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_dup(
2455 __isl_keep isl_qpolynomial_fold *fold)
2458 isl_qpolynomial_fold *dup;
2462 dup = qpolynomial_fold_alloc(fold->type,
2463 isl_dim_copy(fold->dim), fold->n);
2467 for (i = 0; i < fold->n; ++i) {
2468 dup->qp[i] = isl_qpolynomial_copy(fold->qp[i]);
2475 isl_qpolynomial_fold_free(dup);
2479 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_cow(
2480 __isl_take isl_qpolynomial_fold *fold)
2488 return isl_qpolynomial_fold_dup(fold);
2491 void isl_qpolynomial_fold_free(__isl_take isl_qpolynomial_fold *fold)
2497 if (--fold->ref > 0)
2500 for (i = 0; i < fold->n; ++i)
2501 isl_qpolynomial_free(fold->qp[i]);
2502 isl_dim_free(fold->dim);
2506 int isl_qpolynomial_fold_is_empty(__isl_keep isl_qpolynomial_fold *fold)
2511 return fold->n == 0;
2514 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold(
2515 __isl_take isl_qpolynomial_fold *fold1,
2516 __isl_take isl_qpolynomial_fold *fold2)
2519 struct isl_qpolynomial_fold *res = NULL;
2521 if (!fold1 || !fold2)
2524 isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error);
2525 isl_assert(fold1->dim->ctx, isl_dim_equal(fold1->dim, fold2->dim),
2528 if (isl_qpolynomial_fold_is_empty(fold1)) {
2529 isl_qpolynomial_fold_free(fold1);
2533 if (isl_qpolynomial_fold_is_empty(fold2)) {
2534 isl_qpolynomial_fold_free(fold2);
2538 res = qpolynomial_fold_alloc(fold1->type, isl_dim_copy(fold1->dim),
2539 fold1->n + fold2->n);
2543 for (i = 0; i < fold1->n; ++i) {
2544 res->qp[res->n] = isl_qpolynomial_copy(fold1->qp[i]);
2545 if (!res->qp[res->n])
2550 for (i = 0; i < fold2->n; ++i) {
2551 res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]);
2552 if (!res->qp[res->n])
2557 isl_qpolynomial_fold_free(fold1);
2558 isl_qpolynomial_fold_free(fold2);
2562 isl_qpolynomial_fold_free(res);
2563 isl_qpolynomial_fold_free(fold1);
2564 isl_qpolynomial_fold_free(fold2);
2568 __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_from_pw_qpolynomial(
2569 enum isl_fold type, __isl_take isl_pw_qpolynomial *pwqp)
2572 isl_pw_qpolynomial_fold *pwf;
2577 pwf = isl_pw_qpolynomial_fold_alloc_(isl_dim_copy(pwqp->dim), pwqp->n);
2579 for (i = 0; i < pwqp->n; ++i)
2580 pwf = isl_pw_qpolynomial_fold_add_piece(pwf,
2581 isl_set_copy(pwqp->p[i].set),
2582 isl_qpolynomial_fold_alloc(type,
2583 isl_qpolynomial_copy(pwqp->p[i].qp)));
2585 isl_pw_qpolynomial_free(pwqp);
2590 /* For each parameter or variable that does not appear in qp,
2591 * first eliminate the variable from all constraints and then set it to zero.
2593 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
2594 __isl_keep isl_qpolynomial *qp)
2605 d = isl_dim_total(set->dim);
2606 active = isl_calloc_array(set->ctx, int, d);
2607 if (set_active(qp, active) < 0)
2610 for (i = 0; i < d; ++i)
2619 nparam = isl_dim_size(set->dim, isl_dim_param);
2620 nvar = isl_dim_size(set->dim, isl_dim_set);
2621 for (i = 0; i < nparam; ++i) {
2624 set = isl_set_eliminate(set, isl_dim_param, i, 1);
2625 set = isl_set_fix_si(set, isl_dim_param, i, 0);
2627 for (i = 0; i < nvar; ++i) {
2630 set = isl_set_eliminate(set, isl_dim_set, i, 1);
2631 set = isl_set_fix_si(set, isl_dim_set, i, 0);
2643 struct isl_max_data {
2644 isl_qpolynomial *qp;
2646 isl_qpolynomial *max;
2649 static int max_fn(__isl_take isl_point *pnt, void *user)
2651 struct isl_max_data *data = (struct isl_max_data *)user;
2652 isl_qpolynomial *val;
2654 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
2659 data->max = qpolynomial_max(data->max, val);
2665 static __isl_give isl_qpolynomial *guarded_qpolynomial_max(
2666 __isl_take isl_set *set, __isl_take isl_qpolynomial *qp)
2668 struct isl_max_data data = { NULL, 1, NULL };
2673 if (isl_upoly_is_cst(qp->upoly)) {
2678 set = fix_inactive(set, qp);
2681 if (isl_set_foreach_point(set, max_fn, &data) < 0)
2685 isl_qpolynomial_free(qp);
2689 isl_qpolynomial_free(qp);
2690 isl_qpolynomial_free(data.max);
2694 /* Compute the maximal value attained by the piecewise quasipolynomial
2695 * on its domain or zero if the domain is empty.
2696 * In the worst case, the domain is scanned completely,
2697 * so the domain is assumed to be bounded.
2699 __isl_give isl_qpolynomial *isl_pw_qpolynomial_max(
2700 __isl_take isl_pw_qpolynomial *pwqp)
2703 isl_qpolynomial *max;
2709 isl_dim *dim = isl_dim_copy(pwqp->dim);
2710 isl_pw_qpolynomial_free(pwqp);
2711 return isl_qpolynomial_zero(dim);
2714 max = guarded_qpolynomial_max(isl_set_copy(pwqp->p[0].set),
2715 isl_qpolynomial_copy(pwqp->p[0].qp));
2716 for (i = 1; i < pwqp->n; ++i) {
2717 isl_qpolynomial *max_i;
2718 max_i = guarded_qpolynomial_max(isl_set_copy(pwqp->p[i].set),
2719 isl_qpolynomial_copy(pwqp->p[i].qp));
2720 max = qpolynomial_max(max, max_i);
2723 isl_pw_qpolynomial_free(pwqp);