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_factorization.h>
15 #include <isl_union_map_private.h>
16 #include <isl_polynomial_private.h>
17 #include <isl_point_private.h>
18 #include <isl_dim_private.h>
19 #include <isl_map_private.h>
20 #include <isl_mat_private.h>
21 #include <isl_range.h>
23 static unsigned pos(__isl_keep isl_dim *dim, enum isl_dim_type type)
26 case isl_dim_param: return 0;
27 case isl_dim_in: return dim->nparam;
28 case isl_dim_out: return dim->nparam + dim->n_in;
33 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
41 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
46 isl_assert(up->ctx, up->var < 0, return NULL);
48 return (struct isl_upoly_cst *)up;
51 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
56 isl_assert(up->ctx, up->var >= 0, return NULL);
58 return (struct isl_upoly_rec *)up;
61 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
62 __isl_keep struct isl_upoly *up2)
65 struct isl_upoly_rec *rec1, *rec2;
71 if (up1->var != up2->var)
73 if (isl_upoly_is_cst(up1)) {
74 struct isl_upoly_cst *cst1, *cst2;
75 cst1 = isl_upoly_as_cst(up1);
76 cst2 = isl_upoly_as_cst(up2);
79 return isl_int_eq(cst1->n, cst2->n) &&
80 isl_int_eq(cst1->d, cst2->d);
83 rec1 = isl_upoly_as_rec(up1);
84 rec2 = isl_upoly_as_rec(up2);
88 if (rec1->n != rec2->n)
91 for (i = 0; i < rec1->n; ++i) {
92 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
100 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
102 struct isl_upoly_cst *cst;
106 if (!isl_upoly_is_cst(up))
109 cst = isl_upoly_as_cst(up);
113 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
116 int isl_upoly_sgn(__isl_keep struct isl_upoly *up)
118 struct isl_upoly_cst *cst;
122 if (!isl_upoly_is_cst(up))
125 cst = isl_upoly_as_cst(up);
129 return isl_int_sgn(cst->n);
132 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
134 struct isl_upoly_cst *cst;
138 if (!isl_upoly_is_cst(up))
141 cst = isl_upoly_as_cst(up);
145 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
148 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
150 struct isl_upoly_cst *cst;
154 if (!isl_upoly_is_cst(up))
157 cst = isl_upoly_as_cst(up);
161 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
164 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
166 struct isl_upoly_cst *cst;
170 if (!isl_upoly_is_cst(up))
173 cst = isl_upoly_as_cst(up);
177 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
180 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
182 struct isl_upoly_cst *cst;
186 if (!isl_upoly_is_cst(up))
189 cst = isl_upoly_as_cst(up);
193 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
196 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
198 struct isl_upoly_cst *cst;
202 if (!isl_upoly_is_cst(up))
205 cst = isl_upoly_as_cst(up);
209 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
212 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
214 struct isl_upoly_cst *cst;
216 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
225 isl_int_init(cst->n);
226 isl_int_init(cst->d);
231 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
233 struct isl_upoly_cst *cst;
235 cst = isl_upoly_cst_alloc(ctx);
239 isl_int_set_si(cst->n, 0);
240 isl_int_set_si(cst->d, 1);
245 __isl_give struct isl_upoly *isl_upoly_one(struct isl_ctx *ctx)
247 struct isl_upoly_cst *cst;
249 cst = isl_upoly_cst_alloc(ctx);
253 isl_int_set_si(cst->n, 1);
254 isl_int_set_si(cst->d, 1);
259 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
261 struct isl_upoly_cst *cst;
263 cst = isl_upoly_cst_alloc(ctx);
267 isl_int_set_si(cst->n, 1);
268 isl_int_set_si(cst->d, 0);
273 __isl_give struct isl_upoly *isl_upoly_neginfty(struct isl_ctx *ctx)
275 struct isl_upoly_cst *cst;
277 cst = isl_upoly_cst_alloc(ctx);
281 isl_int_set_si(cst->n, -1);
282 isl_int_set_si(cst->d, 0);
287 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
289 struct isl_upoly_cst *cst;
291 cst = isl_upoly_cst_alloc(ctx);
295 isl_int_set_si(cst->n, 0);
296 isl_int_set_si(cst->d, 0);
301 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
302 isl_int n, isl_int d)
304 struct isl_upoly_cst *cst;
306 cst = isl_upoly_cst_alloc(ctx);
310 isl_int_set(cst->n, n);
311 isl_int_set(cst->d, d);
316 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
319 struct isl_upoly_rec *rec;
321 isl_assert(ctx, var >= 0, return NULL);
322 isl_assert(ctx, size >= 0, return NULL);
323 rec = isl_calloc(ctx, struct isl_upoly_rec,
324 sizeof(struct isl_upoly_rec) +
325 (size - 1) * sizeof(struct isl_upoly *));
340 __isl_give isl_qpolynomial *isl_qpolynomial_reset_dim(
341 __isl_take isl_qpolynomial *qp, __isl_take isl_dim *dim)
343 qp = isl_qpolynomial_cow(qp);
347 isl_dim_free(qp->dim);
352 isl_qpolynomial_free(qp);
357 isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp)
359 return qp ? qp->dim->ctx : NULL;
362 __isl_give isl_dim *isl_qpolynomial_get_dim(__isl_keep isl_qpolynomial *qp)
364 return qp ? isl_dim_copy(qp->dim) : NULL;
367 unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp,
368 enum isl_dim_type type)
370 return qp ? isl_dim_size(qp->dim, type) : 0;
373 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
375 return qp ? isl_upoly_is_zero(qp->upoly) : -1;
378 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
380 return qp ? isl_upoly_is_one(qp->upoly) : -1;
383 int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
385 return qp ? isl_upoly_is_nan(qp->upoly) : -1;
388 int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
390 return qp ? isl_upoly_is_infty(qp->upoly) : -1;
393 int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
395 return qp ? isl_upoly_is_neginfty(qp->upoly) : -1;
398 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
400 return qp ? isl_upoly_sgn(qp->upoly) : 0;
403 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
405 isl_int_clear(cst->n);
406 isl_int_clear(cst->d);
409 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
413 for (i = 0; i < rec->n; ++i)
414 isl_upoly_free(rec->p[i]);
417 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
426 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
428 struct isl_upoly_cst *cst;
429 struct isl_upoly_cst *dup;
431 cst = isl_upoly_as_cst(up);
435 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
438 isl_int_set(dup->n, cst->n);
439 isl_int_set(dup->d, cst->d);
444 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
447 struct isl_upoly_rec *rec;
448 struct isl_upoly_rec *dup;
450 rec = isl_upoly_as_rec(up);
454 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
458 for (i = 0; i < rec->n; ++i) {
459 dup->p[i] = isl_upoly_copy(rec->p[i]);
467 isl_upoly_free(&dup->up);
471 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
473 struct isl_upoly *dup;
478 if (isl_upoly_is_cst(up))
479 return isl_upoly_dup_cst(up);
481 return isl_upoly_dup_rec(up);
484 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
492 return isl_upoly_dup(up);
495 void isl_upoly_free(__isl_take struct isl_upoly *up)
504 upoly_free_cst((struct isl_upoly_cst *)up);
506 upoly_free_rec((struct isl_upoly_rec *)up);
508 isl_ctx_deref(up->ctx);
512 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
517 isl_int_gcd(gcd, cst->n, cst->d);
518 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
519 isl_int_divexact(cst->n, cst->n, gcd);
520 isl_int_divexact(cst->d, cst->d, gcd);
525 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
526 __isl_take struct isl_upoly *up2)
528 struct isl_upoly_cst *cst1;
529 struct isl_upoly_cst *cst2;
531 up1 = isl_upoly_cow(up1);
535 cst1 = isl_upoly_as_cst(up1);
536 cst2 = isl_upoly_as_cst(up2);
538 if (isl_int_eq(cst1->d, cst2->d))
539 isl_int_add(cst1->n, cst1->n, cst2->n);
541 isl_int_mul(cst1->n, cst1->n, cst2->d);
542 isl_int_addmul(cst1->n, cst2->n, cst1->d);
543 isl_int_mul(cst1->d, cst1->d, cst2->d);
546 isl_upoly_cst_reduce(cst1);
556 static __isl_give struct isl_upoly *replace_by_zero(
557 __isl_take struct isl_upoly *up)
565 return isl_upoly_zero(ctx);
568 static __isl_give struct isl_upoly *replace_by_constant_term(
569 __isl_take struct isl_upoly *up)
571 struct isl_upoly_rec *rec;
572 struct isl_upoly *cst;
577 rec = isl_upoly_as_rec(up);
580 cst = isl_upoly_copy(rec->p[0]);
588 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
589 __isl_take struct isl_upoly *up2)
592 struct isl_upoly_rec *rec1, *rec2;
597 if (isl_upoly_is_nan(up1)) {
602 if (isl_upoly_is_nan(up2)) {
607 if (isl_upoly_is_zero(up1)) {
612 if (isl_upoly_is_zero(up2)) {
617 if (up1->var < up2->var)
618 return isl_upoly_sum(up2, up1);
620 if (up2->var < up1->var) {
621 struct isl_upoly_rec *rec;
622 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
626 up1 = isl_upoly_cow(up1);
627 rec = isl_upoly_as_rec(up1);
630 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
632 up1 = replace_by_constant_term(up1);
636 if (isl_upoly_is_cst(up1))
637 return isl_upoly_sum_cst(up1, up2);
639 rec1 = isl_upoly_as_rec(up1);
640 rec2 = isl_upoly_as_rec(up2);
644 if (rec1->n < rec2->n)
645 return isl_upoly_sum(up2, up1);
647 up1 = isl_upoly_cow(up1);
648 rec1 = isl_upoly_as_rec(up1);
652 for (i = rec2->n - 1; i >= 0; --i) {
653 rec1->p[i] = isl_upoly_sum(rec1->p[i],
654 isl_upoly_copy(rec2->p[i]));
657 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
658 isl_upoly_free(rec1->p[i]);
664 up1 = replace_by_zero(up1);
665 else if (rec1->n == 1)
666 up1 = replace_by_constant_term(up1);
677 __isl_give struct isl_upoly *isl_upoly_cst_add_isl_int(
678 __isl_take struct isl_upoly *up, isl_int v)
680 struct isl_upoly_cst *cst;
682 up = isl_upoly_cow(up);
686 cst = isl_upoly_as_cst(up);
688 isl_int_addmul(cst->n, cst->d, v);
693 __isl_give struct isl_upoly *isl_upoly_add_isl_int(
694 __isl_take struct isl_upoly *up, isl_int v)
696 struct isl_upoly_rec *rec;
701 if (isl_upoly_is_cst(up))
702 return isl_upoly_cst_add_isl_int(up, v);
704 up = isl_upoly_cow(up);
705 rec = isl_upoly_as_rec(up);
709 rec->p[0] = isl_upoly_add_isl_int(rec->p[0], v);
719 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
721 struct isl_upoly_cst *cst;
723 if (isl_upoly_is_zero(up))
726 up = isl_upoly_cow(up);
730 cst = isl_upoly_as_cst(up);
732 isl_int_neg(cst->n, cst->n);
737 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
740 struct isl_upoly_rec *rec;
745 if (isl_upoly_is_cst(up))
746 return isl_upoly_neg_cst(up);
748 up = isl_upoly_cow(up);
749 rec = isl_upoly_as_rec(up);
753 for (i = 0; i < rec->n; ++i) {
754 rec->p[i] = isl_upoly_neg(rec->p[i]);
765 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
766 __isl_take struct isl_upoly *up2)
768 struct isl_upoly_cst *cst1;
769 struct isl_upoly_cst *cst2;
771 up1 = isl_upoly_cow(up1);
775 cst1 = isl_upoly_as_cst(up1);
776 cst2 = isl_upoly_as_cst(up2);
778 isl_int_mul(cst1->n, cst1->n, cst2->n);
779 isl_int_mul(cst1->d, cst1->d, cst2->d);
781 isl_upoly_cst_reduce(cst1);
791 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
792 __isl_take struct isl_upoly *up2)
794 struct isl_upoly_rec *rec1;
795 struct isl_upoly_rec *rec2;
796 struct isl_upoly_rec *res;
800 rec1 = isl_upoly_as_rec(up1);
801 rec2 = isl_upoly_as_rec(up2);
804 size = rec1->n + rec2->n - 1;
805 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
809 for (i = 0; i < rec1->n; ++i) {
810 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
811 isl_upoly_copy(rec1->p[i]));
816 for (; i < size; ++i) {
817 res->p[i] = isl_upoly_zero(up1->ctx);
822 for (i = 0; i < rec1->n; ++i) {
823 for (j = 1; j < rec2->n; ++j) {
824 struct isl_upoly *up;
825 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
826 isl_upoly_copy(rec1->p[i]));
827 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
840 isl_upoly_free(&res->up);
844 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
845 __isl_take struct isl_upoly *up2)
850 if (isl_upoly_is_nan(up1)) {
855 if (isl_upoly_is_nan(up2)) {
860 if (isl_upoly_is_zero(up1)) {
865 if (isl_upoly_is_zero(up2)) {
870 if (isl_upoly_is_one(up1)) {
875 if (isl_upoly_is_one(up2)) {
880 if (up1->var < up2->var)
881 return isl_upoly_mul(up2, up1);
883 if (up2->var < up1->var) {
885 struct isl_upoly_rec *rec;
886 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
887 isl_ctx *ctx = up1->ctx;
890 return isl_upoly_nan(ctx);
892 up1 = isl_upoly_cow(up1);
893 rec = isl_upoly_as_rec(up1);
897 for (i = 0; i < rec->n; ++i) {
898 rec->p[i] = isl_upoly_mul(rec->p[i],
899 isl_upoly_copy(up2));
907 if (isl_upoly_is_cst(up1))
908 return isl_upoly_mul_cst(up1, up2);
910 return isl_upoly_mul_rec(up1, up2);
917 __isl_give struct isl_upoly *isl_upoly_pow(__isl_take struct isl_upoly *up,
920 struct isl_upoly *res;
928 res = isl_upoly_copy(up);
930 res = isl_upoly_one(up->ctx);
932 while (power >>= 1) {
933 up = isl_upoly_mul(up, isl_upoly_copy(up));
935 res = isl_upoly_mul(res, isl_upoly_copy(up));
942 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
943 unsigned n_div, __isl_take struct isl_upoly *up)
945 struct isl_qpolynomial *qp = NULL;
951 total = isl_dim_total(dim);
953 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
958 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
969 isl_qpolynomial_free(qp);
973 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
982 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
984 struct isl_qpolynomial *dup;
989 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row,
990 isl_upoly_copy(qp->upoly));
993 isl_mat_free(dup->div);
994 dup->div = isl_mat_copy(qp->div);
1000 isl_qpolynomial_free(dup);
1004 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
1012 return isl_qpolynomial_dup(qp);
1015 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
1023 isl_dim_free(qp->dim);
1024 isl_mat_free(qp->div);
1025 isl_upoly_free(qp->upoly);
1030 __isl_give struct isl_upoly *isl_upoly_var_pow(isl_ctx *ctx, int pos, int power)
1033 struct isl_upoly *up;
1034 struct isl_upoly_rec *rec;
1035 struct isl_upoly_cst *cst;
1037 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
1040 for (i = 0; i < 1 + power; ++i) {
1041 rec->p[i] = isl_upoly_zero(ctx);
1046 cst = isl_upoly_as_cst(rec->p[power]);
1047 isl_int_set_si(cst->n, 1);
1051 isl_upoly_free(&rec->up);
1055 /* r array maps original positions to new positions.
1057 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
1061 struct isl_upoly_rec *rec;
1062 struct isl_upoly *base;
1063 struct isl_upoly *res;
1065 if (isl_upoly_is_cst(up))
1068 rec = isl_upoly_as_rec(up);
1072 isl_assert(up->ctx, rec->n >= 1, goto error);
1074 base = isl_upoly_var_pow(up->ctx, r[up->var], 1);
1075 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
1077 for (i = rec->n - 2; i >= 0; --i) {
1078 res = isl_upoly_mul(res, isl_upoly_copy(base));
1079 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
1082 isl_upoly_free(base);
1091 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
1096 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1097 div1->n_col >= div2->n_col, return -1);
1099 if (div1->n_row == div2->n_row)
1100 return isl_mat_is_equal(div1, div2);
1102 n_row = div1->n_row;
1103 n_col = div1->n_col;
1104 div1->n_row = div2->n_row;
1105 div1->n_col = div2->n_col;
1107 equal = isl_mat_is_equal(div1, div2);
1109 div1->n_row = n_row;
1110 div1->n_col = n_col;
1115 static void expand_row(__isl_keep isl_mat *dst, int d,
1116 __isl_keep isl_mat *src, int s, int *exp)
1119 unsigned c = src->n_col - src->n_row;
1121 isl_seq_cpy(dst->row[d], src->row[s], c);
1122 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
1124 for (i = 0; i < s; ++i)
1125 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
1128 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
1132 li = isl_seq_last_non_zero(div->row[i], div->n_col);
1133 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
1138 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
1141 struct isl_div_sort_info {
1146 static int div_sort_cmp(const void *p1, const void *p2)
1148 const struct isl_div_sort_info *i1, *i2;
1149 i1 = (const struct isl_div_sort_info *) p1;
1150 i2 = (const struct isl_div_sort_info *) p2;
1152 return cmp_row(i1->div, i1->row, i2->row);
1155 /* Sort divs and remove duplicates.
1157 static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp)
1162 struct isl_div_sort_info *array = NULL;
1163 int *pos = NULL, *at = NULL;
1164 int *reordering = NULL;
1169 if (qp->div->n_row <= 1)
1172 div_pos = isl_dim_total(qp->dim);
1174 array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info,
1176 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1177 at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1178 len = qp->div->n_col - 2;
1179 reordering = isl_alloc_array(qp->div->ctx, int, len);
1180 if (!array || !pos || !at || !reordering)
1183 for (i = 0; i < qp->div->n_row; ++i) {
1184 array[i].div = qp->div;
1190 qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
1193 for (i = 0; i < div_pos; ++i)
1196 for (i = 0; i < qp->div->n_row; ++i) {
1197 if (pos[array[i].row] == i)
1199 qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]);
1200 pos[at[i]] = pos[array[i].row];
1201 at[pos[array[i].row]] = at[i];
1202 at[i] = array[i].row;
1203 pos[array[i].row] = i;
1207 for (i = 0; i < len - div_pos; ++i) {
1209 isl_seq_eq(qp->div->row[i - skip - 1],
1210 qp->div->row[i - skip], qp->div->n_col)) {
1211 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
1212 isl_mat_col_add(qp->div, 2 + div_pos + i - skip - 1,
1213 2 + div_pos + i - skip);
1214 qp->div = isl_mat_drop_cols(qp->div,
1215 2 + div_pos + i - skip, 1);
1218 reordering[div_pos + array[i].row] = div_pos + i - skip;
1221 qp->upoly = reorder(qp->upoly, reordering);
1223 if (!qp->upoly || !qp->div)
1237 isl_qpolynomial_free(qp);
1241 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
1242 __isl_keep isl_mat *div2, int *exp1, int *exp2)
1245 isl_mat *div = NULL;
1246 unsigned d = div1->n_col - div1->n_row;
1248 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
1249 d + div1->n_row + div2->n_row);
1253 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
1256 expand_row(div, k, div1, i, exp1);
1257 expand_row(div, k + 1, div2, j, exp2);
1259 cmp = cmp_row(div, k, k + 1);
1263 } else if (cmp < 0) {
1267 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1270 for (; i < div1->n_row; ++i, ++k) {
1271 expand_row(div, k, div1, i, exp1);
1274 for (; j < div2->n_row; ++j, ++k) {
1275 expand_row(div, k, div2, j, exp2);
1285 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1286 int *exp, int first)
1289 struct isl_upoly_rec *rec;
1291 if (isl_upoly_is_cst(up))
1294 if (up->var < first)
1297 if (exp[up->var - first] == up->var - first)
1300 up = isl_upoly_cow(up);
1304 up->var = exp[up->var - first] + first;
1306 rec = isl_upoly_as_rec(up);
1310 for (i = 0; i < rec->n; ++i) {
1311 rec->p[i] = expand(rec->p[i], exp, first);
1322 static __isl_give isl_qpolynomial *with_merged_divs(
1323 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1324 __isl_take isl_qpolynomial *qp2),
1325 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1329 isl_mat *div = NULL;
1331 qp1 = isl_qpolynomial_cow(qp1);
1332 qp2 = isl_qpolynomial_cow(qp2);
1337 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1338 qp1->div->n_col >= qp2->div->n_col, goto error);
1340 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1341 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1345 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1349 isl_mat_free(qp1->div);
1350 qp1->div = isl_mat_copy(div);
1351 isl_mat_free(qp2->div);
1352 qp2->div = isl_mat_copy(div);
1354 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1355 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1357 if (!qp1->upoly || !qp2->upoly)
1364 return fn(qp1, qp2);
1369 isl_qpolynomial_free(qp1);
1370 isl_qpolynomial_free(qp2);
1374 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1375 __isl_take isl_qpolynomial *qp2)
1377 qp1 = isl_qpolynomial_cow(qp1);
1382 if (qp1->div->n_row < qp2->div->n_row)
1383 return isl_qpolynomial_add(qp2, qp1);
1385 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1386 if (!compatible_divs(qp1->div, qp2->div))
1387 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1389 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1393 isl_qpolynomial_free(qp2);
1397 isl_qpolynomial_free(qp1);
1398 isl_qpolynomial_free(qp2);
1402 __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain(
1403 __isl_keep isl_set *dom,
1404 __isl_take isl_qpolynomial *qp1,
1405 __isl_take isl_qpolynomial *qp2)
1407 return isl_qpolynomial_add(qp1, qp2);
1410 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1411 __isl_take isl_qpolynomial *qp2)
1413 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1416 __isl_give isl_qpolynomial *isl_qpolynomial_add_isl_int(
1417 __isl_take isl_qpolynomial *qp, isl_int v)
1419 if (isl_int_is_zero(v))
1422 qp = isl_qpolynomial_cow(qp);
1426 qp->upoly = isl_upoly_add_isl_int(qp->upoly, v);
1432 isl_qpolynomial_free(qp);
1437 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1439 qp = isl_qpolynomial_cow(qp);
1444 qp->upoly = isl_upoly_neg(qp->upoly);
1450 isl_qpolynomial_free(qp);
1454 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1455 __isl_take isl_qpolynomial *qp2)
1457 qp1 = isl_qpolynomial_cow(qp1);
1462 if (qp1->div->n_row < qp2->div->n_row)
1463 return isl_qpolynomial_mul(qp2, qp1);
1465 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1466 if (!compatible_divs(qp1->div, qp2->div))
1467 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1469 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1473 isl_qpolynomial_free(qp2);
1477 isl_qpolynomial_free(qp1);
1478 isl_qpolynomial_free(qp2);
1482 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_qpolynomial *qp,
1485 qp = isl_qpolynomial_cow(qp);
1490 qp->upoly = isl_upoly_pow(qp->upoly, power);
1496 isl_qpolynomial_free(qp);
1500 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1502 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1505 __isl_give isl_qpolynomial *isl_qpolynomial_one(__isl_take isl_dim *dim)
1507 return isl_qpolynomial_alloc(dim, 0, isl_upoly_one(dim->ctx));
1510 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1512 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1515 __isl_give isl_qpolynomial *isl_qpolynomial_neginfty(__isl_take isl_dim *dim)
1517 return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx));
1520 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1522 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1525 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1528 struct isl_qpolynomial *qp;
1529 struct isl_upoly_cst *cst;
1531 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1535 cst = isl_upoly_as_cst(qp->upoly);
1536 isl_int_set(cst->n, v);
1541 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1542 isl_int *n, isl_int *d)
1544 struct isl_upoly_cst *cst;
1549 if (!isl_upoly_is_cst(qp->upoly))
1552 cst = isl_upoly_as_cst(qp->upoly);
1557 isl_int_set(*n, cst->n);
1559 isl_int_set(*d, cst->d);
1564 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1567 struct isl_upoly_rec *rec;
1575 rec = isl_upoly_as_rec(up);
1582 isl_assert(up->ctx, rec->n > 1, return -1);
1584 is_cst = isl_upoly_is_cst(rec->p[1]);
1590 return isl_upoly_is_affine(rec->p[0]);
1593 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1598 if (qp->div->n_row > 0)
1601 return isl_upoly_is_affine(qp->upoly);
1604 static void update_coeff(__isl_keep isl_vec *aff,
1605 __isl_keep struct isl_upoly_cst *cst, int pos)
1610 if (isl_int_is_zero(cst->n))
1615 isl_int_gcd(gcd, cst->d, aff->el[0]);
1616 isl_int_divexact(f, cst->d, gcd);
1617 isl_int_divexact(gcd, aff->el[0], gcd);
1618 isl_seq_scale(aff->el, aff->el, f, aff->size);
1619 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1624 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1625 __isl_keep isl_vec *aff)
1627 struct isl_upoly_cst *cst;
1628 struct isl_upoly_rec *rec;
1634 struct isl_upoly_cst *cst;
1636 cst = isl_upoly_as_cst(up);
1639 update_coeff(aff, cst, 0);
1643 rec = isl_upoly_as_rec(up);
1646 isl_assert(up->ctx, rec->n == 2, return -1);
1648 cst = isl_upoly_as_cst(rec->p[1]);
1651 update_coeff(aff, cst, 1 + up->var);
1653 return isl_upoly_update_affine(rec->p[0], aff);
1656 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1657 __isl_keep isl_qpolynomial *qp)
1665 isl_assert(qp->div->ctx, qp->div->n_row == 0, return NULL);
1666 d = isl_dim_total(qp->dim);
1667 aff = isl_vec_alloc(qp->div->ctx, 2 + d);
1671 isl_seq_clr(aff->el + 1, 1 + d);
1672 isl_int_set_si(aff->el[0], 1);
1674 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1683 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1684 __isl_keep isl_qpolynomial *qp2)
1689 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1692 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1695 struct isl_upoly_rec *rec;
1697 if (isl_upoly_is_cst(up)) {
1698 struct isl_upoly_cst *cst;
1699 cst = isl_upoly_as_cst(up);
1702 isl_int_lcm(*d, *d, cst->d);
1706 rec = isl_upoly_as_rec(up);
1710 for (i = 0; i < rec->n; ++i)
1711 upoly_update_den(rec->p[i], d);
1714 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1716 isl_int_set_si(*d, 1);
1719 upoly_update_den(qp->upoly, d);
1722 __isl_give isl_qpolynomial *isl_qpolynomial_var_pow(__isl_take isl_dim *dim,
1725 struct isl_ctx *ctx;
1732 return isl_qpolynomial_alloc(dim, 0, isl_upoly_var_pow(ctx, pos, power));
1735 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1736 enum isl_dim_type type, unsigned pos)
1741 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1742 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1744 if (type == isl_dim_set)
1745 pos += isl_dim_size(dim, isl_dim_param);
1747 return isl_qpolynomial_var_pow(dim, pos, 1);
1753 __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up,
1754 unsigned first, unsigned n, __isl_keep struct isl_upoly **subs)
1757 struct isl_upoly_rec *rec;
1758 struct isl_upoly *base, *res;
1763 if (isl_upoly_is_cst(up))
1766 if (up->var < first)
1769 rec = isl_upoly_as_rec(up);
1773 isl_assert(up->ctx, rec->n >= 1, goto error);
1775 if (up->var >= first + n)
1776 base = isl_upoly_var_pow(up->ctx, up->var, 1);
1778 base = isl_upoly_copy(subs[up->var - first]);
1780 res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs);
1781 for (i = rec->n - 2; i >= 0; --i) {
1782 struct isl_upoly *t;
1783 t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs);
1784 res = isl_upoly_mul(res, isl_upoly_copy(base));
1785 res = isl_upoly_sum(res, t);
1788 isl_upoly_free(base);
1797 __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f,
1798 isl_int denom, unsigned len)
1801 struct isl_upoly *up;
1803 isl_assert(ctx, len >= 1, return NULL);
1805 up = isl_upoly_rat_cst(ctx, f[0], denom);
1806 for (i = 0; i < len - 1; ++i) {
1807 struct isl_upoly *t;
1808 struct isl_upoly *c;
1810 if (isl_int_is_zero(f[1 + i]))
1813 c = isl_upoly_rat_cst(ctx, f[1 + i], denom);
1814 t = isl_upoly_var_pow(ctx, i, 1);
1815 t = isl_upoly_mul(c, t);
1816 up = isl_upoly_sum(up, t);
1822 /* Remove common factor of non-constant terms and denominator.
1824 static void normalize_div(__isl_keep isl_qpolynomial *qp, int div)
1826 isl_ctx *ctx = qp->div->ctx;
1827 unsigned total = qp->div->n_col - 2;
1829 isl_seq_gcd(qp->div->row[div] + 2, total, &ctx->normalize_gcd);
1830 isl_int_gcd(ctx->normalize_gcd,
1831 ctx->normalize_gcd, qp->div->row[div][0]);
1832 if (isl_int_is_one(ctx->normalize_gcd))
1835 isl_seq_scale_down(qp->div->row[div] + 2, qp->div->row[div] + 2,
1836 ctx->normalize_gcd, total);
1837 isl_int_divexact(qp->div->row[div][0], qp->div->row[div][0],
1838 ctx->normalize_gcd);
1839 isl_int_fdiv_q(qp->div->row[div][1], qp->div->row[div][1],
1840 ctx->normalize_gcd);
1843 /* Replace the integer division identified by "div" by the polynomial "s".
1844 * The integer division is assumed not to appear in the definition
1845 * of any other integer divisions.
1847 static __isl_give isl_qpolynomial *substitute_div(
1848 __isl_take isl_qpolynomial *qp,
1849 int div, __isl_take struct isl_upoly *s)
1858 qp = isl_qpolynomial_cow(qp);
1862 total = isl_dim_total(qp->dim);
1863 qp->upoly = isl_upoly_subs(qp->upoly, total + div, 1, &s);
1867 reordering = isl_alloc_array(qp->dim->ctx, int, total + qp->div->n_row);
1870 for (i = 0; i < total + div; ++i)
1872 for (i = total + div + 1; i < total + qp->div->n_row; ++i)
1873 reordering[i] = i - 1;
1874 qp->div = isl_mat_drop_rows(qp->div, div, 1);
1875 qp->div = isl_mat_drop_cols(qp->div, 2 + total + div, 1);
1876 qp->upoly = reorder(qp->upoly, reordering);
1879 if (!qp->upoly || !qp->div)
1885 isl_qpolynomial_free(qp);
1890 /* Replace all integer divisions [e/d] that turn out to not actually be integer
1891 * divisions because d is equal to 1 by their definition, i.e., e.
1893 static __isl_give isl_qpolynomial *substitute_non_divs(
1894 __isl_take isl_qpolynomial *qp)
1898 struct isl_upoly *s;
1903 total = isl_dim_total(qp->dim);
1904 for (i = 0; qp && i < qp->div->n_row; ++i) {
1905 if (!isl_int_is_one(qp->div->row[i][0]))
1907 for (j = i + 1; j < qp->div->n_row; ++j) {
1908 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
1910 isl_seq_combine(qp->div->row[j] + 1,
1911 qp->div->ctx->one, qp->div->row[j] + 1,
1912 qp->div->row[j][2 + total + i],
1913 qp->div->row[i] + 1, 1 + total + i);
1914 isl_int_set_si(qp->div->row[j][2 + total + i], 0);
1915 normalize_div(qp, j);
1917 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
1918 qp->div->row[i][0], qp->div->n_col - 1);
1919 qp = substitute_div(qp, i, s);
1926 /* Reduce the coefficients of div "div" to lie in the interval [0, d-1],
1927 * with d the denominator. When replacing the coefficient e of x by
1928 * d * frac(e/d) = e - d * floor(e/d), we are subtracting d * floor(e/d) * x
1929 * inside the division, so we need to add floor(e/d) * x outside.
1930 * That is, we replace q by q' + floor(e/d) * x and we therefore need
1931 * to adjust the coefficient of x in each later div that depends on the
1932 * current div "div" and also in the affine expression "aff"
1933 * (if it too depends on "div").
1935 static void reduce_div(__isl_keep isl_qpolynomial *qp, int div,
1936 __isl_keep isl_vec *aff)
1940 unsigned total = qp->div->n_col - qp->div->n_row - 2;
1943 for (i = 0; i < 1 + total + div; ++i) {
1944 if (isl_int_is_nonneg(qp->div->row[div][1 + i]) &&
1945 isl_int_lt(qp->div->row[div][1 + i], qp->div->row[div][0]))
1947 isl_int_fdiv_q(v, qp->div->row[div][1 + i], qp->div->row[div][0]);
1948 isl_int_fdiv_r(qp->div->row[div][1 + i],
1949 qp->div->row[div][1 + i], qp->div->row[div][0]);
1950 if (!isl_int_is_zero(aff->el[1 + total + div]))
1951 isl_int_addmul(aff->el[i], v, aff->el[1 + total + div]);
1952 for (j = div + 1; j < qp->div->n_row; ++j) {
1953 if (isl_int_is_zero(qp->div->row[j][2 + total + div]))
1955 isl_int_addmul(qp->div->row[j][1 + i],
1956 v, qp->div->row[j][2 + total + div]);
1962 /* Check if the last non-zero coefficient is bigger that half of the
1963 * denominator. If so, we will invert the div to further reduce the number
1964 * of distinct divs that may appear.
1965 * If the last non-zero coefficient is exactly half the denominator,
1966 * then we continue looking for earlier coefficients that are bigger
1967 * than half the denominator.
1969 static int needs_invert(__isl_keep isl_mat *div, int row)
1974 for (i = div->n_col - 1; i >= 1; --i) {
1975 if (isl_int_is_zero(div->row[row][i]))
1977 isl_int_mul_ui(div->row[row][i], div->row[row][i], 2);
1978 cmp = isl_int_cmp(div->row[row][i], div->row[row][0]);
1979 isl_int_divexact_ui(div->row[row][i], div->row[row][i], 2);
1989 /* Replace div "div" q = [e/d] by -[(-e+(d-1))/d].
1990 * We only invert the coefficients of e (and the coefficient of q in
1991 * later divs and in "aff"). After calling this function, the
1992 * coefficients of e should be reduced again.
1994 static void invert_div(__isl_keep isl_qpolynomial *qp, int div,
1995 __isl_keep isl_vec *aff)
1997 unsigned total = qp->div->n_col - qp->div->n_row - 2;
1999 isl_seq_neg(qp->div->row[div] + 1,
2000 qp->div->row[div] + 1, qp->div->n_col - 1);
2001 isl_int_sub_ui(qp->div->row[div][1], qp->div->row[div][1], 1);
2002 isl_int_add(qp->div->row[div][1],
2003 qp->div->row[div][1], qp->div->row[div][0]);
2004 if (!isl_int_is_zero(aff->el[1 + total + div]))
2005 isl_int_neg(aff->el[1 + total + div], aff->el[1 + total + div]);
2006 isl_mat_col_mul(qp->div, 2 + total + div,
2007 qp->div->ctx->negone, 2 + total + div);
2010 /* Assuming "qp" is a monomial, reduce all its divs to have coefficients
2011 * in the interval [0, d-1], with d the denominator and such that the
2012 * last non-zero coefficient that is not equal to d/2 is smaller than d/2.
2014 * After the reduction, some divs may have become redundant or identical,
2015 * so we call substitute_non_divs and sort_divs. If these functions
2016 * eliminate divs of merge * two or more divs into one, the coefficients
2017 * of the enclosing divs may have to be reduced again, so we call
2018 * ourselves recursively if the number of divs decreases.
2020 static __isl_give isl_qpolynomial *reduce_divs(__isl_take isl_qpolynomial *qp)
2023 isl_vec *aff = NULL;
2024 struct isl_upoly *s;
2030 aff = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);
2031 aff = isl_vec_clr(aff);
2035 isl_int_set_si(aff->el[1 + qp->upoly->var], 1);
2037 for (i = 0; i < qp->div->n_row; ++i) {
2038 normalize_div(qp, i);
2039 reduce_div(qp, i, aff);
2040 if (needs_invert(qp->div, i)) {
2041 invert_div(qp, i, aff);
2042 reduce_div(qp, i, aff);
2046 s = isl_upoly_from_affine(qp->div->ctx, aff->el,
2047 qp->div->ctx->one, aff->size);
2048 qp->upoly = isl_upoly_subs(qp->upoly, qp->upoly->var, 1, &s);
2055 n_div = qp->div->n_row;
2056 qp = substitute_non_divs(qp);
2058 if (qp && qp->div->n_row < n_div)
2059 return reduce_divs(qp);
2063 isl_qpolynomial_free(qp);
2068 /* Assumes each div only depends on earlier divs.
2070 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
2073 struct isl_qpolynomial *qp = NULL;
2074 struct isl_upoly_rec *rec;
2075 struct isl_upoly_cst *cst;
2082 d = div->line - div->bmap->div;
2084 pos = isl_dim_total(div->bmap->dim) + d;
2085 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
2086 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap),
2087 div->bmap->n_div, &rec->up);
2091 for (i = 0; i < div->bmap->n_div; ++i)
2092 isl_seq_cpy(qp->div->row[i], div->bmap->div[i], qp->div->n_col);
2094 for (i = 0; i < 1 + power; ++i) {
2095 rec->p[i] = isl_upoly_zero(div->ctx);
2100 cst = isl_upoly_as_cst(rec->p[power]);
2101 isl_int_set_si(cst->n, 1);
2105 qp = reduce_divs(qp);
2109 isl_qpolynomial_free(qp);
2114 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
2116 return isl_qpolynomial_div_pow(div, 1);
2119 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
2120 const isl_int n, const isl_int d)
2122 struct isl_qpolynomial *qp;
2123 struct isl_upoly_cst *cst;
2125 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
2129 cst = isl_upoly_as_cst(qp->upoly);
2130 isl_int_set(cst->n, n);
2131 isl_int_set(cst->d, d);
2136 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
2138 struct isl_upoly_rec *rec;
2144 if (isl_upoly_is_cst(up))
2148 active[up->var] = 1;
2150 rec = isl_upoly_as_rec(up);
2151 for (i = 0; i < rec->n; ++i)
2152 if (up_set_active(rec->p[i], active, d) < 0)
2158 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
2161 int d = isl_dim_total(qp->dim);
2166 for (i = 0; i < d; ++i)
2167 for (j = 0; j < qp->div->n_row; ++j) {
2168 if (isl_int_is_zero(qp->div->row[j][2 + i]))
2174 return up_set_active(qp->upoly, active, d);
2177 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
2178 enum isl_dim_type type, unsigned first, unsigned n)
2189 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2191 isl_assert(qp->dim->ctx, type == isl_dim_param ||
2192 type == isl_dim_set, return -1);
2194 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
2195 if (set_active(qp, active) < 0)
2198 if (type == isl_dim_set)
2199 first += isl_dim_size(qp->dim, isl_dim_param);
2200 for (i = 0; i < n; ++i)
2201 if (active[first + i]) {
2214 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
2215 unsigned first, unsigned n)
2218 struct isl_upoly_rec *rec;
2222 if (n == 0 || up->var < 0 || up->var < first)
2224 if (up->var < first + n) {
2225 up = replace_by_constant_term(up);
2226 return isl_upoly_drop(up, first, n);
2228 up = isl_upoly_cow(up);
2232 rec = isl_upoly_as_rec(up);
2236 for (i = 0; i < rec->n; ++i) {
2237 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
2248 __isl_give isl_qpolynomial *isl_qpolynomial_set_dim_name(
2249 __isl_take isl_qpolynomial *qp,
2250 enum isl_dim_type type, unsigned pos, const char *s)
2252 qp = isl_qpolynomial_cow(qp);
2255 qp->dim = isl_dim_set_name(qp->dim, type, pos, s);
2260 isl_qpolynomial_free(qp);
2264 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
2265 __isl_take isl_qpolynomial *qp,
2266 enum isl_dim_type type, unsigned first, unsigned n)
2270 if (n == 0 && !isl_dim_get_tuple_name(qp->dim, type))
2273 qp = isl_qpolynomial_cow(qp);
2277 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2279 isl_assert(qp->dim->ctx, type == isl_dim_param ||
2280 type == isl_dim_set, goto error);
2282 qp->dim = isl_dim_drop(qp->dim, type, first, n);
2286 if (type == isl_dim_set)
2287 first += isl_dim_size(qp->dim, isl_dim_param);
2289 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
2293 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
2299 isl_qpolynomial_free(qp);
2303 __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities(
2304 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
2310 struct isl_upoly *up;
2314 if (eq->n_eq == 0) {
2315 isl_basic_set_free(eq);
2319 qp = isl_qpolynomial_cow(qp);
2322 qp->div = isl_mat_cow(qp->div);
2326 total = 1 + isl_dim_total(eq->dim);
2328 isl_int_init(denom);
2329 for (i = 0; i < eq->n_eq; ++i) {
2330 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
2331 if (j < 0 || j == 0 || j >= total)
2334 for (k = 0; k < qp->div->n_row; ++k) {
2335 if (isl_int_is_zero(qp->div->row[k][1 + j]))
2337 isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total,
2338 &qp->div->row[k][0]);
2339 normalize_div(qp, k);
2342 if (isl_int_is_pos(eq->eq[i][j]))
2343 isl_seq_neg(eq->eq[i], eq->eq[i], total);
2344 isl_int_abs(denom, eq->eq[i][j]);
2345 isl_int_set_si(eq->eq[i][j], 0);
2347 up = isl_upoly_from_affine(qp->dim->ctx,
2348 eq->eq[i], denom, total);
2349 qp->upoly = isl_upoly_subs(qp->upoly, j - 1, 1, &up);
2352 isl_int_clear(denom);
2357 isl_basic_set_free(eq);
2359 qp = substitute_non_divs(qp);
2364 isl_basic_set_free(eq);
2365 isl_qpolynomial_free(qp);
2369 static __isl_give isl_basic_set *add_div_constraints(
2370 __isl_take isl_basic_set *bset, __isl_take isl_mat *div)
2378 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2381 total = isl_basic_set_total_dim(bset);
2382 for (i = 0; i < div->n_row; ++i)
2383 if (isl_basic_set_add_div_constraints_var(bset,
2384 total - div->n_row + i, div->row[i]) < 0)
2391 isl_basic_set_free(bset);
2395 /* Look for equalities among the variables shared by context and qp
2396 * and the integer divisions of qp, if any.
2397 * The equalities are then used to eliminate variables and/or integer
2398 * divisions from qp.
2400 __isl_give isl_qpolynomial *isl_qpolynomial_gist(
2401 __isl_take isl_qpolynomial *qp, __isl_take isl_set *context)
2407 if (qp->div->n_row > 0) {
2408 isl_basic_set *bset;
2409 context = isl_set_add_dims(context, isl_dim_set,
2411 bset = isl_basic_set_universe(isl_set_get_dim(context));
2412 bset = add_div_constraints(bset, isl_mat_copy(qp->div));
2413 context = isl_set_intersect(context,
2414 isl_set_from_basic_set(bset));
2417 aff = isl_set_affine_hull(context);
2418 return isl_qpolynomial_substitute_equalities(qp, aff);
2420 isl_qpolynomial_free(qp);
2421 isl_set_free(context);
2426 #define PW isl_pw_qpolynomial
2428 #define EL isl_qpolynomial
2430 #define IS_ZERO is_zero
2434 #include <isl_pw_templ.c>
2437 #define UNION isl_union_pw_qpolynomial
2439 #define PART isl_pw_qpolynomial
2441 #define PARTS pw_qpolynomial
2443 #include <isl_union_templ.c>
2445 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
2453 if (!isl_set_fast_is_universe(pwqp->p[0].set))
2456 return isl_qpolynomial_is_one(pwqp->p[0].qp);
2459 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
2460 __isl_take isl_pw_qpolynomial *pwqp1,
2461 __isl_take isl_pw_qpolynomial *pwqp2)
2464 struct isl_pw_qpolynomial *res;
2467 if (!pwqp1 || !pwqp2)
2470 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
2473 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
2474 isl_pw_qpolynomial_free(pwqp2);
2478 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
2479 isl_pw_qpolynomial_free(pwqp1);
2483 if (isl_pw_qpolynomial_is_one(pwqp1)) {
2484 isl_pw_qpolynomial_free(pwqp1);
2488 if (isl_pw_qpolynomial_is_one(pwqp2)) {
2489 isl_pw_qpolynomial_free(pwqp2);
2493 n = pwqp1->n * pwqp2->n;
2494 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
2496 for (i = 0; i < pwqp1->n; ++i) {
2497 for (j = 0; j < pwqp2->n; ++j) {
2498 struct isl_set *common;
2499 struct isl_qpolynomial *prod;
2500 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
2501 isl_set_copy(pwqp2->p[j].set));
2502 if (isl_set_fast_is_empty(common)) {
2503 isl_set_free(common);
2507 prod = isl_qpolynomial_mul(
2508 isl_qpolynomial_copy(pwqp1->p[i].qp),
2509 isl_qpolynomial_copy(pwqp2->p[j].qp));
2511 res = isl_pw_qpolynomial_add_piece(res, common, prod);
2515 isl_pw_qpolynomial_free(pwqp1);
2516 isl_pw_qpolynomial_free(pwqp2);
2520 isl_pw_qpolynomial_free(pwqp1);
2521 isl_pw_qpolynomial_free(pwqp2);
2525 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
2526 __isl_take isl_pw_qpolynomial *pwqp)
2533 if (isl_pw_qpolynomial_is_zero(pwqp))
2536 pwqp = isl_pw_qpolynomial_cow(pwqp);
2540 for (i = 0; i < pwqp->n; ++i) {
2541 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
2548 isl_pw_qpolynomial_free(pwqp);
2552 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
2553 __isl_take isl_pw_qpolynomial *pwqp1,
2554 __isl_take isl_pw_qpolynomial *pwqp2)
2556 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
2559 __isl_give struct isl_upoly *isl_upoly_eval(
2560 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
2563 struct isl_upoly_rec *rec;
2564 struct isl_upoly *res;
2565 struct isl_upoly *base;
2567 if (isl_upoly_is_cst(up)) {
2572 rec = isl_upoly_as_rec(up);
2576 isl_assert(up->ctx, rec->n >= 1, goto error);
2578 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
2580 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
2583 for (i = rec->n - 2; i >= 0; --i) {
2584 res = isl_upoly_mul(res, isl_upoly_copy(base));
2585 res = isl_upoly_sum(res,
2586 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
2587 isl_vec_copy(vec)));
2590 isl_upoly_free(base);
2600 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
2601 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
2604 struct isl_upoly *up;
2609 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
2611 if (qp->div->n_row == 0)
2612 ext = isl_vec_copy(pnt->vec);
2615 unsigned dim = isl_dim_total(qp->dim);
2616 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
2620 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
2621 for (i = 0; i < qp->div->n_row; ++i) {
2622 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
2623 1 + dim + i, &ext->el[1+dim+i]);
2624 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
2625 qp->div->row[i][0]);
2629 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
2633 dim = isl_dim_copy(qp->dim);
2634 isl_qpolynomial_free(qp);
2635 isl_point_free(pnt);
2637 return isl_qpolynomial_alloc(dim, 0, up);
2639 isl_qpolynomial_free(qp);
2640 isl_point_free(pnt);
2644 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
2645 __isl_keep struct isl_upoly_cst *cst2)
2650 isl_int_mul(t, cst1->n, cst2->d);
2651 isl_int_submul(t, cst2->n, cst1->d);
2652 cmp = isl_int_sgn(t);
2657 int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1,
2658 __isl_keep isl_qpolynomial *qp2)
2660 struct isl_upoly_cst *cst1, *cst2;
2664 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), return -1);
2665 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), return -1);
2666 if (isl_qpolynomial_is_nan(qp1))
2668 if (isl_qpolynomial_is_nan(qp2))
2670 cst1 = isl_upoly_as_cst(qp1->upoly);
2671 cst2 = isl_upoly_as_cst(qp2->upoly);
2673 return isl_upoly_cmp(cst1, cst2) <= 0;
2676 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
2677 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2679 struct isl_upoly_cst *cst1, *cst2;
2684 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2685 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2686 cst1 = isl_upoly_as_cst(qp1->upoly);
2687 cst2 = isl_upoly_as_cst(qp2->upoly);
2688 cmp = isl_upoly_cmp(cst1, cst2);
2691 isl_qpolynomial_free(qp2);
2693 isl_qpolynomial_free(qp1);
2698 isl_qpolynomial_free(qp1);
2699 isl_qpolynomial_free(qp2);
2703 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
2704 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2706 struct isl_upoly_cst *cst1, *cst2;
2711 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2712 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2713 cst1 = isl_upoly_as_cst(qp1->upoly);
2714 cst2 = isl_upoly_as_cst(qp2->upoly);
2715 cmp = isl_upoly_cmp(cst1, cst2);
2718 isl_qpolynomial_free(qp2);
2720 isl_qpolynomial_free(qp1);
2725 isl_qpolynomial_free(qp1);
2726 isl_qpolynomial_free(qp2);
2730 __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
2731 __isl_take isl_qpolynomial *qp, enum isl_dim_type type,
2732 unsigned first, unsigned n)
2741 qp = isl_qpolynomial_cow(qp);
2745 isl_assert(qp->div->ctx, first <= isl_dim_size(qp->dim, type),
2748 g_pos = pos(qp->dim, type) + first;
2750 qp->div = isl_mat_insert_cols(qp->div, 2 + g_pos, n);
2754 total = qp->div->n_col - 2;
2755 if (total > g_pos) {
2757 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2760 for (i = 0; i < total - g_pos; ++i)
2762 qp->upoly = expand(qp->upoly, exp, g_pos);
2768 qp->dim = isl_dim_insert(qp->dim, type, first, n);
2774 isl_qpolynomial_free(qp);
2778 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
2779 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2783 pos = isl_qpolynomial_dim(qp, type);
2785 return isl_qpolynomial_insert_dims(qp, type, pos, n);
2788 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2789 __isl_take isl_pw_qpolynomial *pwqp,
2790 enum isl_dim_type type, unsigned n)
2794 pos = isl_pw_qpolynomial_dim(pwqp, type);
2796 return isl_pw_qpolynomial_insert_dims(pwqp, type, pos, n);
2799 static int *reordering_move(isl_ctx *ctx,
2800 unsigned len, unsigned dst, unsigned src, unsigned n)
2805 reordering = isl_alloc_array(ctx, int, len);
2810 for (i = 0; i < dst; ++i)
2812 for (i = 0; i < n; ++i)
2813 reordering[src + i] = dst + i;
2814 for (i = 0; i < src - dst; ++i)
2815 reordering[dst + i] = dst + n + i;
2816 for (i = 0; i < len - src - n; ++i)
2817 reordering[src + n + i] = src + n + i;
2819 for (i = 0; i < src; ++i)
2821 for (i = 0; i < n; ++i)
2822 reordering[src + i] = dst + i;
2823 for (i = 0; i < dst - src; ++i)
2824 reordering[src + n + i] = src + i;
2825 for (i = 0; i < len - dst - n; ++i)
2826 reordering[dst + n + i] = dst + n + i;
2832 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
2833 __isl_take isl_qpolynomial *qp,
2834 enum isl_dim_type dst_type, unsigned dst_pos,
2835 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2841 qp = isl_qpolynomial_cow(qp);
2845 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2848 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2849 g_src_pos = pos(qp->dim, src_type) + src_pos;
2850 if (dst_type > src_type)
2853 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2860 reordering = reordering_move(qp->dim->ctx,
2861 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2865 qp->upoly = reorder(qp->upoly, reordering);
2870 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2876 isl_qpolynomial_free(qp);
2880 __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_dim *dim,
2881 isl_int *f, isl_int denom)
2883 struct isl_upoly *up;
2888 up = isl_upoly_from_affine(dim->ctx, f, denom, 1 + isl_dim_total(dim));
2890 return isl_qpolynomial_alloc(dim, 0, up);
2893 __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
2894 __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
2898 struct isl_upoly *up;
2899 isl_qpolynomial *qp;
2905 isl_int_init(denom);
2907 isl_constraint_get_coefficient(c, type, pos, &denom);
2908 isl_constraint_set_coefficient(c, type, pos, c->ctx->zero);
2909 sgn = isl_int_sgn(denom);
2910 isl_int_abs(denom, denom);
2911 up = isl_upoly_from_affine(c->ctx, c->line[0], denom,
2912 1 + isl_constraint_dim(c, isl_dim_all));
2914 isl_int_neg(denom, denom);
2915 isl_constraint_set_coefficient(c, type, pos, denom);
2917 dim = isl_dim_copy(c->bmap->dim);
2919 isl_int_clear(denom);
2920 isl_constraint_free(c);
2922 qp = isl_qpolynomial_alloc(dim, 0, up);
2924 qp = isl_qpolynomial_neg(qp);
2928 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
2929 * in "qp" by subs[i].
2931 __isl_give isl_qpolynomial *isl_qpolynomial_substitute(
2932 __isl_take isl_qpolynomial *qp,
2933 enum isl_dim_type type, unsigned first, unsigned n,
2934 __isl_keep isl_qpolynomial **subs)
2937 struct isl_upoly **ups;
2942 qp = isl_qpolynomial_cow(qp);
2945 for (i = 0; i < n; ++i)
2949 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2952 for (i = 0; i < n; ++i)
2953 isl_assert(qp->dim->ctx, isl_dim_equal(qp->dim, subs[i]->dim),
2956 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
2957 for (i = 0; i < n; ++i)
2958 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
2960 first += pos(qp->dim, type);
2962 ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n);
2965 for (i = 0; i < n; ++i)
2966 ups[i] = subs[i]->upoly;
2968 qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups);
2977 isl_qpolynomial_free(qp);
2981 /* Extend "bset" with extra set dimensions for each integer division
2982 * in "qp" and then call "fn" with the extended bset and the polynomial
2983 * that results from replacing each of the integer divisions by the
2984 * corresponding extra set dimension.
2986 int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
2987 __isl_keep isl_basic_set *bset,
2988 int (*fn)(__isl_take isl_basic_set *bset,
2989 __isl_take isl_qpolynomial *poly, void *user), void *user)
2993 isl_qpolynomial *poly;
2997 if (qp->div->n_row == 0)
2998 return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
3001 div = isl_mat_copy(qp->div);
3002 dim = isl_dim_copy(qp->dim);
3003 dim = isl_dim_add(dim, isl_dim_set, qp->div->n_row);
3004 poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly));
3005 bset = isl_basic_set_copy(bset);
3006 bset = isl_basic_set_add(bset, isl_dim_set, qp->div->n_row);
3007 bset = add_div_constraints(bset, div);
3009 return fn(bset, poly, user);
3014 /* Return total degree in variables first (inclusive) up to last (exclusive).
3016 int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last)
3020 struct isl_upoly_rec *rec;
3024 if (isl_upoly_is_zero(up))
3026 if (isl_upoly_is_cst(up) || up->var < first)
3029 rec = isl_upoly_as_rec(up);
3033 for (i = 0; i < rec->n; ++i) {
3036 if (isl_upoly_is_zero(rec->p[i]))
3038 d = isl_upoly_degree(rec->p[i], first, last);
3048 /* Return total degree in set variables.
3050 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
3058 ovar = isl_dim_offset(poly->dim, isl_dim_set);
3059 nvar = isl_dim_size(poly->dim, isl_dim_set);
3060 return isl_upoly_degree(poly->upoly, ovar, ovar + nvar);
3063 __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up,
3064 unsigned pos, int deg)
3067 struct isl_upoly_rec *rec;
3072 if (isl_upoly_is_cst(up) || up->var < pos) {
3074 return isl_upoly_copy(up);
3076 return isl_upoly_zero(up->ctx);
3079 rec = isl_upoly_as_rec(up);
3083 if (up->var == pos) {
3085 return isl_upoly_copy(rec->p[deg]);
3087 return isl_upoly_zero(up->ctx);
3090 up = isl_upoly_copy(up);
3091 up = isl_upoly_cow(up);
3092 rec = isl_upoly_as_rec(up);
3096 for (i = 0; i < rec->n; ++i) {
3097 struct isl_upoly *t;
3098 t = isl_upoly_coeff(rec->p[i], pos, deg);
3101 isl_upoly_free(rec->p[i]);
3111 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
3113 __isl_give isl_qpolynomial *isl_qpolynomial_coeff(
3114 __isl_keep isl_qpolynomial *qp,
3115 enum isl_dim_type type, unsigned t_pos, int deg)
3118 struct isl_upoly *up;
3124 isl_assert(qp->div->ctx, t_pos < isl_dim_size(qp->dim, type),
3127 g_pos = pos(qp->dim, type) + t_pos;
3128 up = isl_upoly_coeff(qp->upoly, g_pos, deg);
3130 c = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row, up);
3133 isl_mat_free(c->div);
3134 c->div = isl_mat_copy(qp->div);
3139 isl_qpolynomial_free(c);
3143 /* Homogenize the polynomial in the variables first (inclusive) up to
3144 * last (exclusive) by inserting powers of variable first.
3145 * Variable first is assumed not to appear in the input.
3147 __isl_give struct isl_upoly *isl_upoly_homogenize(
3148 __isl_take struct isl_upoly *up, int deg, int target,
3149 int first, int last)
3152 struct isl_upoly_rec *rec;
3156 if (isl_upoly_is_zero(up))
3160 if (isl_upoly_is_cst(up) || up->var < first) {
3161 struct isl_upoly *hom;
3163 hom = isl_upoly_var_pow(up->ctx, first, target - deg);
3166 rec = isl_upoly_as_rec(hom);
3167 rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up);
3172 up = isl_upoly_cow(up);
3173 rec = isl_upoly_as_rec(up);
3177 for (i = 0; i < rec->n; ++i) {
3178 if (isl_upoly_is_zero(rec->p[i]))
3180 rec->p[i] = isl_upoly_homogenize(rec->p[i],
3181 up->var < last ? deg + i : i, target,
3193 /* Homogenize the polynomial in the set variables by introducing
3194 * powers of an extra set variable at position 0.
3196 __isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
3197 __isl_take isl_qpolynomial *poly)
3201 int deg = isl_qpolynomial_degree(poly);
3206 poly = isl_qpolynomial_insert_dims(poly, isl_dim_set, 0, 1);
3207 poly = isl_qpolynomial_cow(poly);
3211 ovar = isl_dim_offset(poly->dim, isl_dim_set);
3212 nvar = isl_dim_size(poly->dim, isl_dim_set);
3213 poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg,
3220 isl_qpolynomial_free(poly);
3224 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
3225 __isl_take isl_mat *div)
3233 n = isl_dim_total(dim) + div->n_row;
3235 term = isl_calloc(dim->ctx, struct isl_term,
3236 sizeof(struct isl_term) + (n - 1) * sizeof(int));
3243 isl_int_init(term->n);
3244 isl_int_init(term->d);
3253 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
3262 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
3271 total = isl_dim_total(term->dim) + term->div->n_row;
3273 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
3277 isl_int_set(dup->n, term->n);
3278 isl_int_set(dup->d, term->d);
3280 for (i = 0; i < total; ++i)
3281 dup->pow[i] = term->pow[i];
3286 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
3294 return isl_term_dup(term);
3297 void isl_term_free(__isl_take isl_term *term)
3302 if (--term->ref > 0)
3305 isl_dim_free(term->dim);
3306 isl_mat_free(term->div);
3307 isl_int_clear(term->n);
3308 isl_int_clear(term->d);
3312 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
3320 case isl_dim_out: return isl_dim_size(term->dim, type);
3321 case isl_dim_div: return term->div->n_row;
3322 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
3327 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
3329 return term ? term->dim->ctx : NULL;
3332 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
3336 isl_int_set(*n, term->n);
3339 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
3343 isl_int_set(*d, term->d);
3346 int isl_term_get_exp(__isl_keep isl_term *term,
3347 enum isl_dim_type type, unsigned pos)
3352 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
3354 if (type >= isl_dim_set)
3355 pos += isl_dim_size(term->dim, isl_dim_param);
3356 if (type >= isl_dim_div)
3357 pos += isl_dim_size(term->dim, isl_dim_set);
3359 return term->pow[pos];
3362 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
3364 isl_basic_map *bmap;
3371 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
3374 total = term->div->n_col - term->div->n_row - 2;
3375 /* No nested divs for now */
3376 isl_assert(term->dim->ctx,
3377 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
3378 term->div->n_row) == -1,
3381 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
3382 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
3385 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
3387 return isl_basic_map_div(bmap, k);
3389 isl_basic_map_free(bmap);
3393 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
3394 int (*fn)(__isl_take isl_term *term, void *user),
3395 __isl_take isl_term *term, void *user)
3398 struct isl_upoly_rec *rec;
3403 if (isl_upoly_is_zero(up))
3406 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
3407 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
3408 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
3410 if (isl_upoly_is_cst(up)) {
3411 struct isl_upoly_cst *cst;
3412 cst = isl_upoly_as_cst(up);
3415 term = isl_term_cow(term);
3418 isl_int_set(term->n, cst->n);
3419 isl_int_set(term->d, cst->d);
3420 if (fn(isl_term_copy(term), user) < 0)
3425 rec = isl_upoly_as_rec(up);
3429 for (i = 0; i < rec->n; ++i) {
3430 term = isl_term_cow(term);
3433 term->pow[up->var] = i;
3434 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
3438 term->pow[up->var] = 0;
3442 isl_term_free(term);
3446 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
3447 int (*fn)(__isl_take isl_term *term, void *user), void *user)
3454 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
3458 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
3460 isl_term_free(term);
3462 return term ? 0 : -1;
3465 __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
3467 struct isl_upoly *up;
3468 isl_qpolynomial *qp;
3474 n = isl_dim_total(term->dim) + term->div->n_row;
3476 up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d);
3477 for (i = 0; i < n; ++i) {
3480 up = isl_upoly_mul(up,
3481 isl_upoly_var_pow(term->dim->ctx, i, term->pow[i]));
3484 qp = isl_qpolynomial_alloc(isl_dim_copy(term->dim), term->div->n_row, up);
3487 isl_mat_free(qp->div);
3488 qp->div = isl_mat_copy(term->div);
3492 isl_term_free(term);
3495 isl_qpolynomial_free(qp);
3496 isl_term_free(term);
3500 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
3501 __isl_take isl_dim *dim)
3510 if (isl_dim_equal(qp->dim, dim)) {
3515 qp = isl_qpolynomial_cow(qp);
3519 extra = isl_dim_size(dim, isl_dim_set) -
3520 isl_dim_size(qp->dim, isl_dim_set);
3521 total = isl_dim_total(qp->dim);
3522 if (qp->div->n_row) {
3525 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
3528 for (i = 0; i < qp->div->n_row; ++i)
3530 qp->upoly = expand(qp->upoly, exp, total);
3535 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
3538 for (i = 0; i < qp->div->n_row; ++i)
3539 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
3541 isl_dim_free(qp->dim);
3547 isl_qpolynomial_free(qp);
3551 /* For each parameter or variable that does not appear in qp,
3552 * first eliminate the variable from all constraints and then set it to zero.
3554 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
3555 __isl_keep isl_qpolynomial *qp)
3566 d = isl_dim_total(set->dim);
3567 active = isl_calloc_array(set->ctx, int, d);
3568 if (set_active(qp, active) < 0)
3571 for (i = 0; i < d; ++i)
3580 nparam = isl_dim_size(set->dim, isl_dim_param);
3581 nvar = isl_dim_size(set->dim, isl_dim_set);
3582 for (i = 0; i < nparam; ++i) {
3585 set = isl_set_eliminate(set, isl_dim_param, i, 1);
3586 set = isl_set_fix_si(set, isl_dim_param, i, 0);
3588 for (i = 0; i < nvar; ++i) {
3589 if (active[nparam + i])
3591 set = isl_set_eliminate(set, isl_dim_set, i, 1);
3592 set = isl_set_fix_si(set, isl_dim_set, i, 0);
3604 struct isl_opt_data {
3605 isl_qpolynomial *qp;
3607 isl_qpolynomial *opt;
3611 static int opt_fn(__isl_take isl_point *pnt, void *user)
3613 struct isl_opt_data *data = (struct isl_opt_data *)user;
3614 isl_qpolynomial *val;
3616 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
3620 } else if (data->max) {
3621 data->opt = isl_qpolynomial_max_cst(data->opt, val);
3623 data->opt = isl_qpolynomial_min_cst(data->opt, val);
3629 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
3630 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
3632 struct isl_opt_data data = { NULL, 1, NULL, max };
3637 if (isl_upoly_is_cst(qp->upoly)) {
3642 set = fix_inactive(set, qp);
3645 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
3649 data.opt = isl_qpolynomial_zero(isl_qpolynomial_get_dim(qp));
3652 isl_qpolynomial_free(qp);
3656 isl_qpolynomial_free(qp);
3657 isl_qpolynomial_free(data.opt);
3661 __isl_give isl_qpolynomial *isl_qpolynomial_morph(__isl_take isl_qpolynomial *qp,
3662 __isl_take isl_morph *morph)
3667 struct isl_upoly *up;
3669 struct isl_upoly **subs;
3672 qp = isl_qpolynomial_cow(qp);
3677 isl_assert(ctx, isl_dim_equal(qp->dim, morph->dom->dim), goto error);
3679 n_sub = morph->inv->n_row - 1;
3680 if (morph->inv->n_row != morph->inv->n_col)
3681 n_sub += qp->div->n_row;
3682 subs = isl_calloc_array(ctx, struct isl_upoly *, n_sub);
3686 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3687 subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i],
3688 morph->inv->row[0][0], morph->inv->n_col);
3689 if (morph->inv->n_row != morph->inv->n_col)
3690 for (i = 0; i < qp->div->n_row; ++i)
3691 subs[morph->inv->n_row - 1 + i] =
3692 isl_upoly_var_pow(ctx, morph->inv->n_col - 1 + i, 1);
3694 qp->upoly = isl_upoly_subs(qp->upoly, 0, n_sub, subs);
3696 for (i = 0; i < n_sub; ++i)
3697 isl_upoly_free(subs[i]);
3700 mat = isl_mat_diagonal(isl_mat_identity(ctx, 1), isl_mat_copy(morph->inv));
3701 mat = isl_mat_diagonal(mat, isl_mat_identity(ctx, qp->div->n_row));
3702 qp->div = isl_mat_product(qp->div, mat);
3703 isl_dim_free(qp->dim);
3704 qp->dim = isl_dim_copy(morph->ran->dim);
3706 if (!qp->upoly || !qp->div || !qp->dim)
3709 isl_morph_free(morph);
3713 isl_qpolynomial_free(qp);
3714 isl_morph_free(morph);
3718 static int neg_entry(void **entry, void *user)
3720 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
3722 *pwqp = isl_pw_qpolynomial_neg(*pwqp);
3724 return *pwqp ? 0 : -1;
3727 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_neg(
3728 __isl_take isl_union_pw_qpolynomial *upwqp)
3730 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
3734 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
3735 &neg_entry, NULL) < 0)
3740 isl_union_pw_qpolynomial_free(upwqp);
3744 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_sub(
3745 __isl_take isl_union_pw_qpolynomial *upwqp1,
3746 __isl_take isl_union_pw_qpolynomial *upwqp2)
3748 return isl_union_pw_qpolynomial_add(upwqp1,
3749 isl_union_pw_qpolynomial_neg(upwqp2));
3752 static int mul_entry(void **entry, void *user)
3754 struct isl_union_pw_qpolynomial_match_bin_data *data = user;
3756 struct isl_hash_table_entry *entry2;
3757 isl_pw_qpolynomial *pwpq = *entry;
3760 hash = isl_dim_get_hash(pwpq->dim);
3761 entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table,
3762 hash, &has_dim, pwpq->dim, 0);
3766 pwpq = isl_pw_qpolynomial_copy(pwpq);
3767 pwpq = isl_pw_qpolynomial_mul(pwpq,
3768 isl_pw_qpolynomial_copy(entry2->data));
3770 empty = isl_pw_qpolynomial_is_zero(pwpq);
3772 isl_pw_qpolynomial_free(pwpq);
3776 isl_pw_qpolynomial_free(pwpq);
3780 data->res = isl_union_pw_qpolynomial_add_pw_qpolynomial(data->res, pwpq);
3785 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
3786 __isl_take isl_union_pw_qpolynomial *upwqp1,
3787 __isl_take isl_union_pw_qpolynomial *upwqp2)
3789 return match_bin_op(upwqp1, upwqp2, &mul_entry);
3792 /* Reorder the columns of the given div definitions according to the
3795 static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div,
3796 __isl_take isl_reordering *r)
3805 extra = isl_dim_total(r->dim) + div->n_row - r->len;
3806 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
3810 for (i = 0; i < div->n_row; ++i) {
3811 isl_seq_cpy(mat->row[i], div->row[i], 2);
3812 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2);
3813 for (j = 0; j < r->len; ++j)
3814 isl_int_set(mat->row[i][2 + r->pos[j]],
3815 div->row[i][2 + j]);
3818 isl_reordering_free(r);
3822 isl_reordering_free(r);
3827 /* Reorder the dimension of "qp" according to the given reordering.
3829 __isl_give isl_qpolynomial *isl_qpolynomial_realign(
3830 __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r)
3832 qp = isl_qpolynomial_cow(qp);
3836 r = isl_reordering_extend(r, qp->div->n_row);
3840 qp->div = reorder_divs(qp->div, isl_reordering_copy(r));
3844 qp->upoly = reorder(qp->upoly, r->pos);
3848 qp = isl_qpolynomial_reset_dim(qp, isl_dim_copy(r->dim));
3850 isl_reordering_free(r);
3853 isl_qpolynomial_free(qp);
3854 isl_reordering_free(r);
3858 struct isl_split_periods_data {
3860 isl_pw_qpolynomial *res;
3863 /* Create a slice where the integer division "div" has the fixed value "v".
3864 * In particular, if "div" refers to floor(f/m), then create a slice
3866 * m v <= f <= m v + (m - 1)
3871 * -f + m v + (m - 1) >= 0
3873 static __isl_give isl_set *set_div_slice(__isl_take isl_dim *dim,
3874 __isl_keep isl_qpolynomial *qp, int div, isl_int v)
3877 isl_basic_set *bset = NULL;
3883 total = isl_dim_total(dim);
3884 bset = isl_basic_set_alloc_dim(isl_dim_copy(dim), 0, 0, 2);
3886 k = isl_basic_set_alloc_inequality(bset);
3889 isl_seq_cpy(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3890 isl_int_submul(bset->ineq[k][0], v, qp->div->row[div][0]);
3892 k = isl_basic_set_alloc_inequality(bset);
3895 isl_seq_neg(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3896 isl_int_addmul(bset->ineq[k][0], v, qp->div->row[div][0]);
3897 isl_int_add(bset->ineq[k][0], bset->ineq[k][0], qp->div->row[div][0]);
3898 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
3901 return isl_set_from_basic_set(bset);
3903 isl_basic_set_free(bset);
3908 static int split_periods(__isl_take isl_set *set,
3909 __isl_take isl_qpolynomial *qp, void *user);
3911 /* Create a slice of the domain "set" such that integer division "div"
3912 * has the fixed value "v" and add the results to data->res,
3913 * replacing the integer division by "v" in "qp".
3915 static int set_div(__isl_take isl_set *set,
3916 __isl_take isl_qpolynomial *qp, int div, isl_int v,
3917 struct isl_split_periods_data *data)
3922 struct isl_upoly *cst;
3924 slice = set_div_slice(isl_set_get_dim(set), qp, div, v);
3925 set = isl_set_intersect(set, slice);
3930 total = isl_dim_total(qp->dim);
3932 for (i = div + 1; i < qp->div->n_row; ++i) {
3933 if (isl_int_is_zero(qp->div->row[i][2 + total + div]))
3935 isl_int_addmul(qp->div->row[i][1],
3936 qp->div->row[i][2 + total + div], v);
3937 isl_int_set_si(qp->div->row[i][2 + total + div], 0);
3940 cst = isl_upoly_rat_cst(qp->dim->ctx, v, qp->dim->ctx->one);
3941 qp = substitute_div(qp, div, cst);
3943 return split_periods(set, qp, data);
3946 isl_qpolynomial_free(qp);
3950 /* Split the domain "set" such that integer division "div"
3951 * has a fixed value (ranging from "min" to "max") on each slice
3952 * and add the results to data->res.
3954 static int split_div(__isl_take isl_set *set,
3955 __isl_take isl_qpolynomial *qp, int div, isl_int min, isl_int max,
3956 struct isl_split_periods_data *data)
3958 for (; isl_int_le(min, max); isl_int_add_ui(min, min, 1)) {
3959 isl_set *set_i = isl_set_copy(set);
3960 isl_qpolynomial *qp_i = isl_qpolynomial_copy(qp);
3962 if (set_div(set_i, qp_i, div, min, data) < 0)
3966 isl_qpolynomial_free(qp);
3970 isl_qpolynomial_free(qp);
3974 /* If "qp" refers to any integer division
3975 * that can only attain "max_periods" distinct values on "set"
3976 * then split the domain along those distinct values.
3977 * Add the results (or the original if no splitting occurs)
3980 static int split_periods(__isl_take isl_set *set,
3981 __isl_take isl_qpolynomial *qp, void *user)
3984 isl_pw_qpolynomial *pwqp;
3985 struct isl_split_periods_data *data;
3990 data = (struct isl_split_periods_data *)user;
3995 if (qp->div->n_row == 0) {
3996 pwqp = isl_pw_qpolynomial_alloc(set, qp);
3997 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
4003 total = isl_dim_total(qp->dim);
4004 for (i = 0; i < qp->div->n_row; ++i) {
4005 enum isl_lp_result lp_res;
4007 if (isl_seq_first_non_zero(qp->div->row[i] + 2 + total,
4008 qp->div->n_row) != -1)
4011 lp_res = isl_set_solve_lp(set, 0, qp->div->row[i] + 1,
4012 set->ctx->one, &min, NULL, NULL);
4013 if (lp_res == isl_lp_error)
4015 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
4017 isl_int_fdiv_q(min, min, qp->div->row[i][0]);
4019 lp_res = isl_set_solve_lp(set, 1, qp->div->row[i] + 1,
4020 set->ctx->one, &max, NULL, NULL);
4021 if (lp_res == isl_lp_error)
4023 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
4025 isl_int_fdiv_q(max, max, qp->div->row[i][0]);
4027 isl_int_sub(max, max, min);
4028 if (isl_int_cmp_si(max, data->max_periods) < 0) {
4029 isl_int_add(max, max, min);
4034 if (i < qp->div->n_row) {
4035 r = split_div(set, qp, i, min, max, data);
4037 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4038 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
4050 isl_qpolynomial_free(qp);
4054 /* If any quasi-polynomial in pwqp refers to any integer division
4055 * that can only attain "max_periods" distinct values on its domain
4056 * then split the domain along those distinct values.
4058 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_periods(
4059 __isl_take isl_pw_qpolynomial *pwqp, int max_periods)
4061 struct isl_split_periods_data data;
4063 data.max_periods = max_periods;
4064 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_dim(pwqp));
4066 if (isl_pw_qpolynomial_foreach_piece(pwqp, &split_periods, &data) < 0)
4069 isl_pw_qpolynomial_free(pwqp);
4073 isl_pw_qpolynomial_free(data.res);
4074 isl_pw_qpolynomial_free(pwqp);
4078 /* Construct a piecewise quasipolynomial that is constant on the given
4079 * domain. In particular, it is
4082 * infinity if cst == -1
4084 static __isl_give isl_pw_qpolynomial *constant_on_domain(
4085 __isl_take isl_basic_set *bset, int cst)
4088 isl_qpolynomial *qp;
4093 bset = isl_basic_map_domain(isl_basic_map_from_range(bset));
4094 dim = isl_basic_set_get_dim(bset);
4096 qp = isl_qpolynomial_infty(dim);
4098 qp = isl_qpolynomial_zero(dim);
4100 qp = isl_qpolynomial_one(dim);
4101 return isl_pw_qpolynomial_alloc(isl_set_from_basic_set(bset), qp);
4104 /* Factor bset, call fn on each of the factors and return the product.
4106 * If no factors can be found, simply call fn on the input.
4107 * Otherwise, construct the factors based on the factorizer,
4108 * call fn on each factor and compute the product.
4110 static __isl_give isl_pw_qpolynomial *compressed_multiplicative_call(
4111 __isl_take isl_basic_set *bset,
4112 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
4118 isl_qpolynomial *qp;
4119 isl_pw_qpolynomial *pwqp;
4123 f = isl_basic_set_factorizer(bset);
4126 if (f->n_group == 0) {
4127 isl_factorizer_free(f);
4131 nparam = isl_basic_set_dim(bset, isl_dim_param);
4132 nvar = isl_basic_set_dim(bset, isl_dim_set);
4134 dim = isl_basic_set_get_dim(bset);
4135 dim = isl_dim_domain(dim);
4136 set = isl_set_universe(isl_dim_copy(dim));
4137 qp = isl_qpolynomial_one(dim);
4138 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4140 bset = isl_morph_basic_set(isl_morph_copy(f->morph), bset);
4142 for (i = 0, n = 0; i < f->n_group; ++i) {
4143 isl_basic_set *bset_i;
4144 isl_pw_qpolynomial *pwqp_i;
4146 bset_i = isl_basic_set_copy(bset);
4147 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
4148 nparam + n + f->len[i], nvar - n - f->len[i]);
4149 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
4151 bset_i = isl_basic_set_drop(bset_i, isl_dim_set,
4152 n + f->len[i], nvar - n - f->len[i]);
4153 bset_i = isl_basic_set_drop(bset_i, isl_dim_set, 0, n);
4155 pwqp_i = fn(bset_i);
4156 pwqp = isl_pw_qpolynomial_mul(pwqp, pwqp_i);
4161 isl_basic_set_free(bset);
4162 isl_factorizer_free(f);
4166 isl_basic_set_free(bset);
4170 /* Factor bset, call fn on each of the factors and return the product.
4171 * The function is assumed to evaluate to zero on empty domains,
4172 * to one on zero-dimensional domains and to infinity on unbounded domains
4173 * and will not be called explicitly on zero-dimensional or unbounded domains.
4175 * We first check for some special cases and remove all equalities.
4176 * Then we hand over control to compressed_multiplicative_call.
4178 __isl_give isl_pw_qpolynomial *isl_basic_set_multiplicative_call(
4179 __isl_take isl_basic_set *bset,
4180 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
4184 isl_pw_qpolynomial *pwqp;
4185 unsigned orig_nvar, final_nvar;
4190 if (isl_basic_set_fast_is_empty(bset))
4191 return constant_on_domain(bset, 0);
4193 orig_nvar = isl_basic_set_dim(bset, isl_dim_set);
4196 return constant_on_domain(bset, 1);
4198 bounded = isl_basic_set_is_bounded(bset);
4202 return constant_on_domain(bset, -1);
4204 if (bset->n_eq == 0)
4205 return compressed_multiplicative_call(bset, fn);
4207 morph = isl_basic_set_full_compression(bset);
4208 bset = isl_morph_basic_set(isl_morph_copy(morph), bset);
4210 final_nvar = isl_basic_set_dim(bset, isl_dim_set);
4212 pwqp = compressed_multiplicative_call(bset, fn);
4214 morph = isl_morph_remove_dom_dims(morph, isl_dim_set, 0, orig_nvar);
4215 morph = isl_morph_remove_ran_dims(morph, isl_dim_set, 0, final_nvar);
4216 morph = isl_morph_inverse(morph);
4218 pwqp = isl_pw_qpolynomial_morph(pwqp, morph);
4222 isl_basic_set_free(bset);
4226 /* Drop all floors in "qp", turning each integer division [a/m] into
4227 * a rational division a/m. If "down" is set, then the integer division
4228 * is replaces by (a-(m-1))/m instead.
4230 static __isl_give isl_qpolynomial *qp_drop_floors(
4231 __isl_take isl_qpolynomial *qp, int down)
4234 struct isl_upoly *s;
4238 if (qp->div->n_row == 0)
4241 qp = isl_qpolynomial_cow(qp);
4245 for (i = qp->div->n_row - 1; i >= 0; --i) {
4247 isl_int_sub(qp->div->row[i][1],
4248 qp->div->row[i][1], qp->div->row[i][0]);
4249 isl_int_add_ui(qp->div->row[i][1],
4250 qp->div->row[i][1], 1);
4252 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
4253 qp->div->row[i][0], qp->div->n_col - 1);
4254 qp = substitute_div(qp, i, s);
4262 /* Drop all floors in "pwqp", turning each integer division [a/m] into
4263 * a rational division a/m.
4265 static __isl_give isl_pw_qpolynomial *pwqp_drop_floors(
4266 __isl_take isl_pw_qpolynomial *pwqp)
4273 if (isl_pw_qpolynomial_is_zero(pwqp))
4276 pwqp = isl_pw_qpolynomial_cow(pwqp);
4280 for (i = 0; i < pwqp->n; ++i) {
4281 pwqp->p[i].qp = qp_drop_floors(pwqp->p[i].qp, 0);
4288 isl_pw_qpolynomial_free(pwqp);
4292 /* Adjust all the integer divisions in "qp" such that they are at least
4293 * one over the given orthant (identified by "signs"). This ensures
4294 * that they will still be non-negative even after subtracting (m-1)/m.
4296 * In particular, f is replaced by f' + v, changing f = [a/m]
4297 * to f' = [(a - m v)/m].
4298 * If the constant term k in a is smaller than m,
4299 * the constant term of v is set to floor(k/m) - 1.
4300 * For any other term, if the coefficient c and the variable x have
4301 * the same sign, then no changes are needed.
4302 * Otherwise, if the variable is positive (and c is negative),
4303 * then the coefficient of x in v is set to floor(c/m).
4304 * If the variable is negative (and c is positive),
4305 * then the coefficient of x in v is set to ceil(c/m).
4307 static __isl_give isl_qpolynomial *make_divs_pos(__isl_take isl_qpolynomial *qp,
4313 struct isl_upoly *s;
4315 qp = isl_qpolynomial_cow(qp);
4318 qp->div = isl_mat_cow(qp->div);
4322 total = isl_dim_total(qp->dim);
4323 v = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);
4325 for (i = 0; i < qp->div->n_row; ++i) {
4326 isl_int *row = qp->div->row[i];
4330 if (isl_int_lt(row[1], row[0])) {
4331 isl_int_fdiv_q(v->el[0], row[1], row[0]);
4332 isl_int_sub_ui(v->el[0], v->el[0], 1);
4333 isl_int_submul(row[1], row[0], v->el[0]);
4335 for (j = 0; j < total; ++j) {
4336 if (isl_int_sgn(row[2 + j]) * signs[j] >= 0)
4339 isl_int_cdiv_q(v->el[1 + j], row[2 + j], row[0]);
4341 isl_int_fdiv_q(v->el[1 + j], row[2 + j], row[0]);
4342 isl_int_submul(row[2 + j], row[0], v->el[1 + j]);
4344 for (j = 0; j < i; ++j) {
4345 if (isl_int_sgn(row[2 + total + j]) >= 0)
4347 isl_int_fdiv_q(v->el[1 + total + j],
4348 row[2 + total + j], row[0]);
4349 isl_int_submul(row[2 + total + j],
4350 row[0], v->el[1 + total + j]);
4352 for (j = i + 1; j < qp->div->n_row; ++j) {
4353 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
4355 isl_seq_combine(qp->div->row[j] + 1,
4356 qp->div->ctx->one, qp->div->row[j] + 1,
4357 qp->div->row[j][2 + total + i], v->el, v->size);
4359 isl_int_set_si(v->el[1 + total + i], 1);
4360 s = isl_upoly_from_affine(qp->dim->ctx, v->el,
4361 qp->div->ctx->one, v->size);
4362 qp->upoly = isl_upoly_subs(qp->upoly, total + i, 1, &s);
4372 isl_qpolynomial_free(qp);
4376 struct isl_to_poly_data {
4378 isl_pw_qpolynomial *res;
4379 isl_qpolynomial *qp;
4382 /* Appoximate data->qp by a polynomial on the orthant identified by "signs".
4383 * We first make all integer divisions positive and then split the
4384 * quasipolynomials into terms with sign data->sign (the direction
4385 * of the requested approximation) and terms with the opposite sign.
4386 * In the first set of terms, each integer division [a/m] is
4387 * overapproximated by a/m, while in the second it is underapproximated
4390 static int to_polynomial_on_orthant(__isl_take isl_set *orthant, int *signs,
4393 struct isl_to_poly_data *data = user;
4394 isl_pw_qpolynomial *t;
4395 isl_qpolynomial *qp, *up, *down;
4397 qp = isl_qpolynomial_copy(data->qp);
4398 qp = make_divs_pos(qp, signs);
4400 up = isl_qpolynomial_terms_of_sign(qp, signs, data->sign);
4401 up = qp_drop_floors(up, 0);
4402 down = isl_qpolynomial_terms_of_sign(qp, signs, -data->sign);
4403 down = qp_drop_floors(down, 1);
4405 isl_qpolynomial_free(qp);
4406 qp = isl_qpolynomial_add(up, down);
4408 t = isl_pw_qpolynomial_alloc(orthant, qp);
4409 data->res = isl_pw_qpolynomial_add_disjoint(data->res, t);
4414 /* Approximate each quasipolynomial by a polynomial. If "sign" is positive,
4415 * the polynomial will be an overapproximation. If "sign" is negative,
4416 * it will be an underapproximation. If "sign" is zero, the approximation
4417 * will lie somewhere in between.
4419 * In particular, is sign == 0, we simply drop the floors, turning
4420 * the integer divisions into rational divisions.
4421 * Otherwise, we split the domains into orthants, make all integer divisions
4422 * positive and then approximate each [a/m] by either a/m or (a-(m-1))/m,
4423 * depending on the requested sign and the sign of the term in which
4424 * the integer division appears.
4426 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_to_polynomial(
4427 __isl_take isl_pw_qpolynomial *pwqp, int sign)
4430 struct isl_to_poly_data data;
4433 return pwqp_drop_floors(pwqp);
4439 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_dim(pwqp));
4441 for (i = 0; i < pwqp->n; ++i) {
4442 if (pwqp->p[i].qp->div->n_row == 0) {
4443 isl_pw_qpolynomial *t;
4444 t = isl_pw_qpolynomial_alloc(
4445 isl_set_copy(pwqp->p[i].set),
4446 isl_qpolynomial_copy(pwqp->p[i].qp));
4447 data.res = isl_pw_qpolynomial_add_disjoint(data.res, t);
4450 data.qp = pwqp->p[i].qp;
4451 if (isl_set_foreach_orthant(pwqp->p[i].set,
4452 &to_polynomial_on_orthant, &data) < 0)
4456 isl_pw_qpolynomial_free(pwqp);
4460 isl_pw_qpolynomial_free(pwqp);
4461 isl_pw_qpolynomial_free(data.res);
4465 static int poly_entry(void **entry, void *user)
4468 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
4470 *pwqp = isl_pw_qpolynomial_to_polynomial(*pwqp, *sign);
4472 return *pwqp ? 0 : -1;
4475 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_to_polynomial(
4476 __isl_take isl_union_pw_qpolynomial *upwqp, int sign)
4478 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
4482 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
4483 &poly_entry, &sign) < 0)
4488 isl_union_pw_qpolynomial_free(upwqp);