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,
13 #include <isl_polynomial_private.h>
14 #include <isl_point_private.h>
16 #include <isl_map_private.h>
18 static unsigned pos(__isl_keep isl_dim *dim, enum isl_dim_type type)
21 case isl_dim_param: return 0;
22 case isl_dim_in: return dim->nparam;
23 case isl_dim_out: return dim->nparam + dim->n_in;
27 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
35 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
40 isl_assert(up->ctx, up->var < 0, return NULL);
42 return (struct isl_upoly_cst *)up;
45 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
50 isl_assert(up->ctx, up->var >= 0, return NULL);
52 return (struct isl_upoly_rec *)up;
55 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
56 __isl_keep struct isl_upoly *up2)
59 struct isl_upoly_rec *rec1, *rec2;
65 if (up1->var != up2->var)
67 if (isl_upoly_is_cst(up1)) {
68 struct isl_upoly_cst *cst1, *cst2;
69 cst1 = isl_upoly_as_cst(up1);
70 cst2 = isl_upoly_as_cst(up2);
73 return isl_int_eq(cst1->n, cst2->n) &&
74 isl_int_eq(cst1->d, cst2->d);
77 rec1 = isl_upoly_as_rec(up1);
78 rec2 = isl_upoly_as_rec(up2);
82 if (rec1->n != rec2->n)
85 for (i = 0; i < rec1->n; ++i) {
86 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
94 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
96 struct isl_upoly_cst *cst;
100 if (!isl_upoly_is_cst(up))
103 cst = isl_upoly_as_cst(up);
107 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
110 int isl_upoly_sgn(__isl_keep struct isl_upoly *up)
112 struct isl_upoly_cst *cst;
116 if (!isl_upoly_is_cst(up))
119 cst = isl_upoly_as_cst(up);
123 return isl_int_sgn(cst->n);
126 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
128 struct isl_upoly_cst *cst;
132 if (!isl_upoly_is_cst(up))
135 cst = isl_upoly_as_cst(up);
139 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
142 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
144 struct isl_upoly_cst *cst;
148 if (!isl_upoly_is_cst(up))
151 cst = isl_upoly_as_cst(up);
155 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
158 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
160 struct isl_upoly_cst *cst;
164 if (!isl_upoly_is_cst(up))
167 cst = isl_upoly_as_cst(up);
171 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
174 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
176 struct isl_upoly_cst *cst;
180 if (!isl_upoly_is_cst(up))
183 cst = isl_upoly_as_cst(up);
187 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
190 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
192 struct isl_upoly_cst *cst;
196 if (!isl_upoly_is_cst(up))
199 cst = isl_upoly_as_cst(up);
203 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
206 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
208 struct isl_upoly_cst *cst;
210 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
219 isl_int_init(cst->n);
220 isl_int_init(cst->d);
225 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
227 struct isl_upoly_cst *cst;
229 cst = isl_upoly_cst_alloc(ctx);
233 isl_int_set_si(cst->n, 0);
234 isl_int_set_si(cst->d, 1);
239 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
241 struct isl_upoly_cst *cst;
243 cst = isl_upoly_cst_alloc(ctx);
247 isl_int_set_si(cst->n, 1);
248 isl_int_set_si(cst->d, 0);
253 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
255 struct isl_upoly_cst *cst;
257 cst = isl_upoly_cst_alloc(ctx);
261 isl_int_set_si(cst->n, 0);
262 isl_int_set_si(cst->d, 0);
267 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
268 isl_int n, isl_int d)
270 struct isl_upoly_cst *cst;
272 cst = isl_upoly_cst_alloc(ctx);
276 isl_int_set(cst->n, n);
277 isl_int_set(cst->d, d);
282 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
285 struct isl_upoly_rec *rec;
287 isl_assert(ctx, var >= 0, return NULL);
288 isl_assert(ctx, size >= 0, return NULL);
289 rec = isl_calloc(dim->ctx, struct isl_upoly_rec,
290 sizeof(struct isl_upoly_rec) +
291 (size - 1) * sizeof(struct isl_upoly *));
305 isl_upoly_free(&rec->up);
309 isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp)
311 return qp ? qp->dim->ctx : NULL;
314 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
316 return qp ? isl_upoly_is_zero(qp->upoly) : -1;
319 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
321 return qp ? isl_upoly_is_one(qp->upoly) : -1;
324 int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
326 return qp ? isl_upoly_is_nan(qp->upoly) : -1;
329 int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
331 return qp ? isl_upoly_is_infty(qp->upoly) : -1;
334 int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
336 return qp ? isl_upoly_is_neginfty(qp->upoly) : -1;
339 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
341 return qp ? isl_upoly_sgn(qp->upoly) : 0;
344 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
346 isl_int_clear(cst->n);
347 isl_int_clear(cst->d);
350 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
354 for (i = 0; i < rec->n; ++i)
355 isl_upoly_free(rec->p[i]);
358 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
367 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
369 struct isl_upoly_cst *cst;
370 struct isl_upoly_cst *dup;
372 cst = isl_upoly_as_cst(up);
376 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
379 isl_int_set(dup->n, cst->n);
380 isl_int_set(dup->d, cst->d);
385 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
388 struct isl_upoly_rec *rec;
389 struct isl_upoly_rec *dup;
391 rec = isl_upoly_as_rec(up);
395 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
399 for (i = 0; i < rec->n; ++i) {
400 dup->p[i] = isl_upoly_copy(rec->p[i]);
408 isl_upoly_free(&dup->up);
412 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
414 struct isl_upoly *dup;
419 if (isl_upoly_is_cst(up))
420 return isl_upoly_dup_cst(up);
422 return isl_upoly_dup_rec(up);
425 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
433 return isl_upoly_dup(up);
436 void isl_upoly_free(__isl_take struct isl_upoly *up)
445 upoly_free_cst((struct isl_upoly_cst *)up);
447 upoly_free_rec((struct isl_upoly_rec *)up);
449 isl_ctx_deref(up->ctx);
453 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
458 isl_int_gcd(gcd, cst->n, cst->d);
459 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
460 isl_int_divexact(cst->n, cst->n, gcd);
461 isl_int_divexact(cst->d, cst->d, gcd);
466 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
467 __isl_take struct isl_upoly *up2)
469 struct isl_upoly_cst *cst1;
470 struct isl_upoly_cst *cst2;
472 up1 = isl_upoly_cow(up1);
476 cst1 = isl_upoly_as_cst(up1);
477 cst2 = isl_upoly_as_cst(up2);
479 if (isl_int_eq(cst1->d, cst2->d))
480 isl_int_add(cst1->n, cst1->n, cst2->n);
482 isl_int_mul(cst1->n, cst1->n, cst2->d);
483 isl_int_addmul(cst1->n, cst2->n, cst1->d);
484 isl_int_mul(cst1->d, cst1->d, cst2->d);
487 isl_upoly_cst_reduce(cst1);
497 static __isl_give struct isl_upoly *replace_by_zero(
498 __isl_take struct isl_upoly *up)
506 return isl_upoly_zero(ctx);
509 static __isl_give struct isl_upoly *replace_by_constant_term(
510 __isl_take struct isl_upoly *up)
512 struct isl_upoly_rec *rec;
513 struct isl_upoly *cst;
518 rec = isl_upoly_as_rec(up);
521 cst = isl_upoly_copy(rec->p[0]);
529 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
530 __isl_take struct isl_upoly *up2)
533 struct isl_upoly_rec *rec1, *rec2;
538 if (isl_upoly_is_nan(up1)) {
543 if (isl_upoly_is_nan(up2)) {
548 if (isl_upoly_is_zero(up1)) {
553 if (isl_upoly_is_zero(up2)) {
558 if (up1->var < up2->var)
559 return isl_upoly_sum(up2, up1);
561 if (up2->var < up1->var) {
562 struct isl_upoly_rec *rec;
563 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
567 up1 = isl_upoly_cow(up1);
568 rec = isl_upoly_as_rec(up1);
571 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
573 up1 = replace_by_constant_term(up1);
577 if (isl_upoly_is_cst(up1))
578 return isl_upoly_sum_cst(up1, up2);
580 rec1 = isl_upoly_as_rec(up1);
581 rec2 = isl_upoly_as_rec(up2);
585 if (rec1->n < rec2->n)
586 return isl_upoly_sum(up2, up1);
588 up1 = isl_upoly_cow(up1);
589 rec1 = isl_upoly_as_rec(up1);
593 for (i = rec2->n - 1; i >= 0; --i) {
594 rec1->p[i] = isl_upoly_sum(rec1->p[i],
595 isl_upoly_copy(rec2->p[i]));
598 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
599 isl_upoly_free(rec1->p[i]);
605 up1 = replace_by_zero(up1);
606 else if (rec1->n == 1)
607 up1 = replace_by_constant_term(up1);
618 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
620 struct isl_upoly_cst *cst;
622 if (isl_upoly_is_zero(up))
625 up = isl_upoly_cow(up);
629 cst = isl_upoly_as_cst(up);
631 isl_int_neg(cst->n, cst->n);
636 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
639 struct isl_upoly_rec *rec;
644 if (isl_upoly_is_cst(up))
645 return isl_upoly_neg_cst(up);
647 up = isl_upoly_cow(up);
648 rec = isl_upoly_as_rec(up);
652 for (i = 0; i < rec->n; ++i) {
653 rec->p[i] = isl_upoly_neg(rec->p[i]);
664 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
665 __isl_take struct isl_upoly *up2)
667 struct isl_upoly_cst *cst1;
668 struct isl_upoly_cst *cst2;
670 up1 = isl_upoly_cow(up1);
674 cst1 = isl_upoly_as_cst(up1);
675 cst2 = isl_upoly_as_cst(up2);
677 isl_int_mul(cst1->n, cst1->n, cst2->n);
678 isl_int_mul(cst1->d, cst1->d, cst2->d);
680 isl_upoly_cst_reduce(cst1);
690 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
691 __isl_take struct isl_upoly *up2)
693 struct isl_upoly_rec *rec1;
694 struct isl_upoly_rec *rec2;
695 struct isl_upoly_rec *res;
699 rec1 = isl_upoly_as_rec(up1);
700 rec2 = isl_upoly_as_rec(up2);
703 size = rec1->n + rec2->n - 1;
704 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
708 for (i = 0; i < rec1->n; ++i) {
709 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
710 isl_upoly_copy(rec1->p[i]));
715 for (; i < size; ++i) {
716 res->p[i] = isl_upoly_zero(up1->ctx);
721 for (i = 0; i < rec1->n; ++i) {
722 for (j = 1; j < rec2->n; ++j) {
723 struct isl_upoly *up;
724 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
725 isl_upoly_copy(rec1->p[i]));
726 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
739 isl_upoly_free(&res->up);
743 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
744 __isl_take struct isl_upoly *up2)
749 if (isl_upoly_is_nan(up1)) {
754 if (isl_upoly_is_nan(up2)) {
759 if (isl_upoly_is_zero(up1)) {
764 if (isl_upoly_is_zero(up2)) {
769 if (isl_upoly_is_one(up1)) {
774 if (isl_upoly_is_one(up2)) {
779 if (up1->var < up2->var)
780 return isl_upoly_mul(up2, up1);
782 if (up2->var < up1->var) {
784 struct isl_upoly_rec *rec;
785 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
786 isl_ctx *ctx = up1->ctx;
789 return isl_upoly_nan(ctx);
791 up1 = isl_upoly_cow(up1);
792 rec = isl_upoly_as_rec(up1);
796 for (i = 0; i < rec->n; ++i) {
797 rec->p[i] = isl_upoly_mul(rec->p[i],
798 isl_upoly_copy(up2));
806 if (isl_upoly_is_cst(up1))
807 return isl_upoly_mul_cst(up1, up2);
809 return isl_upoly_mul_rec(up1, up2);
816 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
817 unsigned n_div, __isl_take struct isl_upoly *up)
819 struct isl_qpolynomial *qp = NULL;
825 total = isl_dim_total(dim);
827 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
832 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
843 isl_qpolynomial_free(qp);
847 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
856 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
858 struct isl_qpolynomial *dup;
863 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row,
864 isl_upoly_copy(qp->upoly));
867 isl_mat_free(dup->div);
868 dup->div = isl_mat_copy(qp->div);
874 isl_qpolynomial_free(dup);
878 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
886 return isl_qpolynomial_dup(qp);
889 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
897 isl_dim_free(qp->dim);
898 isl_mat_free(qp->div);
899 isl_upoly_free(qp->upoly);
904 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
909 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
910 div1->n_col >= div2->n_col, return -1);
912 if (div1->n_row == div2->n_row)
913 return isl_mat_is_equal(div1, div2);
917 div1->n_row = div2->n_row;
918 div1->n_col = div2->n_col;
920 equal = isl_mat_is_equal(div1, div2);
928 static void expand_row(__isl_keep isl_mat *dst, int d,
929 __isl_keep isl_mat *src, int s, int *exp)
932 unsigned c = src->n_col - src->n_row;
934 isl_seq_cpy(dst->row[d], src->row[s], c);
935 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
937 for (i = 0; i < s; ++i)
938 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
941 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
945 li = isl_seq_last_non_zero(div->row[i], div->n_col);
946 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
951 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
954 struct isl_div_sort_info {
959 static int div_sort_cmp(const void *p1, const void *p2)
961 const struct isl_div_sort_info *i1, *i2;
962 i1 = (const struct isl_div_sort_info *) p1;
963 i2 = (const struct isl_div_sort_info *) p2;
965 return cmp_row(i1->div, i1->row, i2->row);
968 static __isl_give isl_mat *sort_divs(__isl_take isl_mat *div)
971 struct isl_div_sort_info *array = NULL;
979 array = isl_alloc_array(div->ctx, struct isl_div_sort_info, div->n_row);
980 pos = isl_alloc_array(div->ctx, int, div->n_row);
984 for (i = 0; i < div->n_row; ++i) {
990 qsort(array, div->n_row, sizeof(struct isl_div_sort_info),
993 for (i = 0; i < div->n_row; ++i) {
995 if (pos[array[i].row] == i)
997 div = isl_mat_cow(div);
998 div = isl_mat_swap_rows(div, i, pos[array[i].row]);
999 t = pos[array[i].row];
1000 pos[array[i].row] = pos[i];
1014 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
1015 __isl_keep isl_mat *div2, int *exp1, int *exp2)
1018 isl_mat *div = NULL;
1019 unsigned d = div1->n_col - div1->n_row;
1021 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
1022 d + div1->n_row + div2->n_row);
1026 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
1029 expand_row(div, k, div1, i, exp1);
1030 expand_row(div, k + 1, div2, j, exp2);
1032 cmp = cmp_row(div, k, k + 1);
1036 } else if (cmp < 0) {
1040 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1043 for (; i < div1->n_row; ++i, ++k) {
1044 expand_row(div, k, div1, i, exp1);
1047 for (; j < div2->n_row; ++j, ++k) {
1048 expand_row(div, k, div2, j, exp2);
1058 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1059 int *exp, int first)
1062 struct isl_upoly_rec *rec;
1064 if (isl_upoly_is_cst(up))
1067 if (up->var < first)
1070 if (exp[up->var - first] == up->var - first)
1073 up = isl_upoly_cow(up);
1077 up->var = exp[up->var - first] + first;
1079 rec = isl_upoly_as_rec(up);
1083 for (i = 0; i < rec->n; ++i) {
1084 rec->p[i] = expand(rec->p[i], exp, first);
1095 static __isl_give isl_qpolynomial *with_merged_divs(
1096 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1097 __isl_take isl_qpolynomial *qp2),
1098 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1102 isl_mat *div = NULL;
1104 qp1 = isl_qpolynomial_cow(qp1);
1105 qp2 = isl_qpolynomial_cow(qp2);
1110 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1111 qp1->div->n_col >= qp2->div->n_col, goto error);
1113 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1114 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1118 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1122 isl_mat_free(qp1->div);
1123 qp1->div = isl_mat_copy(div);
1124 isl_mat_free(qp2->div);
1125 qp2->div = isl_mat_copy(div);
1127 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1128 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1130 if (!qp1->upoly || !qp2->upoly)
1137 return fn(qp1, qp2);
1142 isl_qpolynomial_free(qp1);
1143 isl_qpolynomial_free(qp2);
1147 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1148 __isl_take isl_qpolynomial *qp2)
1150 qp1 = isl_qpolynomial_cow(qp1);
1155 if (qp1->div->n_row < qp2->div->n_row)
1156 return isl_qpolynomial_add(qp2, qp1);
1158 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1159 if (!compatible_divs(qp1->div, qp2->div))
1160 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1162 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1166 isl_qpolynomial_free(qp2);
1170 isl_qpolynomial_free(qp1);
1171 isl_qpolynomial_free(qp2);
1175 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1176 __isl_take isl_qpolynomial *qp2)
1178 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1181 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1183 qp = isl_qpolynomial_cow(qp);
1188 qp->upoly = isl_upoly_neg(qp->upoly);
1194 isl_qpolynomial_free(qp);
1198 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1199 __isl_take isl_qpolynomial *qp2)
1201 qp1 = isl_qpolynomial_cow(qp1);
1206 if (qp1->div->n_row < qp2->div->n_row)
1207 return isl_qpolynomial_mul(qp2, qp1);
1209 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1210 if (!compatible_divs(qp1->div, qp2->div))
1211 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1213 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1217 isl_qpolynomial_free(qp2);
1221 isl_qpolynomial_free(qp1);
1222 isl_qpolynomial_free(qp2);
1226 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1228 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1231 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1233 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1236 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1238 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1241 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1244 struct isl_qpolynomial *qp;
1245 struct isl_upoly_cst *cst;
1247 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1251 cst = isl_upoly_as_cst(qp->upoly);
1252 isl_int_set(cst->n, v);
1256 isl_qpolynomial_free(qp);
1260 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1261 isl_int *n, isl_int *d)
1263 struct isl_upoly_cst *cst;
1268 if (!isl_upoly_is_cst(qp->upoly))
1271 cst = isl_upoly_as_cst(qp->upoly);
1276 isl_int_set(*n, cst->n);
1278 isl_int_set(*d, cst->d);
1283 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1286 struct isl_upoly_rec *rec;
1294 rec = isl_upoly_as_rec(up);
1301 isl_assert(up->ctx, rec->n > 1, return -1);
1303 is_cst = isl_upoly_is_cst(rec->p[1]);
1309 return isl_upoly_is_affine(rec->p[0]);
1312 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1317 if (qp->div->n_row > 0)
1320 return isl_upoly_is_affine(qp->upoly);
1323 static void update_coeff(__isl_keep isl_vec *aff,
1324 __isl_keep struct isl_upoly_cst *cst, int pos)
1329 if (isl_int_is_zero(cst->n))
1334 isl_int_gcd(gcd, cst->d, aff->el[0]);
1335 isl_int_divexact(f, cst->d, gcd);
1336 isl_int_divexact(gcd, aff->el[0], gcd);
1337 isl_seq_scale(aff->el, aff->el, f, aff->size);
1338 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1343 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1344 __isl_keep isl_vec *aff)
1346 struct isl_upoly_cst *cst;
1347 struct isl_upoly_rec *rec;
1353 struct isl_upoly_cst *cst;
1355 cst = isl_upoly_as_cst(up);
1358 update_coeff(aff, cst, 0);
1362 rec = isl_upoly_as_rec(up);
1365 isl_assert(up->ctx, rec->n == 2, return -1);
1367 cst = isl_upoly_as_cst(rec->p[1]);
1370 update_coeff(aff, cst, 1 + up->var);
1372 return isl_upoly_update_affine(rec->p[0], aff);
1375 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1376 __isl_keep isl_qpolynomial *qp)
1384 isl_assert(qp->div->ctx, qp->div->n_row == 0, return NULL);
1385 d = isl_dim_total(qp->dim);
1386 aff = isl_vec_alloc(qp->div->ctx, 2 + d);
1390 isl_seq_clr(aff->el + 1, 1 + d);
1391 isl_int_set_si(aff->el[0], 1);
1393 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1402 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1403 __isl_keep isl_qpolynomial *qp2)
1408 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1411 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1414 struct isl_upoly_rec *rec;
1416 if (isl_upoly_is_cst(up)) {
1417 struct isl_upoly_cst *cst;
1418 cst = isl_upoly_as_cst(up);
1421 isl_int_lcm(*d, *d, cst->d);
1425 rec = isl_upoly_as_rec(up);
1429 for (i = 0; i < rec->n; ++i)
1430 upoly_update_den(rec->p[i], d);
1433 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1435 isl_int_set_si(*d, 1);
1438 upoly_update_den(qp->upoly, d);
1441 __isl_give struct isl_upoly *isl_upoly_pow(isl_ctx *ctx, int pos, int power)
1444 struct isl_upoly *up;
1445 struct isl_upoly_rec *rec;
1446 struct isl_upoly_cst *cst;
1448 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
1451 for (i = 0; i < 1 + power; ++i) {
1452 rec->p[i] = isl_upoly_zero(ctx);
1457 cst = isl_upoly_as_cst(rec->p[power]);
1458 isl_int_set_si(cst->n, 1);
1462 isl_upoly_free(&rec->up);
1466 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1469 struct isl_ctx *ctx;
1476 return isl_qpolynomial_alloc(dim, 0, isl_upoly_pow(ctx, pos, power));
1479 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1480 enum isl_dim_type type, unsigned pos)
1485 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1486 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1488 if (type == isl_dim_set)
1489 pos += isl_dim_size(dim, isl_dim_param);
1491 return isl_qpolynomial_pow(dim, pos, 1);
1497 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1500 struct isl_qpolynomial *qp = NULL;
1501 struct isl_upoly_rec *rec;
1502 struct isl_upoly_cst *cst;
1508 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1510 pos = isl_dim_total(div->bmap->dim);
1511 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
1512 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1,
1517 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1518 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1520 for (i = 0; i < 1 + power; ++i) {
1521 rec->p[i] = isl_upoly_zero(div->ctx);
1526 cst = isl_upoly_as_cst(rec->p[power]);
1527 isl_int_set_si(cst->n, 1);
1533 isl_qpolynomial_free(qp);
1538 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1540 return isl_qpolynomial_div_pow(div, 1);
1543 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1544 const isl_int n, const isl_int d)
1546 struct isl_qpolynomial *qp;
1547 struct isl_upoly_cst *cst;
1549 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1553 cst = isl_upoly_as_cst(qp->upoly);
1554 isl_int_set(cst->n, n);
1555 isl_int_set(cst->d, d);
1559 isl_qpolynomial_free(qp);
1563 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1565 struct isl_upoly_rec *rec;
1571 if (isl_upoly_is_cst(up))
1575 active[up->var] = 1;
1577 rec = isl_upoly_as_rec(up);
1578 for (i = 0; i < rec->n; ++i)
1579 if (up_set_active(rec->p[i], active, d) < 0)
1585 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1588 int d = isl_dim_total(qp->dim);
1593 for (i = 0; i < d; ++i)
1594 for (j = 0; j < qp->div->n_row; ++j) {
1595 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1601 return up_set_active(qp->upoly, active, d);
1604 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1605 enum isl_dim_type type, unsigned first, unsigned n)
1616 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1618 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1619 type == isl_dim_set, return -1);
1621 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1622 if (set_active(qp, active) < 0)
1625 if (type == isl_dim_set)
1626 first += isl_dim_size(qp->dim, isl_dim_param);
1627 for (i = 0; i < n; ++i)
1628 if (active[first + i]) {
1641 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1642 unsigned first, unsigned n)
1645 struct isl_upoly_rec *rec;
1649 if (n == 0 || up->var < 0 || up->var < first)
1651 if (up->var < first + n) {
1652 up = replace_by_constant_term(up);
1653 return isl_upoly_drop(up, first, n);
1655 up = isl_upoly_cow(up);
1659 rec = isl_upoly_as_rec(up);
1663 for (i = 0; i < rec->n; ++i) {
1664 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1675 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1676 __isl_take isl_qpolynomial *qp,
1677 enum isl_dim_type type, unsigned first, unsigned n)
1684 qp = isl_qpolynomial_cow(qp);
1688 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1690 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1691 type == isl_dim_set, goto error);
1693 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1697 if (type == isl_dim_set)
1698 first += isl_dim_size(qp->dim, isl_dim_param);
1700 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1704 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1710 isl_qpolynomial_free(qp);
1715 #define PW isl_pw_qpolynomial
1717 #define EL isl_qpolynomial
1719 #define IS_ZERO is_zero
1723 #define ADD(d,e1,e2) isl_qpolynomial_add(e1,e2)
1725 #include <isl_pw_templ.c>
1727 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
1735 if (!isl_set_fast_is_universe(pwqp->p[0].set))
1738 return isl_qpolynomial_is_one(pwqp->p[0].qp);
1741 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
1742 __isl_take isl_pw_qpolynomial *pwqp1,
1743 __isl_take isl_pw_qpolynomial *pwqp2)
1746 struct isl_pw_qpolynomial *res;
1749 if (!pwqp1 || !pwqp2)
1752 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
1755 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
1756 isl_pw_qpolynomial_free(pwqp2);
1760 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
1761 isl_pw_qpolynomial_free(pwqp1);
1765 if (isl_pw_qpolynomial_is_one(pwqp1)) {
1766 isl_pw_qpolynomial_free(pwqp1);
1770 if (isl_pw_qpolynomial_is_one(pwqp2)) {
1771 isl_pw_qpolynomial_free(pwqp2);
1775 n = pwqp1->n * pwqp2->n;
1776 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
1778 for (i = 0; i < pwqp1->n; ++i) {
1779 for (j = 0; j < pwqp2->n; ++j) {
1780 struct isl_set *common;
1781 struct isl_qpolynomial *prod;
1782 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
1783 isl_set_copy(pwqp2->p[j].set));
1784 if (isl_set_fast_is_empty(common)) {
1785 isl_set_free(common);
1789 prod = isl_qpolynomial_mul(
1790 isl_qpolynomial_copy(pwqp1->p[i].qp),
1791 isl_qpolynomial_copy(pwqp2->p[j].qp));
1793 res = isl_pw_qpolynomial_add_piece(res, common, prod);
1797 isl_pw_qpolynomial_free(pwqp1);
1798 isl_pw_qpolynomial_free(pwqp2);
1802 isl_pw_qpolynomial_free(pwqp1);
1803 isl_pw_qpolynomial_free(pwqp2);
1807 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
1808 __isl_take isl_pw_qpolynomial *pwqp)
1811 struct isl_pw_qpolynomial *res;
1817 if (isl_pw_qpolynomial_is_zero(pwqp))
1820 pwqp = isl_pw_qpolynomial_cow(pwqp);
1822 for (i = 0; i < pwqp->n; ++i) {
1823 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
1830 isl_pw_qpolynomial_free(pwqp);
1834 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
1835 __isl_take isl_pw_qpolynomial *pwqp1,
1836 __isl_take isl_pw_qpolynomial *pwqp2)
1838 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
1841 __isl_give struct isl_upoly *isl_upoly_eval(
1842 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
1845 struct isl_upoly_rec *rec;
1846 struct isl_upoly *res;
1847 struct isl_upoly *base;
1849 if (isl_upoly_is_cst(up)) {
1854 rec = isl_upoly_as_rec(up);
1858 isl_assert(up->ctx, rec->n >= 1, goto error);
1860 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
1862 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
1865 for (i = rec->n - 2; i >= 0; --i) {
1866 res = isl_upoly_mul(res, isl_upoly_copy(base));
1867 res = isl_upoly_sum(res,
1868 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
1869 isl_vec_copy(vec)));
1872 isl_upoly_free(base);
1882 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
1883 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
1886 struct isl_upoly *up;
1891 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
1893 if (qp->div->n_row == 0)
1894 ext = isl_vec_copy(pnt->vec);
1897 unsigned dim = isl_dim_total(qp->dim);
1898 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
1902 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
1903 for (i = 0; i < qp->div->n_row; ++i) {
1904 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
1905 1 + dim + i, &ext->el[1+dim+i]);
1906 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
1907 qp->div->row[i][0]);
1911 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
1915 dim = isl_dim_copy(qp->dim);
1916 isl_qpolynomial_free(qp);
1917 isl_point_free(pnt);
1919 return isl_qpolynomial_alloc(dim, 0, up);
1921 isl_qpolynomial_free(qp);
1922 isl_point_free(pnt);
1926 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
1927 __isl_keep struct isl_upoly_cst *cst2)
1932 isl_int_mul(t, cst1->n, cst2->d);
1933 isl_int_submul(t, cst2->n, cst1->d);
1934 cmp = isl_int_sgn(t);
1939 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
1940 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1942 struct isl_upoly_cst *cst1, *cst2;
1947 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1948 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1949 cst1 = isl_upoly_as_cst(qp1->upoly);
1950 cst2 = isl_upoly_as_cst(qp2->upoly);
1951 cmp = isl_upoly_cmp(cst1, cst2);
1954 isl_qpolynomial_free(qp2);
1956 isl_qpolynomial_free(qp1);
1961 isl_qpolynomial_free(qp1);
1962 isl_qpolynomial_free(qp2);
1966 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
1967 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1969 struct isl_upoly_cst *cst1, *cst2;
1974 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1975 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1976 cst1 = isl_upoly_as_cst(qp1->upoly);
1977 cst2 = isl_upoly_as_cst(qp2->upoly);
1978 cmp = isl_upoly_cmp(cst1, cst2);
1981 isl_qpolynomial_free(qp2);
1983 isl_qpolynomial_free(qp1);
1988 isl_qpolynomial_free(qp1);
1989 isl_qpolynomial_free(qp2);
1993 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
1994 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2003 qp = isl_qpolynomial_cow(qp);
2007 g_pos = pos(qp->dim, type) + isl_dim_size(qp->dim, type);
2009 qp->div = isl_mat_insert_cols(qp->div, 2 + g_pos, n);
2013 total = qp->div->n_col - 2;
2014 if (total > g_pos) {
2016 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2019 for (i = 0; i < total - g_pos; ++i)
2021 qp->upoly = expand(qp->upoly, exp, g_pos);
2027 qp->dim = isl_dim_add(qp->dim, type, n);
2033 isl_qpolynomial_free(qp);
2037 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2038 __isl_take isl_pw_qpolynomial *pwqp,
2039 enum isl_dim_type type, unsigned n)
2046 pwqp = isl_pw_qpolynomial_cow(pwqp);
2050 pwqp->dim = isl_dim_add(pwqp->dim, type, n);
2054 for (i = 0; i < pwqp->n; ++i) {
2055 pwqp->p[i].set = isl_set_add(pwqp->p[i].set, type, n);
2056 if (!pwqp->p[i].set)
2058 pwqp->p[i].qp = isl_qpolynomial_add_dims(pwqp->p[i].qp, type, n);
2065 isl_pw_qpolynomial_free(pwqp);
2069 static int *reordering_move(isl_ctx *ctx,
2070 unsigned len, unsigned dst, unsigned src, unsigned n)
2075 reordering = isl_alloc_array(ctx, int, len);
2080 for (i = 0; i < dst; ++i)
2082 for (i = 0; i < n; ++i)
2083 reordering[src + i] = dst + i;
2084 for (i = 0; i < src - dst; ++i)
2085 reordering[dst + i] = dst + n + i;
2086 for (i = 0; i < len - src - n; ++i)
2087 reordering[src + n + i] = src + n + i;
2089 for (i = 0; i < src; ++i)
2091 for (i = 0; i < n; ++i)
2092 reordering[src + i] = dst + i;
2093 for (i = 0; i < dst - src; ++i)
2094 reordering[src + n + i] = src + i;
2095 for (i = 0; i < len - dst - n; ++i)
2096 reordering[dst + n + i] = dst + n + i;
2102 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
2106 struct isl_upoly_rec *rec;
2107 struct isl_upoly *base;
2108 struct isl_upoly *res;
2110 if (isl_upoly_is_cst(up))
2113 rec = isl_upoly_as_rec(up);
2117 isl_assert(up->ctx, rec->n >= 1, goto error);
2119 base = isl_upoly_pow(up->ctx, r[up->var], 1);
2120 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
2122 for (i = rec->n - 2; i >= 0; --i) {
2123 res = isl_upoly_mul(res, isl_upoly_copy(base));
2124 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
2127 isl_upoly_free(base);
2136 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
2137 __isl_take isl_qpolynomial *qp,
2138 enum isl_dim_type dst_type, unsigned dst_pos,
2139 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2145 qp = isl_qpolynomial_cow(qp);
2149 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2152 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2153 g_src_pos = pos(qp->dim, src_type) + src_pos;
2154 if (dst_type > src_type)
2157 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2158 qp->div = sort_divs(qp->div);
2162 reordering = reordering_move(qp->dim->ctx,
2163 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2167 qp->upoly = reorder(qp->upoly, reordering);
2172 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2178 isl_qpolynomial_free(qp);
2182 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_move(
2183 __isl_take isl_pw_qpolynomial *pwqp,
2184 enum isl_dim_type dst_type, unsigned dst_pos,
2185 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2189 pwqp = isl_pw_qpolynomial_cow(pwqp);
2193 pwqp->dim = isl_dim_move(pwqp->dim,
2194 dst_type, dst_pos, src_type, src_pos, n);
2198 for (i = 0; i < pwqp->n; ++i) {
2199 pwqp->p[i].set = isl_set_move_dims(pwqp->p[i].set,
2201 src_type, src_pos, n);
2202 if (!pwqp->p[i].set)
2204 pwqp->p[i].qp = isl_qpolynomial_move_dims(pwqp->p[i].qp,
2205 dst_type, dst_pos, src_type, src_pos, n);
2212 isl_pw_qpolynomial_free(pwqp);
2216 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2217 __isl_take isl_mat *div)
2225 n = isl_dim_total(dim) + div->n_row;
2227 term = isl_calloc(dim->ctx, struct isl_term,
2228 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2235 isl_int_init(term->n);
2236 isl_int_init(term->d);
2245 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
2254 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
2263 total = isl_dim_total(term->dim) + term->div->n_row;
2265 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
2269 isl_int_set(dup->n, term->n);
2270 isl_int_set(dup->d, term->d);
2272 for (i = 0; i < total; ++i)
2273 dup->pow[i] = term->pow[i];
2278 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
2286 return isl_term_dup(term);
2289 void isl_term_free(__isl_take isl_term *term)
2294 if (--term->ref > 0)
2297 isl_dim_free(term->dim);
2298 isl_mat_free(term->div);
2299 isl_int_clear(term->n);
2300 isl_int_clear(term->d);
2304 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
2312 case isl_dim_out: return isl_dim_size(term->dim, type);
2313 case isl_dim_div: return term->div->n_row;
2314 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
2318 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
2320 return term ? term->dim->ctx : NULL;
2323 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
2327 isl_int_set(*n, term->n);
2330 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
2334 isl_int_set(*d, term->d);
2337 int isl_term_get_exp(__isl_keep isl_term *term,
2338 enum isl_dim_type type, unsigned pos)
2343 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
2345 if (type >= isl_dim_set)
2346 pos += isl_dim_size(term->dim, isl_dim_param);
2347 if (type >= isl_dim_div)
2348 pos += isl_dim_size(term->dim, isl_dim_set);
2350 return term->pow[pos];
2353 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
2355 isl_basic_map *bmap;
2362 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
2365 total = term->div->n_col - term->div->n_row - 2;
2366 /* No nested divs for now */
2367 isl_assert(term->dim->ctx,
2368 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
2369 term->div->n_row) == -1,
2372 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
2373 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
2376 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
2378 return isl_basic_map_div(bmap, k);
2380 isl_basic_map_free(bmap);
2384 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
2385 int (*fn)(__isl_take isl_term *term, void *user),
2386 __isl_take isl_term *term, void *user)
2389 struct isl_upoly_rec *rec;
2394 if (isl_upoly_is_zero(up))
2397 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
2398 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
2399 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
2401 if (isl_upoly_is_cst(up)) {
2402 struct isl_upoly_cst *cst;
2403 cst = isl_upoly_as_cst(up);
2406 term = isl_term_cow(term);
2409 isl_int_set(term->n, cst->n);
2410 isl_int_set(term->d, cst->d);
2411 if (fn(isl_term_copy(term), user) < 0)
2416 rec = isl_upoly_as_rec(up);
2420 for (i = 0; i < rec->n; ++i) {
2421 term = isl_term_cow(term);
2424 term->pow[up->var] = i;
2425 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
2429 term->pow[up->var] = 0;
2433 isl_term_free(term);
2437 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
2438 int (*fn)(__isl_take isl_term *term, void *user), void *user)
2445 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
2449 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
2451 isl_term_free(term);
2453 return term ? 0 : -1;
2456 int isl_pw_qpolynomial_foreach_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2457 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2458 void *user), void *user)
2465 for (i = 0; i < pwqp->n; ++i)
2466 if (fn(isl_set_copy(pwqp->p[i].set),
2467 isl_qpolynomial_copy(pwqp->p[i].qp), user) < 0)
2473 static int any_divs(__isl_keep isl_set *set)
2480 for (i = 0; i < set->n; ++i)
2481 if (set->p[i]->n_div > 0)
2487 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
2488 __isl_take isl_dim *dim)
2493 if (isl_dim_equal(qp->dim, dim)) {
2498 qp = isl_qpolynomial_cow(qp);
2502 if (qp->div->n_row) {
2508 extra = isl_dim_size(dim, isl_dim_set) -
2509 isl_dim_size(qp->dim, isl_dim_set);
2510 total = isl_dim_total(qp->dim);
2511 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
2514 for (i = 0; i < qp->div->n_row; ++i)
2516 qp->upoly = expand(qp->upoly, exp, total);
2520 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
2523 for (i = 0; i < qp->div->n_row; ++i)
2524 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
2527 isl_dim_free(qp->dim);
2533 isl_qpolynomial_free(qp);
2537 static int foreach_lifted_subset(__isl_take isl_set *set,
2538 __isl_take isl_qpolynomial *qp,
2539 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2540 void *user), void *user)
2547 for (i = 0; i < set->n; ++i) {
2549 isl_qpolynomial *copy;
2551 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
2552 lift = isl_set_lift(lift);
2554 copy = isl_qpolynomial_copy(qp);
2555 copy = isl_qpolynomial_lift(copy, isl_set_get_dim(lift));
2557 if (fn(lift, copy, user) < 0)
2562 isl_qpolynomial_free(qp);
2567 isl_qpolynomial_free(qp);
2571 int isl_pw_qpolynomial_foreach_lifted_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2572 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2573 void *user), void *user)
2580 for (i = 0; i < pwqp->n; ++i) {
2582 isl_qpolynomial *qp;
2584 set = isl_set_copy(pwqp->p[i].set);
2585 qp = isl_qpolynomial_copy(pwqp->p[i].qp);
2586 if (!any_divs(set)) {
2587 if (fn(set, qp, user) < 0)
2591 if (foreach_lifted_subset(set, qp, fn, user) < 0)
2598 /* For each parameter or variable that does not appear in qp,
2599 * first eliminate the variable from all constraints and then set it to zero.
2601 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
2602 __isl_keep isl_qpolynomial *qp)
2613 d = isl_dim_total(set->dim);
2614 active = isl_calloc_array(set->ctx, int, d);
2615 if (set_active(qp, active) < 0)
2618 for (i = 0; i < d; ++i)
2627 nparam = isl_dim_size(set->dim, isl_dim_param);
2628 nvar = isl_dim_size(set->dim, isl_dim_set);
2629 for (i = 0; i < nparam; ++i) {
2632 set = isl_set_eliminate(set, isl_dim_param, i, 1);
2633 set = isl_set_fix_si(set, isl_dim_param, i, 0);
2635 for (i = 0; i < nvar; ++i) {
2636 if (active[nparam + i])
2638 set = isl_set_eliminate(set, isl_dim_set, i, 1);
2639 set = isl_set_fix_si(set, isl_dim_set, i, 0);
2651 struct isl_opt_data {
2652 isl_qpolynomial *qp;
2654 isl_qpolynomial *opt;
2658 static int opt_fn(__isl_take isl_point *pnt, void *user)
2660 struct isl_opt_data *data = (struct isl_opt_data *)user;
2661 isl_qpolynomial *val;
2663 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
2667 } else if (data->max) {
2668 data->opt = isl_qpolynomial_max_cst(data->opt, val);
2670 data->opt = isl_qpolynomial_min_cst(data->opt, val);
2676 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
2677 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
2679 struct isl_opt_data data = { NULL, 1, NULL, max };
2684 if (isl_upoly_is_cst(qp->upoly)) {
2689 set = fix_inactive(set, qp);
2692 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
2696 isl_qpolynomial_free(qp);
2700 isl_qpolynomial_free(qp);
2701 isl_qpolynomial_free(data.opt);