3 #include <isl_polynomial_private.h>
4 #include <isl_point_private.h>
5 #include <isl_dim_private.h>
6 #include <isl_map_private.h>
7 #include <isl_map_private.h>
9 static unsigned pos(__isl_keep isl_dim *dim, enum isl_dim_type type)
12 case isl_dim_param: return 0;
13 case isl_dim_in: return dim->nparam;
14 case isl_dim_out: return dim->nparam + dim->n_in;
18 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
26 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
31 isl_assert(up->ctx, up->var < 0, return NULL);
33 return (struct isl_upoly_cst *)up;
36 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
41 isl_assert(up->ctx, up->var >= 0, return NULL);
43 return (struct isl_upoly_rec *)up;
46 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
47 __isl_keep struct isl_upoly *up2)
50 struct isl_upoly_rec *rec1, *rec2;
56 if (up1->var != up2->var)
58 if (isl_upoly_is_cst(up1)) {
59 struct isl_upoly_cst *cst1, *cst2;
60 cst1 = isl_upoly_as_cst(up1);
61 cst2 = isl_upoly_as_cst(up2);
64 return isl_int_eq(cst1->n, cst2->n) &&
65 isl_int_eq(cst1->d, cst2->d);
68 rec1 = isl_upoly_as_rec(up1);
69 rec2 = isl_upoly_as_rec(up2);
73 if (rec1->n != rec2->n)
76 for (i = 0; i < rec1->n; ++i) {
77 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
85 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
87 struct isl_upoly_cst *cst;
91 if (!isl_upoly_is_cst(up))
94 cst = isl_upoly_as_cst(up);
98 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
101 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
103 struct isl_upoly_cst *cst;
107 if (!isl_upoly_is_cst(up))
110 cst = isl_upoly_as_cst(up);
114 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
117 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
119 struct isl_upoly_cst *cst;
123 if (!isl_upoly_is_cst(up))
126 cst = isl_upoly_as_cst(up);
130 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
133 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
135 struct isl_upoly_cst *cst;
139 if (!isl_upoly_is_cst(up))
142 cst = isl_upoly_as_cst(up);
146 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
149 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
151 struct isl_upoly_cst *cst;
155 if (!isl_upoly_is_cst(up))
158 cst = isl_upoly_as_cst(up);
162 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
165 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
167 struct isl_upoly_cst *cst;
171 if (!isl_upoly_is_cst(up))
174 cst = isl_upoly_as_cst(up);
178 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
181 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
183 struct isl_upoly_cst *cst;
185 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
194 isl_int_init(cst->n);
195 isl_int_init(cst->d);
200 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
202 struct isl_upoly_cst *cst;
204 cst = isl_upoly_cst_alloc(ctx);
208 isl_int_set_si(cst->n, 0);
209 isl_int_set_si(cst->d, 1);
214 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
216 struct isl_upoly_cst *cst;
218 cst = isl_upoly_cst_alloc(ctx);
222 isl_int_set_si(cst->n, 1);
223 isl_int_set_si(cst->d, 0);
228 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
230 struct isl_upoly_cst *cst;
232 cst = isl_upoly_cst_alloc(ctx);
236 isl_int_set_si(cst->n, 0);
237 isl_int_set_si(cst->d, 0);
242 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
243 isl_int n, isl_int d)
245 struct isl_upoly_cst *cst;
247 cst = isl_upoly_cst_alloc(ctx);
251 isl_int_set(cst->n, n);
252 isl_int_set(cst->d, d);
257 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
260 struct isl_upoly_rec *rec;
262 isl_assert(ctx, var >= 0, return NULL);
263 isl_assert(ctx, size >= 0, return NULL);
264 rec = isl_calloc(dim->ctx, struct isl_upoly_rec,
265 sizeof(struct isl_upoly_rec) +
266 (size - 1) * sizeof(struct isl_upoly *));
280 isl_upoly_free(&rec->up);
284 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
286 struct isl_upoly_cst *cst;
291 return isl_upoly_is_zero(qp->upoly);
294 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
296 struct isl_upoly_cst *cst;
301 return isl_upoly_is_one(qp->upoly);
304 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
306 isl_int_clear(cst->n);
307 isl_int_clear(cst->d);
310 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
314 for (i = 0; i < rec->n; ++i)
315 isl_upoly_free(rec->p[i]);
318 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
327 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
329 struct isl_upoly_cst *cst;
330 struct isl_upoly_cst *dup;
332 cst = isl_upoly_as_cst(up);
336 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
339 isl_int_set(dup->n, cst->n);
340 isl_int_set(dup->d, cst->d);
345 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
348 struct isl_upoly_rec *rec;
349 struct isl_upoly_rec *dup;
351 rec = isl_upoly_as_rec(up);
355 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
359 for (i = 0; i < rec->n; ++i) {
360 dup->p[i] = isl_upoly_copy(rec->p[i]);
368 isl_upoly_free(&dup->up);
372 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
374 struct isl_upoly *dup;
379 if (isl_upoly_is_cst(up))
380 return isl_upoly_dup_cst(up);
382 return isl_upoly_dup_rec(up);
385 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
393 return isl_upoly_dup(up);
396 void isl_upoly_free(__isl_take struct isl_upoly *up)
405 upoly_free_cst((struct isl_upoly_cst *)up);
407 upoly_free_rec((struct isl_upoly_rec *)up);
409 isl_ctx_deref(up->ctx);
413 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
418 isl_int_gcd(gcd, cst->n, cst->d);
419 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
420 isl_int_divexact(cst->n, cst->n, gcd);
421 isl_int_divexact(cst->d, cst->d, gcd);
426 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
427 __isl_take struct isl_upoly *up2)
429 struct isl_upoly_cst *cst1;
430 struct isl_upoly_cst *cst2;
432 up1 = isl_upoly_cow(up1);
436 cst1 = isl_upoly_as_cst(up1);
437 cst2 = isl_upoly_as_cst(up2);
439 if (isl_int_eq(cst1->d, cst2->d))
440 isl_int_add(cst1->n, cst1->n, cst2->n);
442 isl_int_mul(cst1->n, cst1->n, cst2->d);
443 isl_int_addmul(cst1->n, cst2->n, cst1->d);
444 isl_int_mul(cst1->d, cst1->d, cst2->d);
447 isl_upoly_cst_reduce(cst1);
457 static __isl_give struct isl_upoly *replace_by_zero(
458 __isl_take struct isl_upoly *up)
466 return isl_upoly_zero(ctx);
469 static __isl_give struct isl_upoly *replace_by_constant_term(
470 __isl_take struct isl_upoly *up)
472 struct isl_upoly_rec *rec;
473 struct isl_upoly *cst;
478 rec = isl_upoly_as_rec(up);
481 cst = isl_upoly_copy(rec->p[0]);
489 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
490 __isl_take struct isl_upoly *up2)
493 struct isl_upoly_rec *rec1, *rec2;
498 if (isl_upoly_is_nan(up1)) {
503 if (isl_upoly_is_nan(up2)) {
508 if (isl_upoly_is_zero(up1)) {
513 if (isl_upoly_is_zero(up2)) {
518 if (up1->var < up2->var)
519 return isl_upoly_sum(up2, up1);
521 if (up2->var < up1->var) {
522 struct isl_upoly_rec *rec;
523 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
527 up1 = isl_upoly_cow(up1);
528 rec = isl_upoly_as_rec(up1);
531 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
533 up1 = replace_by_constant_term(up1);
537 if (isl_upoly_is_cst(up1))
538 return isl_upoly_sum_cst(up1, up2);
540 rec1 = isl_upoly_as_rec(up1);
541 rec2 = isl_upoly_as_rec(up2);
545 if (rec1->n < rec2->n)
546 return isl_upoly_sum(up2, up1);
548 up1 = isl_upoly_cow(up1);
549 rec1 = isl_upoly_as_rec(up1);
553 for (i = rec2->n - 1; i >= 0; --i) {
554 rec1->p[i] = isl_upoly_sum(rec1->p[i],
555 isl_upoly_copy(rec2->p[i]));
558 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
559 isl_upoly_free(rec1->p[i]);
565 up1 = replace_by_zero(up1);
566 else if (rec1->n == 1)
567 up1 = replace_by_constant_term(up1);
578 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
580 struct isl_upoly_cst *cst;
582 if (isl_upoly_is_zero(up))
585 up = isl_upoly_cow(up);
589 cst = isl_upoly_as_cst(up);
591 isl_int_neg(cst->n, cst->n);
596 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
599 struct isl_upoly_rec *rec;
604 if (isl_upoly_is_cst(up))
605 return isl_upoly_neg_cst(up);
607 up = isl_upoly_cow(up);
608 rec = isl_upoly_as_rec(up);
612 for (i = 0; i < rec->n; ++i) {
613 rec->p[i] = isl_upoly_neg(rec->p[i]);
624 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
625 __isl_take struct isl_upoly *up2)
627 struct isl_upoly_cst *cst1;
628 struct isl_upoly_cst *cst2;
630 up1 = isl_upoly_cow(up1);
634 cst1 = isl_upoly_as_cst(up1);
635 cst2 = isl_upoly_as_cst(up2);
637 isl_int_mul(cst1->n, cst1->n, cst2->n);
638 isl_int_mul(cst1->d, cst1->d, cst2->d);
640 isl_upoly_cst_reduce(cst1);
650 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
651 __isl_take struct isl_upoly *up2)
653 struct isl_upoly_rec *rec1;
654 struct isl_upoly_rec *rec2;
655 struct isl_upoly_rec *res;
659 rec1 = isl_upoly_as_rec(up1);
660 rec2 = isl_upoly_as_rec(up2);
663 size = rec1->n + rec2->n - 1;
664 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
668 for (i = 0; i < rec1->n; ++i) {
669 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
670 isl_upoly_copy(rec1->p[i]));
675 for (; i < size; ++i) {
676 res->p[i] = isl_upoly_zero(up1->ctx);
681 for (i = 0; i < rec1->n; ++i) {
682 for (j = 1; j < rec2->n; ++j) {
683 struct isl_upoly *up;
684 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
685 isl_upoly_copy(rec1->p[i]));
686 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
699 isl_upoly_free(&res->up);
703 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
704 __isl_take struct isl_upoly *up2)
709 if (isl_upoly_is_nan(up1)) {
714 if (isl_upoly_is_nan(up2)) {
719 if (isl_upoly_is_zero(up1)) {
724 if (isl_upoly_is_zero(up2)) {
729 if (isl_upoly_is_one(up1)) {
734 if (isl_upoly_is_one(up2)) {
739 if (up1->var < up2->var)
740 return isl_upoly_mul(up2, up1);
742 if (up2->var < up1->var) {
744 struct isl_upoly_rec *rec;
745 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
746 isl_ctx *ctx = up1->ctx;
749 return isl_upoly_nan(ctx);
751 up1 = isl_upoly_cow(up1);
752 rec = isl_upoly_as_rec(up1);
756 for (i = 0; i < rec->n; ++i) {
757 rec->p[i] = isl_upoly_mul(rec->p[i],
758 isl_upoly_copy(up2));
766 if (isl_upoly_is_cst(up1))
767 return isl_upoly_mul_cst(up1, up2);
769 return isl_upoly_mul_rec(up1, up2);
776 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
779 struct isl_qpolynomial *qp;
785 total = isl_dim_total(dim);
787 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
792 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
801 isl_qpolynomial_free(qp);
805 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
814 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
816 struct isl_qpolynomial *dup;
821 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row);
824 isl_mat_free(dup->div);
825 dup->div = isl_mat_copy(qp->div);
828 dup->upoly = isl_upoly_copy(qp->upoly);
834 isl_qpolynomial_free(dup);
838 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
846 return isl_qpolynomial_dup(qp);
849 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
857 isl_dim_free(qp->dim);
858 isl_mat_free(qp->div);
859 isl_upoly_free(qp->upoly);
864 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
869 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
870 div1->n_col >= div2->n_col, return -1);
872 if (div1->n_row == div2->n_row)
873 return isl_mat_is_equal(div1, div2);
877 div1->n_row = div2->n_row;
878 div1->n_col = div2->n_col;
880 equal = isl_mat_is_equal(div1, div2);
888 static void expand_row(__isl_keep isl_mat *dst, int d,
889 __isl_keep isl_mat *src, int s, int *exp)
892 unsigned c = src->n_col - src->n_row;
894 isl_seq_cpy(dst->row[d], src->row[s], c);
895 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
897 for (i = 0; i < s; ++i)
898 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
901 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
905 li = isl_seq_last_non_zero(div->row[i], div->n_col);
906 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
911 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
914 struct isl_div_sort_info {
919 static int div_sort_cmp(const void *p1, const void *p2)
921 const struct isl_div_sort_info *i1, *i2;
922 i1 = (const struct isl_div_sort_info *) p1;
923 i2 = (const struct isl_div_sort_info *) p2;
925 return cmp_row(i1->div, i1->row, i2->row);
928 static __isl_give isl_mat *sort_divs(__isl_take isl_mat *div)
931 struct isl_div_sort_info *array = NULL;
939 array = isl_alloc_array(div->ctx, struct isl_div_sort_info, div->n_row);
940 pos = isl_alloc_array(div->ctx, int, div->n_row);
944 for (i = 0; i < div->n_row; ++i) {
950 qsort(array, div->n_row, sizeof(struct isl_div_sort_info),
953 for (i = 0; i < div->n_row; ++i) {
955 if (pos[array[i].row] == i)
957 div = isl_mat_cow(div);
958 div = isl_mat_swap_rows(div, i, pos[array[i].row]);
959 t = pos[array[i].row];
960 pos[array[i].row] = pos[i];
974 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
975 __isl_keep isl_mat *div2, int *exp1, int *exp2)
979 unsigned d = div1->n_col - div1->n_row;
981 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
982 d + div1->n_row + div2->n_row);
986 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
989 expand_row(div, k, div1, i, exp1);
990 expand_row(div, k + 1, div2, j, exp2);
992 cmp = cmp_row(div, k, k + 1);
996 } else if (cmp < 0) {
1000 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1003 for (; i < div1->n_row; ++i, ++k) {
1004 expand_row(div, k, div1, i, exp1);
1007 for (; j < div2->n_row; ++j, ++k) {
1008 expand_row(div, k, div2, j, exp2);
1018 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1019 int *exp, int first)
1022 struct isl_upoly_rec *rec;
1024 if (isl_upoly_is_cst(up))
1027 if (up->var < first)
1030 if (exp[up->var - first] == up->var - first)
1033 up = isl_upoly_cow(up);
1037 up->var = exp[up->var - first] + first;
1039 rec = isl_upoly_as_rec(up);
1043 for (i = 0; i < rec->n; ++i) {
1044 rec->p[i] = expand(rec->p[i], exp, first);
1055 static __isl_give isl_qpolynomial *with_merged_divs(
1056 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1057 __isl_take isl_qpolynomial *qp2),
1058 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1062 isl_mat *div = NULL;
1064 qp1 = isl_qpolynomial_cow(qp1);
1065 qp2 = isl_qpolynomial_cow(qp2);
1070 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1071 qp1->div->n_col >= qp2->div->n_col, goto error);
1073 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1074 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1078 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1082 isl_mat_free(qp1->div);
1083 qp1->div = isl_mat_copy(div);
1084 isl_mat_free(qp2->div);
1085 qp2->div = isl_mat_copy(div);
1087 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1088 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1090 if (!qp1->upoly || !qp2->upoly)
1097 return fn(qp1, qp2);
1102 isl_qpolynomial_free(qp1);
1103 isl_qpolynomial_free(qp2);
1107 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1108 __isl_take isl_qpolynomial *qp2)
1110 qp1 = isl_qpolynomial_cow(qp1);
1115 if (qp1->div->n_row < qp2->div->n_row)
1116 return isl_qpolynomial_add(qp2, qp1);
1118 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1119 if (!compatible_divs(qp1->div, qp2->div))
1120 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1122 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1126 isl_qpolynomial_free(qp2);
1130 isl_qpolynomial_free(qp1);
1131 isl_qpolynomial_free(qp2);
1135 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1136 __isl_take isl_qpolynomial *qp2)
1138 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1141 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1143 qp = isl_qpolynomial_cow(qp);
1148 qp->upoly = isl_upoly_neg(qp->upoly);
1154 isl_qpolynomial_free(qp);
1158 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1159 __isl_take isl_qpolynomial *qp2)
1161 qp1 = isl_qpolynomial_cow(qp1);
1166 if (qp1->div->n_row < qp2->div->n_row)
1167 return isl_qpolynomial_mul(qp2, qp1);
1169 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1170 if (!compatible_divs(qp1->div, qp2->div))
1171 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1173 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1177 isl_qpolynomial_free(qp2);
1181 isl_qpolynomial_free(qp1);
1182 isl_qpolynomial_free(qp2);
1186 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1188 struct isl_qpolynomial *qp;
1189 struct isl_upoly_cst *cst;
1191 qp = isl_qpolynomial_alloc(dim, 0);
1195 qp->upoly = isl_upoly_zero(dim->ctx);
1201 isl_qpolynomial_free(qp);
1205 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1207 struct isl_qpolynomial *qp;
1208 struct isl_upoly_cst *cst;
1210 qp = isl_qpolynomial_alloc(dim, 0);
1214 qp->upoly = isl_upoly_infty(dim->ctx);
1220 isl_qpolynomial_free(qp);
1224 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1226 struct isl_qpolynomial *qp;
1227 struct isl_upoly_cst *cst;
1229 qp = isl_qpolynomial_alloc(dim, 0);
1233 qp->upoly = isl_upoly_nan(dim->ctx);
1239 isl_qpolynomial_free(qp);
1243 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1246 struct isl_qpolynomial *qp;
1247 struct isl_upoly_cst *cst;
1249 qp = isl_qpolynomial_alloc(dim, 0);
1253 qp->upoly = isl_upoly_zero(dim->ctx);
1256 cst = isl_upoly_as_cst(qp->upoly);
1257 isl_int_set(cst->n, v);
1261 isl_qpolynomial_free(qp);
1265 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1266 isl_int *n, isl_int *d)
1268 struct isl_upoly_cst *cst;
1273 if (!isl_upoly_is_cst(qp->upoly))
1276 cst = isl_upoly_as_cst(qp->upoly);
1281 isl_int_set(*n, cst->n);
1283 isl_int_set(*d, cst->d);
1288 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1289 __isl_keep isl_qpolynomial *qp2)
1294 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1297 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1300 struct isl_upoly_rec *rec;
1302 if (isl_upoly_is_cst(up)) {
1303 struct isl_upoly_cst *cst;
1304 cst = isl_upoly_as_cst(up);
1307 isl_int_lcm(*d, *d, cst->d);
1311 rec = isl_upoly_as_rec(up);
1315 for (i = 0; i < rec->n; ++i)
1316 upoly_update_den(rec->p[i], d);
1319 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1321 isl_int_set_si(*d, 1);
1324 upoly_update_den(qp->upoly, d);
1327 __isl_give struct isl_upoly *isl_upoly_pow(isl_ctx *ctx, int pos, int power)
1330 struct isl_upoly *up;
1331 struct isl_upoly_rec *rec;
1332 struct isl_upoly_cst *cst;
1334 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
1337 for (i = 0; i < 1 + power; ++i) {
1338 rec->p[i] = isl_upoly_zero(ctx);
1343 cst = isl_upoly_as_cst(rec->p[power]);
1344 isl_int_set_si(cst->n, 1);
1348 isl_upoly_free(&rec->up);
1352 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1355 struct isl_qpolynomial *qp;
1356 struct isl_ctx *ctx;
1363 qp = isl_qpolynomial_alloc(dim, 0);
1367 qp->upoly = isl_upoly_pow(ctx, pos, power);
1373 isl_qpolynomial_free(qp);
1377 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1378 enum isl_dim_type type, unsigned pos)
1383 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1384 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1386 if (type == isl_dim_set)
1387 pos += isl_dim_size(dim, isl_dim_param);
1389 return isl_qpolynomial_pow(dim, pos, 1);
1395 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1398 struct isl_qpolynomial *qp = NULL;
1399 struct isl_upoly_rec *rec;
1400 struct isl_upoly_cst *cst;
1406 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1408 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1);
1412 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1413 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1415 pos = isl_dim_total(qp->dim);
1416 qp->upoly = &isl_upoly_alloc_rec(div->ctx, pos, 1 + power)->up;
1419 rec = isl_upoly_as_rec(qp->upoly);
1420 for (i = 0; i < 1 + power; ++i) {
1421 rec->p[i] = isl_upoly_zero(div->ctx);
1426 cst = isl_upoly_as_cst(rec->p[power]);
1427 isl_int_set_si(cst->n, 1);
1433 isl_qpolynomial_free(qp);
1438 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1440 return isl_qpolynomial_div_pow(div, 1);
1443 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1444 const isl_int n, const isl_int d)
1446 struct isl_qpolynomial *qp;
1447 struct isl_upoly_cst *cst;
1449 qp = isl_qpolynomial_alloc(dim, 0);
1453 qp->upoly = isl_upoly_zero(dim->ctx);
1456 cst = isl_upoly_as_cst(qp->upoly);
1457 isl_int_set(cst->n, n);
1458 isl_int_set(cst->d, d);
1462 isl_qpolynomial_free(qp);
1466 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1468 struct isl_upoly_rec *rec;
1474 if (isl_upoly_is_cst(up))
1478 active[up->var] = 1;
1480 rec = isl_upoly_as_rec(up);
1481 for (i = 0; i < rec->n; ++i)
1482 if (up_set_active(rec->p[i], active, d) < 0)
1488 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1491 int d = isl_dim_total(qp->dim);
1496 for (i = 0; i < d; ++i)
1497 for (j = 0; j < qp->div->n_row; ++j) {
1498 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1504 return up_set_active(qp->upoly, active, d);
1507 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1508 enum isl_dim_type type, unsigned first, unsigned n)
1519 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1521 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1522 type == isl_dim_set, return -1);
1524 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1525 if (set_active(qp, active) < 0)
1528 if (type == isl_dim_set)
1529 first += isl_dim_size(qp->dim, isl_dim_param);
1530 for (i = 0; i < n; ++i)
1531 if (active[first + i]) {
1544 int isl_qpolynomial_fold_involves_dims(__isl_keep isl_qpolynomial_fold *fold,
1545 enum isl_dim_type type, unsigned first, unsigned n)
1551 if (fold->n == 0 || n == 0)
1554 for (i = 0; i < fold->n; ++i) {
1555 int involves = isl_qpolynomial_involves_dims(fold->qp[i],
1557 if (involves < 0 || involves)
1563 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1564 unsigned first, unsigned n)
1567 struct isl_upoly_rec *rec;
1571 if (n == 0 || up->var < 0 || up->var < first)
1573 if (up->var < first + n) {
1574 up = replace_by_constant_term(up);
1575 return isl_upoly_drop(up, first, n);
1577 up = isl_upoly_cow(up);
1581 rec = isl_upoly_as_rec(up);
1585 for (i = 0; i < rec->n; ++i) {
1586 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1597 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1598 __isl_take isl_qpolynomial *qp,
1599 enum isl_dim_type type, unsigned first, unsigned n)
1606 qp = isl_qpolynomial_cow(qp);
1610 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1612 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1613 type == isl_dim_set, goto error);
1615 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1619 if (type == isl_dim_set)
1620 first += isl_dim_size(qp->dim, isl_dim_param);
1622 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1626 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1632 isl_qpolynomial_free(qp);
1636 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_drop_dims(
1637 __isl_take isl_qpolynomial_fold *fold,
1638 enum isl_dim_type type, unsigned first, unsigned n)
1647 fold = isl_qpolynomial_fold_cow(fold);
1650 fold->dim = isl_dim_drop(fold->dim, type, first, n);
1654 for (i = 0; i < fold->n; ++i) {
1655 fold->qp[i] = isl_qpolynomial_drop_dims(fold->qp[i],
1663 isl_qpolynomial_fold_free(fold);
1668 #define PW isl_pw_qpolynomial
1670 #define EL isl_qpolynomial
1672 #define IS_ZERO is_zero
1678 #include <isl_pw_templ.c>
1681 #define PW isl_pw_qpolynomial_fold
1683 #define EL isl_qpolynomial_fold
1685 #define IS_ZERO is_empty
1691 #include <isl_pw_templ.c>
1693 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
1701 if (!isl_set_fast_is_universe(pwqp->p[0].set))
1704 return isl_qpolynomial_is_one(pwqp->p[0].qp);
1707 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
1708 __isl_take isl_pw_qpolynomial *pwqp1,
1709 __isl_take isl_pw_qpolynomial *pwqp2)
1712 struct isl_pw_qpolynomial *res;
1715 if (!pwqp1 || !pwqp2)
1718 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
1721 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
1722 isl_pw_qpolynomial_free(pwqp2);
1726 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
1727 isl_pw_qpolynomial_free(pwqp1);
1731 if (isl_pw_qpolynomial_is_one(pwqp1)) {
1732 isl_pw_qpolynomial_free(pwqp1);
1736 if (isl_pw_qpolynomial_is_one(pwqp2)) {
1737 isl_pw_qpolynomial_free(pwqp2);
1741 n = pwqp1->n * pwqp2->n;
1742 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
1744 for (i = 0; i < pwqp1->n; ++i) {
1745 for (j = 0; j < pwqp2->n; ++j) {
1746 struct isl_set *common;
1747 struct isl_qpolynomial *prod;
1748 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
1749 isl_set_copy(pwqp2->p[j].set));
1750 if (isl_set_fast_is_empty(common)) {
1751 isl_set_free(common);
1755 prod = isl_qpolynomial_mul(
1756 isl_qpolynomial_copy(pwqp1->p[i].qp),
1757 isl_qpolynomial_copy(pwqp2->p[j].qp));
1759 res = isl_pw_qpolynomial_add_piece(res, common, prod);
1763 isl_pw_qpolynomial_free(pwqp1);
1764 isl_pw_qpolynomial_free(pwqp2);
1768 isl_pw_qpolynomial_free(pwqp1);
1769 isl_pw_qpolynomial_free(pwqp2);
1773 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
1774 __isl_take isl_pw_qpolynomial *pwqp)
1777 struct isl_pw_qpolynomial *res;
1783 if (isl_pw_qpolynomial_is_zero(pwqp))
1786 pwqp = isl_pw_qpolynomial_cow(pwqp);
1788 for (i = 0; i < pwqp->n; ++i) {
1789 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
1796 isl_pw_qpolynomial_free(pwqp);
1800 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
1801 __isl_take isl_pw_qpolynomial *pwqp1,
1802 __isl_take isl_pw_qpolynomial *pwqp2)
1804 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
1807 __isl_give struct isl_upoly *isl_upoly_eval(
1808 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
1811 struct isl_upoly_rec *rec;
1812 struct isl_upoly *res;
1813 struct isl_upoly *base;
1815 if (isl_upoly_is_cst(up)) {
1820 rec = isl_upoly_as_rec(up);
1824 isl_assert(up->ctx, rec->n >= 1, goto error);
1826 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
1828 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
1831 for (i = rec->n - 2; i >= 0; --i) {
1832 res = isl_upoly_mul(res, isl_upoly_copy(base));
1833 res = isl_upoly_sum(res,
1834 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
1835 isl_vec_copy(vec)));
1838 isl_upoly_free(base);
1848 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
1849 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
1852 struct isl_upoly *up;
1857 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
1859 if (qp->div->n_row == 0)
1860 ext = isl_vec_copy(pnt->vec);
1863 unsigned dim = isl_dim_total(qp->dim);
1864 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
1868 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
1869 for (i = 0; i < qp->div->n_row; ++i) {
1870 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
1871 1 + dim + i, &ext->el[1+dim+i]);
1872 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
1873 qp->div->row[i][0]);
1877 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
1881 dim = isl_dim_copy(qp->dim);
1882 isl_qpolynomial_free(qp);
1883 isl_point_free(pnt);
1885 qp = isl_qpolynomial_alloc(dim, 0);
1893 isl_qpolynomial_free(qp);
1894 isl_point_free(pnt);
1898 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
1899 __isl_keep struct isl_upoly_cst *cst2)
1904 isl_int_mul(t, cst1->n, cst2->d);
1905 isl_int_submul(t, cst2->n, cst1->d);
1906 cmp = isl_int_sgn(t);
1911 static __isl_give isl_qpolynomial *qpolynomial_min(
1912 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1914 struct isl_upoly_cst *cst1, *cst2;
1919 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1920 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1921 cst1 = isl_upoly_as_cst(qp1->upoly);
1922 cst2 = isl_upoly_as_cst(qp2->upoly);
1923 cmp = isl_upoly_cmp(cst1, cst2);
1926 isl_qpolynomial_free(qp2);
1928 isl_qpolynomial_free(qp1);
1933 isl_qpolynomial_free(qp1);
1934 isl_qpolynomial_free(qp2);
1938 static __isl_give isl_qpolynomial *qpolynomial_max(
1939 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1941 struct isl_upoly_cst *cst1, *cst2;
1946 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1947 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1948 cst1 = isl_upoly_as_cst(qp1->upoly);
1949 cst2 = isl_upoly_as_cst(qp2->upoly);
1950 cmp = isl_upoly_cmp(cst1, cst2);
1953 isl_qpolynomial_free(qp2);
1955 isl_qpolynomial_free(qp1);
1960 isl_qpolynomial_free(qp1);
1961 isl_qpolynomial_free(qp2);
1965 int isl_qpolynomial_fold_is_equal(__isl_keep isl_qpolynomial_fold *fold1,
1966 __isl_keep isl_qpolynomial_fold *fold2)
1970 if (!fold1 || !fold2)
1973 if (fold1->n != fold2->n)
1976 /* We probably want to sort the qps first... */
1977 for (i = 0; i < fold1->n; ++i) {
1978 int eq = isl_qpolynomial_is_equal(fold1->qp[i], fold2->qp[i]);
1986 __isl_give isl_qpolynomial *isl_qpolynomial_fold_eval(
1987 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_point *pnt)
1989 isl_qpolynomial *qp;
1993 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, fold->dim), goto error);
1994 isl_assert(pnt->dim->ctx,
1995 fold->type == isl_fold_max || fold->type == isl_fold_min,
1999 qp = isl_qpolynomial_zero(isl_dim_copy(fold->dim));
2002 qp = isl_qpolynomial_eval(isl_qpolynomial_copy(fold->qp[0]),
2003 isl_point_copy(pnt));
2004 for (i = 1; i < fold->n; ++i) {
2005 isl_qpolynomial *qp_i;
2006 qp_i = isl_qpolynomial_eval(
2007 isl_qpolynomial_copy(fold->qp[i]),
2008 isl_point_copy(pnt));
2009 if (fold->type == isl_fold_max)
2010 qp = qpolynomial_max(qp, qp_i);
2012 qp = qpolynomial_min(qp, qp_i);
2015 isl_qpolynomial_fold_free(fold);
2016 isl_point_free(pnt);
2020 isl_qpolynomial_fold_free(fold);
2021 isl_point_free(pnt);
2025 static int *reordering_move(isl_ctx *ctx,
2026 unsigned len, unsigned dst, unsigned src, unsigned n)
2031 reordering = isl_alloc_array(ctx, int, len);
2036 for (i = 0; i < dst; ++i)
2038 for (i = 0; i < n; ++i)
2039 reordering[src + i] = dst + i;
2040 for (i = 0; i < src - dst; ++i)
2041 reordering[dst + i] = dst + n + i;
2042 for (i = 0; i < len - src - n; ++i)
2043 reordering[src + n + i] = src + n + i;
2045 for (i = 0; i < src; ++i)
2047 for (i = 0; i < n; ++i)
2048 reordering[src + i] = dst + i;
2049 for (i = 0; i < dst - src; ++i)
2050 reordering[src + n + i] = src + i;
2051 for (i = 0; i < len - dst - n; ++i)
2052 reordering[dst + n + i] = dst + n + i;
2058 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
2062 struct isl_upoly_rec *rec;
2063 struct isl_upoly *base;
2064 struct isl_upoly *res;
2066 if (isl_upoly_is_cst(up))
2069 rec = isl_upoly_as_rec(up);
2073 isl_assert(up->ctx, rec->n >= 1, goto error);
2075 base = isl_upoly_pow(up->ctx, r[up->var], 1);
2076 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
2078 for (i = rec->n - 2; i >= 0; --i) {
2079 res = isl_upoly_mul(res, isl_upoly_copy(base));
2080 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
2083 isl_upoly_free(base);
2092 __isl_give isl_qpolynomial *isl_qpolynomial_move(__isl_take isl_qpolynomial *qp,
2093 enum isl_dim_type dst_type, unsigned dst_pos,
2094 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2100 qp = isl_qpolynomial_cow(qp);
2104 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2107 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2108 g_src_pos = pos(qp->dim, src_type) + src_pos;
2109 if (dst_type > src_type)
2112 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2113 qp->div = sort_divs(qp->div);
2117 reordering = reordering_move(qp->dim->ctx,
2118 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2122 qp->upoly = reorder(qp->upoly, reordering);
2127 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2133 isl_qpolynomial_free(qp);
2137 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_move(
2138 __isl_take isl_pw_qpolynomial *pwqp,
2139 enum isl_dim_type dst_type, unsigned dst_pos,
2140 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2144 pwqp = isl_pw_qpolynomial_cow(pwqp);
2148 pwqp->dim = isl_dim_move(pwqp->dim,
2149 dst_type, dst_pos, src_type, src_pos, n);
2153 for (i = 0; i < pwqp->n; ++i) {
2154 pwqp->p[i].set = isl_set_move(pwqp->p[i].set, dst_type, dst_pos,
2155 src_type, src_pos, n);
2156 if (!pwqp->p[i].set)
2158 pwqp->p[i].qp = isl_qpolynomial_move(pwqp->p[i].qp,
2159 dst_type, dst_pos, src_type, src_pos, n);
2166 isl_pw_qpolynomial_free(pwqp);
2170 __isl_give isl_dim *isl_pw_qpolynomial_get_dim(
2171 __isl_keep isl_pw_qpolynomial *pwqp)
2176 return isl_dim_copy(pwqp->dim);
2179 unsigned isl_pw_qpolynomial_dim(__isl_keep isl_pw_qpolynomial *pwqp,
2180 enum isl_dim_type type)
2182 return pwqp ? isl_dim_size(pwqp->dim, type) : 0;
2185 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2186 __isl_take isl_mat *div)
2194 n = isl_dim_total(dim) + div->n_row;
2196 term = isl_calloc(dim->ctx, struct isl_term,
2197 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2204 isl_int_init(term->n);
2205 isl_int_init(term->d);
2214 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
2223 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
2232 total = isl_dim_total(term->dim) + term->div->n_row;
2234 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
2238 isl_int_set(dup->n, term->n);
2239 isl_int_set(dup->d, term->d);
2241 for (i = 0; i < total; ++i)
2242 dup->pow[i] = term->pow[i];
2247 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
2255 return isl_term_dup(term);
2258 void isl_term_free(__isl_take isl_term *term)
2263 if (--term->ref > 0)
2266 isl_dim_free(term->dim);
2267 isl_mat_free(term->div);
2268 isl_int_clear(term->n);
2269 isl_int_clear(term->d);
2273 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
2281 case isl_dim_out: return isl_dim_size(term->dim, type);
2282 case isl_dim_div: return term->div->n_row;
2283 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
2287 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
2289 return term ? term->dim->ctx : NULL;
2292 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
2296 isl_int_set(*n, term->n);
2299 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
2303 isl_int_set(*d, term->d);
2306 int isl_term_get_exp(__isl_keep isl_term *term,
2307 enum isl_dim_type type, unsigned pos)
2312 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
2314 if (type >= isl_dim_set)
2315 pos += isl_dim_size(term->dim, isl_dim_param);
2316 if (type >= isl_dim_div)
2317 pos += isl_dim_size(term->dim, isl_dim_set);
2319 return term->pow[pos];
2322 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
2324 isl_basic_map *bmap;
2331 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
2334 total = term->div->n_col - term->div->n_row - 2;
2335 /* No nested divs for now */
2336 isl_assert(term->dim->ctx,
2337 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
2338 term->div->n_row) == -1,
2341 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
2342 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
2345 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
2347 return isl_basic_map_div(bmap, k);
2349 isl_basic_map_free(bmap);
2353 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
2354 int (*fn)(__isl_take isl_term *term, void *user),
2355 __isl_take isl_term *term, void *user)
2358 struct isl_upoly_rec *rec;
2363 if (isl_upoly_is_zero(up))
2366 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
2367 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
2368 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
2370 if (isl_upoly_is_cst(up)) {
2371 struct isl_upoly_cst *cst;
2372 cst = isl_upoly_as_cst(up);
2375 term = isl_term_cow(term);
2378 isl_int_set(term->n, cst->n);
2379 isl_int_set(term->d, cst->d);
2380 if (fn(isl_term_copy(term), user) < 0)
2385 rec = isl_upoly_as_rec(up);
2389 for (i = 0; i < rec->n; ++i) {
2390 term = isl_term_cow(term);
2393 term->pow[up->var] = i;
2394 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
2398 term->pow[up->var] = 0;
2402 isl_term_free(term);
2406 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
2407 int (*fn)(__isl_take isl_term *term, void *user), void *user)
2414 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
2418 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
2420 isl_term_free(term);
2422 return term ? 0 : -1;
2425 int isl_pw_qpolynomial_foreach_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2426 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2427 void *user), void *user)
2434 for (i = 0; i < pwqp->n; ++i)
2435 if (fn(isl_set_copy(pwqp->p[i].set),
2436 isl_qpolynomial_copy(pwqp->p[i].qp), user) < 0)
2442 static int any_divs(__isl_keep isl_set *set)
2449 for (i = 0; i < set->n; ++i)
2450 if (set->p[i]->n_div > 0)
2456 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
2457 __isl_take isl_dim *dim)
2462 if (isl_dim_equal(qp->dim, dim)) {
2467 qp = isl_qpolynomial_cow(qp);
2471 if (qp->div->n_row) {
2477 extra = isl_dim_size(dim, isl_dim_set) -
2478 isl_dim_size(qp->dim, isl_dim_set);
2479 total = isl_dim_total(qp->dim);
2480 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
2483 for (i = 0; i < qp->div->n_row; ++i)
2485 qp->upoly = expand(qp->upoly, exp, total);
2489 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
2492 for (i = 0; i < qp->div->n_row; ++i)
2493 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
2496 isl_dim_free(qp->dim);
2502 isl_qpolynomial_free(qp);
2506 static int foreach_lifted_subset(__isl_take isl_set *set,
2507 __isl_take isl_qpolynomial *qp,
2508 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2509 void *user), void *user)
2516 for (i = 0; i < set->n; ++i) {
2518 isl_qpolynomial *copy;
2520 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
2521 lift = isl_set_lift(lift);
2523 copy = isl_qpolynomial_copy(qp);
2524 copy = isl_qpolynomial_lift(copy, isl_set_get_dim(lift));
2526 if (fn(lift, copy, user) < 0)
2531 isl_qpolynomial_free(qp);
2536 isl_qpolynomial_free(qp);
2540 int isl_pw_qpolynomial_foreach_lifted_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2541 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2542 void *user), void *user)
2549 for (i = 0; i < pwqp->n; ++i) {
2551 isl_qpolynomial *qp;
2553 set = isl_set_copy(pwqp->p[i].set);
2554 qp = isl_qpolynomial_copy(pwqp->p[i].qp);
2555 if (!any_divs(set)) {
2556 if (fn(set, qp, user) < 0)
2560 if (foreach_lifted_subset(set, qp, fn, user) < 0)
2567 static __isl_give isl_qpolynomial_fold *qpolynomial_fold_alloc(
2568 enum isl_fold type, __isl_take isl_dim *dim, int n)
2570 isl_qpolynomial_fold *fold;
2575 isl_assert(dim->ctx, n >= 0, goto error);
2576 fold = isl_alloc(dim->ctx, struct isl_qpolynomial_fold,
2577 sizeof(struct isl_qpolynomial_fold) +
2578 (n - 1) * sizeof(struct isl_qpolynomial *));
2594 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_empty(enum isl_fold type,
2595 __isl_take isl_dim *dim)
2597 return qpolynomial_fold_alloc(type, dim, 0);
2600 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_alloc(
2601 enum isl_fold type, __isl_take isl_qpolynomial *qp)
2603 isl_qpolynomial_fold *fold;
2608 fold = qpolynomial_fold_alloc(type, isl_dim_copy(qp->dim), 1);
2617 isl_qpolynomial_fold_free(fold);
2618 isl_qpolynomial_free(qp);
2622 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_copy(
2623 __isl_keep isl_qpolynomial_fold *fold)
2632 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_dup(
2633 __isl_keep isl_qpolynomial_fold *fold)
2636 isl_qpolynomial_fold *dup;
2640 dup = qpolynomial_fold_alloc(fold->type,
2641 isl_dim_copy(fold->dim), fold->n);
2645 for (i = 0; i < fold->n; ++i) {
2646 dup->qp[i] = isl_qpolynomial_copy(fold->qp[i]);
2653 isl_qpolynomial_fold_free(dup);
2657 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_cow(
2658 __isl_take isl_qpolynomial_fold *fold)
2666 return isl_qpolynomial_fold_dup(fold);
2669 void isl_qpolynomial_fold_free(__isl_take isl_qpolynomial_fold *fold)
2675 if (--fold->ref > 0)
2678 for (i = 0; i < fold->n; ++i)
2679 isl_qpolynomial_free(fold->qp[i]);
2680 isl_dim_free(fold->dim);
2684 int isl_qpolynomial_fold_is_empty(__isl_keep isl_qpolynomial_fold *fold)
2689 return fold->n == 0;
2692 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold(
2693 __isl_take isl_qpolynomial_fold *fold1,
2694 __isl_take isl_qpolynomial_fold *fold2)
2697 struct isl_qpolynomial_fold *res = NULL;
2699 if (!fold1 || !fold2)
2702 isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error);
2703 isl_assert(fold1->dim->ctx, isl_dim_equal(fold1->dim, fold2->dim),
2706 if (isl_qpolynomial_fold_is_empty(fold1)) {
2707 isl_qpolynomial_fold_free(fold1);
2711 if (isl_qpolynomial_fold_is_empty(fold2)) {
2712 isl_qpolynomial_fold_free(fold2);
2716 res = qpolynomial_fold_alloc(fold1->type, isl_dim_copy(fold1->dim),
2717 fold1->n + fold2->n);
2721 for (i = 0; i < fold1->n; ++i) {
2722 res->qp[res->n] = isl_qpolynomial_copy(fold1->qp[i]);
2723 if (!res->qp[res->n])
2728 for (i = 0; i < fold2->n; ++i) {
2729 res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]);
2730 if (!res->qp[res->n])
2735 isl_qpolynomial_fold_free(fold1);
2736 isl_qpolynomial_fold_free(fold2);
2740 isl_qpolynomial_fold_free(res);
2741 isl_qpolynomial_fold_free(fold1);
2742 isl_qpolynomial_fold_free(fold2);
2746 __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_from_pw_qpolynomial(
2747 enum isl_fold type, __isl_take isl_pw_qpolynomial *pwqp)
2750 isl_pw_qpolynomial_fold *pwf;
2755 pwf = isl_pw_qpolynomial_fold_alloc_(isl_dim_copy(pwqp->dim), pwqp->n);
2757 for (i = 0; i < pwqp->n; ++i)
2758 pwf = isl_pw_qpolynomial_fold_add_piece(pwf,
2759 isl_set_copy(pwqp->p[i].set),
2760 isl_qpolynomial_fold_alloc(type,
2761 isl_qpolynomial_copy(pwqp->p[i].qp)));
2763 isl_pw_qpolynomial_free(pwqp);
2768 /* For each parameter or variable that does not appear in qp,
2769 * first eliminate the variable from all constraints and then set it to zero.
2771 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
2772 __isl_keep isl_qpolynomial *qp)
2783 d = isl_dim_total(set->dim);
2784 active = isl_calloc_array(set->ctx, int, d);
2785 if (set_active(qp, active) < 0)
2788 for (i = 0; i < d; ++i)
2797 nparam = isl_dim_size(set->dim, isl_dim_param);
2798 nvar = isl_dim_size(set->dim, isl_dim_set);
2799 for (i = 0; i < nparam; ++i) {
2802 set = isl_set_eliminate(set, isl_dim_param, i, 1);
2803 set = isl_set_fix_si(set, isl_dim_param, i, 0);
2805 for (i = 0; i < nvar; ++i) {
2808 set = isl_set_eliminate(set, isl_dim_set, i, 1);
2809 set = isl_set_fix_si(set, isl_dim_set, i, 0);
2821 struct isl_max_data {
2822 isl_qpolynomial *qp;
2824 isl_qpolynomial *max;
2827 static int max_fn(__isl_take isl_point *pnt, void *user)
2829 struct isl_max_data *data = (struct isl_max_data *)user;
2830 isl_qpolynomial *val;
2832 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
2837 data->max = qpolynomial_max(data->max, val);
2843 static __isl_give isl_qpolynomial *guarded_qpolynomial_max(
2844 __isl_take isl_set *set, __isl_take isl_qpolynomial *qp)
2846 struct isl_max_data data = { NULL, 1, NULL };
2851 if (isl_upoly_is_cst(qp->upoly)) {
2856 set = fix_inactive(set, qp);
2859 if (isl_set_foreach_point(set, max_fn, &data) < 0)
2863 isl_qpolynomial_free(qp);
2867 isl_qpolynomial_free(qp);
2868 isl_qpolynomial_free(data.max);
2872 /* Compute the maximal value attained by the piecewise quasipolynomial
2873 * on its domain or zero if the domain is empty.
2874 * In the worst case, the domain is scanned completely,
2875 * so the domain is assumed to be bounded.
2877 __isl_give isl_qpolynomial *isl_pw_qpolynomial_max(
2878 __isl_take isl_pw_qpolynomial *pwqp)
2881 isl_qpolynomial *max;
2887 isl_dim *dim = isl_dim_copy(pwqp->dim);
2888 isl_pw_qpolynomial_free(pwqp);
2889 return isl_qpolynomial_zero(dim);
2892 max = guarded_qpolynomial_max(isl_set_copy(pwqp->p[0].set),
2893 isl_qpolynomial_copy(pwqp->p[0].qp));
2894 for (i = 1; i < pwqp->n; ++i) {
2895 isl_qpolynomial *max_i;
2896 max_i = guarded_qpolynomial_max(isl_set_copy(pwqp->p[i].set),
2897 isl_qpolynomial_copy(pwqp->p[i].qp));
2898 max = qpolynomial_max(max, max_i);
2901 isl_pw_qpolynomial_free(pwqp);