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_zero(__isl_keep struct isl_upoly *up)
37 struct isl_upoly_cst *cst;
41 if (!isl_upoly_is_cst(up))
44 cst = isl_upoly_as_cst(up);
48 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
51 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
53 struct isl_upoly_cst *cst;
57 if (!isl_upoly_is_cst(up))
60 cst = isl_upoly_as_cst(up);
64 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
67 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
69 struct isl_upoly_cst *cst;
73 if (!isl_upoly_is_cst(up))
76 cst = isl_upoly_as_cst(up);
80 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
83 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
85 struct isl_upoly_cst *cst;
89 if (!isl_upoly_is_cst(up))
92 cst = isl_upoly_as_cst(up);
96 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
99 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
101 struct isl_upoly_cst *cst;
105 if (!isl_upoly_is_cst(up))
108 cst = isl_upoly_as_cst(up);
112 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
115 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
117 struct isl_upoly_cst *cst;
121 if (!isl_upoly_is_cst(up))
124 cst = isl_upoly_as_cst(up);
128 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
131 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
133 struct isl_upoly_cst *cst;
135 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
144 isl_int_init(cst->n);
145 isl_int_init(cst->d);
150 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
152 struct isl_upoly_cst *cst;
154 cst = isl_upoly_cst_alloc(ctx);
158 isl_int_set_si(cst->n, 0);
159 isl_int_set_si(cst->d, 1);
164 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
166 struct isl_upoly_cst *cst;
168 cst = isl_upoly_cst_alloc(ctx);
172 isl_int_set_si(cst->n, 1);
173 isl_int_set_si(cst->d, 0);
178 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
180 struct isl_upoly_cst *cst;
182 cst = isl_upoly_cst_alloc(ctx);
186 isl_int_set_si(cst->n, 0);
187 isl_int_set_si(cst->d, 0);
192 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
193 isl_int n, isl_int d)
195 struct isl_upoly_cst *cst;
197 cst = isl_upoly_cst_alloc(ctx);
201 isl_int_set(cst->n, n);
202 isl_int_set(cst->d, d);
207 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
210 struct isl_upoly_rec *rec;
212 isl_assert(ctx, var >= 0, return NULL);
213 isl_assert(ctx, size >= 0, return NULL);
214 rec = isl_calloc(dim->ctx, struct isl_upoly_rec,
215 sizeof(struct isl_upoly_rec) +
216 (size - 1) * sizeof(struct isl_upoly *));
230 isl_upoly_free(&rec->up);
234 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
236 struct isl_upoly_cst *cst;
241 return isl_upoly_is_zero(qp->upoly);
244 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
246 struct isl_upoly_cst *cst;
251 return isl_upoly_is_one(qp->upoly);
254 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
256 isl_int_clear(cst->n);
257 isl_int_clear(cst->d);
260 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
264 for (i = 0; i < rec->n; ++i)
265 isl_upoly_free(rec->p[i]);
268 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
277 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
279 struct isl_upoly_cst *cst;
280 struct isl_upoly_cst *dup;
282 cst = isl_upoly_as_cst(up);
286 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
289 isl_int_set(dup->n, cst->n);
290 isl_int_set(dup->d, cst->d);
295 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
298 struct isl_upoly_rec *rec;
299 struct isl_upoly_rec *dup;
301 rec = isl_upoly_as_rec(up);
305 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
309 for (i = 0; i < rec->n; ++i) {
310 dup->p[i] = isl_upoly_copy(rec->p[i]);
318 isl_upoly_free(&dup->up);
322 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
324 struct isl_upoly *dup;
329 if (isl_upoly_is_cst(up))
330 return isl_upoly_dup_cst(up);
332 return isl_upoly_dup_rec(up);
335 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
343 return isl_upoly_dup(up);
346 void isl_upoly_free(__isl_take struct isl_upoly *up)
355 upoly_free_cst((struct isl_upoly_cst *)up);
357 upoly_free_rec((struct isl_upoly_rec *)up);
359 isl_ctx_deref(up->ctx);
363 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
368 isl_int_gcd(gcd, cst->n, cst->d);
369 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
370 isl_int_divexact(cst->n, cst->n, gcd);
371 isl_int_divexact(cst->d, cst->d, gcd);
376 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
377 __isl_take struct isl_upoly *up2)
379 struct isl_upoly_cst *cst1;
380 struct isl_upoly_cst *cst2;
382 up1 = isl_upoly_cow(up1);
386 cst1 = isl_upoly_as_cst(up1);
387 cst2 = isl_upoly_as_cst(up2);
389 if (isl_int_eq(cst1->d, cst2->d))
390 isl_int_add(cst1->n, cst1->n, cst2->n);
392 isl_int_mul(cst1->n, cst1->n, cst2->d);
393 isl_int_addmul(cst1->n, cst2->n, cst1->d);
394 isl_int_mul(cst1->d, cst1->d, cst2->d);
397 isl_upoly_cst_reduce(cst1);
407 static __isl_give struct isl_upoly *replace_by_zero(
408 __isl_take struct isl_upoly *up)
416 return isl_upoly_zero(ctx);
419 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
420 __isl_take struct isl_upoly *up2)
423 struct isl_upoly_rec *rec1, *rec2;
428 if (isl_upoly_is_nan(up1)) {
433 if (isl_upoly_is_nan(up2)) {
438 if (isl_upoly_is_zero(up1)) {
443 if (isl_upoly_is_zero(up2)) {
448 if (up1->var < up2->var)
449 return isl_upoly_sum(up2, up1);
451 if (up2->var < up1->var) {
452 struct isl_upoly_rec *rec;
453 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
457 up1 = isl_upoly_cow(up1);
458 rec = isl_upoly_as_rec(up1);
461 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
462 if (rec->n == 1 && isl_upoly_is_zero(rec->p[0]))
463 up1 = replace_by_zero(up1);
467 if (isl_upoly_is_cst(up1))
468 return isl_upoly_sum_cst(up1, up2);
470 rec1 = isl_upoly_as_rec(up1);
471 rec2 = isl_upoly_as_rec(up2);
475 if (rec1->n < rec2->n)
476 return isl_upoly_sum(up2, up1);
478 up1 = isl_upoly_cow(up1);
479 rec1 = isl_upoly_as_rec(up1);
483 for (i = rec2->n - 1; i >= 0; --i) {
484 rec1->p[i] = isl_upoly_sum(rec1->p[i],
485 isl_upoly_copy(rec2->p[i]));
488 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
489 isl_upoly_free(rec1->p[i]);
495 up1 = replace_by_zero(up1);
506 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
508 struct isl_upoly_cst *cst;
510 if (isl_upoly_is_zero(up))
513 up = isl_upoly_cow(up);
517 cst = isl_upoly_as_cst(up);
519 isl_int_neg(cst->n, cst->n);
524 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
527 struct isl_upoly_rec *rec;
532 if (isl_upoly_is_cst(up))
533 return isl_upoly_neg_cst(up);
535 up = isl_upoly_cow(up);
536 rec = isl_upoly_as_rec(up);
540 for (i = 0; i < rec->n; ++i) {
541 rec->p[i] = isl_upoly_neg(rec->p[i]);
552 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
553 __isl_take struct isl_upoly *up2)
555 struct isl_upoly_cst *cst1;
556 struct isl_upoly_cst *cst2;
558 up1 = isl_upoly_cow(up1);
562 cst1 = isl_upoly_as_cst(up1);
563 cst2 = isl_upoly_as_cst(up2);
565 isl_int_mul(cst1->n, cst1->n, cst2->n);
566 isl_int_mul(cst1->d, cst1->d, cst2->d);
568 isl_upoly_cst_reduce(cst1);
578 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
579 __isl_take struct isl_upoly *up2)
581 struct isl_upoly_rec *rec1;
582 struct isl_upoly_rec *rec2;
583 struct isl_upoly_rec *res;
587 rec1 = isl_upoly_as_rec(up1);
588 rec2 = isl_upoly_as_rec(up2);
591 size = rec1->n + rec2->n - 1;
592 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
596 for (i = 0; i < rec1->n; ++i) {
597 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
598 isl_upoly_copy(rec1->p[i]));
603 for (; i < size; ++i) {
604 res->p[i] = isl_upoly_zero(up1->ctx);
609 for (i = 0; i < rec1->n; ++i) {
610 for (j = 1; j < rec2->n; ++j) {
611 struct isl_upoly *up;
612 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
613 isl_upoly_copy(rec1->p[i]));
614 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
627 isl_upoly_free(&res->up);
631 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
632 __isl_take struct isl_upoly *up2)
637 if (isl_upoly_is_nan(up1)) {
642 if (isl_upoly_is_nan(up2)) {
647 if (isl_upoly_is_zero(up1)) {
652 if (isl_upoly_is_zero(up2)) {
657 if (isl_upoly_is_one(up1)) {
662 if (isl_upoly_is_one(up2)) {
667 if (up1->var < up2->var)
668 return isl_upoly_mul(up2, up1);
670 if (up2->var < up1->var) {
672 struct isl_upoly_rec *rec;
673 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
674 isl_ctx *ctx = up1->ctx;
677 return isl_upoly_nan(ctx);
679 up1 = isl_upoly_cow(up1);
680 rec = isl_upoly_as_rec(up1);
684 for (i = 0; i < rec->n; ++i) {
685 rec->p[i] = isl_upoly_mul(rec->p[i],
686 isl_upoly_copy(up2));
694 if (isl_upoly_is_cst(up1))
695 return isl_upoly_mul_cst(up1, up2);
697 return isl_upoly_mul_rec(up1, up2);
704 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
707 struct isl_qpolynomial *qp;
713 total = isl_dim_total(dim);
715 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
720 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
729 isl_qpolynomial_free(qp);
733 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
742 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
744 struct isl_qpolynomial *dup;
749 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row);
752 isl_mat_free(dup->div);
753 dup->div = isl_mat_copy(qp->div);
756 dup->upoly = isl_upoly_copy(qp->upoly);
762 isl_qpolynomial_free(dup);
766 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
774 return isl_qpolynomial_dup(qp);
777 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
785 isl_dim_free(qp->dim);
786 isl_mat_free(qp->div);
787 isl_upoly_free(qp->upoly);
792 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
797 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
798 div1->n_col >= div2->n_col, return -1);
800 if (div1->n_row == div2->n_row)
801 return isl_mat_is_equal(div1, div2);
805 div1->n_row = div2->n_row;
806 div1->n_col = div2->n_col;
808 equal = isl_mat_is_equal(div1, div2);
816 static void expand_row(__isl_keep isl_mat *dst, int d,
817 __isl_keep isl_mat *src, int s, int *exp)
820 unsigned c = src->n_col - src->n_row;
822 isl_seq_cpy(dst->row[d], src->row[s], c);
823 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
825 for (i = 0; i < s; ++i)
826 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
829 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
833 li = isl_seq_last_non_zero(div->row[i], div->n_col);
834 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
839 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
842 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
843 __isl_keep isl_mat *div2, int *exp1, int *exp2)
847 unsigned d = div1->n_col - div1->n_row;
849 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
850 d + div1->n_row + div2->n_row);
854 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
857 expand_row(div, k, div1, i, exp1);
858 expand_row(div, k + 1, div2, j, exp2);
860 cmp = cmp_row(div, k, k + 1);
864 } else if (cmp < 0) {
868 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
871 for (; i < div1->n_row; ++i, ++k) {
872 expand_row(div, k, div1, i, exp1);
875 for (; j < div2->n_row; ++j, ++k) {
876 expand_row(div, k, div2, j, exp2);
886 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
890 struct isl_upoly_rec *rec;
892 if (isl_upoly_is_cst(up))
898 if (exp[up->var - first] == up->var - first)
901 up = isl_upoly_cow(up);
905 up->var = exp[up->var - first] + first;
907 rec = isl_upoly_as_rec(up);
911 for (i = 0; i < rec->n; ++i) {
912 rec->p[i] = expand(rec->p[i], exp, first);
923 static __isl_give isl_qpolynomial *with_merged_divs(
924 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
925 __isl_take isl_qpolynomial *qp2),
926 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
932 qp1 = isl_qpolynomial_cow(qp1);
933 qp2 = isl_qpolynomial_cow(qp2);
938 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
939 qp1->div->n_col >= qp2->div->n_col, goto error);
941 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
942 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
946 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
950 isl_mat_free(qp1->div);
951 qp1->div = isl_mat_copy(div);
952 isl_mat_free(qp2->div);
953 qp2->div = isl_mat_copy(div);
955 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
956 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
958 if (!qp1->upoly || !qp2->upoly)
970 isl_qpolynomial_free(qp1);
971 isl_qpolynomial_free(qp2);
975 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
976 __isl_take isl_qpolynomial *qp2)
978 qp1 = isl_qpolynomial_cow(qp1);
983 if (qp1->div->n_row < qp2->div->n_row)
984 return isl_qpolynomial_add(qp2, qp1);
986 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
987 if (!compatible_divs(qp1->div, qp2->div))
988 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
990 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
994 isl_qpolynomial_free(qp2);
998 isl_qpolynomial_free(qp1);
999 isl_qpolynomial_free(qp2);
1003 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1004 __isl_take isl_qpolynomial *qp2)
1006 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1009 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1011 qp = isl_qpolynomial_cow(qp);
1016 qp->upoly = isl_upoly_neg(qp->upoly);
1022 isl_qpolynomial_free(qp);
1026 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1027 __isl_take isl_qpolynomial *qp2)
1029 qp1 = isl_qpolynomial_cow(qp1);
1034 if (qp1->div->n_row < qp2->div->n_row)
1035 return isl_qpolynomial_mul(qp2, qp1);
1037 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1038 if (!compatible_divs(qp1->div, qp2->div))
1039 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1041 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1045 isl_qpolynomial_free(qp2);
1049 isl_qpolynomial_free(qp1);
1050 isl_qpolynomial_free(qp2);
1054 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1056 struct isl_qpolynomial *qp;
1057 struct isl_upoly_cst *cst;
1059 qp = isl_qpolynomial_alloc(dim, 0);
1063 qp->upoly = isl_upoly_zero(dim->ctx);
1069 isl_qpolynomial_free(qp);
1073 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1075 struct isl_qpolynomial *qp;
1076 struct isl_upoly_cst *cst;
1078 qp = isl_qpolynomial_alloc(dim, 0);
1082 qp->upoly = isl_upoly_infty(dim->ctx);
1088 isl_qpolynomial_free(qp);
1092 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1094 struct isl_qpolynomial *qp;
1095 struct isl_upoly_cst *cst;
1097 qp = isl_qpolynomial_alloc(dim, 0);
1101 qp->upoly = isl_upoly_nan(dim->ctx);
1107 isl_qpolynomial_free(qp);
1111 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1114 struct isl_qpolynomial *qp;
1115 struct isl_upoly_cst *cst;
1117 qp = isl_qpolynomial_alloc(dim, 0);
1121 qp->upoly = isl_upoly_zero(dim->ctx);
1124 cst = isl_upoly_as_cst(qp->upoly);
1125 isl_int_set(cst->n, v);
1129 isl_qpolynomial_free(qp);
1133 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1134 isl_int *n, isl_int *d)
1136 struct isl_upoly_cst *cst;
1141 if (!isl_upoly_is_cst(qp->upoly))
1144 cst = isl_upoly_as_cst(qp->upoly);
1149 isl_int_set(*n, cst->n);
1151 isl_int_set(*d, cst->d);
1156 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1160 struct isl_qpolynomial *qp;
1161 struct isl_upoly_rec *rec;
1162 struct isl_upoly_cst *cst;
1163 struct isl_ctx *ctx;
1170 qp = isl_qpolynomial_alloc(dim, 0);
1174 qp->upoly = &isl_upoly_alloc_rec(ctx, pos, 1 + power)->up;
1177 rec = isl_upoly_as_rec(qp->upoly);
1178 for (i = 0; i < 1 + power; ++i) {
1179 rec->p[i] = isl_upoly_zero(ctx);
1184 cst = isl_upoly_as_cst(rec->p[power]);
1185 isl_int_set_si(cst->n, 1);
1189 isl_qpolynomial_free(qp);
1193 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1194 enum isl_dim_type type, unsigned pos)
1199 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1200 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1202 if (type == isl_dim_set)
1203 pos += isl_dim_size(dim, isl_dim_param);
1205 return isl_qpolynomial_pow(dim, pos, 1);
1211 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1214 struct isl_qpolynomial *qp = NULL;
1215 struct isl_upoly_rec *rec;
1216 struct isl_upoly_cst *cst;
1222 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1224 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1);
1228 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1229 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1231 pos = isl_dim_total(qp->dim);
1232 qp->upoly = &isl_upoly_alloc_rec(div->ctx, pos, 1 + power)->up;
1235 rec = isl_upoly_as_rec(qp->upoly);
1236 for (i = 0; i < 1 + power; ++i) {
1237 rec->p[i] = isl_upoly_zero(div->ctx);
1242 cst = isl_upoly_as_cst(rec->p[power]);
1243 isl_int_set_si(cst->n, 1);
1249 isl_qpolynomial_free(qp);
1254 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1256 return isl_qpolynomial_div_pow(div, 1);
1259 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1260 const isl_int n, const isl_int d)
1262 struct isl_qpolynomial *qp;
1263 struct isl_upoly_cst *cst;
1265 qp = isl_qpolynomial_alloc(dim, 0);
1269 qp->upoly = isl_upoly_zero(dim->ctx);
1272 cst = isl_upoly_as_cst(qp->upoly);
1273 isl_int_set(cst->n, n);
1274 isl_int_set(cst->d, d);
1278 isl_qpolynomial_free(qp);
1283 #define PW isl_pw_qpolynomial
1285 #define EL isl_qpolynomial
1287 #define IS_ZERO is_zero
1293 #include <isl_pw_templ.c>
1296 #define PW isl_pw_qpolynomial_fold
1298 #define EL isl_qpolynomial_fold
1300 #define IS_ZERO is_empty
1306 #include <isl_pw_templ.c>
1308 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
1316 if (!isl_set_fast_is_universe(pwqp->p[0].set))
1319 return isl_qpolynomial_is_one(pwqp->p[0].qp);
1322 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_cow(
1323 __isl_take isl_pw_qpolynomial *pwqp)
1331 return isl_pw_qpolynomial_dup(pwqp);
1334 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
1335 __isl_take isl_pw_qpolynomial *pwqp1,
1336 __isl_take isl_pw_qpolynomial *pwqp2)
1339 struct isl_pw_qpolynomial *res;
1342 if (!pwqp1 || !pwqp2)
1345 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
1348 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
1349 isl_pw_qpolynomial_free(pwqp2);
1353 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
1354 isl_pw_qpolynomial_free(pwqp1);
1358 if (isl_pw_qpolynomial_is_one(pwqp1)) {
1359 isl_pw_qpolynomial_free(pwqp1);
1363 if (isl_pw_qpolynomial_is_one(pwqp2)) {
1364 isl_pw_qpolynomial_free(pwqp2);
1368 n = pwqp1->n * pwqp2->n;
1369 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
1371 for (i = 0; i < pwqp1->n; ++i) {
1372 for (j = 0; j < pwqp2->n; ++j) {
1373 struct isl_set *common;
1374 struct isl_qpolynomial *prod;
1375 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
1376 isl_set_copy(pwqp2->p[j].set));
1377 if (isl_set_fast_is_empty(common)) {
1378 isl_set_free(common);
1382 prod = isl_qpolynomial_mul(
1383 isl_qpolynomial_copy(pwqp1->p[i].qp),
1384 isl_qpolynomial_copy(pwqp2->p[j].qp));
1386 res = isl_pw_qpolynomial_add_piece(res, common, prod);
1390 isl_pw_qpolynomial_free(pwqp1);
1391 isl_pw_qpolynomial_free(pwqp2);
1395 isl_pw_qpolynomial_free(pwqp1);
1396 isl_pw_qpolynomial_free(pwqp2);
1400 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
1401 __isl_take isl_pw_qpolynomial *pwqp)
1404 struct isl_pw_qpolynomial *res;
1410 if (isl_pw_qpolynomial_is_zero(pwqp))
1413 pwqp = isl_pw_qpolynomial_cow(pwqp);
1415 for (i = 0; i < pwqp->n; ++i) {
1416 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
1423 isl_pw_qpolynomial_free(pwqp);
1427 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
1428 __isl_take isl_pw_qpolynomial *pwqp1,
1429 __isl_take isl_pw_qpolynomial *pwqp2)
1431 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
1434 __isl_give struct isl_upoly *isl_upoly_eval(
1435 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
1438 struct isl_upoly_rec *rec;
1439 struct isl_upoly *res;
1440 struct isl_upoly *base;
1442 if (isl_upoly_is_cst(up)) {
1447 rec = isl_upoly_as_rec(up);
1451 isl_assert(up->ctx, rec->n >= 1, goto error);
1453 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
1455 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
1458 for (i = rec->n - 2; i >= 0; --i) {
1459 res = isl_upoly_mul(res, isl_upoly_copy(base));
1460 res = isl_upoly_sum(res,
1461 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
1462 isl_vec_copy(vec)));
1465 isl_upoly_free(base);
1475 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
1476 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
1479 struct isl_upoly *up;
1484 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
1486 if (qp->div->n_row == 0)
1487 ext = isl_vec_copy(pnt->vec);
1490 unsigned dim = isl_dim_total(qp->dim);
1491 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
1495 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
1496 for (i = 0; i < qp->div->n_row; ++i) {
1497 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
1498 1 + dim + i, &ext->el[1+dim+i]);
1499 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
1500 qp->div->row[i][0]);
1504 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
1508 dim = isl_dim_copy(qp->dim);
1509 isl_qpolynomial_free(qp);
1510 isl_point_free(pnt);
1512 qp = isl_qpolynomial_alloc(dim, 0);
1520 isl_qpolynomial_free(qp);
1521 isl_point_free(pnt);
1525 __isl_give isl_qpolynomial *isl_pw_qpolynomial_eval(
1526 __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_point *pnt)
1530 isl_qpolynomial *qp;
1534 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, pwqp->dim), goto error);
1536 for (i = 0; i < pwqp->n; ++i) {
1537 found = isl_set_contains_point(pwqp->p[i].set, pnt);
1544 qp = isl_qpolynomial_eval(isl_qpolynomial_copy(pwqp->p[i].qp),
1545 isl_point_copy(pnt));
1547 qp = isl_qpolynomial_zero(isl_dim_copy(pwqp->dim));
1548 isl_pw_qpolynomial_free(pwqp);
1549 isl_point_free(pnt);
1552 isl_pw_qpolynomial_free(pwqp);
1553 isl_point_free(pnt);
1557 __isl_give isl_qpolynomial *isl_qpolynomial_move(__isl_take isl_qpolynomial *qp,
1558 enum isl_dim_type dst_type, unsigned dst_pos,
1559 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1564 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
1568 /* Do something to polynomials when needed; later */
1572 isl_qpolynomial_free(qp);
1576 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_move(
1577 __isl_take isl_pw_qpolynomial *pwqp,
1578 enum isl_dim_type dst_type, unsigned dst_pos,
1579 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1586 pwqp->dim = isl_dim_move(pwqp->dim,
1587 dst_type, dst_pos, src_type, src_pos, n);
1591 for (i = 0; i < pwqp->n; ++i) {
1592 pwqp->p[i].set = isl_set_move(pwqp->p[i].set, dst_type, dst_pos,
1593 src_type, src_pos, n);
1594 if (!pwqp->p[i].set)
1596 pwqp->p[i].qp = isl_qpolynomial_move(pwqp->p[i].qp,
1597 dst_type, dst_pos, src_type, src_pos, n);
1604 isl_pw_qpolynomial_free(pwqp);
1608 __isl_give isl_dim *isl_pw_qpolynomial_get_dim(
1609 __isl_keep isl_pw_qpolynomial *pwqp)
1614 return isl_dim_copy(pwqp->dim);
1617 unsigned isl_pw_qpolynomial_dim(__isl_keep isl_pw_qpolynomial *pwqp,
1618 enum isl_dim_type type)
1620 return pwqp ? isl_dim_size(pwqp->dim, type) : 0;
1623 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
1624 __isl_take isl_mat *div)
1632 n = isl_dim_total(dim) + div->n_row;
1634 term = isl_calloc(dim->ctx, struct isl_term,
1635 sizeof(struct isl_term) + (n - 1) * sizeof(int));
1642 isl_int_init(term->n);
1643 isl_int_init(term->d);
1652 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
1661 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
1670 total = isl_dim_total(term->dim) + term->div->n_row;
1672 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
1676 isl_int_set(dup->n, term->n);
1677 isl_int_set(dup->d, term->d);
1679 for (i = 0; i < total; ++i)
1680 dup->pow[i] = term->pow[i];
1685 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
1693 return isl_term_dup(term);
1696 void isl_term_free(__isl_take isl_term *term)
1701 if (--term->ref > 0)
1704 isl_dim_free(term->dim);
1705 isl_mat_free(term->div);
1706 isl_int_clear(term->n);
1707 isl_int_clear(term->d);
1711 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
1719 case isl_dim_out: return isl_dim_size(term->dim, type);
1720 case isl_dim_div: return term->div->n_row;
1721 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
1725 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
1727 return term ? term->dim->ctx : NULL;
1730 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
1734 isl_int_set(*n, term->n);
1737 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
1741 isl_int_set(*d, term->d);
1744 int isl_term_get_exp(__isl_keep isl_term *term,
1745 enum isl_dim_type type, unsigned pos)
1750 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
1752 if (type >= isl_dim_set)
1753 pos += isl_dim_size(term->dim, isl_dim_param);
1754 if (type >= isl_dim_div)
1755 pos += isl_dim_size(term->dim, isl_dim_set);
1757 return term->pow[pos];
1760 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
1762 isl_basic_map *bmap;
1769 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
1772 total = term->div->n_col - term->div->n_row - 2;
1773 /* No nested divs for now */
1774 isl_assert(term->dim->ctx,
1775 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
1776 term->div->n_row) == -1,
1779 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
1780 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
1783 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
1785 return isl_basic_map_div(bmap, k);
1787 isl_basic_map_free(bmap);
1791 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
1792 int (*fn)(__isl_take isl_term *term, void *user),
1793 __isl_take isl_term *term, void *user)
1796 struct isl_upoly_rec *rec;
1801 if (isl_upoly_is_zero(up))
1804 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
1805 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
1806 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
1808 if (isl_upoly_is_cst(up)) {
1809 struct isl_upoly_cst *cst;
1810 cst = isl_upoly_as_cst(up);
1813 term = isl_term_cow(term);
1816 isl_int_set(term->n, cst->n);
1817 isl_int_set(term->d, cst->d);
1818 if (fn(isl_term_copy(term), user) < 0)
1823 rec = isl_upoly_as_rec(up);
1827 for (i = 0; i < rec->n; ++i) {
1828 term = isl_term_cow(term);
1831 term->pow[up->var] = i;
1832 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
1836 term->pow[up->var] = 0;
1840 isl_term_free(term);
1844 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
1845 int (*fn)(__isl_take isl_term *term, void *user), void *user)
1852 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
1856 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
1858 isl_term_free(term);
1860 return term ? 0 : -1;
1863 int isl_pw_qpolynomial_foreach_piece(__isl_keep isl_pw_qpolynomial *pwqp,
1864 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
1865 void *user), void *user)
1872 for (i = 0; i < pwqp->n; ++i)
1873 if (fn(isl_set_copy(pwqp->p[i].set),
1874 isl_qpolynomial_copy(pwqp->p[i].qp), user) < 0)
1880 static int any_divs(__isl_keep isl_set *set)
1887 for (i = 0; i < set->n; ++i)
1888 if (set->p[i]->n_div > 0)
1894 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
1895 __isl_take isl_dim *dim)
1900 if (isl_dim_equal(qp->dim, dim)) {
1905 qp = isl_qpolynomial_cow(qp);
1909 if (qp->div->n_row) {
1915 extra = isl_dim_size(dim, isl_dim_set) -
1916 isl_dim_size(qp->dim, isl_dim_set);
1917 total = isl_dim_total(qp->dim);
1918 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1921 for (i = 0; i < qp->div->n_row; ++i)
1923 qp->upoly = expand(qp->upoly, exp, total);
1927 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
1930 for (i = 0; i < qp->div->n_row; ++i)
1931 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
1934 isl_dim_free(qp->dim);
1940 isl_qpolynomial_free(qp);
1944 static int foreach_lifted_subset(__isl_take isl_set *set,
1945 __isl_take isl_qpolynomial *qp,
1946 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
1947 void *user), void *user)
1954 for (i = 0; i < set->n; ++i) {
1956 isl_qpolynomial *copy;
1958 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
1959 lift = isl_set_lift(lift);
1961 copy = isl_qpolynomial_copy(qp);
1962 copy = isl_qpolynomial_lift(copy, isl_set_get_dim(lift));
1964 if (fn(lift, copy, user) < 0)
1969 isl_qpolynomial_free(qp);
1974 isl_qpolynomial_free(qp);
1978 int isl_pw_qpolynomial_foreach_lifted_piece(__isl_keep isl_pw_qpolynomial *pwqp,
1979 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
1980 void *user), void *user)
1987 for (i = 0; i < pwqp->n; ++i) {
1989 isl_qpolynomial *qp;
1991 set = isl_set_copy(pwqp->p[i].set);
1992 qp = isl_qpolynomial_copy(pwqp->p[i].qp);
1993 if (!any_divs(set)) {
1994 if (fn(set, qp, user) < 0)
1998 if (foreach_lifted_subset(set, qp, fn, user) < 0)
2005 static __isl_give isl_qpolynomial_fold *qpolynomial_fold_alloc(
2006 enum isl_fold type, __isl_take isl_dim *dim, int n)
2008 isl_qpolynomial_fold *fold;
2013 isl_assert(dim->ctx, n >= 0, goto error);
2014 fold = isl_alloc(dim->ctx, struct isl_qpolynomial_fold,
2015 sizeof(struct isl_qpolynomial_fold) +
2016 (n - 1) * sizeof(struct isl_qpolynomial *));
2032 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_empty(enum isl_fold type,
2033 __isl_take isl_dim *dim)
2035 return qpolynomial_fold_alloc(type, dim, 0);
2038 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_alloc(
2039 enum isl_fold type, __isl_take isl_qpolynomial *qp)
2041 isl_qpolynomial_fold *fold;
2046 fold = qpolynomial_fold_alloc(type, isl_dim_copy(qp->dim), 1);
2055 isl_qpolynomial_fold_free(fold);
2056 isl_qpolynomial_free(qp);
2060 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_copy(
2061 __isl_keep isl_qpolynomial_fold *fold)
2070 void isl_qpolynomial_fold_free(__isl_take isl_qpolynomial_fold *fold)
2076 if (--fold->ref > 0)
2079 for (i = 0; i < fold->n; ++i)
2080 isl_qpolynomial_free(fold->qp[i]);
2081 isl_dim_free(fold->dim);
2085 int isl_qpolynomial_fold_is_empty(__isl_keep isl_qpolynomial_fold *fold)
2090 return fold->n == 0;
2093 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold(
2094 __isl_take isl_qpolynomial_fold *fold1,
2095 __isl_take isl_qpolynomial_fold *fold2)
2098 struct isl_qpolynomial_fold *res = NULL;
2100 if (!fold1 || !fold2)
2103 isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error);
2104 isl_assert(fold1->dim->ctx, isl_dim_equal(fold1->dim, fold2->dim),
2107 if (isl_qpolynomial_fold_is_empty(fold1)) {
2108 isl_qpolynomial_fold_free(fold1);
2112 if (isl_qpolynomial_fold_is_empty(fold2)) {
2113 isl_qpolynomial_fold_free(fold2);
2117 res = qpolynomial_fold_alloc(fold1->type, isl_dim_copy(fold1->dim),
2118 fold1->n + fold2->n);
2122 for (i = 0; i < fold1->n; ++i) {
2123 res->qp[res->n] = isl_qpolynomial_copy(fold1->qp[i]);
2124 if (!res->qp[res->n])
2129 for (i = 0; i < fold2->n; ++i) {
2130 res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]);
2131 if (!res->qp[res->n])
2136 isl_qpolynomial_fold_free(fold1);
2137 isl_qpolynomial_fold_free(fold2);
2141 isl_qpolynomial_fold_free(res);
2142 isl_qpolynomial_fold_free(fold1);
2143 isl_qpolynomial_fold_free(fold2);
2147 __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_from_pw_qpolynomial(
2148 enum isl_fold type, __isl_take isl_pw_qpolynomial *pwqp)
2151 isl_pw_qpolynomial_fold *pwf;
2156 pwf = isl_pw_qpolynomial_fold_alloc_(isl_dim_copy(pwqp->dim), pwqp->n);
2158 for (i = 0; i < pwqp->n; ++i)
2159 pwf = isl_pw_qpolynomial_fold_add_piece(pwf,
2160 isl_set_copy(pwqp->p[i].set),
2161 isl_qpolynomial_fold_alloc(type,
2162 isl_qpolynomial_copy(pwqp->p[i].qp)));
2164 isl_pw_qpolynomial_free(pwqp);