2 * Copyright 2010 INRIA Saclay
4 * Use of this software is governed by the GNU LGPLv2.1 license
6 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
7 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
12 #include <isl_ctx_private.h>
13 #include <isl_map_private.h>
14 #include <isl_factorization.h>
17 #include <isl_union_map_private.h>
18 #include <isl_polynomial_private.h>
19 #include <isl_point_private.h>
20 #include <isl_dim_private.h>
21 #include <isl_mat_private.h>
22 #include <isl_range.h>
24 static unsigned pos(__isl_keep isl_dim *dim, enum isl_dim_type type)
27 case isl_dim_param: return 0;
28 case isl_dim_in: return dim->nparam;
29 case isl_dim_out: return dim->nparam + dim->n_in;
34 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
42 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
47 isl_assert(up->ctx, up->var < 0, return NULL);
49 return (struct isl_upoly_cst *)up;
52 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
57 isl_assert(up->ctx, up->var >= 0, return NULL);
59 return (struct isl_upoly_rec *)up;
62 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
63 __isl_keep struct isl_upoly *up2)
66 struct isl_upoly_rec *rec1, *rec2;
72 if (up1->var != up2->var)
74 if (isl_upoly_is_cst(up1)) {
75 struct isl_upoly_cst *cst1, *cst2;
76 cst1 = isl_upoly_as_cst(up1);
77 cst2 = isl_upoly_as_cst(up2);
80 return isl_int_eq(cst1->n, cst2->n) &&
81 isl_int_eq(cst1->d, cst2->d);
84 rec1 = isl_upoly_as_rec(up1);
85 rec2 = isl_upoly_as_rec(up2);
89 if (rec1->n != rec2->n)
92 for (i = 0; i < rec1->n; ++i) {
93 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
101 int isl_upoly_is_zero(__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_pos(cst->d);
117 int isl_upoly_sgn(__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_sgn(cst->n);
133 int isl_upoly_is_nan(__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_zero(cst->n) && isl_int_is_zero(cst->d);
149 int isl_upoly_is_infty(__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_is_pos(cst->n) && isl_int_is_zero(cst->d);
165 int isl_upoly_is_neginfty(__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_neg(cst->n) && isl_int_is_zero(cst->d);
181 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
183 struct isl_upoly_cst *cst;
187 if (!isl_upoly_is_cst(up))
190 cst = isl_upoly_as_cst(up);
194 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
197 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
199 struct isl_upoly_cst *cst;
203 if (!isl_upoly_is_cst(up))
206 cst = isl_upoly_as_cst(up);
210 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
213 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
215 struct isl_upoly_cst *cst;
217 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
226 isl_int_init(cst->n);
227 isl_int_init(cst->d);
232 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
234 struct isl_upoly_cst *cst;
236 cst = isl_upoly_cst_alloc(ctx);
240 isl_int_set_si(cst->n, 0);
241 isl_int_set_si(cst->d, 1);
246 __isl_give struct isl_upoly *isl_upoly_one(struct isl_ctx *ctx)
248 struct isl_upoly_cst *cst;
250 cst = isl_upoly_cst_alloc(ctx);
254 isl_int_set_si(cst->n, 1);
255 isl_int_set_si(cst->d, 1);
260 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
262 struct isl_upoly_cst *cst;
264 cst = isl_upoly_cst_alloc(ctx);
268 isl_int_set_si(cst->n, 1);
269 isl_int_set_si(cst->d, 0);
274 __isl_give struct isl_upoly *isl_upoly_neginfty(struct isl_ctx *ctx)
276 struct isl_upoly_cst *cst;
278 cst = isl_upoly_cst_alloc(ctx);
282 isl_int_set_si(cst->n, -1);
283 isl_int_set_si(cst->d, 0);
288 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
290 struct isl_upoly_cst *cst;
292 cst = isl_upoly_cst_alloc(ctx);
296 isl_int_set_si(cst->n, 0);
297 isl_int_set_si(cst->d, 0);
302 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
303 isl_int n, isl_int d)
305 struct isl_upoly_cst *cst;
307 cst = isl_upoly_cst_alloc(ctx);
311 isl_int_set(cst->n, n);
312 isl_int_set(cst->d, d);
317 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
320 struct isl_upoly_rec *rec;
322 isl_assert(ctx, var >= 0, return NULL);
323 isl_assert(ctx, size >= 0, return NULL);
324 rec = isl_calloc(ctx, struct isl_upoly_rec,
325 sizeof(struct isl_upoly_rec) +
326 (size - 1) * sizeof(struct isl_upoly *));
341 __isl_give isl_qpolynomial *isl_qpolynomial_reset_dim(
342 __isl_take isl_qpolynomial *qp, __isl_take isl_dim *dim)
344 qp = isl_qpolynomial_cow(qp);
348 isl_dim_free(qp->dim);
353 isl_qpolynomial_free(qp);
358 isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp)
360 return qp ? qp->dim->ctx : NULL;
363 __isl_give isl_dim *isl_qpolynomial_get_dim(__isl_keep isl_qpolynomial *qp)
365 return qp ? isl_dim_copy(qp->dim) : NULL;
368 unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp,
369 enum isl_dim_type type)
371 return qp ? isl_dim_size(qp->dim, type) : 0;
374 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
376 return qp ? isl_upoly_is_zero(qp->upoly) : -1;
379 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
381 return qp ? isl_upoly_is_one(qp->upoly) : -1;
384 int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
386 return qp ? isl_upoly_is_nan(qp->upoly) : -1;
389 int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
391 return qp ? isl_upoly_is_infty(qp->upoly) : -1;
394 int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
396 return qp ? isl_upoly_is_neginfty(qp->upoly) : -1;
399 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
401 return qp ? isl_upoly_sgn(qp->upoly) : 0;
404 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
406 isl_int_clear(cst->n);
407 isl_int_clear(cst->d);
410 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
414 for (i = 0; i < rec->n; ++i)
415 isl_upoly_free(rec->p[i]);
418 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
427 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
429 struct isl_upoly_cst *cst;
430 struct isl_upoly_cst *dup;
432 cst = isl_upoly_as_cst(up);
436 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
439 isl_int_set(dup->n, cst->n);
440 isl_int_set(dup->d, cst->d);
445 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
448 struct isl_upoly_rec *rec;
449 struct isl_upoly_rec *dup;
451 rec = isl_upoly_as_rec(up);
455 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
459 for (i = 0; i < rec->n; ++i) {
460 dup->p[i] = isl_upoly_copy(rec->p[i]);
468 isl_upoly_free(&dup->up);
472 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
474 struct isl_upoly *dup;
479 if (isl_upoly_is_cst(up))
480 return isl_upoly_dup_cst(up);
482 return isl_upoly_dup_rec(up);
485 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
493 return isl_upoly_dup(up);
496 void isl_upoly_free(__isl_take struct isl_upoly *up)
505 upoly_free_cst((struct isl_upoly_cst *)up);
507 upoly_free_rec((struct isl_upoly_rec *)up);
509 isl_ctx_deref(up->ctx);
513 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
518 isl_int_gcd(gcd, cst->n, cst->d);
519 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
520 isl_int_divexact(cst->n, cst->n, gcd);
521 isl_int_divexact(cst->d, cst->d, gcd);
526 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
527 __isl_take struct isl_upoly *up2)
529 struct isl_upoly_cst *cst1;
530 struct isl_upoly_cst *cst2;
532 up1 = isl_upoly_cow(up1);
536 cst1 = isl_upoly_as_cst(up1);
537 cst2 = isl_upoly_as_cst(up2);
539 if (isl_int_eq(cst1->d, cst2->d))
540 isl_int_add(cst1->n, cst1->n, cst2->n);
542 isl_int_mul(cst1->n, cst1->n, cst2->d);
543 isl_int_addmul(cst1->n, cst2->n, cst1->d);
544 isl_int_mul(cst1->d, cst1->d, cst2->d);
547 isl_upoly_cst_reduce(cst1);
557 static __isl_give struct isl_upoly *replace_by_zero(
558 __isl_take struct isl_upoly *up)
566 return isl_upoly_zero(ctx);
569 static __isl_give struct isl_upoly *replace_by_constant_term(
570 __isl_take struct isl_upoly *up)
572 struct isl_upoly_rec *rec;
573 struct isl_upoly *cst;
578 rec = isl_upoly_as_rec(up);
581 cst = isl_upoly_copy(rec->p[0]);
589 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
590 __isl_take struct isl_upoly *up2)
593 struct isl_upoly_rec *rec1, *rec2;
598 if (isl_upoly_is_nan(up1)) {
603 if (isl_upoly_is_nan(up2)) {
608 if (isl_upoly_is_zero(up1)) {
613 if (isl_upoly_is_zero(up2)) {
618 if (up1->var < up2->var)
619 return isl_upoly_sum(up2, up1);
621 if (up2->var < up1->var) {
622 struct isl_upoly_rec *rec;
623 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
627 up1 = isl_upoly_cow(up1);
628 rec = isl_upoly_as_rec(up1);
631 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
633 up1 = replace_by_constant_term(up1);
637 if (isl_upoly_is_cst(up1))
638 return isl_upoly_sum_cst(up1, up2);
640 rec1 = isl_upoly_as_rec(up1);
641 rec2 = isl_upoly_as_rec(up2);
645 if (rec1->n < rec2->n)
646 return isl_upoly_sum(up2, up1);
648 up1 = isl_upoly_cow(up1);
649 rec1 = isl_upoly_as_rec(up1);
653 for (i = rec2->n - 1; i >= 0; --i) {
654 rec1->p[i] = isl_upoly_sum(rec1->p[i],
655 isl_upoly_copy(rec2->p[i]));
658 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
659 isl_upoly_free(rec1->p[i]);
665 up1 = replace_by_zero(up1);
666 else if (rec1->n == 1)
667 up1 = replace_by_constant_term(up1);
678 __isl_give struct isl_upoly *isl_upoly_cst_add_isl_int(
679 __isl_take struct isl_upoly *up, isl_int v)
681 struct isl_upoly_cst *cst;
683 up = isl_upoly_cow(up);
687 cst = isl_upoly_as_cst(up);
689 isl_int_addmul(cst->n, cst->d, v);
694 __isl_give struct isl_upoly *isl_upoly_add_isl_int(
695 __isl_take struct isl_upoly *up, isl_int v)
697 struct isl_upoly_rec *rec;
702 if (isl_upoly_is_cst(up))
703 return isl_upoly_cst_add_isl_int(up, v);
705 up = isl_upoly_cow(up);
706 rec = isl_upoly_as_rec(up);
710 rec->p[0] = isl_upoly_add_isl_int(rec->p[0], v);
720 __isl_give struct isl_upoly *isl_upoly_cst_mul_isl_int(
721 __isl_take struct isl_upoly *up, isl_int v)
723 struct isl_upoly_cst *cst;
725 if (isl_upoly_is_zero(up))
728 up = isl_upoly_cow(up);
732 cst = isl_upoly_as_cst(up);
734 isl_int_mul(cst->n, cst->n, v);
739 __isl_give struct isl_upoly *isl_upoly_mul_isl_int(
740 __isl_take struct isl_upoly *up, isl_int v)
743 struct isl_upoly_rec *rec;
748 if (isl_upoly_is_cst(up))
749 return isl_upoly_cst_mul_isl_int(up, v);
751 up = isl_upoly_cow(up);
752 rec = isl_upoly_as_rec(up);
756 for (i = 0; i < rec->n; ++i) {
757 rec->p[i] = isl_upoly_mul_isl_int(rec->p[i], v);
768 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
769 __isl_take struct isl_upoly *up2)
771 struct isl_upoly_cst *cst1;
772 struct isl_upoly_cst *cst2;
774 up1 = isl_upoly_cow(up1);
778 cst1 = isl_upoly_as_cst(up1);
779 cst2 = isl_upoly_as_cst(up2);
781 isl_int_mul(cst1->n, cst1->n, cst2->n);
782 isl_int_mul(cst1->d, cst1->d, cst2->d);
784 isl_upoly_cst_reduce(cst1);
794 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
795 __isl_take struct isl_upoly *up2)
797 struct isl_upoly_rec *rec1;
798 struct isl_upoly_rec *rec2;
799 struct isl_upoly_rec *res;
803 rec1 = isl_upoly_as_rec(up1);
804 rec2 = isl_upoly_as_rec(up2);
807 size = rec1->n + rec2->n - 1;
808 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
812 for (i = 0; i < rec1->n; ++i) {
813 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
814 isl_upoly_copy(rec1->p[i]));
819 for (; i < size; ++i) {
820 res->p[i] = isl_upoly_zero(up1->ctx);
825 for (i = 0; i < rec1->n; ++i) {
826 for (j = 1; j < rec2->n; ++j) {
827 struct isl_upoly *up;
828 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
829 isl_upoly_copy(rec1->p[i]));
830 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
843 isl_upoly_free(&res->up);
847 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
848 __isl_take struct isl_upoly *up2)
853 if (isl_upoly_is_nan(up1)) {
858 if (isl_upoly_is_nan(up2)) {
863 if (isl_upoly_is_zero(up1)) {
868 if (isl_upoly_is_zero(up2)) {
873 if (isl_upoly_is_one(up1)) {
878 if (isl_upoly_is_one(up2)) {
883 if (up1->var < up2->var)
884 return isl_upoly_mul(up2, up1);
886 if (up2->var < up1->var) {
888 struct isl_upoly_rec *rec;
889 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
890 isl_ctx *ctx = up1->ctx;
893 return isl_upoly_nan(ctx);
895 up1 = isl_upoly_cow(up1);
896 rec = isl_upoly_as_rec(up1);
900 for (i = 0; i < rec->n; ++i) {
901 rec->p[i] = isl_upoly_mul(rec->p[i],
902 isl_upoly_copy(up2));
910 if (isl_upoly_is_cst(up1))
911 return isl_upoly_mul_cst(up1, up2);
913 return isl_upoly_mul_rec(up1, up2);
920 __isl_give struct isl_upoly *isl_upoly_pow(__isl_take struct isl_upoly *up,
923 struct isl_upoly *res;
931 res = isl_upoly_copy(up);
933 res = isl_upoly_one(up->ctx);
935 while (power >>= 1) {
936 up = isl_upoly_mul(up, isl_upoly_copy(up));
938 res = isl_upoly_mul(res, isl_upoly_copy(up));
945 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
946 unsigned n_div, __isl_take struct isl_upoly *up)
948 struct isl_qpolynomial *qp = NULL;
954 total = isl_dim_total(dim);
956 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
961 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
972 isl_qpolynomial_free(qp);
976 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
985 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
987 struct isl_qpolynomial *dup;
992 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row,
993 isl_upoly_copy(qp->upoly));
996 isl_mat_free(dup->div);
997 dup->div = isl_mat_copy(qp->div);
1003 isl_qpolynomial_free(dup);
1007 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
1015 return isl_qpolynomial_dup(qp);
1018 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
1026 isl_dim_free(qp->dim);
1027 isl_mat_free(qp->div);
1028 isl_upoly_free(qp->upoly);
1033 __isl_give struct isl_upoly *isl_upoly_var_pow(isl_ctx *ctx, int pos, int power)
1036 struct isl_upoly *up;
1037 struct isl_upoly_rec *rec;
1038 struct isl_upoly_cst *cst;
1040 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
1043 for (i = 0; i < 1 + power; ++i) {
1044 rec->p[i] = isl_upoly_zero(ctx);
1049 cst = isl_upoly_as_cst(rec->p[power]);
1050 isl_int_set_si(cst->n, 1);
1054 isl_upoly_free(&rec->up);
1058 /* r array maps original positions to new positions.
1060 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
1064 struct isl_upoly_rec *rec;
1065 struct isl_upoly *base;
1066 struct isl_upoly *res;
1068 if (isl_upoly_is_cst(up))
1071 rec = isl_upoly_as_rec(up);
1075 isl_assert(up->ctx, rec->n >= 1, goto error);
1077 base = isl_upoly_var_pow(up->ctx, r[up->var], 1);
1078 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
1080 for (i = rec->n - 2; i >= 0; --i) {
1081 res = isl_upoly_mul(res, isl_upoly_copy(base));
1082 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
1085 isl_upoly_free(base);
1094 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
1099 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1100 div1->n_col >= div2->n_col, return -1);
1102 if (div1->n_row == div2->n_row)
1103 return isl_mat_is_equal(div1, div2);
1105 n_row = div1->n_row;
1106 n_col = div1->n_col;
1107 div1->n_row = div2->n_row;
1108 div1->n_col = div2->n_col;
1110 equal = isl_mat_is_equal(div1, div2);
1112 div1->n_row = n_row;
1113 div1->n_col = n_col;
1118 static void expand_row(__isl_keep isl_mat *dst, int d,
1119 __isl_keep isl_mat *src, int s, int *exp)
1122 unsigned c = src->n_col - src->n_row;
1124 isl_seq_cpy(dst->row[d], src->row[s], c);
1125 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
1127 for (i = 0; i < s; ++i)
1128 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
1131 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
1135 li = isl_seq_last_non_zero(div->row[i], div->n_col);
1136 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
1141 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
1144 struct isl_div_sort_info {
1149 static int div_sort_cmp(const void *p1, const void *p2)
1151 const struct isl_div_sort_info *i1, *i2;
1152 i1 = (const struct isl_div_sort_info *) p1;
1153 i2 = (const struct isl_div_sort_info *) p2;
1155 return cmp_row(i1->div, i1->row, i2->row);
1158 /* Sort divs and remove duplicates.
1160 static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp)
1165 struct isl_div_sort_info *array = NULL;
1166 int *pos = NULL, *at = NULL;
1167 int *reordering = NULL;
1172 if (qp->div->n_row <= 1)
1175 div_pos = isl_dim_total(qp->dim);
1177 array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info,
1179 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1180 at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1181 len = qp->div->n_col - 2;
1182 reordering = isl_alloc_array(qp->div->ctx, int, len);
1183 if (!array || !pos || !at || !reordering)
1186 for (i = 0; i < qp->div->n_row; ++i) {
1187 array[i].div = qp->div;
1193 qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
1196 for (i = 0; i < div_pos; ++i)
1199 for (i = 0; i < qp->div->n_row; ++i) {
1200 if (pos[array[i].row] == i)
1202 qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]);
1203 pos[at[i]] = pos[array[i].row];
1204 at[pos[array[i].row]] = at[i];
1205 at[i] = array[i].row;
1206 pos[array[i].row] = i;
1210 for (i = 0; i < len - div_pos; ++i) {
1212 isl_seq_eq(qp->div->row[i - skip - 1],
1213 qp->div->row[i - skip], qp->div->n_col)) {
1214 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
1215 isl_mat_col_add(qp->div, 2 + div_pos + i - skip - 1,
1216 2 + div_pos + i - skip);
1217 qp->div = isl_mat_drop_cols(qp->div,
1218 2 + div_pos + i - skip, 1);
1221 reordering[div_pos + array[i].row] = div_pos + i - skip;
1224 qp->upoly = reorder(qp->upoly, reordering);
1226 if (!qp->upoly || !qp->div)
1240 isl_qpolynomial_free(qp);
1244 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
1245 __isl_keep isl_mat *div2, int *exp1, int *exp2)
1248 isl_mat *div = NULL;
1249 unsigned d = div1->n_col - div1->n_row;
1251 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
1252 d + div1->n_row + div2->n_row);
1256 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
1259 expand_row(div, k, div1, i, exp1);
1260 expand_row(div, k + 1, div2, j, exp2);
1262 cmp = cmp_row(div, k, k + 1);
1266 } else if (cmp < 0) {
1270 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1273 for (; i < div1->n_row; ++i, ++k) {
1274 expand_row(div, k, div1, i, exp1);
1277 for (; j < div2->n_row; ++j, ++k) {
1278 expand_row(div, k, div2, j, exp2);
1288 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1289 int *exp, int first)
1292 struct isl_upoly_rec *rec;
1294 if (isl_upoly_is_cst(up))
1297 if (up->var < first)
1300 if (exp[up->var - first] == up->var - first)
1303 up = isl_upoly_cow(up);
1307 up->var = exp[up->var - first] + first;
1309 rec = isl_upoly_as_rec(up);
1313 for (i = 0; i < rec->n; ++i) {
1314 rec->p[i] = expand(rec->p[i], exp, first);
1325 static __isl_give isl_qpolynomial *with_merged_divs(
1326 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1327 __isl_take isl_qpolynomial *qp2),
1328 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1332 isl_mat *div = NULL;
1334 qp1 = isl_qpolynomial_cow(qp1);
1335 qp2 = isl_qpolynomial_cow(qp2);
1340 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1341 qp1->div->n_col >= qp2->div->n_col, goto error);
1343 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1344 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1348 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1352 isl_mat_free(qp1->div);
1353 qp1->div = isl_mat_copy(div);
1354 isl_mat_free(qp2->div);
1355 qp2->div = isl_mat_copy(div);
1357 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1358 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1360 if (!qp1->upoly || !qp2->upoly)
1367 return fn(qp1, qp2);
1372 isl_qpolynomial_free(qp1);
1373 isl_qpolynomial_free(qp2);
1377 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1378 __isl_take isl_qpolynomial *qp2)
1380 qp1 = isl_qpolynomial_cow(qp1);
1385 if (qp1->div->n_row < qp2->div->n_row)
1386 return isl_qpolynomial_add(qp2, qp1);
1388 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1389 if (!compatible_divs(qp1->div, qp2->div))
1390 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1392 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1396 isl_qpolynomial_free(qp2);
1400 isl_qpolynomial_free(qp1);
1401 isl_qpolynomial_free(qp2);
1405 __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain(
1406 __isl_keep isl_set *dom,
1407 __isl_take isl_qpolynomial *qp1,
1408 __isl_take isl_qpolynomial *qp2)
1410 qp1 = isl_qpolynomial_add(qp1, qp2);
1411 qp1 = isl_qpolynomial_gist(qp1, isl_set_copy(dom));
1415 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1416 __isl_take isl_qpolynomial *qp2)
1418 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1421 __isl_give isl_qpolynomial *isl_qpolynomial_add_isl_int(
1422 __isl_take isl_qpolynomial *qp, isl_int v)
1424 if (isl_int_is_zero(v))
1427 qp = isl_qpolynomial_cow(qp);
1431 qp->upoly = isl_upoly_add_isl_int(qp->upoly, v);
1437 isl_qpolynomial_free(qp);
1442 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1447 return isl_qpolynomial_mul_isl_int(qp, qp->dim->ctx->negone);
1450 __isl_give isl_qpolynomial *isl_qpolynomial_mul_isl_int(
1451 __isl_take isl_qpolynomial *qp, isl_int v)
1453 if (isl_int_is_one(v))
1456 if (qp && isl_int_is_zero(v)) {
1457 isl_qpolynomial *zero;
1458 zero = isl_qpolynomial_zero(isl_dim_copy(qp->dim));
1459 isl_qpolynomial_free(qp);
1463 qp = isl_qpolynomial_cow(qp);
1467 qp->upoly = isl_upoly_mul_isl_int(qp->upoly, v);
1473 isl_qpolynomial_free(qp);
1477 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1478 __isl_take isl_qpolynomial *qp2)
1480 qp1 = isl_qpolynomial_cow(qp1);
1485 if (qp1->div->n_row < qp2->div->n_row)
1486 return isl_qpolynomial_mul(qp2, qp1);
1488 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1489 if (!compatible_divs(qp1->div, qp2->div))
1490 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1492 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1496 isl_qpolynomial_free(qp2);
1500 isl_qpolynomial_free(qp1);
1501 isl_qpolynomial_free(qp2);
1505 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_qpolynomial *qp,
1508 qp = isl_qpolynomial_cow(qp);
1513 qp->upoly = isl_upoly_pow(qp->upoly, power);
1519 isl_qpolynomial_free(qp);
1523 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1527 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1530 __isl_give isl_qpolynomial *isl_qpolynomial_one(__isl_take isl_dim *dim)
1534 return isl_qpolynomial_alloc(dim, 0, isl_upoly_one(dim->ctx));
1537 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1541 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1544 __isl_give isl_qpolynomial *isl_qpolynomial_neginfty(__isl_take isl_dim *dim)
1548 return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx));
1551 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1555 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1558 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1561 struct isl_qpolynomial *qp;
1562 struct isl_upoly_cst *cst;
1567 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1571 cst = isl_upoly_as_cst(qp->upoly);
1572 isl_int_set(cst->n, v);
1577 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1578 isl_int *n, isl_int *d)
1580 struct isl_upoly_cst *cst;
1585 if (!isl_upoly_is_cst(qp->upoly))
1588 cst = isl_upoly_as_cst(qp->upoly);
1593 isl_int_set(*n, cst->n);
1595 isl_int_set(*d, cst->d);
1600 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1603 struct isl_upoly_rec *rec;
1611 rec = isl_upoly_as_rec(up);
1618 isl_assert(up->ctx, rec->n > 1, return -1);
1620 is_cst = isl_upoly_is_cst(rec->p[1]);
1626 return isl_upoly_is_affine(rec->p[0]);
1629 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1634 if (qp->div->n_row > 0)
1637 return isl_upoly_is_affine(qp->upoly);
1640 static void update_coeff(__isl_keep isl_vec *aff,
1641 __isl_keep struct isl_upoly_cst *cst, int pos)
1646 if (isl_int_is_zero(cst->n))
1651 isl_int_gcd(gcd, cst->d, aff->el[0]);
1652 isl_int_divexact(f, cst->d, gcd);
1653 isl_int_divexact(gcd, aff->el[0], gcd);
1654 isl_seq_scale(aff->el, aff->el, f, aff->size);
1655 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1660 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1661 __isl_keep isl_vec *aff)
1663 struct isl_upoly_cst *cst;
1664 struct isl_upoly_rec *rec;
1670 struct isl_upoly_cst *cst;
1672 cst = isl_upoly_as_cst(up);
1675 update_coeff(aff, cst, 0);
1679 rec = isl_upoly_as_rec(up);
1682 isl_assert(up->ctx, rec->n == 2, return -1);
1684 cst = isl_upoly_as_cst(rec->p[1]);
1687 update_coeff(aff, cst, 1 + up->var);
1689 return isl_upoly_update_affine(rec->p[0], aff);
1692 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1693 __isl_keep isl_qpolynomial *qp)
1701 d = isl_dim_total(qp->dim);
1702 aff = isl_vec_alloc(qp->div->ctx, 2 + d + qp->div->n_row);
1706 isl_seq_clr(aff->el + 1, 1 + d + qp->div->n_row);
1707 isl_int_set_si(aff->el[0], 1);
1709 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1718 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1719 __isl_keep isl_qpolynomial *qp2)
1724 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1727 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1730 struct isl_upoly_rec *rec;
1732 if (isl_upoly_is_cst(up)) {
1733 struct isl_upoly_cst *cst;
1734 cst = isl_upoly_as_cst(up);
1737 isl_int_lcm(*d, *d, cst->d);
1741 rec = isl_upoly_as_rec(up);
1745 for (i = 0; i < rec->n; ++i)
1746 upoly_update_den(rec->p[i], d);
1749 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1751 isl_int_set_si(*d, 1);
1754 upoly_update_den(qp->upoly, d);
1757 __isl_give isl_qpolynomial *isl_qpolynomial_var_pow(__isl_take isl_dim *dim,
1760 struct isl_ctx *ctx;
1767 return isl_qpolynomial_alloc(dim, 0, isl_upoly_var_pow(ctx, pos, power));
1770 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1771 enum isl_dim_type type, unsigned pos)
1776 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1777 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1779 if (type == isl_dim_set)
1780 pos += isl_dim_size(dim, isl_dim_param);
1782 return isl_qpolynomial_var_pow(dim, pos, 1);
1788 __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up,
1789 unsigned first, unsigned n, __isl_keep struct isl_upoly **subs)
1792 struct isl_upoly_rec *rec;
1793 struct isl_upoly *base, *res;
1798 if (isl_upoly_is_cst(up))
1801 if (up->var < first)
1804 rec = isl_upoly_as_rec(up);
1808 isl_assert(up->ctx, rec->n >= 1, goto error);
1810 if (up->var >= first + n)
1811 base = isl_upoly_var_pow(up->ctx, up->var, 1);
1813 base = isl_upoly_copy(subs[up->var - first]);
1815 res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs);
1816 for (i = rec->n - 2; i >= 0; --i) {
1817 struct isl_upoly *t;
1818 t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs);
1819 res = isl_upoly_mul(res, isl_upoly_copy(base));
1820 res = isl_upoly_sum(res, t);
1823 isl_upoly_free(base);
1832 __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f,
1833 isl_int denom, unsigned len)
1836 struct isl_upoly *up;
1838 isl_assert(ctx, len >= 1, return NULL);
1840 up = isl_upoly_rat_cst(ctx, f[0], denom);
1841 for (i = 0; i < len - 1; ++i) {
1842 struct isl_upoly *t;
1843 struct isl_upoly *c;
1845 if (isl_int_is_zero(f[1 + i]))
1848 c = isl_upoly_rat_cst(ctx, f[1 + i], denom);
1849 t = isl_upoly_var_pow(ctx, i, 1);
1850 t = isl_upoly_mul(c, t);
1851 up = isl_upoly_sum(up, t);
1857 /* Remove common factor of non-constant terms and denominator.
1859 static void normalize_div(__isl_keep isl_qpolynomial *qp, int div)
1861 isl_ctx *ctx = qp->div->ctx;
1862 unsigned total = qp->div->n_col - 2;
1864 isl_seq_gcd(qp->div->row[div] + 2, total, &ctx->normalize_gcd);
1865 isl_int_gcd(ctx->normalize_gcd,
1866 ctx->normalize_gcd, qp->div->row[div][0]);
1867 if (isl_int_is_one(ctx->normalize_gcd))
1870 isl_seq_scale_down(qp->div->row[div] + 2, qp->div->row[div] + 2,
1871 ctx->normalize_gcd, total);
1872 isl_int_divexact(qp->div->row[div][0], qp->div->row[div][0],
1873 ctx->normalize_gcd);
1874 isl_int_fdiv_q(qp->div->row[div][1], qp->div->row[div][1],
1875 ctx->normalize_gcd);
1878 /* Replace the integer division identified by "div" by the polynomial "s".
1879 * The integer division is assumed not to appear in the definition
1880 * of any other integer divisions.
1882 static __isl_give isl_qpolynomial *substitute_div(
1883 __isl_take isl_qpolynomial *qp,
1884 int div, __isl_take struct isl_upoly *s)
1893 qp = isl_qpolynomial_cow(qp);
1897 total = isl_dim_total(qp->dim);
1898 qp->upoly = isl_upoly_subs(qp->upoly, total + div, 1, &s);
1902 reordering = isl_alloc_array(qp->dim->ctx, int, total + qp->div->n_row);
1905 for (i = 0; i < total + div; ++i)
1907 for (i = total + div + 1; i < total + qp->div->n_row; ++i)
1908 reordering[i] = i - 1;
1909 qp->div = isl_mat_drop_rows(qp->div, div, 1);
1910 qp->div = isl_mat_drop_cols(qp->div, 2 + total + div, 1);
1911 qp->upoly = reorder(qp->upoly, reordering);
1914 if (!qp->upoly || !qp->div)
1920 isl_qpolynomial_free(qp);
1925 /* Replace all integer divisions [e/d] that turn out to not actually be integer
1926 * divisions because d is equal to 1 by their definition, i.e., e.
1928 static __isl_give isl_qpolynomial *substitute_non_divs(
1929 __isl_take isl_qpolynomial *qp)
1933 struct isl_upoly *s;
1938 total = isl_dim_total(qp->dim);
1939 for (i = 0; qp && i < qp->div->n_row; ++i) {
1940 if (!isl_int_is_one(qp->div->row[i][0]))
1942 for (j = i + 1; j < qp->div->n_row; ++j) {
1943 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
1945 isl_seq_combine(qp->div->row[j] + 1,
1946 qp->div->ctx->one, qp->div->row[j] + 1,
1947 qp->div->row[j][2 + total + i],
1948 qp->div->row[i] + 1, 1 + total + i);
1949 isl_int_set_si(qp->div->row[j][2 + total + i], 0);
1950 normalize_div(qp, j);
1952 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
1953 qp->div->row[i][0], qp->div->n_col - 1);
1954 qp = substitute_div(qp, i, s);
1961 /* Reduce the coefficients of div "div" to lie in the interval [0, d-1],
1962 * with d the denominator. When replacing the coefficient e of x by
1963 * d * frac(e/d) = e - d * floor(e/d), we are subtracting d * floor(e/d) * x
1964 * inside the division, so we need to add floor(e/d) * x outside.
1965 * That is, we replace q by q' + floor(e/d) * x and we therefore need
1966 * to adjust the coefficient of x in each later div that depends on the
1967 * current div "div" and also in the affine expression "aff"
1968 * (if it too depends on "div").
1970 static void reduce_div(__isl_keep isl_qpolynomial *qp, int div,
1971 __isl_keep isl_vec *aff)
1975 unsigned total = qp->div->n_col - qp->div->n_row - 2;
1978 for (i = 0; i < 1 + total + div; ++i) {
1979 if (isl_int_is_nonneg(qp->div->row[div][1 + i]) &&
1980 isl_int_lt(qp->div->row[div][1 + i], qp->div->row[div][0]))
1982 isl_int_fdiv_q(v, qp->div->row[div][1 + i], qp->div->row[div][0]);
1983 isl_int_fdiv_r(qp->div->row[div][1 + i],
1984 qp->div->row[div][1 + i], qp->div->row[div][0]);
1985 if (!isl_int_is_zero(aff->el[1 + total + div]))
1986 isl_int_addmul(aff->el[i], v, aff->el[1 + total + div]);
1987 for (j = div + 1; j < qp->div->n_row; ++j) {
1988 if (isl_int_is_zero(qp->div->row[j][2 + total + div]))
1990 isl_int_addmul(qp->div->row[j][1 + i],
1991 v, qp->div->row[j][2 + total + div]);
1997 /* Check if the last non-zero coefficient is bigger that half of the
1998 * denominator. If so, we will invert the div to further reduce the number
1999 * of distinct divs that may appear.
2000 * If the last non-zero coefficient is exactly half the denominator,
2001 * then we continue looking for earlier coefficients that are bigger
2002 * than half the denominator.
2004 static int needs_invert(__isl_keep isl_mat *div, int row)
2009 for (i = div->n_col - 1; i >= 1; --i) {
2010 if (isl_int_is_zero(div->row[row][i]))
2012 isl_int_mul_ui(div->row[row][i], div->row[row][i], 2);
2013 cmp = isl_int_cmp(div->row[row][i], div->row[row][0]);
2014 isl_int_divexact_ui(div->row[row][i], div->row[row][i], 2);
2024 /* Replace div "div" q = [e/d] by -[(-e+(d-1))/d].
2025 * We only invert the coefficients of e (and the coefficient of q in
2026 * later divs and in "aff"). After calling this function, the
2027 * coefficients of e should be reduced again.
2029 static void invert_div(__isl_keep isl_qpolynomial *qp, int div,
2030 __isl_keep isl_vec *aff)
2032 unsigned total = qp->div->n_col - qp->div->n_row - 2;
2034 isl_seq_neg(qp->div->row[div] + 1,
2035 qp->div->row[div] + 1, qp->div->n_col - 1);
2036 isl_int_sub_ui(qp->div->row[div][1], qp->div->row[div][1], 1);
2037 isl_int_add(qp->div->row[div][1],
2038 qp->div->row[div][1], qp->div->row[div][0]);
2039 if (!isl_int_is_zero(aff->el[1 + total + div]))
2040 isl_int_neg(aff->el[1 + total + div], aff->el[1 + total + div]);
2041 isl_mat_col_mul(qp->div, 2 + total + div,
2042 qp->div->ctx->negone, 2 + total + div);
2045 /* Assuming "qp" is a monomial, reduce all its divs to have coefficients
2046 * in the interval [0, d-1], with d the denominator and such that the
2047 * last non-zero coefficient that is not equal to d/2 is smaller than d/2.
2049 * After the reduction, some divs may have become redundant or identical,
2050 * so we call substitute_non_divs and sort_divs. If these functions
2051 * eliminate divs of merge * two or more divs into one, the coefficients
2052 * of the enclosing divs may have to be reduced again, so we call
2053 * ourselves recursively if the number of divs decreases.
2055 static __isl_give isl_qpolynomial *reduce_divs(__isl_take isl_qpolynomial *qp)
2058 isl_vec *aff = NULL;
2059 struct isl_upoly *s;
2065 aff = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);
2066 aff = isl_vec_clr(aff);
2070 isl_int_set_si(aff->el[1 + qp->upoly->var], 1);
2072 for (i = 0; i < qp->div->n_row; ++i) {
2073 normalize_div(qp, i);
2074 reduce_div(qp, i, aff);
2075 if (needs_invert(qp->div, i)) {
2076 invert_div(qp, i, aff);
2077 reduce_div(qp, i, aff);
2081 s = isl_upoly_from_affine(qp->div->ctx, aff->el,
2082 qp->div->ctx->one, aff->size);
2083 qp->upoly = isl_upoly_subs(qp->upoly, qp->upoly->var, 1, &s);
2090 n_div = qp->div->n_row;
2091 qp = substitute_non_divs(qp);
2093 if (qp && qp->div->n_row < n_div)
2094 return reduce_divs(qp);
2098 isl_qpolynomial_free(qp);
2103 /* Assumes each div only depends on earlier divs.
2105 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
2108 struct isl_qpolynomial *qp = NULL;
2109 struct isl_upoly_rec *rec;
2110 struct isl_upoly_cst *cst;
2117 d = div->line - div->bmap->div;
2119 pos = isl_dim_total(div->bmap->dim) + d;
2120 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
2121 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap),
2122 div->bmap->n_div, &rec->up);
2126 for (i = 0; i < div->bmap->n_div; ++i)
2127 isl_seq_cpy(qp->div->row[i], div->bmap->div[i], qp->div->n_col);
2129 for (i = 0; i < 1 + power; ++i) {
2130 rec->p[i] = isl_upoly_zero(div->ctx);
2135 cst = isl_upoly_as_cst(rec->p[power]);
2136 isl_int_set_si(cst->n, 1);
2140 qp = reduce_divs(qp);
2144 isl_qpolynomial_free(qp);
2149 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
2151 return isl_qpolynomial_div_pow(div, 1);
2154 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
2155 const isl_int n, const isl_int d)
2157 struct isl_qpolynomial *qp;
2158 struct isl_upoly_cst *cst;
2160 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
2164 cst = isl_upoly_as_cst(qp->upoly);
2165 isl_int_set(cst->n, n);
2166 isl_int_set(cst->d, d);
2171 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
2173 struct isl_upoly_rec *rec;
2179 if (isl_upoly_is_cst(up))
2183 active[up->var] = 1;
2185 rec = isl_upoly_as_rec(up);
2186 for (i = 0; i < rec->n; ++i)
2187 if (up_set_active(rec->p[i], active, d) < 0)
2193 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
2196 int d = isl_dim_total(qp->dim);
2201 for (i = 0; i < d; ++i)
2202 for (j = 0; j < qp->div->n_row; ++j) {
2203 if (isl_int_is_zero(qp->div->row[j][2 + i]))
2209 return up_set_active(qp->upoly, active, d);
2212 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
2213 enum isl_dim_type type, unsigned first, unsigned n)
2224 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2226 isl_assert(qp->dim->ctx, type == isl_dim_param ||
2227 type == isl_dim_set, return -1);
2229 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
2230 if (set_active(qp, active) < 0)
2233 if (type == isl_dim_set)
2234 first += isl_dim_size(qp->dim, isl_dim_param);
2235 for (i = 0; i < n; ++i)
2236 if (active[first + i]) {
2249 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
2250 unsigned first, unsigned n)
2253 struct isl_upoly_rec *rec;
2257 if (n == 0 || up->var < 0 || up->var < first)
2259 if (up->var < first + n) {
2260 up = replace_by_constant_term(up);
2261 return isl_upoly_drop(up, first, n);
2263 up = isl_upoly_cow(up);
2267 rec = isl_upoly_as_rec(up);
2271 for (i = 0; i < rec->n; ++i) {
2272 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
2283 __isl_give isl_qpolynomial *isl_qpolynomial_set_dim_name(
2284 __isl_take isl_qpolynomial *qp,
2285 enum isl_dim_type type, unsigned pos, const char *s)
2287 qp = isl_qpolynomial_cow(qp);
2290 qp->dim = isl_dim_set_name(qp->dim, type, pos, s);
2295 isl_qpolynomial_free(qp);
2299 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
2300 __isl_take isl_qpolynomial *qp,
2301 enum isl_dim_type type, unsigned first, unsigned n)
2305 if (n == 0 && !isl_dim_get_tuple_name(qp->dim, type))
2308 qp = isl_qpolynomial_cow(qp);
2312 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2314 isl_assert(qp->dim->ctx, type == isl_dim_param ||
2315 type == isl_dim_set, goto error);
2317 qp->dim = isl_dim_drop(qp->dim, type, first, n);
2321 if (type == isl_dim_set)
2322 first += isl_dim_size(qp->dim, isl_dim_param);
2324 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
2328 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
2334 isl_qpolynomial_free(qp);
2338 __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities(
2339 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
2345 struct isl_upoly *up;
2349 if (eq->n_eq == 0) {
2350 isl_basic_set_free(eq);
2354 qp = isl_qpolynomial_cow(qp);
2357 qp->div = isl_mat_cow(qp->div);
2361 total = 1 + isl_dim_total(eq->dim);
2363 isl_int_init(denom);
2364 for (i = 0; i < eq->n_eq; ++i) {
2365 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
2366 if (j < 0 || j == 0 || j >= total)
2369 for (k = 0; k < qp->div->n_row; ++k) {
2370 if (isl_int_is_zero(qp->div->row[k][1 + j]))
2372 isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total,
2373 &qp->div->row[k][0]);
2374 normalize_div(qp, k);
2377 if (isl_int_is_pos(eq->eq[i][j]))
2378 isl_seq_neg(eq->eq[i], eq->eq[i], total);
2379 isl_int_abs(denom, eq->eq[i][j]);
2380 isl_int_set_si(eq->eq[i][j], 0);
2382 up = isl_upoly_from_affine(qp->dim->ctx,
2383 eq->eq[i], denom, total);
2384 qp->upoly = isl_upoly_subs(qp->upoly, j - 1, 1, &up);
2387 isl_int_clear(denom);
2392 isl_basic_set_free(eq);
2394 qp = substitute_non_divs(qp);
2399 isl_basic_set_free(eq);
2400 isl_qpolynomial_free(qp);
2404 static __isl_give isl_basic_set *add_div_constraints(
2405 __isl_take isl_basic_set *bset, __isl_take isl_mat *div)
2413 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2416 total = isl_basic_set_total_dim(bset);
2417 for (i = 0; i < div->n_row; ++i)
2418 if (isl_basic_set_add_div_constraints_var(bset,
2419 total - div->n_row + i, div->row[i]) < 0)
2426 isl_basic_set_free(bset);
2430 /* Look for equalities among the variables shared by context and qp
2431 * and the integer divisions of qp, if any.
2432 * The equalities are then used to eliminate variables and/or integer
2433 * divisions from qp.
2435 __isl_give isl_qpolynomial *isl_qpolynomial_gist(
2436 __isl_take isl_qpolynomial *qp, __isl_take isl_set *context)
2442 if (qp->div->n_row > 0) {
2443 isl_basic_set *bset;
2444 context = isl_set_add_dims(context, isl_dim_set,
2446 bset = isl_basic_set_universe(isl_set_get_dim(context));
2447 bset = add_div_constraints(bset, isl_mat_copy(qp->div));
2448 context = isl_set_intersect(context,
2449 isl_set_from_basic_set(bset));
2452 aff = isl_set_affine_hull(context);
2453 return isl_qpolynomial_substitute_equalities(qp, aff);
2455 isl_qpolynomial_free(qp);
2456 isl_set_free(context);
2461 #define PW isl_pw_qpolynomial
2463 #define EL isl_qpolynomial
2465 #define IS_ZERO is_zero
2469 #include <isl_pw_templ.c>
2472 #define UNION isl_union_pw_qpolynomial
2474 #define PART isl_pw_qpolynomial
2476 #define PARTS pw_qpolynomial
2478 #include <isl_union_templ.c>
2480 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
2488 if (!isl_set_fast_is_universe(pwqp->p[0].set))
2491 return isl_qpolynomial_is_one(pwqp->p[0].qp);
2494 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
2495 __isl_take isl_pw_qpolynomial *pwqp1,
2496 __isl_take isl_pw_qpolynomial *pwqp2)
2499 struct isl_pw_qpolynomial *res;
2502 if (!pwqp1 || !pwqp2)
2505 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
2508 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
2509 isl_pw_qpolynomial_free(pwqp2);
2513 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
2514 isl_pw_qpolynomial_free(pwqp1);
2518 if (isl_pw_qpolynomial_is_one(pwqp1)) {
2519 isl_pw_qpolynomial_free(pwqp1);
2523 if (isl_pw_qpolynomial_is_one(pwqp2)) {
2524 isl_pw_qpolynomial_free(pwqp2);
2528 n = pwqp1->n * pwqp2->n;
2529 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
2531 for (i = 0; i < pwqp1->n; ++i) {
2532 for (j = 0; j < pwqp2->n; ++j) {
2533 struct isl_set *common;
2534 struct isl_qpolynomial *prod;
2535 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
2536 isl_set_copy(pwqp2->p[j].set));
2537 if (isl_set_fast_is_empty(common)) {
2538 isl_set_free(common);
2542 prod = isl_qpolynomial_mul(
2543 isl_qpolynomial_copy(pwqp1->p[i].qp),
2544 isl_qpolynomial_copy(pwqp2->p[j].qp));
2546 res = isl_pw_qpolynomial_add_piece(res, common, prod);
2550 isl_pw_qpolynomial_free(pwqp1);
2551 isl_pw_qpolynomial_free(pwqp2);
2555 isl_pw_qpolynomial_free(pwqp1);
2556 isl_pw_qpolynomial_free(pwqp2);
2560 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
2561 __isl_take isl_pw_qpolynomial *pwqp)
2568 if (isl_pw_qpolynomial_is_zero(pwqp))
2571 pwqp = isl_pw_qpolynomial_cow(pwqp);
2575 for (i = 0; i < pwqp->n; ++i) {
2576 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
2583 isl_pw_qpolynomial_free(pwqp);
2587 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
2588 __isl_take isl_pw_qpolynomial *pwqp1,
2589 __isl_take isl_pw_qpolynomial *pwqp2)
2591 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
2594 __isl_give struct isl_upoly *isl_upoly_eval(
2595 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
2598 struct isl_upoly_rec *rec;
2599 struct isl_upoly *res;
2600 struct isl_upoly *base;
2602 if (isl_upoly_is_cst(up)) {
2607 rec = isl_upoly_as_rec(up);
2611 isl_assert(up->ctx, rec->n >= 1, goto error);
2613 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
2615 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
2618 for (i = rec->n - 2; i >= 0; --i) {
2619 res = isl_upoly_mul(res, isl_upoly_copy(base));
2620 res = isl_upoly_sum(res,
2621 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
2622 isl_vec_copy(vec)));
2625 isl_upoly_free(base);
2635 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
2636 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
2639 struct isl_upoly *up;
2644 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
2646 if (qp->div->n_row == 0)
2647 ext = isl_vec_copy(pnt->vec);
2650 unsigned dim = isl_dim_total(qp->dim);
2651 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
2655 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
2656 for (i = 0; i < qp->div->n_row; ++i) {
2657 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
2658 1 + dim + i, &ext->el[1+dim+i]);
2659 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
2660 qp->div->row[i][0]);
2664 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
2668 dim = isl_dim_copy(qp->dim);
2669 isl_qpolynomial_free(qp);
2670 isl_point_free(pnt);
2672 return isl_qpolynomial_alloc(dim, 0, up);
2674 isl_qpolynomial_free(qp);
2675 isl_point_free(pnt);
2679 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
2680 __isl_keep struct isl_upoly_cst *cst2)
2685 isl_int_mul(t, cst1->n, cst2->d);
2686 isl_int_submul(t, cst2->n, cst1->d);
2687 cmp = isl_int_sgn(t);
2692 int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1,
2693 __isl_keep isl_qpolynomial *qp2)
2695 struct isl_upoly_cst *cst1, *cst2;
2699 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), return -1);
2700 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), return -1);
2701 if (isl_qpolynomial_is_nan(qp1))
2703 if (isl_qpolynomial_is_nan(qp2))
2705 cst1 = isl_upoly_as_cst(qp1->upoly);
2706 cst2 = isl_upoly_as_cst(qp2->upoly);
2708 return isl_upoly_cmp(cst1, cst2) <= 0;
2711 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
2712 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2714 struct isl_upoly_cst *cst1, *cst2;
2719 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2720 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2721 cst1 = isl_upoly_as_cst(qp1->upoly);
2722 cst2 = isl_upoly_as_cst(qp2->upoly);
2723 cmp = isl_upoly_cmp(cst1, cst2);
2726 isl_qpolynomial_free(qp2);
2728 isl_qpolynomial_free(qp1);
2733 isl_qpolynomial_free(qp1);
2734 isl_qpolynomial_free(qp2);
2738 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
2739 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2741 struct isl_upoly_cst *cst1, *cst2;
2746 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2747 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2748 cst1 = isl_upoly_as_cst(qp1->upoly);
2749 cst2 = isl_upoly_as_cst(qp2->upoly);
2750 cmp = isl_upoly_cmp(cst1, cst2);
2753 isl_qpolynomial_free(qp2);
2755 isl_qpolynomial_free(qp1);
2760 isl_qpolynomial_free(qp1);
2761 isl_qpolynomial_free(qp2);
2765 __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
2766 __isl_take isl_qpolynomial *qp, enum isl_dim_type type,
2767 unsigned first, unsigned n)
2776 qp = isl_qpolynomial_cow(qp);
2780 isl_assert(qp->div->ctx, first <= isl_dim_size(qp->dim, type),
2783 g_pos = pos(qp->dim, type) + first;
2785 qp->div = isl_mat_insert_cols(qp->div, 2 + g_pos, n);
2789 total = qp->div->n_col - 2;
2790 if (total > g_pos) {
2792 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2795 for (i = 0; i < total - g_pos; ++i)
2797 qp->upoly = expand(qp->upoly, exp, g_pos);
2803 qp->dim = isl_dim_insert(qp->dim, type, first, n);
2809 isl_qpolynomial_free(qp);
2813 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
2814 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2818 pos = isl_qpolynomial_dim(qp, type);
2820 return isl_qpolynomial_insert_dims(qp, type, pos, n);
2823 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2824 __isl_take isl_pw_qpolynomial *pwqp,
2825 enum isl_dim_type type, unsigned n)
2829 pos = isl_pw_qpolynomial_dim(pwqp, type);
2831 return isl_pw_qpolynomial_insert_dims(pwqp, type, pos, n);
2834 static int *reordering_move(isl_ctx *ctx,
2835 unsigned len, unsigned dst, unsigned src, unsigned n)
2840 reordering = isl_alloc_array(ctx, int, len);
2845 for (i = 0; i < dst; ++i)
2847 for (i = 0; i < n; ++i)
2848 reordering[src + i] = dst + i;
2849 for (i = 0; i < src - dst; ++i)
2850 reordering[dst + i] = dst + n + i;
2851 for (i = 0; i < len - src - n; ++i)
2852 reordering[src + n + i] = src + n + i;
2854 for (i = 0; i < src; ++i)
2856 for (i = 0; i < n; ++i)
2857 reordering[src + i] = dst + i;
2858 for (i = 0; i < dst - src; ++i)
2859 reordering[src + n + i] = src + i;
2860 for (i = 0; i < len - dst - n; ++i)
2861 reordering[dst + n + i] = dst + n + i;
2867 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
2868 __isl_take isl_qpolynomial *qp,
2869 enum isl_dim_type dst_type, unsigned dst_pos,
2870 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2876 qp = isl_qpolynomial_cow(qp);
2880 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2883 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2884 g_src_pos = pos(qp->dim, src_type) + src_pos;
2885 if (dst_type > src_type)
2888 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2895 reordering = reordering_move(qp->dim->ctx,
2896 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2900 qp->upoly = reorder(qp->upoly, reordering);
2905 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2911 isl_qpolynomial_free(qp);
2915 __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_dim *dim,
2916 isl_int *f, isl_int denom)
2918 struct isl_upoly *up;
2923 up = isl_upoly_from_affine(dim->ctx, f, denom, 1 + isl_dim_total(dim));
2925 return isl_qpolynomial_alloc(dim, 0, up);
2928 __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
2929 __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
2933 struct isl_upoly *up;
2934 isl_qpolynomial *qp;
2940 isl_int_init(denom);
2942 isl_constraint_get_coefficient(c, type, pos, &denom);
2943 isl_constraint_set_coefficient(c, type, pos, c->ctx->zero);
2944 sgn = isl_int_sgn(denom);
2945 isl_int_abs(denom, denom);
2946 up = isl_upoly_from_affine(c->ctx, c->line[0], denom,
2947 1 + isl_constraint_dim(c, isl_dim_all));
2949 isl_int_neg(denom, denom);
2950 isl_constraint_set_coefficient(c, type, pos, denom);
2952 dim = isl_dim_copy(c->bmap->dim);
2954 isl_int_clear(denom);
2955 isl_constraint_free(c);
2957 qp = isl_qpolynomial_alloc(dim, 0, up);
2959 qp = isl_qpolynomial_neg(qp);
2963 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
2964 * in "qp" by subs[i].
2966 __isl_give isl_qpolynomial *isl_qpolynomial_substitute(
2967 __isl_take isl_qpolynomial *qp,
2968 enum isl_dim_type type, unsigned first, unsigned n,
2969 __isl_keep isl_qpolynomial **subs)
2972 struct isl_upoly **ups;
2977 qp = isl_qpolynomial_cow(qp);
2980 for (i = 0; i < n; ++i)
2984 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2987 for (i = 0; i < n; ++i)
2988 isl_assert(qp->dim->ctx, isl_dim_equal(qp->dim, subs[i]->dim),
2991 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
2992 for (i = 0; i < n; ++i)
2993 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
2995 first += pos(qp->dim, type);
2997 ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n);
3000 for (i = 0; i < n; ++i)
3001 ups[i] = subs[i]->upoly;
3003 qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups);
3012 isl_qpolynomial_free(qp);
3016 /* Extend "bset" with extra set dimensions for each integer division
3017 * in "qp" and then call "fn" with the extended bset and the polynomial
3018 * that results from replacing each of the integer divisions by the
3019 * corresponding extra set dimension.
3021 int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
3022 __isl_keep isl_basic_set *bset,
3023 int (*fn)(__isl_take isl_basic_set *bset,
3024 __isl_take isl_qpolynomial *poly, void *user), void *user)
3028 isl_qpolynomial *poly;
3032 if (qp->div->n_row == 0)
3033 return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
3036 div = isl_mat_copy(qp->div);
3037 dim = isl_dim_copy(qp->dim);
3038 dim = isl_dim_add(dim, isl_dim_set, qp->div->n_row);
3039 poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly));
3040 bset = isl_basic_set_copy(bset);
3041 bset = isl_basic_set_add(bset, isl_dim_set, qp->div->n_row);
3042 bset = add_div_constraints(bset, div);
3044 return fn(bset, poly, user);
3049 /* Return total degree in variables first (inclusive) up to last (exclusive).
3051 int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last)
3055 struct isl_upoly_rec *rec;
3059 if (isl_upoly_is_zero(up))
3061 if (isl_upoly_is_cst(up) || up->var < first)
3064 rec = isl_upoly_as_rec(up);
3068 for (i = 0; i < rec->n; ++i) {
3071 if (isl_upoly_is_zero(rec->p[i]))
3073 d = isl_upoly_degree(rec->p[i], first, last);
3083 /* Return total degree in set variables.
3085 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
3093 ovar = isl_dim_offset(poly->dim, isl_dim_set);
3094 nvar = isl_dim_size(poly->dim, isl_dim_set);
3095 return isl_upoly_degree(poly->upoly, ovar, ovar + nvar);
3098 __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up,
3099 unsigned pos, int deg)
3102 struct isl_upoly_rec *rec;
3107 if (isl_upoly_is_cst(up) || up->var < pos) {
3109 return isl_upoly_copy(up);
3111 return isl_upoly_zero(up->ctx);
3114 rec = isl_upoly_as_rec(up);
3118 if (up->var == pos) {
3120 return isl_upoly_copy(rec->p[deg]);
3122 return isl_upoly_zero(up->ctx);
3125 up = isl_upoly_copy(up);
3126 up = isl_upoly_cow(up);
3127 rec = isl_upoly_as_rec(up);
3131 for (i = 0; i < rec->n; ++i) {
3132 struct isl_upoly *t;
3133 t = isl_upoly_coeff(rec->p[i], pos, deg);
3136 isl_upoly_free(rec->p[i]);
3146 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
3148 __isl_give isl_qpolynomial *isl_qpolynomial_coeff(
3149 __isl_keep isl_qpolynomial *qp,
3150 enum isl_dim_type type, unsigned t_pos, int deg)
3153 struct isl_upoly *up;
3159 isl_assert(qp->div->ctx, t_pos < isl_dim_size(qp->dim, type),
3162 g_pos = pos(qp->dim, type) + t_pos;
3163 up = isl_upoly_coeff(qp->upoly, g_pos, deg);
3165 c = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row, up);
3168 isl_mat_free(c->div);
3169 c->div = isl_mat_copy(qp->div);
3174 isl_qpolynomial_free(c);
3178 /* Homogenize the polynomial in the variables first (inclusive) up to
3179 * last (exclusive) by inserting powers of variable first.
3180 * Variable first is assumed not to appear in the input.
3182 __isl_give struct isl_upoly *isl_upoly_homogenize(
3183 __isl_take struct isl_upoly *up, int deg, int target,
3184 int first, int last)
3187 struct isl_upoly_rec *rec;
3191 if (isl_upoly_is_zero(up))
3195 if (isl_upoly_is_cst(up) || up->var < first) {
3196 struct isl_upoly *hom;
3198 hom = isl_upoly_var_pow(up->ctx, first, target - deg);
3201 rec = isl_upoly_as_rec(hom);
3202 rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up);
3207 up = isl_upoly_cow(up);
3208 rec = isl_upoly_as_rec(up);
3212 for (i = 0; i < rec->n; ++i) {
3213 if (isl_upoly_is_zero(rec->p[i]))
3215 rec->p[i] = isl_upoly_homogenize(rec->p[i],
3216 up->var < last ? deg + i : i, target,
3228 /* Homogenize the polynomial in the set variables by introducing
3229 * powers of an extra set variable at position 0.
3231 __isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
3232 __isl_take isl_qpolynomial *poly)
3236 int deg = isl_qpolynomial_degree(poly);
3241 poly = isl_qpolynomial_insert_dims(poly, isl_dim_set, 0, 1);
3242 poly = isl_qpolynomial_cow(poly);
3246 ovar = isl_dim_offset(poly->dim, isl_dim_set);
3247 nvar = isl_dim_size(poly->dim, isl_dim_set);
3248 poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg,
3255 isl_qpolynomial_free(poly);
3259 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
3260 __isl_take isl_mat *div)
3268 n = isl_dim_total(dim) + div->n_row;
3270 term = isl_calloc(dim->ctx, struct isl_term,
3271 sizeof(struct isl_term) + (n - 1) * sizeof(int));
3278 isl_int_init(term->n);
3279 isl_int_init(term->d);
3288 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
3297 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
3306 total = isl_dim_total(term->dim) + term->div->n_row;
3308 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
3312 isl_int_set(dup->n, term->n);
3313 isl_int_set(dup->d, term->d);
3315 for (i = 0; i < total; ++i)
3316 dup->pow[i] = term->pow[i];
3321 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
3329 return isl_term_dup(term);
3332 void isl_term_free(__isl_take isl_term *term)
3337 if (--term->ref > 0)
3340 isl_dim_free(term->dim);
3341 isl_mat_free(term->div);
3342 isl_int_clear(term->n);
3343 isl_int_clear(term->d);
3347 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
3355 case isl_dim_out: return isl_dim_size(term->dim, type);
3356 case isl_dim_div: return term->div->n_row;
3357 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
3362 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
3364 return term ? term->dim->ctx : NULL;
3367 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
3371 isl_int_set(*n, term->n);
3374 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
3378 isl_int_set(*d, term->d);
3381 int isl_term_get_exp(__isl_keep isl_term *term,
3382 enum isl_dim_type type, unsigned pos)
3387 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
3389 if (type >= isl_dim_set)
3390 pos += isl_dim_size(term->dim, isl_dim_param);
3391 if (type >= isl_dim_div)
3392 pos += isl_dim_size(term->dim, isl_dim_set);
3394 return term->pow[pos];
3397 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
3399 isl_basic_map *bmap;
3406 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
3409 total = term->div->n_col - term->div->n_row - 2;
3410 /* No nested divs for now */
3411 isl_assert(term->dim->ctx,
3412 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
3413 term->div->n_row) == -1,
3416 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
3417 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
3420 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
3422 return isl_basic_map_div(bmap, k);
3424 isl_basic_map_free(bmap);
3428 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
3429 int (*fn)(__isl_take isl_term *term, void *user),
3430 __isl_take isl_term *term, void *user)
3433 struct isl_upoly_rec *rec;
3438 if (isl_upoly_is_zero(up))
3441 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
3442 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
3443 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
3445 if (isl_upoly_is_cst(up)) {
3446 struct isl_upoly_cst *cst;
3447 cst = isl_upoly_as_cst(up);
3450 term = isl_term_cow(term);
3453 isl_int_set(term->n, cst->n);
3454 isl_int_set(term->d, cst->d);
3455 if (fn(isl_term_copy(term), user) < 0)
3460 rec = isl_upoly_as_rec(up);
3464 for (i = 0; i < rec->n; ++i) {
3465 term = isl_term_cow(term);
3468 term->pow[up->var] = i;
3469 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
3473 term->pow[up->var] = 0;
3477 isl_term_free(term);
3481 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
3482 int (*fn)(__isl_take isl_term *term, void *user), void *user)
3489 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
3493 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
3495 isl_term_free(term);
3497 return term ? 0 : -1;
3500 __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
3502 struct isl_upoly *up;
3503 isl_qpolynomial *qp;
3509 n = isl_dim_total(term->dim) + term->div->n_row;
3511 up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d);
3512 for (i = 0; i < n; ++i) {
3515 up = isl_upoly_mul(up,
3516 isl_upoly_var_pow(term->dim->ctx, i, term->pow[i]));
3519 qp = isl_qpolynomial_alloc(isl_dim_copy(term->dim), term->div->n_row, up);
3522 isl_mat_free(qp->div);
3523 qp->div = isl_mat_copy(term->div);
3527 isl_term_free(term);
3530 isl_qpolynomial_free(qp);
3531 isl_term_free(term);
3535 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
3536 __isl_take isl_dim *dim)
3545 if (isl_dim_equal(qp->dim, dim)) {
3550 qp = isl_qpolynomial_cow(qp);
3554 extra = isl_dim_size(dim, isl_dim_set) -
3555 isl_dim_size(qp->dim, isl_dim_set);
3556 total = isl_dim_total(qp->dim);
3557 if (qp->div->n_row) {
3560 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
3563 for (i = 0; i < qp->div->n_row; ++i)
3565 qp->upoly = expand(qp->upoly, exp, total);
3570 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
3573 for (i = 0; i < qp->div->n_row; ++i)
3574 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
3576 isl_dim_free(qp->dim);
3582 isl_qpolynomial_free(qp);
3586 /* For each parameter or variable that does not appear in qp,
3587 * first eliminate the variable from all constraints and then set it to zero.
3589 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
3590 __isl_keep isl_qpolynomial *qp)
3601 d = isl_dim_total(set->dim);
3602 active = isl_calloc_array(set->ctx, int, d);
3603 if (set_active(qp, active) < 0)
3606 for (i = 0; i < d; ++i)
3615 nparam = isl_dim_size(set->dim, isl_dim_param);
3616 nvar = isl_dim_size(set->dim, isl_dim_set);
3617 for (i = 0; i < nparam; ++i) {
3620 set = isl_set_eliminate(set, isl_dim_param, i, 1);
3621 set = isl_set_fix_si(set, isl_dim_param, i, 0);
3623 for (i = 0; i < nvar; ++i) {
3624 if (active[nparam + i])
3626 set = isl_set_eliminate(set, isl_dim_set, i, 1);
3627 set = isl_set_fix_si(set, isl_dim_set, i, 0);
3639 struct isl_opt_data {
3640 isl_qpolynomial *qp;
3642 isl_qpolynomial *opt;
3646 static int opt_fn(__isl_take isl_point *pnt, void *user)
3648 struct isl_opt_data *data = (struct isl_opt_data *)user;
3649 isl_qpolynomial *val;
3651 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
3655 } else if (data->max) {
3656 data->opt = isl_qpolynomial_max_cst(data->opt, val);
3658 data->opt = isl_qpolynomial_min_cst(data->opt, val);
3664 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
3665 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
3667 struct isl_opt_data data = { NULL, 1, NULL, max };
3672 if (isl_upoly_is_cst(qp->upoly)) {
3677 set = fix_inactive(set, qp);
3680 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
3684 data.opt = isl_qpolynomial_zero(isl_qpolynomial_get_dim(qp));
3687 isl_qpolynomial_free(qp);
3691 isl_qpolynomial_free(qp);
3692 isl_qpolynomial_free(data.opt);
3696 __isl_give isl_qpolynomial *isl_qpolynomial_morph(__isl_take isl_qpolynomial *qp,
3697 __isl_take isl_morph *morph)
3702 struct isl_upoly *up;
3704 struct isl_upoly **subs;
3707 qp = isl_qpolynomial_cow(qp);
3712 isl_assert(ctx, isl_dim_equal(qp->dim, morph->dom->dim), goto error);
3714 n_sub = morph->inv->n_row - 1;
3715 if (morph->inv->n_row != morph->inv->n_col)
3716 n_sub += qp->div->n_row;
3717 subs = isl_calloc_array(ctx, struct isl_upoly *, n_sub);
3721 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3722 subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i],
3723 morph->inv->row[0][0], morph->inv->n_col);
3724 if (morph->inv->n_row != morph->inv->n_col)
3725 for (i = 0; i < qp->div->n_row; ++i)
3726 subs[morph->inv->n_row - 1 + i] =
3727 isl_upoly_var_pow(ctx, morph->inv->n_col - 1 + i, 1);
3729 qp->upoly = isl_upoly_subs(qp->upoly, 0, n_sub, subs);
3731 for (i = 0; i < n_sub; ++i)
3732 isl_upoly_free(subs[i]);
3735 mat = isl_mat_diagonal(isl_mat_identity(ctx, 1), isl_mat_copy(morph->inv));
3736 mat = isl_mat_diagonal(mat, isl_mat_identity(ctx, qp->div->n_row));
3737 qp->div = isl_mat_product(qp->div, mat);
3738 isl_dim_free(qp->dim);
3739 qp->dim = isl_dim_copy(morph->ran->dim);
3741 if (!qp->upoly || !qp->div || !qp->dim)
3744 isl_morph_free(morph);
3748 isl_qpolynomial_free(qp);
3749 isl_morph_free(morph);
3753 static int neg_entry(void **entry, void *user)
3755 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
3757 *pwqp = isl_pw_qpolynomial_neg(*pwqp);
3759 return *pwqp ? 0 : -1;
3762 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_neg(
3763 __isl_take isl_union_pw_qpolynomial *upwqp)
3765 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
3769 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
3770 &neg_entry, NULL) < 0)
3775 isl_union_pw_qpolynomial_free(upwqp);
3779 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_sub(
3780 __isl_take isl_union_pw_qpolynomial *upwqp1,
3781 __isl_take isl_union_pw_qpolynomial *upwqp2)
3783 return isl_union_pw_qpolynomial_add(upwqp1,
3784 isl_union_pw_qpolynomial_neg(upwqp2));
3787 static int mul_entry(void **entry, void *user)
3789 struct isl_union_pw_qpolynomial_match_bin_data *data = user;
3791 struct isl_hash_table_entry *entry2;
3792 isl_pw_qpolynomial *pwpq = *entry;
3795 hash = isl_dim_get_hash(pwpq->dim);
3796 entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table,
3797 hash, &has_dim, pwpq->dim, 0);
3801 pwpq = isl_pw_qpolynomial_copy(pwpq);
3802 pwpq = isl_pw_qpolynomial_mul(pwpq,
3803 isl_pw_qpolynomial_copy(entry2->data));
3805 empty = isl_pw_qpolynomial_is_zero(pwpq);
3807 isl_pw_qpolynomial_free(pwpq);
3811 isl_pw_qpolynomial_free(pwpq);
3815 data->res = isl_union_pw_qpolynomial_add_pw_qpolynomial(data->res, pwpq);
3820 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
3821 __isl_take isl_union_pw_qpolynomial *upwqp1,
3822 __isl_take isl_union_pw_qpolynomial *upwqp2)
3824 return match_bin_op(upwqp1, upwqp2, &mul_entry);
3827 /* Reorder the columns of the given div definitions according to the
3830 static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div,
3831 __isl_take isl_reordering *r)
3840 extra = isl_dim_total(r->dim) + div->n_row - r->len;
3841 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
3845 for (i = 0; i < div->n_row; ++i) {
3846 isl_seq_cpy(mat->row[i], div->row[i], 2);
3847 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2);
3848 for (j = 0; j < r->len; ++j)
3849 isl_int_set(mat->row[i][2 + r->pos[j]],
3850 div->row[i][2 + j]);
3853 isl_reordering_free(r);
3857 isl_reordering_free(r);
3862 /* Reorder the dimension of "qp" according to the given reordering.
3864 __isl_give isl_qpolynomial *isl_qpolynomial_realign(
3865 __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r)
3867 qp = isl_qpolynomial_cow(qp);
3871 r = isl_reordering_extend(r, qp->div->n_row);
3875 qp->div = reorder_divs(qp->div, isl_reordering_copy(r));
3879 qp->upoly = reorder(qp->upoly, r->pos);
3883 qp = isl_qpolynomial_reset_dim(qp, isl_dim_copy(r->dim));
3885 isl_reordering_free(r);
3888 isl_qpolynomial_free(qp);
3889 isl_reordering_free(r);
3893 struct isl_split_periods_data {
3895 isl_pw_qpolynomial *res;
3898 /* Create a slice where the integer division "div" has the fixed value "v".
3899 * In particular, if "div" refers to floor(f/m), then create a slice
3901 * m v <= f <= m v + (m - 1)
3906 * -f + m v + (m - 1) >= 0
3908 static __isl_give isl_set *set_div_slice(__isl_take isl_dim *dim,
3909 __isl_keep isl_qpolynomial *qp, int div, isl_int v)
3912 isl_basic_set *bset = NULL;
3918 total = isl_dim_total(dim);
3919 bset = isl_basic_set_alloc_dim(isl_dim_copy(dim), 0, 0, 2);
3921 k = isl_basic_set_alloc_inequality(bset);
3924 isl_seq_cpy(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3925 isl_int_submul(bset->ineq[k][0], v, qp->div->row[div][0]);
3927 k = isl_basic_set_alloc_inequality(bset);
3930 isl_seq_neg(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3931 isl_int_addmul(bset->ineq[k][0], v, qp->div->row[div][0]);
3932 isl_int_add(bset->ineq[k][0], bset->ineq[k][0], qp->div->row[div][0]);
3933 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
3936 return isl_set_from_basic_set(bset);
3938 isl_basic_set_free(bset);
3943 static int split_periods(__isl_take isl_set *set,
3944 __isl_take isl_qpolynomial *qp, void *user);
3946 /* Create a slice of the domain "set" such that integer division "div"
3947 * has the fixed value "v" and add the results to data->res,
3948 * replacing the integer division by "v" in "qp".
3950 static int set_div(__isl_take isl_set *set,
3951 __isl_take isl_qpolynomial *qp, int div, isl_int v,
3952 struct isl_split_periods_data *data)
3957 struct isl_upoly *cst;
3959 slice = set_div_slice(isl_set_get_dim(set), qp, div, v);
3960 set = isl_set_intersect(set, slice);
3965 total = isl_dim_total(qp->dim);
3967 for (i = div + 1; i < qp->div->n_row; ++i) {
3968 if (isl_int_is_zero(qp->div->row[i][2 + total + div]))
3970 isl_int_addmul(qp->div->row[i][1],
3971 qp->div->row[i][2 + total + div], v);
3972 isl_int_set_si(qp->div->row[i][2 + total + div], 0);
3975 cst = isl_upoly_rat_cst(qp->dim->ctx, v, qp->dim->ctx->one);
3976 qp = substitute_div(qp, div, cst);
3978 return split_periods(set, qp, data);
3981 isl_qpolynomial_free(qp);
3985 /* Split the domain "set" such that integer division "div"
3986 * has a fixed value (ranging from "min" to "max") on each slice
3987 * and add the results to data->res.
3989 static int split_div(__isl_take isl_set *set,
3990 __isl_take isl_qpolynomial *qp, int div, isl_int min, isl_int max,
3991 struct isl_split_periods_data *data)
3993 for (; isl_int_le(min, max); isl_int_add_ui(min, min, 1)) {
3994 isl_set *set_i = isl_set_copy(set);
3995 isl_qpolynomial *qp_i = isl_qpolynomial_copy(qp);
3997 if (set_div(set_i, qp_i, div, min, data) < 0)
4001 isl_qpolynomial_free(qp);
4005 isl_qpolynomial_free(qp);
4009 /* If "qp" refers to any integer division
4010 * that can only attain "max_periods" distinct values on "set"
4011 * then split the domain along those distinct values.
4012 * Add the results (or the original if no splitting occurs)
4015 static int split_periods(__isl_take isl_set *set,
4016 __isl_take isl_qpolynomial *qp, void *user)
4019 isl_pw_qpolynomial *pwqp;
4020 struct isl_split_periods_data *data;
4025 data = (struct isl_split_periods_data *)user;
4030 if (qp->div->n_row == 0) {
4031 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4032 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
4038 total = isl_dim_total(qp->dim);
4039 for (i = 0; i < qp->div->n_row; ++i) {
4040 enum isl_lp_result lp_res;
4042 if (isl_seq_first_non_zero(qp->div->row[i] + 2 + total,
4043 qp->div->n_row) != -1)
4046 lp_res = isl_set_solve_lp(set, 0, qp->div->row[i] + 1,
4047 set->ctx->one, &min, NULL, NULL);
4048 if (lp_res == isl_lp_error)
4050 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
4052 isl_int_fdiv_q(min, min, qp->div->row[i][0]);
4054 lp_res = isl_set_solve_lp(set, 1, qp->div->row[i] + 1,
4055 set->ctx->one, &max, NULL, NULL);
4056 if (lp_res == isl_lp_error)
4058 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
4060 isl_int_fdiv_q(max, max, qp->div->row[i][0]);
4062 isl_int_sub(max, max, min);
4063 if (isl_int_cmp_si(max, data->max_periods) < 0) {
4064 isl_int_add(max, max, min);
4069 if (i < qp->div->n_row) {
4070 r = split_div(set, qp, i, min, max, data);
4072 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4073 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
4085 isl_qpolynomial_free(qp);
4089 /* If any quasi-polynomial in pwqp refers to any integer division
4090 * that can only attain "max_periods" distinct values on its domain
4091 * then split the domain along those distinct values.
4093 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_periods(
4094 __isl_take isl_pw_qpolynomial *pwqp, int max_periods)
4096 struct isl_split_periods_data data;
4098 data.max_periods = max_periods;
4099 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_dim(pwqp));
4101 if (isl_pw_qpolynomial_foreach_piece(pwqp, &split_periods, &data) < 0)
4104 isl_pw_qpolynomial_free(pwqp);
4108 isl_pw_qpolynomial_free(data.res);
4109 isl_pw_qpolynomial_free(pwqp);
4113 /* Construct a piecewise quasipolynomial that is constant on the given
4114 * domain. In particular, it is
4117 * infinity if cst == -1
4119 static __isl_give isl_pw_qpolynomial *constant_on_domain(
4120 __isl_take isl_basic_set *bset, int cst)
4123 isl_qpolynomial *qp;
4128 bset = isl_basic_map_domain(isl_basic_map_from_range(bset));
4129 dim = isl_basic_set_get_dim(bset);
4131 qp = isl_qpolynomial_infty(dim);
4133 qp = isl_qpolynomial_zero(dim);
4135 qp = isl_qpolynomial_one(dim);
4136 return isl_pw_qpolynomial_alloc(isl_set_from_basic_set(bset), qp);
4139 /* Factor bset, call fn on each of the factors and return the product.
4141 * If no factors can be found, simply call fn on the input.
4142 * Otherwise, construct the factors based on the factorizer,
4143 * call fn on each factor and compute the product.
4145 static __isl_give isl_pw_qpolynomial *compressed_multiplicative_call(
4146 __isl_take isl_basic_set *bset,
4147 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
4153 isl_qpolynomial *qp;
4154 isl_pw_qpolynomial *pwqp;
4158 f = isl_basic_set_factorizer(bset);
4161 if (f->n_group == 0) {
4162 isl_factorizer_free(f);
4166 nparam = isl_basic_set_dim(bset, isl_dim_param);
4167 nvar = isl_basic_set_dim(bset, isl_dim_set);
4169 dim = isl_basic_set_get_dim(bset);
4170 dim = isl_dim_domain(dim);
4171 set = isl_set_universe(isl_dim_copy(dim));
4172 qp = isl_qpolynomial_one(dim);
4173 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4175 bset = isl_morph_basic_set(isl_morph_copy(f->morph), bset);
4177 for (i = 0, n = 0; i < f->n_group; ++i) {
4178 isl_basic_set *bset_i;
4179 isl_pw_qpolynomial *pwqp_i;
4181 bset_i = isl_basic_set_copy(bset);
4182 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
4183 nparam + n + f->len[i], nvar - n - f->len[i]);
4184 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
4186 bset_i = isl_basic_set_drop(bset_i, isl_dim_set,
4187 n + f->len[i], nvar - n - f->len[i]);
4188 bset_i = isl_basic_set_drop(bset_i, isl_dim_set, 0, n);
4190 pwqp_i = fn(bset_i);
4191 pwqp = isl_pw_qpolynomial_mul(pwqp, pwqp_i);
4196 isl_basic_set_free(bset);
4197 isl_factorizer_free(f);
4201 isl_basic_set_free(bset);
4205 /* Factor bset, call fn on each of the factors and return the product.
4206 * The function is assumed to evaluate to zero on empty domains,
4207 * to one on zero-dimensional domains and to infinity on unbounded domains
4208 * and will not be called explicitly on zero-dimensional or unbounded domains.
4210 * We first check for some special cases and remove all equalities.
4211 * Then we hand over control to compressed_multiplicative_call.
4213 __isl_give isl_pw_qpolynomial *isl_basic_set_multiplicative_call(
4214 __isl_take isl_basic_set *bset,
4215 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
4219 isl_pw_qpolynomial *pwqp;
4220 unsigned orig_nvar, final_nvar;
4225 if (isl_basic_set_fast_is_empty(bset))
4226 return constant_on_domain(bset, 0);
4228 orig_nvar = isl_basic_set_dim(bset, isl_dim_set);
4231 return constant_on_domain(bset, 1);
4233 bounded = isl_basic_set_is_bounded(bset);
4237 return constant_on_domain(bset, -1);
4239 if (bset->n_eq == 0)
4240 return compressed_multiplicative_call(bset, fn);
4242 morph = isl_basic_set_full_compression(bset);
4243 bset = isl_morph_basic_set(isl_morph_copy(morph), bset);
4245 final_nvar = isl_basic_set_dim(bset, isl_dim_set);
4247 pwqp = compressed_multiplicative_call(bset, fn);
4249 morph = isl_morph_remove_dom_dims(morph, isl_dim_set, 0, orig_nvar);
4250 morph = isl_morph_remove_ran_dims(morph, isl_dim_set, 0, final_nvar);
4251 morph = isl_morph_inverse(morph);
4253 pwqp = isl_pw_qpolynomial_morph(pwqp, morph);
4257 isl_basic_set_free(bset);
4261 /* Drop all floors in "qp", turning each integer division [a/m] into
4262 * a rational division a/m. If "down" is set, then the integer division
4263 * is replaces by (a-(m-1))/m instead.
4265 static __isl_give isl_qpolynomial *qp_drop_floors(
4266 __isl_take isl_qpolynomial *qp, int down)
4269 struct isl_upoly *s;
4273 if (qp->div->n_row == 0)
4276 qp = isl_qpolynomial_cow(qp);
4280 for (i = qp->div->n_row - 1; i >= 0; --i) {
4282 isl_int_sub(qp->div->row[i][1],
4283 qp->div->row[i][1], qp->div->row[i][0]);
4284 isl_int_add_ui(qp->div->row[i][1],
4285 qp->div->row[i][1], 1);
4287 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
4288 qp->div->row[i][0], qp->div->n_col - 1);
4289 qp = substitute_div(qp, i, s);
4297 /* Drop all floors in "pwqp", turning each integer division [a/m] into
4298 * a rational division a/m.
4300 static __isl_give isl_pw_qpolynomial *pwqp_drop_floors(
4301 __isl_take isl_pw_qpolynomial *pwqp)
4308 if (isl_pw_qpolynomial_is_zero(pwqp))
4311 pwqp = isl_pw_qpolynomial_cow(pwqp);
4315 for (i = 0; i < pwqp->n; ++i) {
4316 pwqp->p[i].qp = qp_drop_floors(pwqp->p[i].qp, 0);
4323 isl_pw_qpolynomial_free(pwqp);
4327 /* Adjust all the integer divisions in "qp" such that they are at least
4328 * one over the given orthant (identified by "signs"). This ensures
4329 * that they will still be non-negative even after subtracting (m-1)/m.
4331 * In particular, f is replaced by f' + v, changing f = [a/m]
4332 * to f' = [(a - m v)/m].
4333 * If the constant term k in a is smaller than m,
4334 * the constant term of v is set to floor(k/m) - 1.
4335 * For any other term, if the coefficient c and the variable x have
4336 * the same sign, then no changes are needed.
4337 * Otherwise, if the variable is positive (and c is negative),
4338 * then the coefficient of x in v is set to floor(c/m).
4339 * If the variable is negative (and c is positive),
4340 * then the coefficient of x in v is set to ceil(c/m).
4342 static __isl_give isl_qpolynomial *make_divs_pos(__isl_take isl_qpolynomial *qp,
4348 struct isl_upoly *s;
4350 qp = isl_qpolynomial_cow(qp);
4353 qp->div = isl_mat_cow(qp->div);
4357 total = isl_dim_total(qp->dim);
4358 v = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);
4360 for (i = 0; i < qp->div->n_row; ++i) {
4361 isl_int *row = qp->div->row[i];
4365 if (isl_int_lt(row[1], row[0])) {
4366 isl_int_fdiv_q(v->el[0], row[1], row[0]);
4367 isl_int_sub_ui(v->el[0], v->el[0], 1);
4368 isl_int_submul(row[1], row[0], v->el[0]);
4370 for (j = 0; j < total; ++j) {
4371 if (isl_int_sgn(row[2 + j]) * signs[j] >= 0)
4374 isl_int_cdiv_q(v->el[1 + j], row[2 + j], row[0]);
4376 isl_int_fdiv_q(v->el[1 + j], row[2 + j], row[0]);
4377 isl_int_submul(row[2 + j], row[0], v->el[1 + j]);
4379 for (j = 0; j < i; ++j) {
4380 if (isl_int_sgn(row[2 + total + j]) >= 0)
4382 isl_int_fdiv_q(v->el[1 + total + j],
4383 row[2 + total + j], row[0]);
4384 isl_int_submul(row[2 + total + j],
4385 row[0], v->el[1 + total + j]);
4387 for (j = i + 1; j < qp->div->n_row; ++j) {
4388 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
4390 isl_seq_combine(qp->div->row[j] + 1,
4391 qp->div->ctx->one, qp->div->row[j] + 1,
4392 qp->div->row[j][2 + total + i], v->el, v->size);
4394 isl_int_set_si(v->el[1 + total + i], 1);
4395 s = isl_upoly_from_affine(qp->dim->ctx, v->el,
4396 qp->div->ctx->one, v->size);
4397 qp->upoly = isl_upoly_subs(qp->upoly, total + i, 1, &s);
4407 isl_qpolynomial_free(qp);
4411 struct isl_to_poly_data {
4413 isl_pw_qpolynomial *res;
4414 isl_qpolynomial *qp;
4417 /* Appoximate data->qp by a polynomial on the orthant identified by "signs".
4418 * We first make all integer divisions positive and then split the
4419 * quasipolynomials into terms with sign data->sign (the direction
4420 * of the requested approximation) and terms with the opposite sign.
4421 * In the first set of terms, each integer division [a/m] is
4422 * overapproximated by a/m, while in the second it is underapproximated
4425 static int to_polynomial_on_orthant(__isl_take isl_set *orthant, int *signs,
4428 struct isl_to_poly_data *data = user;
4429 isl_pw_qpolynomial *t;
4430 isl_qpolynomial *qp, *up, *down;
4432 qp = isl_qpolynomial_copy(data->qp);
4433 qp = make_divs_pos(qp, signs);
4435 up = isl_qpolynomial_terms_of_sign(qp, signs, data->sign);
4436 up = qp_drop_floors(up, 0);
4437 down = isl_qpolynomial_terms_of_sign(qp, signs, -data->sign);
4438 down = qp_drop_floors(down, 1);
4440 isl_qpolynomial_free(qp);
4441 qp = isl_qpolynomial_add(up, down);
4443 t = isl_pw_qpolynomial_alloc(orthant, qp);
4444 data->res = isl_pw_qpolynomial_add_disjoint(data->res, t);
4449 /* Approximate each quasipolynomial by a polynomial. If "sign" is positive,
4450 * the polynomial will be an overapproximation. If "sign" is negative,
4451 * it will be an underapproximation. If "sign" is zero, the approximation
4452 * will lie somewhere in between.
4454 * In particular, is sign == 0, we simply drop the floors, turning
4455 * the integer divisions into rational divisions.
4456 * Otherwise, we split the domains into orthants, make all integer divisions
4457 * positive and then approximate each [a/m] by either a/m or (a-(m-1))/m,
4458 * depending on the requested sign and the sign of the term in which
4459 * the integer division appears.
4461 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_to_polynomial(
4462 __isl_take isl_pw_qpolynomial *pwqp, int sign)
4465 struct isl_to_poly_data data;
4468 return pwqp_drop_floors(pwqp);
4474 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_dim(pwqp));
4476 for (i = 0; i < pwqp->n; ++i) {
4477 if (pwqp->p[i].qp->div->n_row == 0) {
4478 isl_pw_qpolynomial *t;
4479 t = isl_pw_qpolynomial_alloc(
4480 isl_set_copy(pwqp->p[i].set),
4481 isl_qpolynomial_copy(pwqp->p[i].qp));
4482 data.res = isl_pw_qpolynomial_add_disjoint(data.res, t);
4485 data.qp = pwqp->p[i].qp;
4486 if (isl_set_foreach_orthant(pwqp->p[i].set,
4487 &to_polynomial_on_orthant, &data) < 0)
4491 isl_pw_qpolynomial_free(pwqp);
4495 isl_pw_qpolynomial_free(pwqp);
4496 isl_pw_qpolynomial_free(data.res);
4500 static int poly_entry(void **entry, void *user)
4503 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
4505 *pwqp = isl_pw_qpolynomial_to_polynomial(*pwqp, *sign);
4507 return *pwqp ? 0 : -1;
4510 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_to_polynomial(
4511 __isl_take isl_union_pw_qpolynomial *upwqp, int sign)
4513 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
4517 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
4518 &poly_entry, &sign) < 0)
4523 isl_union_pw_qpolynomial_free(upwqp);
4527 __isl_give isl_basic_map *isl_basic_map_from_qpolynomial(
4528 __isl_take isl_qpolynomial *qp)
4532 isl_vec *aff = NULL;
4533 isl_basic_map *bmap = NULL;
4539 if (!isl_upoly_is_affine(qp->upoly))
4540 isl_die(qp->dim->ctx, isl_error_invalid,
4541 "input quasi-polynomial not affine", goto error);
4542 aff = isl_qpolynomial_extract_affine(qp);
4545 dim = isl_qpolynomial_get_dim(qp);
4546 dim = isl_dim_from_domain(dim);
4547 pos = 1 + isl_dim_offset(dim, isl_dim_out);
4548 dim = isl_dim_add(dim, isl_dim_out, 1);
4549 n_div = qp->div->n_row;
4550 bmap = isl_basic_map_alloc_dim(dim, n_div, 1, 2 * n_div);
4552 for (i = 0; i < n_div; ++i) {
4553 k = isl_basic_map_alloc_div(bmap);
4556 isl_seq_cpy(bmap->div[k], qp->div->row[i], qp->div->n_col);
4557 isl_int_set_si(bmap->div[k][qp->div->n_col], 0);
4558 if (isl_basic_map_add_div_constraints(bmap, k) < 0)
4561 k = isl_basic_map_alloc_equality(bmap);
4564 isl_int_neg(bmap->eq[k][pos], aff->el[0]);
4565 isl_seq_cpy(bmap->eq[k], aff->el + 1, pos);
4566 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->el + 1 + pos, n_div);
4569 isl_qpolynomial_free(qp);
4570 bmap = isl_basic_map_finalize(bmap);
4574 isl_qpolynomial_free(qp);
4575 isl_basic_map_free(bmap);