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_neg_cst(__isl_take struct isl_upoly *up)
679 struct isl_upoly_cst *cst;
681 if (isl_upoly_is_zero(up))
684 up = isl_upoly_cow(up);
688 cst = isl_upoly_as_cst(up);
690 isl_int_neg(cst->n, cst->n);
695 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
698 struct isl_upoly_rec *rec;
703 if (isl_upoly_is_cst(up))
704 return isl_upoly_neg_cst(up);
706 up = isl_upoly_cow(up);
707 rec = isl_upoly_as_rec(up);
711 for (i = 0; i < rec->n; ++i) {
712 rec->p[i] = isl_upoly_neg(rec->p[i]);
723 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
724 __isl_take struct isl_upoly *up2)
726 struct isl_upoly_cst *cst1;
727 struct isl_upoly_cst *cst2;
729 up1 = isl_upoly_cow(up1);
733 cst1 = isl_upoly_as_cst(up1);
734 cst2 = isl_upoly_as_cst(up2);
736 isl_int_mul(cst1->n, cst1->n, cst2->n);
737 isl_int_mul(cst1->d, cst1->d, cst2->d);
739 isl_upoly_cst_reduce(cst1);
749 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
750 __isl_take struct isl_upoly *up2)
752 struct isl_upoly_rec *rec1;
753 struct isl_upoly_rec *rec2;
754 struct isl_upoly_rec *res;
758 rec1 = isl_upoly_as_rec(up1);
759 rec2 = isl_upoly_as_rec(up2);
762 size = rec1->n + rec2->n - 1;
763 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
767 for (i = 0; i < rec1->n; ++i) {
768 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
769 isl_upoly_copy(rec1->p[i]));
774 for (; i < size; ++i) {
775 res->p[i] = isl_upoly_zero(up1->ctx);
780 for (i = 0; i < rec1->n; ++i) {
781 for (j = 1; j < rec2->n; ++j) {
782 struct isl_upoly *up;
783 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
784 isl_upoly_copy(rec1->p[i]));
785 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
798 isl_upoly_free(&res->up);
802 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
803 __isl_take struct isl_upoly *up2)
808 if (isl_upoly_is_nan(up1)) {
813 if (isl_upoly_is_nan(up2)) {
818 if (isl_upoly_is_zero(up1)) {
823 if (isl_upoly_is_zero(up2)) {
828 if (isl_upoly_is_one(up1)) {
833 if (isl_upoly_is_one(up2)) {
838 if (up1->var < up2->var)
839 return isl_upoly_mul(up2, up1);
841 if (up2->var < up1->var) {
843 struct isl_upoly_rec *rec;
844 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
845 isl_ctx *ctx = up1->ctx;
848 return isl_upoly_nan(ctx);
850 up1 = isl_upoly_cow(up1);
851 rec = isl_upoly_as_rec(up1);
855 for (i = 0; i < rec->n; ++i) {
856 rec->p[i] = isl_upoly_mul(rec->p[i],
857 isl_upoly_copy(up2));
865 if (isl_upoly_is_cst(up1))
866 return isl_upoly_mul_cst(up1, up2);
868 return isl_upoly_mul_rec(up1, up2);
875 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
876 unsigned n_div, __isl_take struct isl_upoly *up)
878 struct isl_qpolynomial *qp = NULL;
884 total = isl_dim_total(dim);
886 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
891 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
902 isl_qpolynomial_free(qp);
906 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
915 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
917 struct isl_qpolynomial *dup;
922 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row,
923 isl_upoly_copy(qp->upoly));
926 isl_mat_free(dup->div);
927 dup->div = isl_mat_copy(qp->div);
933 isl_qpolynomial_free(dup);
937 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
945 return isl_qpolynomial_dup(qp);
948 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
956 isl_dim_free(qp->dim);
957 isl_mat_free(qp->div);
958 isl_upoly_free(qp->upoly);
963 __isl_give struct isl_upoly *isl_upoly_pow(isl_ctx *ctx, int pos, int power)
966 struct isl_upoly *up;
967 struct isl_upoly_rec *rec;
968 struct isl_upoly_cst *cst;
970 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
973 for (i = 0; i < 1 + power; ++i) {
974 rec->p[i] = isl_upoly_zero(ctx);
979 cst = isl_upoly_as_cst(rec->p[power]);
980 isl_int_set_si(cst->n, 1);
984 isl_upoly_free(&rec->up);
988 /* r array maps original positions to new positions.
990 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
994 struct isl_upoly_rec *rec;
995 struct isl_upoly *base;
996 struct isl_upoly *res;
998 if (isl_upoly_is_cst(up))
1001 rec = isl_upoly_as_rec(up);
1005 isl_assert(up->ctx, rec->n >= 1, goto error);
1007 base = isl_upoly_pow(up->ctx, r[up->var], 1);
1008 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
1010 for (i = rec->n - 2; i >= 0; --i) {
1011 res = isl_upoly_mul(res, isl_upoly_copy(base));
1012 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
1015 isl_upoly_free(base);
1024 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
1029 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1030 div1->n_col >= div2->n_col, return -1);
1032 if (div1->n_row == div2->n_row)
1033 return isl_mat_is_equal(div1, div2);
1035 n_row = div1->n_row;
1036 n_col = div1->n_col;
1037 div1->n_row = div2->n_row;
1038 div1->n_col = div2->n_col;
1040 equal = isl_mat_is_equal(div1, div2);
1042 div1->n_row = n_row;
1043 div1->n_col = n_col;
1048 static void expand_row(__isl_keep isl_mat *dst, int d,
1049 __isl_keep isl_mat *src, int s, int *exp)
1052 unsigned c = src->n_col - src->n_row;
1054 isl_seq_cpy(dst->row[d], src->row[s], c);
1055 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
1057 for (i = 0; i < s; ++i)
1058 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
1061 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
1065 li = isl_seq_last_non_zero(div->row[i], div->n_col);
1066 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
1071 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
1074 struct isl_div_sort_info {
1079 static int div_sort_cmp(const void *p1, const void *p2)
1081 const struct isl_div_sort_info *i1, *i2;
1082 i1 = (const struct isl_div_sort_info *) p1;
1083 i2 = (const struct isl_div_sort_info *) p2;
1085 return cmp_row(i1->div, i1->row, i2->row);
1088 /* Sort divs and remove duplicates.
1090 static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp)
1095 struct isl_div_sort_info *array = NULL;
1096 int *pos = NULL, *at = NULL;
1097 int *reordering = NULL;
1102 if (qp->div->n_row <= 1)
1105 div_pos = isl_dim_total(qp->dim);
1107 array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info,
1109 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1110 at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1111 len = qp->div->n_col - 2;
1112 reordering = isl_alloc_array(qp->div->ctx, int, len);
1113 if (!array || !pos || !at || !reordering)
1116 for (i = 0; i < qp->div->n_row; ++i) {
1117 array[i].div = qp->div;
1123 qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
1126 for (i = 0; i < div_pos; ++i)
1129 for (i = 0; i < qp->div->n_row; ++i) {
1130 if (pos[array[i].row] == i)
1132 qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]);
1133 pos[at[i]] = pos[array[i].row];
1134 at[pos[array[i].row]] = at[i];
1135 at[i] = array[i].row;
1136 pos[array[i].row] = i;
1140 for (i = 0; i < len - div_pos; ++i) {
1142 isl_seq_eq(qp->div->row[i - skip - 1],
1143 qp->div->row[i - skip], qp->div->n_col)) {
1144 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
1145 isl_mat_col_add(qp->div, 2 + div_pos + i - skip - 1,
1146 2 + div_pos + i - skip);
1147 qp->div = isl_mat_drop_cols(qp->div,
1148 2 + div_pos + i - skip, 1);
1151 reordering[div_pos + array[i].row] = div_pos + i - skip;
1154 qp->upoly = reorder(qp->upoly, reordering);
1156 if (!qp->upoly || !qp->div)
1170 isl_qpolynomial_free(qp);
1174 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
1175 __isl_keep isl_mat *div2, int *exp1, int *exp2)
1178 isl_mat *div = NULL;
1179 unsigned d = div1->n_col - div1->n_row;
1181 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
1182 d + div1->n_row + div2->n_row);
1186 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
1189 expand_row(div, k, div1, i, exp1);
1190 expand_row(div, k + 1, div2, j, exp2);
1192 cmp = cmp_row(div, k, k + 1);
1196 } else if (cmp < 0) {
1200 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1203 for (; i < div1->n_row; ++i, ++k) {
1204 expand_row(div, k, div1, i, exp1);
1207 for (; j < div2->n_row; ++j, ++k) {
1208 expand_row(div, k, div2, j, exp2);
1218 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1219 int *exp, int first)
1222 struct isl_upoly_rec *rec;
1224 if (isl_upoly_is_cst(up))
1227 if (up->var < first)
1230 if (exp[up->var - first] == up->var - first)
1233 up = isl_upoly_cow(up);
1237 up->var = exp[up->var - first] + first;
1239 rec = isl_upoly_as_rec(up);
1243 for (i = 0; i < rec->n; ++i) {
1244 rec->p[i] = expand(rec->p[i], exp, first);
1255 static __isl_give isl_qpolynomial *with_merged_divs(
1256 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1257 __isl_take isl_qpolynomial *qp2),
1258 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1262 isl_mat *div = NULL;
1264 qp1 = isl_qpolynomial_cow(qp1);
1265 qp2 = isl_qpolynomial_cow(qp2);
1270 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1271 qp1->div->n_col >= qp2->div->n_col, goto error);
1273 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1274 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1278 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1282 isl_mat_free(qp1->div);
1283 qp1->div = isl_mat_copy(div);
1284 isl_mat_free(qp2->div);
1285 qp2->div = isl_mat_copy(div);
1287 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1288 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1290 if (!qp1->upoly || !qp2->upoly)
1297 return fn(qp1, qp2);
1302 isl_qpolynomial_free(qp1);
1303 isl_qpolynomial_free(qp2);
1307 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1308 __isl_take isl_qpolynomial *qp2)
1310 qp1 = isl_qpolynomial_cow(qp1);
1315 if (qp1->div->n_row < qp2->div->n_row)
1316 return isl_qpolynomial_add(qp2, qp1);
1318 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1319 if (!compatible_divs(qp1->div, qp2->div))
1320 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1322 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1326 isl_qpolynomial_free(qp2);
1330 isl_qpolynomial_free(qp1);
1331 isl_qpolynomial_free(qp2);
1335 __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain(
1336 __isl_keep isl_set *dom,
1337 __isl_take isl_qpolynomial *qp1,
1338 __isl_take isl_qpolynomial *qp2)
1340 return isl_qpolynomial_add(qp1, qp2);
1343 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1344 __isl_take isl_qpolynomial *qp2)
1346 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1349 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1351 qp = isl_qpolynomial_cow(qp);
1356 qp->upoly = isl_upoly_neg(qp->upoly);
1362 isl_qpolynomial_free(qp);
1366 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1367 __isl_take isl_qpolynomial *qp2)
1369 qp1 = isl_qpolynomial_cow(qp1);
1374 if (qp1->div->n_row < qp2->div->n_row)
1375 return isl_qpolynomial_mul(qp2, qp1);
1377 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1378 if (!compatible_divs(qp1->div, qp2->div))
1379 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1381 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1385 isl_qpolynomial_free(qp2);
1389 isl_qpolynomial_free(qp1);
1390 isl_qpolynomial_free(qp2);
1394 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1396 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1399 __isl_give isl_qpolynomial *isl_qpolynomial_one(__isl_take isl_dim *dim)
1401 return isl_qpolynomial_alloc(dim, 0, isl_upoly_one(dim->ctx));
1404 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1406 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1409 __isl_give isl_qpolynomial *isl_qpolynomial_neginfty(__isl_take isl_dim *dim)
1411 return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx));
1414 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1416 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1419 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1422 struct isl_qpolynomial *qp;
1423 struct isl_upoly_cst *cst;
1425 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1429 cst = isl_upoly_as_cst(qp->upoly);
1430 isl_int_set(cst->n, v);
1435 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1436 isl_int *n, isl_int *d)
1438 struct isl_upoly_cst *cst;
1443 if (!isl_upoly_is_cst(qp->upoly))
1446 cst = isl_upoly_as_cst(qp->upoly);
1451 isl_int_set(*n, cst->n);
1453 isl_int_set(*d, cst->d);
1458 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1461 struct isl_upoly_rec *rec;
1469 rec = isl_upoly_as_rec(up);
1476 isl_assert(up->ctx, rec->n > 1, return -1);
1478 is_cst = isl_upoly_is_cst(rec->p[1]);
1484 return isl_upoly_is_affine(rec->p[0]);
1487 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1492 if (qp->div->n_row > 0)
1495 return isl_upoly_is_affine(qp->upoly);
1498 static void update_coeff(__isl_keep isl_vec *aff,
1499 __isl_keep struct isl_upoly_cst *cst, int pos)
1504 if (isl_int_is_zero(cst->n))
1509 isl_int_gcd(gcd, cst->d, aff->el[0]);
1510 isl_int_divexact(f, cst->d, gcd);
1511 isl_int_divexact(gcd, aff->el[0], gcd);
1512 isl_seq_scale(aff->el, aff->el, f, aff->size);
1513 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1518 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1519 __isl_keep isl_vec *aff)
1521 struct isl_upoly_cst *cst;
1522 struct isl_upoly_rec *rec;
1528 struct isl_upoly_cst *cst;
1530 cst = isl_upoly_as_cst(up);
1533 update_coeff(aff, cst, 0);
1537 rec = isl_upoly_as_rec(up);
1540 isl_assert(up->ctx, rec->n == 2, return -1);
1542 cst = isl_upoly_as_cst(rec->p[1]);
1545 update_coeff(aff, cst, 1 + up->var);
1547 return isl_upoly_update_affine(rec->p[0], aff);
1550 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1551 __isl_keep isl_qpolynomial *qp)
1559 isl_assert(qp->div->ctx, qp->div->n_row == 0, return NULL);
1560 d = isl_dim_total(qp->dim);
1561 aff = isl_vec_alloc(qp->div->ctx, 2 + d);
1565 isl_seq_clr(aff->el + 1, 1 + d);
1566 isl_int_set_si(aff->el[0], 1);
1568 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1577 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1578 __isl_keep isl_qpolynomial *qp2)
1583 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1586 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1589 struct isl_upoly_rec *rec;
1591 if (isl_upoly_is_cst(up)) {
1592 struct isl_upoly_cst *cst;
1593 cst = isl_upoly_as_cst(up);
1596 isl_int_lcm(*d, *d, cst->d);
1600 rec = isl_upoly_as_rec(up);
1604 for (i = 0; i < rec->n; ++i)
1605 upoly_update_den(rec->p[i], d);
1608 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1610 isl_int_set_si(*d, 1);
1613 upoly_update_den(qp->upoly, d);
1616 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1619 struct isl_ctx *ctx;
1626 return isl_qpolynomial_alloc(dim, 0, isl_upoly_pow(ctx, pos, power));
1629 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1630 enum isl_dim_type type, unsigned pos)
1635 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1636 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1638 if (type == isl_dim_set)
1639 pos += isl_dim_size(dim, isl_dim_param);
1641 return isl_qpolynomial_pow(dim, pos, 1);
1647 /* Remove common factor of non-constant terms and denominator.
1649 static void normalize_div(__isl_keep isl_qpolynomial *qp, int div)
1651 isl_ctx *ctx = qp->div->ctx;
1652 unsigned total = qp->div->n_col - 2;
1654 isl_seq_gcd(qp->div->row[div] + 2, total, &ctx->normalize_gcd);
1655 isl_int_gcd(ctx->normalize_gcd,
1656 ctx->normalize_gcd, qp->div->row[div][0]);
1657 if (isl_int_is_one(ctx->normalize_gcd))
1660 isl_seq_scale_down(qp->div->row[div] + 2, qp->div->row[div] + 2,
1661 ctx->normalize_gcd, total);
1662 isl_int_divexact(qp->div->row[div][0], qp->div->row[div][0],
1663 ctx->normalize_gcd);
1664 isl_int_fdiv_q(qp->div->row[div][1], qp->div->row[div][1],
1665 ctx->normalize_gcd);
1668 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1671 struct isl_qpolynomial *qp = NULL;
1672 struct isl_upoly_rec *rec;
1673 struct isl_upoly_cst *cst;
1680 d = div->line - div->bmap->div;
1682 pos = isl_dim_total(div->bmap->dim) + d;
1683 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
1684 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap),
1685 div->bmap->n_div, &rec->up);
1689 for (i = 0; i < div->bmap->n_div; ++i) {
1690 isl_seq_cpy(qp->div->row[i], div->bmap->div[i], qp->div->n_col);
1691 normalize_div(qp, i);
1694 for (i = 0; i < 1 + power; ++i) {
1695 rec->p[i] = isl_upoly_zero(div->ctx);
1700 cst = isl_upoly_as_cst(rec->p[power]);
1701 isl_int_set_si(cst->n, 1);
1709 isl_qpolynomial_free(qp);
1714 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1716 return isl_qpolynomial_div_pow(div, 1);
1719 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1720 const isl_int n, const isl_int d)
1722 struct isl_qpolynomial *qp;
1723 struct isl_upoly_cst *cst;
1725 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1729 cst = isl_upoly_as_cst(qp->upoly);
1730 isl_int_set(cst->n, n);
1731 isl_int_set(cst->d, d);
1736 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1738 struct isl_upoly_rec *rec;
1744 if (isl_upoly_is_cst(up))
1748 active[up->var] = 1;
1750 rec = isl_upoly_as_rec(up);
1751 for (i = 0; i < rec->n; ++i)
1752 if (up_set_active(rec->p[i], active, d) < 0)
1758 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1761 int d = isl_dim_total(qp->dim);
1766 for (i = 0; i < d; ++i)
1767 for (j = 0; j < qp->div->n_row; ++j) {
1768 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1774 return up_set_active(qp->upoly, active, d);
1777 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1778 enum isl_dim_type type, unsigned first, unsigned n)
1789 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1791 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1792 type == isl_dim_set, return -1);
1794 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1795 if (set_active(qp, active) < 0)
1798 if (type == isl_dim_set)
1799 first += isl_dim_size(qp->dim, isl_dim_param);
1800 for (i = 0; i < n; ++i)
1801 if (active[first + i]) {
1814 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1815 unsigned first, unsigned n)
1818 struct isl_upoly_rec *rec;
1822 if (n == 0 || up->var < 0 || up->var < first)
1824 if (up->var < first + n) {
1825 up = replace_by_constant_term(up);
1826 return isl_upoly_drop(up, first, n);
1828 up = isl_upoly_cow(up);
1832 rec = isl_upoly_as_rec(up);
1836 for (i = 0; i < rec->n; ++i) {
1837 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1848 __isl_give isl_qpolynomial *isl_qpolynomial_set_dim_name(
1849 __isl_take isl_qpolynomial *qp,
1850 enum isl_dim_type type, unsigned pos, const char *s)
1852 qp = isl_qpolynomial_cow(qp);
1855 qp->dim = isl_dim_set_name(qp->dim, type, pos, s);
1860 isl_qpolynomial_free(qp);
1864 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1865 __isl_take isl_qpolynomial *qp,
1866 enum isl_dim_type type, unsigned first, unsigned n)
1870 if (n == 0 && !isl_dim_get_tuple_name(qp->dim, type))
1873 qp = isl_qpolynomial_cow(qp);
1877 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1879 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1880 type == isl_dim_set, goto error);
1882 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1886 if (type == isl_dim_set)
1887 first += isl_dim_size(qp->dim, isl_dim_param);
1889 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1893 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1899 isl_qpolynomial_free(qp);
1903 __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up,
1904 unsigned first, unsigned n, __isl_keep struct isl_upoly **subs)
1907 struct isl_upoly_rec *rec;
1908 struct isl_upoly *base, *res;
1913 if (isl_upoly_is_cst(up))
1916 if (up->var < first)
1919 rec = isl_upoly_as_rec(up);
1923 isl_assert(up->ctx, rec->n >= 1, goto error);
1925 if (up->var >= first + n)
1926 base = isl_upoly_pow(up->ctx, up->var, 1);
1928 base = isl_upoly_copy(subs[up->var - first]);
1930 res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs);
1931 for (i = rec->n - 2; i >= 0; --i) {
1932 struct isl_upoly *t;
1933 t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs);
1934 res = isl_upoly_mul(res, isl_upoly_copy(base));
1935 res = isl_upoly_sum(res, t);
1938 isl_upoly_free(base);
1947 __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f,
1948 isl_int denom, unsigned len)
1951 struct isl_upoly *up;
1953 isl_assert(ctx, len >= 1, return NULL);
1955 up = isl_upoly_rat_cst(ctx, f[0], denom);
1956 for (i = 0; i < len - 1; ++i) {
1957 struct isl_upoly *t;
1958 struct isl_upoly *c;
1960 if (isl_int_is_zero(f[1 + i]))
1963 c = isl_upoly_rat_cst(ctx, f[1 + i], denom);
1964 t = isl_upoly_pow(ctx, i, 1);
1965 t = isl_upoly_mul(c, t);
1966 up = isl_upoly_sum(up, t);
1972 /* Replace the integer division identified by "div" by the polynomial "s".
1973 * The integer division is assumed not to appear in the definition
1974 * of any other integer divisions.
1976 static __isl_give isl_qpolynomial *substitute_div(
1977 __isl_take isl_qpolynomial *qp,
1978 int div, __isl_take struct isl_upoly *s)
1987 qp = isl_qpolynomial_cow(qp);
1991 total = isl_dim_total(qp->dim);
1992 qp->upoly = isl_upoly_subs(qp->upoly, total + div, 1, &s);
1996 reordering = isl_alloc_array(qp->dim->ctx, int, total + qp->div->n_row);
1999 for (i = 0; i < total + div; ++i)
2001 for (i = total + div + 1; i < total + qp->div->n_row; ++i)
2002 reordering[i] = i - 1;
2003 qp->div = isl_mat_drop_rows(qp->div, div, 1);
2004 qp->div = isl_mat_drop_cols(qp->div, 2 + total + div, 1);
2005 qp->upoly = reorder(qp->upoly, reordering);
2008 if (!qp->upoly || !qp->div)
2014 isl_qpolynomial_free(qp);
2019 /* Replace all integer divisions [e/d] that turn out to not actually be integer
2020 * divisions because d is equal to 1 by their definition, i.e., e.
2022 static __isl_give isl_qpolynomial *substitute_non_divs(
2023 __isl_take isl_qpolynomial *qp)
2027 struct isl_upoly *s;
2032 total = isl_dim_total(qp->dim);
2033 for (i = 0; qp && i < qp->div->n_row; ++i) {
2034 if (!isl_int_is_one(qp->div->row[i][0]))
2036 for (j = i + 1; j < qp->div->n_row; ++j) {
2037 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
2039 isl_seq_combine(qp->div->row[j] + 1,
2040 qp->div->ctx->one, qp->div->row[j] + 1,
2041 qp->div->row[j][2 + total + i],
2042 qp->div->row[i] + 1, 1 + total + i);
2043 isl_int_set_si(qp->div->row[j][2 + total + i], 0);
2044 normalize_div(qp, j);
2046 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
2047 qp->div->row[i][0], qp->div->n_col - 1);
2048 qp = substitute_div(qp, i, s);
2055 __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities(
2056 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
2062 struct isl_upoly *up;
2066 if (eq->n_eq == 0) {
2067 isl_basic_set_free(eq);
2071 qp = isl_qpolynomial_cow(qp);
2074 qp->div = isl_mat_cow(qp->div);
2078 total = 1 + isl_dim_total(eq->dim);
2080 isl_int_init(denom);
2081 for (i = 0; i < eq->n_eq; ++i) {
2082 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
2083 if (j < 0 || j == 0 || j >= total)
2086 for (k = 0; k < qp->div->n_row; ++k) {
2087 if (isl_int_is_zero(qp->div->row[k][1 + j]))
2089 isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total,
2090 &qp->div->row[k][0]);
2091 normalize_div(qp, k);
2094 if (isl_int_is_pos(eq->eq[i][j]))
2095 isl_seq_neg(eq->eq[i], eq->eq[i], total);
2096 isl_int_abs(denom, eq->eq[i][j]);
2097 isl_int_set_si(eq->eq[i][j], 0);
2099 up = isl_upoly_from_affine(qp->dim->ctx,
2100 eq->eq[i], denom, total);
2101 qp->upoly = isl_upoly_subs(qp->upoly, j - 1, 1, &up);
2104 isl_int_clear(denom);
2109 isl_basic_set_free(eq);
2111 qp = substitute_non_divs(qp);
2116 isl_basic_set_free(eq);
2117 isl_qpolynomial_free(qp);
2121 static __isl_give isl_basic_set *add_div_constraints(
2122 __isl_take isl_basic_set *bset, __isl_take isl_mat *div)
2130 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2133 total = isl_basic_set_total_dim(bset);
2134 for (i = 0; i < div->n_row; ++i)
2135 if (isl_basic_set_add_div_constraints_var(bset,
2136 total - div->n_row + i, div->row[i]) < 0)
2143 isl_basic_set_free(bset);
2147 /* Look for equalities among the variables shared by context and qp
2148 * and the integer divisions of qp, if any.
2149 * The equalities are then used to eliminate variables and/or integer
2150 * divisions from qp.
2152 __isl_give isl_qpolynomial *isl_qpolynomial_gist(
2153 __isl_take isl_qpolynomial *qp, __isl_take isl_set *context)
2159 if (qp->div->n_row > 0) {
2160 isl_basic_set *bset;
2161 context = isl_set_add_dims(context, isl_dim_set,
2163 bset = isl_basic_set_universe(isl_set_get_dim(context));
2164 bset = add_div_constraints(bset, isl_mat_copy(qp->div));
2165 context = isl_set_intersect(context,
2166 isl_set_from_basic_set(bset));
2169 aff = isl_set_affine_hull(context);
2170 return isl_qpolynomial_substitute_equalities(qp, aff);
2172 isl_qpolynomial_free(qp);
2173 isl_set_free(context);
2178 #define PW isl_pw_qpolynomial
2180 #define EL isl_qpolynomial
2182 #define IS_ZERO is_zero
2186 #include <isl_pw_templ.c>
2189 #define UNION isl_union_pw_qpolynomial
2191 #define PART isl_pw_qpolynomial
2193 #define PARTS pw_qpolynomial
2195 #include <isl_union_templ.c>
2197 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
2205 if (!isl_set_fast_is_universe(pwqp->p[0].set))
2208 return isl_qpolynomial_is_one(pwqp->p[0].qp);
2211 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
2212 __isl_take isl_pw_qpolynomial *pwqp1,
2213 __isl_take isl_pw_qpolynomial *pwqp2)
2216 struct isl_pw_qpolynomial *res;
2219 if (!pwqp1 || !pwqp2)
2222 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
2225 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
2226 isl_pw_qpolynomial_free(pwqp2);
2230 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
2231 isl_pw_qpolynomial_free(pwqp1);
2235 if (isl_pw_qpolynomial_is_one(pwqp1)) {
2236 isl_pw_qpolynomial_free(pwqp1);
2240 if (isl_pw_qpolynomial_is_one(pwqp2)) {
2241 isl_pw_qpolynomial_free(pwqp2);
2245 n = pwqp1->n * pwqp2->n;
2246 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
2248 for (i = 0; i < pwqp1->n; ++i) {
2249 for (j = 0; j < pwqp2->n; ++j) {
2250 struct isl_set *common;
2251 struct isl_qpolynomial *prod;
2252 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
2253 isl_set_copy(pwqp2->p[j].set));
2254 if (isl_set_fast_is_empty(common)) {
2255 isl_set_free(common);
2259 prod = isl_qpolynomial_mul(
2260 isl_qpolynomial_copy(pwqp1->p[i].qp),
2261 isl_qpolynomial_copy(pwqp2->p[j].qp));
2263 res = isl_pw_qpolynomial_add_piece(res, common, prod);
2267 isl_pw_qpolynomial_free(pwqp1);
2268 isl_pw_qpolynomial_free(pwqp2);
2272 isl_pw_qpolynomial_free(pwqp1);
2273 isl_pw_qpolynomial_free(pwqp2);
2277 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
2278 __isl_take isl_pw_qpolynomial *pwqp)
2285 if (isl_pw_qpolynomial_is_zero(pwqp))
2288 pwqp = isl_pw_qpolynomial_cow(pwqp);
2292 for (i = 0; i < pwqp->n; ++i) {
2293 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
2300 isl_pw_qpolynomial_free(pwqp);
2304 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
2305 __isl_take isl_pw_qpolynomial *pwqp1,
2306 __isl_take isl_pw_qpolynomial *pwqp2)
2308 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
2311 __isl_give struct isl_upoly *isl_upoly_eval(
2312 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
2315 struct isl_upoly_rec *rec;
2316 struct isl_upoly *res;
2317 struct isl_upoly *base;
2319 if (isl_upoly_is_cst(up)) {
2324 rec = isl_upoly_as_rec(up);
2328 isl_assert(up->ctx, rec->n >= 1, goto error);
2330 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
2332 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
2335 for (i = rec->n - 2; i >= 0; --i) {
2336 res = isl_upoly_mul(res, isl_upoly_copy(base));
2337 res = isl_upoly_sum(res,
2338 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
2339 isl_vec_copy(vec)));
2342 isl_upoly_free(base);
2352 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
2353 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
2356 struct isl_upoly *up;
2361 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
2363 if (qp->div->n_row == 0)
2364 ext = isl_vec_copy(pnt->vec);
2367 unsigned dim = isl_dim_total(qp->dim);
2368 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
2372 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
2373 for (i = 0; i < qp->div->n_row; ++i) {
2374 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
2375 1 + dim + i, &ext->el[1+dim+i]);
2376 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
2377 qp->div->row[i][0]);
2381 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
2385 dim = isl_dim_copy(qp->dim);
2386 isl_qpolynomial_free(qp);
2387 isl_point_free(pnt);
2389 return isl_qpolynomial_alloc(dim, 0, up);
2391 isl_qpolynomial_free(qp);
2392 isl_point_free(pnt);
2396 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
2397 __isl_keep struct isl_upoly_cst *cst2)
2402 isl_int_mul(t, cst1->n, cst2->d);
2403 isl_int_submul(t, cst2->n, cst1->d);
2404 cmp = isl_int_sgn(t);
2409 int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1,
2410 __isl_keep isl_qpolynomial *qp2)
2412 struct isl_upoly_cst *cst1, *cst2;
2416 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), return -1);
2417 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), return -1);
2418 if (isl_qpolynomial_is_nan(qp1))
2420 if (isl_qpolynomial_is_nan(qp2))
2422 cst1 = isl_upoly_as_cst(qp1->upoly);
2423 cst2 = isl_upoly_as_cst(qp2->upoly);
2425 return isl_upoly_cmp(cst1, cst2) <= 0;
2428 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
2429 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2431 struct isl_upoly_cst *cst1, *cst2;
2436 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2437 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2438 cst1 = isl_upoly_as_cst(qp1->upoly);
2439 cst2 = isl_upoly_as_cst(qp2->upoly);
2440 cmp = isl_upoly_cmp(cst1, cst2);
2443 isl_qpolynomial_free(qp2);
2445 isl_qpolynomial_free(qp1);
2450 isl_qpolynomial_free(qp1);
2451 isl_qpolynomial_free(qp2);
2455 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
2456 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2458 struct isl_upoly_cst *cst1, *cst2;
2463 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2464 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2465 cst1 = isl_upoly_as_cst(qp1->upoly);
2466 cst2 = isl_upoly_as_cst(qp2->upoly);
2467 cmp = isl_upoly_cmp(cst1, cst2);
2470 isl_qpolynomial_free(qp2);
2472 isl_qpolynomial_free(qp1);
2477 isl_qpolynomial_free(qp1);
2478 isl_qpolynomial_free(qp2);
2482 __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
2483 __isl_take isl_qpolynomial *qp, enum isl_dim_type type,
2484 unsigned first, unsigned n)
2493 qp = isl_qpolynomial_cow(qp);
2497 isl_assert(qp->div->ctx, first <= isl_dim_size(qp->dim, type),
2500 g_pos = pos(qp->dim, type) + first;
2502 qp->div = isl_mat_insert_cols(qp->div, 2 + g_pos, n);
2506 total = qp->div->n_col - 2;
2507 if (total > g_pos) {
2509 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2512 for (i = 0; i < total - g_pos; ++i)
2514 qp->upoly = expand(qp->upoly, exp, g_pos);
2520 qp->dim = isl_dim_insert(qp->dim, type, first, n);
2526 isl_qpolynomial_free(qp);
2530 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
2531 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2535 pos = isl_qpolynomial_dim(qp, type);
2537 return isl_qpolynomial_insert_dims(qp, type, pos, n);
2540 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2541 __isl_take isl_pw_qpolynomial *pwqp,
2542 enum isl_dim_type type, unsigned n)
2546 pos = isl_pw_qpolynomial_dim(pwqp, type);
2548 return isl_pw_qpolynomial_insert_dims(pwqp, type, pos, n);
2551 static int *reordering_move(isl_ctx *ctx,
2552 unsigned len, unsigned dst, unsigned src, unsigned n)
2557 reordering = isl_alloc_array(ctx, int, len);
2562 for (i = 0; i < dst; ++i)
2564 for (i = 0; i < n; ++i)
2565 reordering[src + i] = dst + i;
2566 for (i = 0; i < src - dst; ++i)
2567 reordering[dst + i] = dst + n + i;
2568 for (i = 0; i < len - src - n; ++i)
2569 reordering[src + n + i] = src + n + i;
2571 for (i = 0; i < src; ++i)
2573 for (i = 0; i < n; ++i)
2574 reordering[src + i] = dst + i;
2575 for (i = 0; i < dst - src; ++i)
2576 reordering[src + n + i] = src + i;
2577 for (i = 0; i < len - dst - n; ++i)
2578 reordering[dst + n + i] = dst + n + i;
2584 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
2585 __isl_take isl_qpolynomial *qp,
2586 enum isl_dim_type dst_type, unsigned dst_pos,
2587 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2593 qp = isl_qpolynomial_cow(qp);
2597 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2600 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2601 g_src_pos = pos(qp->dim, src_type) + src_pos;
2602 if (dst_type > src_type)
2605 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2612 reordering = reordering_move(qp->dim->ctx,
2613 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2617 qp->upoly = reorder(qp->upoly, reordering);
2622 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2628 isl_qpolynomial_free(qp);
2632 __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_dim *dim,
2633 isl_int *f, isl_int denom)
2635 struct isl_upoly *up;
2640 up = isl_upoly_from_affine(dim->ctx, f, denom, 1 + isl_dim_total(dim));
2642 return isl_qpolynomial_alloc(dim, 0, up);
2645 __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
2646 __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
2650 struct isl_upoly *up;
2651 isl_qpolynomial *qp;
2657 isl_int_init(denom);
2659 isl_constraint_get_coefficient(c, type, pos, &denom);
2660 isl_constraint_set_coefficient(c, type, pos, c->ctx->zero);
2661 sgn = isl_int_sgn(denom);
2662 isl_int_abs(denom, denom);
2663 up = isl_upoly_from_affine(c->ctx, c->line[0], denom,
2664 1 + isl_constraint_dim(c, isl_dim_all));
2666 isl_int_neg(denom, denom);
2667 isl_constraint_set_coefficient(c, type, pos, denom);
2669 dim = isl_dim_copy(c->bmap->dim);
2671 isl_int_clear(denom);
2672 isl_constraint_free(c);
2674 qp = isl_qpolynomial_alloc(dim, 0, up);
2676 qp = isl_qpolynomial_neg(qp);
2680 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
2681 * in "qp" by subs[i].
2683 __isl_give isl_qpolynomial *isl_qpolynomial_substitute(
2684 __isl_take isl_qpolynomial *qp,
2685 enum isl_dim_type type, unsigned first, unsigned n,
2686 __isl_keep isl_qpolynomial **subs)
2689 struct isl_upoly **ups;
2694 qp = isl_qpolynomial_cow(qp);
2697 for (i = 0; i < n; ++i)
2701 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2704 for (i = 0; i < n; ++i)
2705 isl_assert(qp->dim->ctx, isl_dim_equal(qp->dim, subs[i]->dim),
2708 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
2709 for (i = 0; i < n; ++i)
2710 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
2712 first += pos(qp->dim, type);
2714 ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n);
2717 for (i = 0; i < n; ++i)
2718 ups[i] = subs[i]->upoly;
2720 qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups);
2729 isl_qpolynomial_free(qp);
2733 /* Extend "bset" with extra set dimensions for each integer division
2734 * in "qp" and then call "fn" with the extended bset and the polynomial
2735 * that results from replacing each of the integer divisions by the
2736 * corresponding extra set dimension.
2738 int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
2739 __isl_keep isl_basic_set *bset,
2740 int (*fn)(__isl_take isl_basic_set *bset,
2741 __isl_take isl_qpolynomial *poly, void *user), void *user)
2745 isl_qpolynomial *poly;
2749 if (qp->div->n_row == 0)
2750 return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
2753 div = isl_mat_copy(qp->div);
2754 dim = isl_dim_copy(qp->dim);
2755 dim = isl_dim_add(dim, isl_dim_set, qp->div->n_row);
2756 poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly));
2757 bset = isl_basic_set_copy(bset);
2758 bset = isl_basic_set_add(bset, isl_dim_set, qp->div->n_row);
2759 bset = add_div_constraints(bset, div);
2761 return fn(bset, poly, user);
2766 /* Return total degree in variables first (inclusive) up to last (exclusive).
2768 int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last)
2772 struct isl_upoly_rec *rec;
2776 if (isl_upoly_is_zero(up))
2778 if (isl_upoly_is_cst(up) || up->var < first)
2781 rec = isl_upoly_as_rec(up);
2785 for (i = 0; i < rec->n; ++i) {
2788 if (isl_upoly_is_zero(rec->p[i]))
2790 d = isl_upoly_degree(rec->p[i], first, last);
2800 /* Return total degree in set variables.
2802 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
2810 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2811 nvar = isl_dim_size(poly->dim, isl_dim_set);
2812 return isl_upoly_degree(poly->upoly, ovar, ovar + nvar);
2815 __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up,
2816 unsigned pos, int deg)
2819 struct isl_upoly_rec *rec;
2824 if (isl_upoly_is_cst(up) || up->var < pos) {
2826 return isl_upoly_copy(up);
2828 return isl_upoly_zero(up->ctx);
2831 rec = isl_upoly_as_rec(up);
2835 if (up->var == pos) {
2837 return isl_upoly_copy(rec->p[deg]);
2839 return isl_upoly_zero(up->ctx);
2842 up = isl_upoly_copy(up);
2843 up = isl_upoly_cow(up);
2844 rec = isl_upoly_as_rec(up);
2848 for (i = 0; i < rec->n; ++i) {
2849 struct isl_upoly *t;
2850 t = isl_upoly_coeff(rec->p[i], pos, deg);
2853 isl_upoly_free(rec->p[i]);
2863 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
2865 __isl_give isl_qpolynomial *isl_qpolynomial_coeff(
2866 __isl_keep isl_qpolynomial *qp,
2867 enum isl_dim_type type, unsigned t_pos, int deg)
2870 struct isl_upoly *up;
2876 isl_assert(qp->div->ctx, t_pos < isl_dim_size(qp->dim, type),
2879 g_pos = pos(qp->dim, type) + t_pos;
2880 up = isl_upoly_coeff(qp->upoly, g_pos, deg);
2882 c = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row, up);
2885 isl_mat_free(c->div);
2886 c->div = isl_mat_copy(qp->div);
2891 isl_qpolynomial_free(c);
2895 /* Homogenize the polynomial in the variables first (inclusive) up to
2896 * last (exclusive) by inserting powers of variable first.
2897 * Variable first is assumed not to appear in the input.
2899 __isl_give struct isl_upoly *isl_upoly_homogenize(
2900 __isl_take struct isl_upoly *up, int deg, int target,
2901 int first, int last)
2904 struct isl_upoly_rec *rec;
2908 if (isl_upoly_is_zero(up))
2912 if (isl_upoly_is_cst(up) || up->var < first) {
2913 struct isl_upoly *hom;
2915 hom = isl_upoly_pow(up->ctx, first, target - deg);
2918 rec = isl_upoly_as_rec(hom);
2919 rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up);
2924 up = isl_upoly_cow(up);
2925 rec = isl_upoly_as_rec(up);
2929 for (i = 0; i < rec->n; ++i) {
2930 if (isl_upoly_is_zero(rec->p[i]))
2932 rec->p[i] = isl_upoly_homogenize(rec->p[i],
2933 up->var < last ? deg + i : i, target,
2945 /* Homogenize the polynomial in the set variables by introducing
2946 * powers of an extra set variable at position 0.
2948 __isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
2949 __isl_take isl_qpolynomial *poly)
2953 int deg = isl_qpolynomial_degree(poly);
2958 poly = isl_qpolynomial_insert_dims(poly, isl_dim_set, 0, 1);
2959 poly = isl_qpolynomial_cow(poly);
2963 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2964 nvar = isl_dim_size(poly->dim, isl_dim_set);
2965 poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg,
2972 isl_qpolynomial_free(poly);
2976 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2977 __isl_take isl_mat *div)
2985 n = isl_dim_total(dim) + div->n_row;
2987 term = isl_calloc(dim->ctx, struct isl_term,
2988 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2995 isl_int_init(term->n);
2996 isl_int_init(term->d);
3005 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
3014 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
3023 total = isl_dim_total(term->dim) + term->div->n_row;
3025 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
3029 isl_int_set(dup->n, term->n);
3030 isl_int_set(dup->d, term->d);
3032 for (i = 0; i < total; ++i)
3033 dup->pow[i] = term->pow[i];
3038 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
3046 return isl_term_dup(term);
3049 void isl_term_free(__isl_take isl_term *term)
3054 if (--term->ref > 0)
3057 isl_dim_free(term->dim);
3058 isl_mat_free(term->div);
3059 isl_int_clear(term->n);
3060 isl_int_clear(term->d);
3064 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
3072 case isl_dim_out: return isl_dim_size(term->dim, type);
3073 case isl_dim_div: return term->div->n_row;
3074 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
3079 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
3081 return term ? term->dim->ctx : NULL;
3084 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
3088 isl_int_set(*n, term->n);
3091 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
3095 isl_int_set(*d, term->d);
3098 int isl_term_get_exp(__isl_keep isl_term *term,
3099 enum isl_dim_type type, unsigned pos)
3104 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
3106 if (type >= isl_dim_set)
3107 pos += isl_dim_size(term->dim, isl_dim_param);
3108 if (type >= isl_dim_div)
3109 pos += isl_dim_size(term->dim, isl_dim_set);
3111 return term->pow[pos];
3114 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
3116 isl_basic_map *bmap;
3123 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
3126 total = term->div->n_col - term->div->n_row - 2;
3127 /* No nested divs for now */
3128 isl_assert(term->dim->ctx,
3129 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
3130 term->div->n_row) == -1,
3133 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
3134 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
3137 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
3139 return isl_basic_map_div(bmap, k);
3141 isl_basic_map_free(bmap);
3145 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
3146 int (*fn)(__isl_take isl_term *term, void *user),
3147 __isl_take isl_term *term, void *user)
3150 struct isl_upoly_rec *rec;
3155 if (isl_upoly_is_zero(up))
3158 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
3159 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
3160 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
3162 if (isl_upoly_is_cst(up)) {
3163 struct isl_upoly_cst *cst;
3164 cst = isl_upoly_as_cst(up);
3167 term = isl_term_cow(term);
3170 isl_int_set(term->n, cst->n);
3171 isl_int_set(term->d, cst->d);
3172 if (fn(isl_term_copy(term), user) < 0)
3177 rec = isl_upoly_as_rec(up);
3181 for (i = 0; i < rec->n; ++i) {
3182 term = isl_term_cow(term);
3185 term->pow[up->var] = i;
3186 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
3190 term->pow[up->var] = 0;
3194 isl_term_free(term);
3198 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
3199 int (*fn)(__isl_take isl_term *term, void *user), void *user)
3206 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
3210 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
3212 isl_term_free(term);
3214 return term ? 0 : -1;
3217 __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
3219 struct isl_upoly *up;
3220 isl_qpolynomial *qp;
3226 n = isl_dim_total(term->dim) + term->div->n_row;
3228 up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d);
3229 for (i = 0; i < n; ++i) {
3232 up = isl_upoly_mul(up,
3233 isl_upoly_pow(term->dim->ctx, i, term->pow[i]));
3236 qp = isl_qpolynomial_alloc(isl_dim_copy(term->dim), term->div->n_row, up);
3239 isl_mat_free(qp->div);
3240 qp->div = isl_mat_copy(term->div);
3244 isl_term_free(term);
3247 isl_qpolynomial_free(qp);
3248 isl_term_free(term);
3252 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
3253 __isl_take isl_dim *dim)
3262 if (isl_dim_equal(qp->dim, dim)) {
3267 qp = isl_qpolynomial_cow(qp);
3271 extra = isl_dim_size(dim, isl_dim_set) -
3272 isl_dim_size(qp->dim, isl_dim_set);
3273 total = isl_dim_total(qp->dim);
3274 if (qp->div->n_row) {
3277 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
3280 for (i = 0; i < qp->div->n_row; ++i)
3282 qp->upoly = expand(qp->upoly, exp, total);
3287 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
3290 for (i = 0; i < qp->div->n_row; ++i)
3291 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
3293 isl_dim_free(qp->dim);
3299 isl_qpolynomial_free(qp);
3303 /* For each parameter or variable that does not appear in qp,
3304 * first eliminate the variable from all constraints and then set it to zero.
3306 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
3307 __isl_keep isl_qpolynomial *qp)
3318 d = isl_dim_total(set->dim);
3319 active = isl_calloc_array(set->ctx, int, d);
3320 if (set_active(qp, active) < 0)
3323 for (i = 0; i < d; ++i)
3332 nparam = isl_dim_size(set->dim, isl_dim_param);
3333 nvar = isl_dim_size(set->dim, isl_dim_set);
3334 for (i = 0; i < nparam; ++i) {
3337 set = isl_set_eliminate(set, isl_dim_param, i, 1);
3338 set = isl_set_fix_si(set, isl_dim_param, i, 0);
3340 for (i = 0; i < nvar; ++i) {
3341 if (active[nparam + i])
3343 set = isl_set_eliminate(set, isl_dim_set, i, 1);
3344 set = isl_set_fix_si(set, isl_dim_set, i, 0);
3356 struct isl_opt_data {
3357 isl_qpolynomial *qp;
3359 isl_qpolynomial *opt;
3363 static int opt_fn(__isl_take isl_point *pnt, void *user)
3365 struct isl_opt_data *data = (struct isl_opt_data *)user;
3366 isl_qpolynomial *val;
3368 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
3372 } else if (data->max) {
3373 data->opt = isl_qpolynomial_max_cst(data->opt, val);
3375 data->opt = isl_qpolynomial_min_cst(data->opt, val);
3381 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
3382 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
3384 struct isl_opt_data data = { NULL, 1, NULL, max };
3389 if (isl_upoly_is_cst(qp->upoly)) {
3394 set = fix_inactive(set, qp);
3397 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
3401 data.opt = isl_qpolynomial_zero(isl_qpolynomial_get_dim(qp));
3404 isl_qpolynomial_free(qp);
3408 isl_qpolynomial_free(qp);
3409 isl_qpolynomial_free(data.opt);
3413 __isl_give isl_qpolynomial *isl_qpolynomial_morph(__isl_take isl_qpolynomial *qp,
3414 __isl_take isl_morph *morph)
3419 struct isl_upoly *up;
3421 struct isl_upoly **subs;
3424 qp = isl_qpolynomial_cow(qp);
3429 isl_assert(ctx, isl_dim_equal(qp->dim, morph->dom->dim), goto error);
3431 n_sub = morph->inv->n_row - 1;
3432 if (morph->inv->n_row != morph->inv->n_col)
3433 n_sub += qp->div->n_row;
3434 subs = isl_calloc_array(ctx, struct isl_upoly *, n_sub);
3438 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3439 subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i],
3440 morph->inv->row[0][0], morph->inv->n_col);
3441 if (morph->inv->n_row != morph->inv->n_col)
3442 for (i = 0; i < qp->div->n_row; ++i)
3443 subs[morph->inv->n_row - 1 + i] =
3444 isl_upoly_pow(ctx, morph->inv->n_col - 1 + i, 1);
3446 qp->upoly = isl_upoly_subs(qp->upoly, 0, n_sub, subs);
3448 for (i = 0; i < n_sub; ++i)
3449 isl_upoly_free(subs[i]);
3452 mat = isl_mat_diagonal(isl_mat_identity(ctx, 1), isl_mat_copy(morph->inv));
3453 mat = isl_mat_diagonal(mat, isl_mat_identity(ctx, qp->div->n_row));
3454 qp->div = isl_mat_product(qp->div, mat);
3455 isl_dim_free(qp->dim);
3456 qp->dim = isl_dim_copy(morph->ran->dim);
3458 if (!qp->upoly || !qp->div || !qp->dim)
3461 isl_morph_free(morph);
3465 isl_qpolynomial_free(qp);
3466 isl_morph_free(morph);
3470 static int neg_entry(void **entry, void *user)
3472 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
3474 *pwqp = isl_pw_qpolynomial_neg(*pwqp);
3476 return *pwqp ? 0 : -1;
3479 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_neg(
3480 __isl_take isl_union_pw_qpolynomial *upwqp)
3482 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
3486 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
3487 &neg_entry, NULL) < 0)
3492 isl_union_pw_qpolynomial_free(upwqp);
3496 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_sub(
3497 __isl_take isl_union_pw_qpolynomial *upwqp1,
3498 __isl_take isl_union_pw_qpolynomial *upwqp2)
3500 return isl_union_pw_qpolynomial_add(upwqp1,
3501 isl_union_pw_qpolynomial_neg(upwqp2));
3504 static int mul_entry(void **entry, void *user)
3506 struct isl_union_pw_qpolynomial_match_bin_data *data = user;
3508 struct isl_hash_table_entry *entry2;
3509 isl_pw_qpolynomial *pwpq = *entry;
3512 hash = isl_dim_get_hash(pwpq->dim);
3513 entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table,
3514 hash, &has_dim, pwpq->dim, 0);
3518 pwpq = isl_pw_qpolynomial_copy(pwpq);
3519 pwpq = isl_pw_qpolynomial_mul(pwpq,
3520 isl_pw_qpolynomial_copy(entry2->data));
3522 empty = isl_pw_qpolynomial_is_zero(pwpq);
3524 isl_pw_qpolynomial_free(pwpq);
3528 isl_pw_qpolynomial_free(pwpq);
3532 data->res = isl_union_pw_qpolynomial_add_pw_qpolynomial(data->res, pwpq);
3537 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
3538 __isl_take isl_union_pw_qpolynomial *upwqp1,
3539 __isl_take isl_union_pw_qpolynomial *upwqp2)
3541 return match_bin_op(upwqp1, upwqp2, &mul_entry);
3544 /* Reorder the columns of the given div definitions according to the
3547 static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div,
3548 __isl_take isl_reordering *r)
3557 extra = isl_dim_total(r->dim) + div->n_row - r->len;
3558 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
3562 for (i = 0; i < div->n_row; ++i) {
3563 isl_seq_cpy(mat->row[i], div->row[i], 2);
3564 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2);
3565 for (j = 0; j < r->len; ++j)
3566 isl_int_set(mat->row[i][2 + r->pos[j]],
3567 div->row[i][2 + j]);
3570 isl_reordering_free(r);
3574 isl_reordering_free(r);
3579 /* Reorder the dimension of "qp" according to the given reordering.
3581 __isl_give isl_qpolynomial *isl_qpolynomial_realign(
3582 __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r)
3584 qp = isl_qpolynomial_cow(qp);
3588 r = isl_reordering_extend(r, qp->div->n_row);
3592 qp->div = reorder_divs(qp->div, isl_reordering_copy(r));
3596 qp->upoly = reorder(qp->upoly, r->pos);
3600 qp = isl_qpolynomial_reset_dim(qp, isl_dim_copy(r->dim));
3602 isl_reordering_free(r);
3605 isl_qpolynomial_free(qp);
3606 isl_reordering_free(r);
3610 struct isl_split_periods_data {
3612 isl_pw_qpolynomial *res;
3615 /* Create a slice where the integer division "div" has the fixed value "v".
3616 * In particular, if "div" refers to floor(f/m), then create a slice
3618 * m v <= f <= m v + (m - 1)
3623 * -f + m v + (m - 1) >= 0
3625 static __isl_give isl_set *set_div_slice(__isl_take isl_dim *dim,
3626 __isl_keep isl_qpolynomial *qp, int div, isl_int v)
3629 isl_basic_set *bset = NULL;
3635 total = isl_dim_total(dim);
3636 bset = isl_basic_set_alloc_dim(isl_dim_copy(dim), 0, 0, 2);
3638 k = isl_basic_set_alloc_inequality(bset);
3641 isl_seq_cpy(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3642 isl_int_submul(bset->ineq[k][0], v, qp->div->row[div][0]);
3644 k = isl_basic_set_alloc_inequality(bset);
3647 isl_seq_neg(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3648 isl_int_addmul(bset->ineq[k][0], v, qp->div->row[div][0]);
3649 isl_int_add(bset->ineq[k][0], bset->ineq[k][0], qp->div->row[div][0]);
3650 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
3653 return isl_set_from_basic_set(bset);
3655 isl_basic_set_free(bset);
3660 static int split_periods(__isl_take isl_set *set,
3661 __isl_take isl_qpolynomial *qp, void *user);
3663 /* Create a slice of the domain "set" such that integer division "div"
3664 * has the fixed value "v" and add the results to data->res,
3665 * replacing the integer division by "v" in "qp".
3667 static int set_div(__isl_take isl_set *set,
3668 __isl_take isl_qpolynomial *qp, int div, isl_int v,
3669 struct isl_split_periods_data *data)
3674 struct isl_upoly *cst;
3676 slice = set_div_slice(isl_set_get_dim(set), qp, div, v);
3677 set = isl_set_intersect(set, slice);
3682 total = isl_dim_total(qp->dim);
3684 for (i = div + 1; i < qp->div->n_row; ++i) {
3685 if (isl_int_is_zero(qp->div->row[i][2 + total + div]))
3687 isl_int_addmul(qp->div->row[i][1],
3688 qp->div->row[i][2 + total + div], v);
3689 isl_int_set_si(qp->div->row[i][2 + total + div], 0);
3692 cst = isl_upoly_rat_cst(qp->dim->ctx, v, qp->dim->ctx->one);
3693 qp = substitute_div(qp, div, cst);
3695 return split_periods(set, qp, data);
3698 isl_qpolynomial_free(qp);
3702 /* Split the domain "set" such that integer division "div"
3703 * has a fixed value (ranging from "min" to "max") on each slice
3704 * and add the results to data->res.
3706 static int split_div(__isl_take isl_set *set,
3707 __isl_take isl_qpolynomial *qp, int div, isl_int min, isl_int max,
3708 struct isl_split_periods_data *data)
3710 for (; isl_int_le(min, max); isl_int_add_ui(min, min, 1)) {
3711 isl_set *set_i = isl_set_copy(set);
3712 isl_qpolynomial *qp_i = isl_qpolynomial_copy(qp);
3714 if (set_div(set_i, qp_i, div, min, data) < 0)
3718 isl_qpolynomial_free(qp);
3722 isl_qpolynomial_free(qp);
3726 /* If "qp" refers to any integer division
3727 * that can only attain "max_periods" distinct values on "set"
3728 * then split the domain along those distinct values.
3729 * Add the results (or the original if no splitting occurs)
3732 static int split_periods(__isl_take isl_set *set,
3733 __isl_take isl_qpolynomial *qp, void *user)
3736 isl_pw_qpolynomial *pwqp;
3737 struct isl_split_periods_data *data;
3742 data = (struct isl_split_periods_data *)user;
3747 if (qp->div->n_row == 0) {
3748 pwqp = isl_pw_qpolynomial_alloc(set, qp);
3749 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
3755 total = isl_dim_total(qp->dim);
3756 for (i = 0; i < qp->div->n_row; ++i) {
3757 enum isl_lp_result lp_res;
3759 if (isl_seq_first_non_zero(qp->div->row[i] + 2 + total,
3760 qp->div->n_row) != -1)
3763 lp_res = isl_set_solve_lp(set, 0, qp->div->row[i] + 1,
3764 set->ctx->one, &min, NULL, NULL);
3765 if (lp_res == isl_lp_error)
3767 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
3769 isl_int_fdiv_q(min, min, qp->div->row[i][0]);
3771 lp_res = isl_set_solve_lp(set, 1, qp->div->row[i] + 1,
3772 set->ctx->one, &max, NULL, NULL);
3773 if (lp_res == isl_lp_error)
3775 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
3777 isl_int_fdiv_q(max, max, qp->div->row[i][0]);
3779 isl_int_sub(max, max, min);
3780 if (isl_int_cmp_si(max, data->max_periods) < 0) {
3781 isl_int_add(max, max, min);
3786 if (i < qp->div->n_row) {
3787 r = split_div(set, qp, i, min, max, data);
3789 pwqp = isl_pw_qpolynomial_alloc(set, qp);
3790 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
3802 isl_qpolynomial_free(qp);
3806 /* If any quasi-polynomial in pwqp refers to any integer division
3807 * that can only attain "max_periods" distinct values on its domain
3808 * then split the domain along those distinct values.
3810 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_periods(
3811 __isl_take isl_pw_qpolynomial *pwqp, int max_periods)
3813 struct isl_split_periods_data data;
3815 data.max_periods = max_periods;
3816 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_dim(pwqp));
3818 if (isl_pw_qpolynomial_foreach_piece(pwqp, &split_periods, &data) < 0)
3821 isl_pw_qpolynomial_free(pwqp);
3825 isl_pw_qpolynomial_free(data.res);
3826 isl_pw_qpolynomial_free(pwqp);
3830 /* Construct a piecewise quasipolynomial that is constant on the given
3831 * domain. In particular, it is
3834 * infinity if cst == -1
3836 static __isl_give isl_pw_qpolynomial *constant_on_domain(
3837 __isl_take isl_basic_set *bset, int cst)
3840 isl_qpolynomial *qp;
3845 bset = isl_basic_map_domain(isl_basic_map_from_range(bset));
3846 dim = isl_basic_set_get_dim(bset);
3848 qp = isl_qpolynomial_infty(dim);
3850 qp = isl_qpolynomial_zero(dim);
3852 qp = isl_qpolynomial_one(dim);
3853 return isl_pw_qpolynomial_alloc(isl_set_from_basic_set(bset), qp);
3856 /* Factor bset, call fn on each of the factors and return the product.
3858 * If no factors can be found, simply call fn on the input.
3859 * Otherwise, construct the factors based on the factorizer,
3860 * call fn on each factor and compute the product.
3862 static __isl_give isl_pw_qpolynomial *compressed_multiplicative_call(
3863 __isl_take isl_basic_set *bset,
3864 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
3870 isl_qpolynomial *qp;
3871 isl_pw_qpolynomial *pwqp;
3875 f = isl_basic_set_factorizer(bset);
3878 if (f->n_group == 0) {
3879 isl_factorizer_free(f);
3883 nparam = isl_basic_set_dim(bset, isl_dim_param);
3884 nvar = isl_basic_set_dim(bset, isl_dim_set);
3886 dim = isl_basic_set_get_dim(bset);
3887 dim = isl_dim_domain(dim);
3888 set = isl_set_universe(isl_dim_copy(dim));
3889 qp = isl_qpolynomial_one(dim);
3890 pwqp = isl_pw_qpolynomial_alloc(set, qp);
3892 bset = isl_morph_basic_set(isl_morph_copy(f->morph), bset);
3894 for (i = 0, n = 0; i < f->n_group; ++i) {
3895 isl_basic_set *bset_i;
3896 isl_pw_qpolynomial *pwqp_i;
3898 bset_i = isl_basic_set_copy(bset);
3899 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
3900 nparam + n + f->len[i], nvar - n - f->len[i]);
3901 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
3903 bset_i = isl_basic_set_drop(bset_i, isl_dim_set,
3904 n + f->len[i], nvar - n - f->len[i]);
3905 bset_i = isl_basic_set_drop(bset_i, isl_dim_set, 0, n);
3907 pwqp_i = fn(bset_i);
3908 pwqp = isl_pw_qpolynomial_mul(pwqp, pwqp_i);
3913 isl_basic_set_free(bset);
3914 isl_factorizer_free(f);
3918 isl_basic_set_free(bset);
3922 /* Factor bset, call fn on each of the factors and return the product.
3923 * The function is assumed to evaluate to zero on empty domains,
3924 * to one on zero-dimensional domains and to infinity on unbounded domains
3925 * and will not be called explicitly on zero-dimensional or unbounded domains.
3927 * We first check for some special cases and remove all equalities.
3928 * Then we hand over control to compressed_multiplicative_call.
3930 __isl_give isl_pw_qpolynomial *isl_basic_set_multiplicative_call(
3931 __isl_take isl_basic_set *bset,
3932 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
3936 isl_pw_qpolynomial *pwqp;
3937 unsigned orig_nvar, final_nvar;
3942 if (isl_basic_set_fast_is_empty(bset))
3943 return constant_on_domain(bset, 0);
3945 orig_nvar = isl_basic_set_dim(bset, isl_dim_set);
3948 return constant_on_domain(bset, 1);
3950 bounded = isl_basic_set_is_bounded(bset);
3954 return constant_on_domain(bset, -1);
3956 if (bset->n_eq == 0)
3957 return compressed_multiplicative_call(bset, fn);
3959 morph = isl_basic_set_full_compression(bset);
3960 bset = isl_morph_basic_set(isl_morph_copy(morph), bset);
3962 final_nvar = isl_basic_set_dim(bset, isl_dim_set);
3964 pwqp = compressed_multiplicative_call(bset, fn);
3966 morph = isl_morph_remove_dom_dims(morph, isl_dim_set, 0, orig_nvar);
3967 morph = isl_morph_remove_ran_dims(morph, isl_dim_set, 0, final_nvar);
3968 morph = isl_morph_inverse(morph);
3970 pwqp = isl_pw_qpolynomial_morph(pwqp, morph);
3974 isl_basic_set_free(bset);
3978 /* Drop all floors in "qp", turning each integer division [a/m] into
3979 * a rational division a/m. If "down" is set, then the integer division
3980 * is replaces by (a-(m-1))/m instead.
3982 static __isl_give isl_qpolynomial *qp_drop_floors(
3983 __isl_take isl_qpolynomial *qp, int down)
3986 struct isl_upoly *s;
3990 if (qp->div->n_row == 0)
3993 qp = isl_qpolynomial_cow(qp);
3997 for (i = qp->div->n_row - 1; i >= 0; --i) {
3999 isl_int_sub(qp->div->row[i][1],
4000 qp->div->row[i][1], qp->div->row[i][0]);
4001 isl_int_add_ui(qp->div->row[i][1],
4002 qp->div->row[i][1], 1);
4004 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
4005 qp->div->row[i][0], qp->div->n_col - 1);
4006 qp = substitute_div(qp, i, s);
4014 /* Drop all floors in "pwqp", turning each integer division [a/m] into
4015 * a rational division a/m.
4017 static __isl_give isl_pw_qpolynomial *pwqp_drop_floors(
4018 __isl_take isl_pw_qpolynomial *pwqp)
4025 if (isl_pw_qpolynomial_is_zero(pwqp))
4028 pwqp = isl_pw_qpolynomial_cow(pwqp);
4032 for (i = 0; i < pwqp->n; ++i) {
4033 pwqp->p[i].qp = qp_drop_floors(pwqp->p[i].qp, 0);
4040 isl_pw_qpolynomial_free(pwqp);
4044 /* Adjust all the integer divisions in "qp" such that they are at least
4045 * one over the given orthant (identified by "signs"). This ensures
4046 * that they will still be non-negative even after subtracting (m-1)/m.
4048 * In particular, f is replaced by f' + v, changing f = [a/m]
4049 * to f' = [(a - m v)/m].
4050 * If the constant term k in a is smaller than m,
4051 * the constant term of v is set to floor(k/m) - 1.
4052 * For any other term, if the coefficient c and the variable x have
4053 * the same sign, then no changes are needed.
4054 * Otherwise, if the variable is positive (and c is negative),
4055 * then the coefficient of x in v is set to floor(c/m).
4056 * If the variable is negative (and c is positive),
4057 * then the coefficient of x in v is set to ceil(c/m).
4059 static __isl_give isl_qpolynomial *make_divs_pos(__isl_take isl_qpolynomial *qp,
4065 struct isl_upoly *s;
4067 qp = isl_qpolynomial_cow(qp);
4070 qp->div = isl_mat_cow(qp->div);
4074 total = isl_dim_total(qp->dim);
4075 v = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);
4077 for (i = 0; i < qp->div->n_row; ++i) {
4078 isl_int *row = qp->div->row[i];
4082 if (isl_int_lt(row[1], row[0])) {
4083 isl_int_fdiv_q(v->el[0], row[1], row[0]);
4084 isl_int_sub_ui(v->el[0], v->el[0], 1);
4085 isl_int_submul(row[1], row[0], v->el[0]);
4087 for (j = 0; j < total; ++j) {
4088 if (isl_int_sgn(row[2 + j]) * signs[j] >= 0)
4091 isl_int_cdiv_q(v->el[1 + j], row[2 + j], row[0]);
4093 isl_int_fdiv_q(v->el[1 + j], row[2 + j], row[0]);
4094 isl_int_submul(row[2 + j], row[0], v->el[1 + j]);
4096 for (j = 0; j < i; ++j) {
4097 if (isl_int_sgn(row[2 + total + j]) >= 0)
4099 isl_int_fdiv_q(v->el[1 + total + j],
4100 row[2 + total + j], row[0]);
4101 isl_int_submul(row[2 + total + j],
4102 row[0], v->el[1 + total + j]);
4104 for (j = i + 1; j < qp->div->n_row; ++j) {
4105 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
4107 isl_seq_combine(qp->div->row[j] + 1,
4108 qp->div->ctx->one, qp->div->row[j] + 1,
4109 qp->div->row[j][2 + total + i], v->el, v->size);
4111 isl_int_set_si(v->el[1 + total + i], 1);
4112 s = isl_upoly_from_affine(qp->dim->ctx, v->el,
4113 qp->div->ctx->one, v->size);
4114 qp->upoly = isl_upoly_subs(qp->upoly, total + i, 1, &s);
4124 isl_qpolynomial_free(qp);
4128 struct isl_to_poly_data {
4130 isl_pw_qpolynomial *res;
4131 isl_qpolynomial *qp;
4134 /* Appoximate data->qp by a polynomial on the orthant identified by "signs".
4135 * We first make all integer divisions positive and then split the
4136 * quasipolynomials into terms with sign data->sign (the direction
4137 * of the requested approximation) and terms with the opposite sign.
4138 * In the first set of terms, each integer division [a/m] is
4139 * overapproximated by a/m, while in the second it is underapproximated
4142 static int to_polynomial_on_orthant(__isl_take isl_set *orthant, int *signs,
4145 struct isl_to_poly_data *data = user;
4146 isl_pw_qpolynomial *t;
4147 isl_qpolynomial *qp, *up, *down;
4149 qp = isl_qpolynomial_copy(data->qp);
4150 qp = make_divs_pos(qp, signs);
4152 up = isl_qpolynomial_terms_of_sign(qp, signs, data->sign);
4153 up = qp_drop_floors(up, 0);
4154 down = isl_qpolynomial_terms_of_sign(qp, signs, -data->sign);
4155 down = qp_drop_floors(down, 1);
4157 isl_qpolynomial_free(qp);
4158 qp = isl_qpolynomial_add(up, down);
4160 t = isl_pw_qpolynomial_alloc(orthant, qp);
4161 data->res = isl_pw_qpolynomial_add_disjoint(data->res, t);
4166 /* Approximate each quasipolynomial by a polynomial. If "sign" is positive,
4167 * the polynomial will be an overapproximation. If "sign" is negative,
4168 * it will be an underapproximation. If "sign" is zero, the approximation
4169 * will lie somewhere in between.
4171 * In particular, is sign == 0, we simply drop the floors, turning
4172 * the integer divisions into rational divisions.
4173 * Otherwise, we split the domains into orthants, make all integer divisions
4174 * positive and then approximate each [a/m] by either a/m or (a-(m-1))/m,
4175 * depending on the requested sign and the sign of the term in which
4176 * the integer division appears.
4178 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_to_polynomial(
4179 __isl_take isl_pw_qpolynomial *pwqp, int sign)
4182 struct isl_to_poly_data data;
4185 return pwqp_drop_floors(pwqp);
4191 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_dim(pwqp));
4193 for (i = 0; i < pwqp->n; ++i) {
4194 if (pwqp->p[i].qp->div->n_row == 0) {
4195 isl_pw_qpolynomial *t;
4196 t = isl_pw_qpolynomial_alloc(
4197 isl_set_copy(pwqp->p[i].set),
4198 isl_qpolynomial_copy(pwqp->p[i].qp));
4199 data.res = isl_pw_qpolynomial_add_disjoint(data.res, t);
4202 data.qp = pwqp->p[i].qp;
4203 if (isl_set_foreach_orthant(pwqp->p[i].set,
4204 &to_polynomial_on_orthant, &data) < 0)
4208 isl_pw_qpolynomial_free(pwqp);
4212 isl_pw_qpolynomial_free(pwqp);
4213 isl_pw_qpolynomial_free(data.res);
4217 static int poly_entry(void **entry, void *user)
4220 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
4222 *pwqp = isl_pw_qpolynomial_to_polynomial(*pwqp, *sign);
4224 return *pwqp ? 0 : -1;
4227 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_to_polynomial(
4228 __isl_take isl_union_pw_qpolynomial *upwqp, int sign)
4230 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
4234 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
4235 &poly_entry, &sign) < 0)
4240 isl_union_pw_qpolynomial_free(upwqp);