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 __isl_give isl_dim *isl_qpolynomial_get_dim(__isl_keep isl_qpolynomial *qp)
316 return qp ? isl_dim_copy(qp->dim) : NULL;
319 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
321 return qp ? isl_upoly_is_zero(qp->upoly) : -1;
324 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
326 return qp ? isl_upoly_is_one(qp->upoly) : -1;
329 int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
331 return qp ? isl_upoly_is_nan(qp->upoly) : -1;
334 int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
336 return qp ? isl_upoly_is_infty(qp->upoly) : -1;
339 int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
341 return qp ? isl_upoly_is_neginfty(qp->upoly) : -1;
344 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
346 return qp ? isl_upoly_sgn(qp->upoly) : 0;
349 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
351 isl_int_clear(cst->n);
352 isl_int_clear(cst->d);
355 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
359 for (i = 0; i < rec->n; ++i)
360 isl_upoly_free(rec->p[i]);
363 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
372 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
374 struct isl_upoly_cst *cst;
375 struct isl_upoly_cst *dup;
377 cst = isl_upoly_as_cst(up);
381 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
384 isl_int_set(dup->n, cst->n);
385 isl_int_set(dup->d, cst->d);
390 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
393 struct isl_upoly_rec *rec;
394 struct isl_upoly_rec *dup;
396 rec = isl_upoly_as_rec(up);
400 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
404 for (i = 0; i < rec->n; ++i) {
405 dup->p[i] = isl_upoly_copy(rec->p[i]);
413 isl_upoly_free(&dup->up);
417 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
419 struct isl_upoly *dup;
424 if (isl_upoly_is_cst(up))
425 return isl_upoly_dup_cst(up);
427 return isl_upoly_dup_rec(up);
430 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
438 return isl_upoly_dup(up);
441 void isl_upoly_free(__isl_take struct isl_upoly *up)
450 upoly_free_cst((struct isl_upoly_cst *)up);
452 upoly_free_rec((struct isl_upoly_rec *)up);
454 isl_ctx_deref(up->ctx);
458 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
463 isl_int_gcd(gcd, cst->n, cst->d);
464 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
465 isl_int_divexact(cst->n, cst->n, gcd);
466 isl_int_divexact(cst->d, cst->d, gcd);
471 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
472 __isl_take struct isl_upoly *up2)
474 struct isl_upoly_cst *cst1;
475 struct isl_upoly_cst *cst2;
477 up1 = isl_upoly_cow(up1);
481 cst1 = isl_upoly_as_cst(up1);
482 cst2 = isl_upoly_as_cst(up2);
484 if (isl_int_eq(cst1->d, cst2->d))
485 isl_int_add(cst1->n, cst1->n, cst2->n);
487 isl_int_mul(cst1->n, cst1->n, cst2->d);
488 isl_int_addmul(cst1->n, cst2->n, cst1->d);
489 isl_int_mul(cst1->d, cst1->d, cst2->d);
492 isl_upoly_cst_reduce(cst1);
502 static __isl_give struct isl_upoly *replace_by_zero(
503 __isl_take struct isl_upoly *up)
511 return isl_upoly_zero(ctx);
514 static __isl_give struct isl_upoly *replace_by_constant_term(
515 __isl_take struct isl_upoly *up)
517 struct isl_upoly_rec *rec;
518 struct isl_upoly *cst;
523 rec = isl_upoly_as_rec(up);
526 cst = isl_upoly_copy(rec->p[0]);
534 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
535 __isl_take struct isl_upoly *up2)
538 struct isl_upoly_rec *rec1, *rec2;
543 if (isl_upoly_is_nan(up1)) {
548 if (isl_upoly_is_nan(up2)) {
553 if (isl_upoly_is_zero(up1)) {
558 if (isl_upoly_is_zero(up2)) {
563 if (up1->var < up2->var)
564 return isl_upoly_sum(up2, up1);
566 if (up2->var < up1->var) {
567 struct isl_upoly_rec *rec;
568 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
572 up1 = isl_upoly_cow(up1);
573 rec = isl_upoly_as_rec(up1);
576 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
578 up1 = replace_by_constant_term(up1);
582 if (isl_upoly_is_cst(up1))
583 return isl_upoly_sum_cst(up1, up2);
585 rec1 = isl_upoly_as_rec(up1);
586 rec2 = isl_upoly_as_rec(up2);
590 if (rec1->n < rec2->n)
591 return isl_upoly_sum(up2, up1);
593 up1 = isl_upoly_cow(up1);
594 rec1 = isl_upoly_as_rec(up1);
598 for (i = rec2->n - 1; i >= 0; --i) {
599 rec1->p[i] = isl_upoly_sum(rec1->p[i],
600 isl_upoly_copy(rec2->p[i]));
603 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
604 isl_upoly_free(rec1->p[i]);
610 up1 = replace_by_zero(up1);
611 else if (rec1->n == 1)
612 up1 = replace_by_constant_term(up1);
623 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
625 struct isl_upoly_cst *cst;
627 if (isl_upoly_is_zero(up))
630 up = isl_upoly_cow(up);
634 cst = isl_upoly_as_cst(up);
636 isl_int_neg(cst->n, cst->n);
641 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
644 struct isl_upoly_rec *rec;
649 if (isl_upoly_is_cst(up))
650 return isl_upoly_neg_cst(up);
652 up = isl_upoly_cow(up);
653 rec = isl_upoly_as_rec(up);
657 for (i = 0; i < rec->n; ++i) {
658 rec->p[i] = isl_upoly_neg(rec->p[i]);
669 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
670 __isl_take struct isl_upoly *up2)
672 struct isl_upoly_cst *cst1;
673 struct isl_upoly_cst *cst2;
675 up1 = isl_upoly_cow(up1);
679 cst1 = isl_upoly_as_cst(up1);
680 cst2 = isl_upoly_as_cst(up2);
682 isl_int_mul(cst1->n, cst1->n, cst2->n);
683 isl_int_mul(cst1->d, cst1->d, cst2->d);
685 isl_upoly_cst_reduce(cst1);
695 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
696 __isl_take struct isl_upoly *up2)
698 struct isl_upoly_rec *rec1;
699 struct isl_upoly_rec *rec2;
700 struct isl_upoly_rec *res;
704 rec1 = isl_upoly_as_rec(up1);
705 rec2 = isl_upoly_as_rec(up2);
708 size = rec1->n + rec2->n - 1;
709 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
713 for (i = 0; i < rec1->n; ++i) {
714 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
715 isl_upoly_copy(rec1->p[i]));
720 for (; i < size; ++i) {
721 res->p[i] = isl_upoly_zero(up1->ctx);
726 for (i = 0; i < rec1->n; ++i) {
727 for (j = 1; j < rec2->n; ++j) {
728 struct isl_upoly *up;
729 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
730 isl_upoly_copy(rec1->p[i]));
731 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
744 isl_upoly_free(&res->up);
748 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
749 __isl_take struct isl_upoly *up2)
754 if (isl_upoly_is_nan(up1)) {
759 if (isl_upoly_is_nan(up2)) {
764 if (isl_upoly_is_zero(up1)) {
769 if (isl_upoly_is_zero(up2)) {
774 if (isl_upoly_is_one(up1)) {
779 if (isl_upoly_is_one(up2)) {
784 if (up1->var < up2->var)
785 return isl_upoly_mul(up2, up1);
787 if (up2->var < up1->var) {
789 struct isl_upoly_rec *rec;
790 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
791 isl_ctx *ctx = up1->ctx;
794 return isl_upoly_nan(ctx);
796 up1 = isl_upoly_cow(up1);
797 rec = isl_upoly_as_rec(up1);
801 for (i = 0; i < rec->n; ++i) {
802 rec->p[i] = isl_upoly_mul(rec->p[i],
803 isl_upoly_copy(up2));
811 if (isl_upoly_is_cst(up1))
812 return isl_upoly_mul_cst(up1, up2);
814 return isl_upoly_mul_rec(up1, up2);
821 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
822 unsigned n_div, __isl_take struct isl_upoly *up)
824 struct isl_qpolynomial *qp = NULL;
830 total = isl_dim_total(dim);
832 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
837 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
848 isl_qpolynomial_free(qp);
852 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
861 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
863 struct isl_qpolynomial *dup;
868 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row,
869 isl_upoly_copy(qp->upoly));
872 isl_mat_free(dup->div);
873 dup->div = isl_mat_copy(qp->div);
879 isl_qpolynomial_free(dup);
883 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
891 return isl_qpolynomial_dup(qp);
894 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
902 isl_dim_free(qp->dim);
903 isl_mat_free(qp->div);
904 isl_upoly_free(qp->upoly);
909 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
914 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
915 div1->n_col >= div2->n_col, return -1);
917 if (div1->n_row == div2->n_row)
918 return isl_mat_is_equal(div1, div2);
922 div1->n_row = div2->n_row;
923 div1->n_col = div2->n_col;
925 equal = isl_mat_is_equal(div1, div2);
933 static void expand_row(__isl_keep isl_mat *dst, int d,
934 __isl_keep isl_mat *src, int s, int *exp)
937 unsigned c = src->n_col - src->n_row;
939 isl_seq_cpy(dst->row[d], src->row[s], c);
940 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
942 for (i = 0; i < s; ++i)
943 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
946 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
950 li = isl_seq_last_non_zero(div->row[i], div->n_col);
951 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
956 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
959 struct isl_div_sort_info {
964 static int div_sort_cmp(const void *p1, const void *p2)
966 const struct isl_div_sort_info *i1, *i2;
967 i1 = (const struct isl_div_sort_info *) p1;
968 i2 = (const struct isl_div_sort_info *) p2;
970 return cmp_row(i1->div, i1->row, i2->row);
973 static __isl_give isl_mat *sort_divs(__isl_take isl_mat *div)
976 struct isl_div_sort_info *array = NULL;
984 array = isl_alloc_array(div->ctx, struct isl_div_sort_info, div->n_row);
985 pos = isl_alloc_array(div->ctx, int, div->n_row);
989 for (i = 0; i < div->n_row; ++i) {
995 qsort(array, div->n_row, sizeof(struct isl_div_sort_info),
998 for (i = 0; i < div->n_row; ++i) {
1000 if (pos[array[i].row] == i)
1002 div = isl_mat_cow(div);
1003 div = isl_mat_swap_rows(div, i, pos[array[i].row]);
1004 t = pos[array[i].row];
1005 pos[array[i].row] = pos[i];
1019 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
1020 __isl_keep isl_mat *div2, int *exp1, int *exp2)
1023 isl_mat *div = NULL;
1024 unsigned d = div1->n_col - div1->n_row;
1026 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
1027 d + div1->n_row + div2->n_row);
1031 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
1034 expand_row(div, k, div1, i, exp1);
1035 expand_row(div, k + 1, div2, j, exp2);
1037 cmp = cmp_row(div, k, k + 1);
1041 } else if (cmp < 0) {
1045 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1048 for (; i < div1->n_row; ++i, ++k) {
1049 expand_row(div, k, div1, i, exp1);
1052 for (; j < div2->n_row; ++j, ++k) {
1053 expand_row(div, k, div2, j, exp2);
1063 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1064 int *exp, int first)
1067 struct isl_upoly_rec *rec;
1069 if (isl_upoly_is_cst(up))
1072 if (up->var < first)
1075 if (exp[up->var - first] == up->var - first)
1078 up = isl_upoly_cow(up);
1082 up->var = exp[up->var - first] + first;
1084 rec = isl_upoly_as_rec(up);
1088 for (i = 0; i < rec->n; ++i) {
1089 rec->p[i] = expand(rec->p[i], exp, first);
1100 static __isl_give isl_qpolynomial *with_merged_divs(
1101 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1102 __isl_take isl_qpolynomial *qp2),
1103 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1107 isl_mat *div = NULL;
1109 qp1 = isl_qpolynomial_cow(qp1);
1110 qp2 = isl_qpolynomial_cow(qp2);
1115 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1116 qp1->div->n_col >= qp2->div->n_col, goto error);
1118 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1119 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1123 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1127 isl_mat_free(qp1->div);
1128 qp1->div = isl_mat_copy(div);
1129 isl_mat_free(qp2->div);
1130 qp2->div = isl_mat_copy(div);
1132 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1133 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1135 if (!qp1->upoly || !qp2->upoly)
1142 return fn(qp1, qp2);
1147 isl_qpolynomial_free(qp1);
1148 isl_qpolynomial_free(qp2);
1152 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1153 __isl_take isl_qpolynomial *qp2)
1155 qp1 = isl_qpolynomial_cow(qp1);
1160 if (qp1->div->n_row < qp2->div->n_row)
1161 return isl_qpolynomial_add(qp2, qp1);
1163 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1164 if (!compatible_divs(qp1->div, qp2->div))
1165 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1167 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1171 isl_qpolynomial_free(qp2);
1175 isl_qpolynomial_free(qp1);
1176 isl_qpolynomial_free(qp2);
1180 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1181 __isl_take isl_qpolynomial *qp2)
1183 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1186 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1188 qp = isl_qpolynomial_cow(qp);
1193 qp->upoly = isl_upoly_neg(qp->upoly);
1199 isl_qpolynomial_free(qp);
1203 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1204 __isl_take isl_qpolynomial *qp2)
1206 qp1 = isl_qpolynomial_cow(qp1);
1211 if (qp1->div->n_row < qp2->div->n_row)
1212 return isl_qpolynomial_mul(qp2, qp1);
1214 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1215 if (!compatible_divs(qp1->div, qp2->div))
1216 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1218 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1222 isl_qpolynomial_free(qp2);
1226 isl_qpolynomial_free(qp1);
1227 isl_qpolynomial_free(qp2);
1231 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1233 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1236 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1238 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1241 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1243 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1246 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1249 struct isl_qpolynomial *qp;
1250 struct isl_upoly_cst *cst;
1252 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1256 cst = isl_upoly_as_cst(qp->upoly);
1257 isl_int_set(cst->n, v);
1261 isl_qpolynomial_free(qp);
1265 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1266 isl_int *n, isl_int *d)
1268 struct isl_upoly_cst *cst;
1273 if (!isl_upoly_is_cst(qp->upoly))
1276 cst = isl_upoly_as_cst(qp->upoly);
1281 isl_int_set(*n, cst->n);
1283 isl_int_set(*d, cst->d);
1288 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1291 struct isl_upoly_rec *rec;
1299 rec = isl_upoly_as_rec(up);
1306 isl_assert(up->ctx, rec->n > 1, return -1);
1308 is_cst = isl_upoly_is_cst(rec->p[1]);
1314 return isl_upoly_is_affine(rec->p[0]);
1317 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1322 if (qp->div->n_row > 0)
1325 return isl_upoly_is_affine(qp->upoly);
1328 static void update_coeff(__isl_keep isl_vec *aff,
1329 __isl_keep struct isl_upoly_cst *cst, int pos)
1334 if (isl_int_is_zero(cst->n))
1339 isl_int_gcd(gcd, cst->d, aff->el[0]);
1340 isl_int_divexact(f, cst->d, gcd);
1341 isl_int_divexact(gcd, aff->el[0], gcd);
1342 isl_seq_scale(aff->el, aff->el, f, aff->size);
1343 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1348 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1349 __isl_keep isl_vec *aff)
1351 struct isl_upoly_cst *cst;
1352 struct isl_upoly_rec *rec;
1358 struct isl_upoly_cst *cst;
1360 cst = isl_upoly_as_cst(up);
1363 update_coeff(aff, cst, 0);
1367 rec = isl_upoly_as_rec(up);
1370 isl_assert(up->ctx, rec->n == 2, return -1);
1372 cst = isl_upoly_as_cst(rec->p[1]);
1375 update_coeff(aff, cst, 1 + up->var);
1377 return isl_upoly_update_affine(rec->p[0], aff);
1380 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1381 __isl_keep isl_qpolynomial *qp)
1389 isl_assert(qp->div->ctx, qp->div->n_row == 0, return NULL);
1390 d = isl_dim_total(qp->dim);
1391 aff = isl_vec_alloc(qp->div->ctx, 2 + d);
1395 isl_seq_clr(aff->el + 1, 1 + d);
1396 isl_int_set_si(aff->el[0], 1);
1398 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1407 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1408 __isl_keep isl_qpolynomial *qp2)
1413 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1416 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1419 struct isl_upoly_rec *rec;
1421 if (isl_upoly_is_cst(up)) {
1422 struct isl_upoly_cst *cst;
1423 cst = isl_upoly_as_cst(up);
1426 isl_int_lcm(*d, *d, cst->d);
1430 rec = isl_upoly_as_rec(up);
1434 for (i = 0; i < rec->n; ++i)
1435 upoly_update_den(rec->p[i], d);
1438 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1440 isl_int_set_si(*d, 1);
1443 upoly_update_den(qp->upoly, d);
1446 __isl_give struct isl_upoly *isl_upoly_pow(isl_ctx *ctx, int pos, int power)
1449 struct isl_upoly *up;
1450 struct isl_upoly_rec *rec;
1451 struct isl_upoly_cst *cst;
1453 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
1456 for (i = 0; i < 1 + power; ++i) {
1457 rec->p[i] = isl_upoly_zero(ctx);
1462 cst = isl_upoly_as_cst(rec->p[power]);
1463 isl_int_set_si(cst->n, 1);
1467 isl_upoly_free(&rec->up);
1471 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1474 struct isl_ctx *ctx;
1481 return isl_qpolynomial_alloc(dim, 0, isl_upoly_pow(ctx, pos, power));
1484 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1485 enum isl_dim_type type, unsigned pos)
1490 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1491 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1493 if (type == isl_dim_set)
1494 pos += isl_dim_size(dim, isl_dim_param);
1496 return isl_qpolynomial_pow(dim, pos, 1);
1502 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1505 struct isl_qpolynomial *qp = NULL;
1506 struct isl_upoly_rec *rec;
1507 struct isl_upoly_cst *cst;
1513 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1515 pos = isl_dim_total(div->bmap->dim);
1516 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
1517 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1,
1522 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1523 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1525 for (i = 0; i < 1 + power; ++i) {
1526 rec->p[i] = isl_upoly_zero(div->ctx);
1531 cst = isl_upoly_as_cst(rec->p[power]);
1532 isl_int_set_si(cst->n, 1);
1538 isl_qpolynomial_free(qp);
1543 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1545 return isl_qpolynomial_div_pow(div, 1);
1548 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1549 const isl_int n, const isl_int d)
1551 struct isl_qpolynomial *qp;
1552 struct isl_upoly_cst *cst;
1554 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1558 cst = isl_upoly_as_cst(qp->upoly);
1559 isl_int_set(cst->n, n);
1560 isl_int_set(cst->d, d);
1564 isl_qpolynomial_free(qp);
1568 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1570 struct isl_upoly_rec *rec;
1576 if (isl_upoly_is_cst(up))
1580 active[up->var] = 1;
1582 rec = isl_upoly_as_rec(up);
1583 for (i = 0; i < rec->n; ++i)
1584 if (up_set_active(rec->p[i], active, d) < 0)
1590 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1593 int d = isl_dim_total(qp->dim);
1598 for (i = 0; i < d; ++i)
1599 for (j = 0; j < qp->div->n_row; ++j) {
1600 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1606 return up_set_active(qp->upoly, active, d);
1609 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1610 enum isl_dim_type type, unsigned first, unsigned n)
1621 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1623 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1624 type == isl_dim_set, return -1);
1626 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1627 if (set_active(qp, active) < 0)
1630 if (type == isl_dim_set)
1631 first += isl_dim_size(qp->dim, isl_dim_param);
1632 for (i = 0; i < n; ++i)
1633 if (active[first + i]) {
1646 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1647 unsigned first, unsigned n)
1650 struct isl_upoly_rec *rec;
1654 if (n == 0 || up->var < 0 || up->var < first)
1656 if (up->var < first + n) {
1657 up = replace_by_constant_term(up);
1658 return isl_upoly_drop(up, first, n);
1660 up = isl_upoly_cow(up);
1664 rec = isl_upoly_as_rec(up);
1668 for (i = 0; i < rec->n; ++i) {
1669 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1680 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1681 __isl_take isl_qpolynomial *qp,
1682 enum isl_dim_type type, unsigned first, unsigned n)
1689 qp = isl_qpolynomial_cow(qp);
1693 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1695 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1696 type == isl_dim_set, goto error);
1698 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1702 if (type == isl_dim_set)
1703 first += isl_dim_size(qp->dim, isl_dim_param);
1705 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1709 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1715 isl_qpolynomial_free(qp);
1720 #define PW isl_pw_qpolynomial
1722 #define EL isl_qpolynomial
1724 #define IS_ZERO is_zero
1728 #define ADD(d,e1,e2) isl_qpolynomial_add(e1,e2)
1730 #include <isl_pw_templ.c>
1732 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
1740 if (!isl_set_fast_is_universe(pwqp->p[0].set))
1743 return isl_qpolynomial_is_one(pwqp->p[0].qp);
1746 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
1747 __isl_take isl_pw_qpolynomial *pwqp1,
1748 __isl_take isl_pw_qpolynomial *pwqp2)
1751 struct isl_pw_qpolynomial *res;
1754 if (!pwqp1 || !pwqp2)
1757 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
1760 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
1761 isl_pw_qpolynomial_free(pwqp2);
1765 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
1766 isl_pw_qpolynomial_free(pwqp1);
1770 if (isl_pw_qpolynomial_is_one(pwqp1)) {
1771 isl_pw_qpolynomial_free(pwqp1);
1775 if (isl_pw_qpolynomial_is_one(pwqp2)) {
1776 isl_pw_qpolynomial_free(pwqp2);
1780 n = pwqp1->n * pwqp2->n;
1781 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
1783 for (i = 0; i < pwqp1->n; ++i) {
1784 for (j = 0; j < pwqp2->n; ++j) {
1785 struct isl_set *common;
1786 struct isl_qpolynomial *prod;
1787 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
1788 isl_set_copy(pwqp2->p[j].set));
1789 if (isl_set_fast_is_empty(common)) {
1790 isl_set_free(common);
1794 prod = isl_qpolynomial_mul(
1795 isl_qpolynomial_copy(pwqp1->p[i].qp),
1796 isl_qpolynomial_copy(pwqp2->p[j].qp));
1798 res = isl_pw_qpolynomial_add_piece(res, common, prod);
1802 isl_pw_qpolynomial_free(pwqp1);
1803 isl_pw_qpolynomial_free(pwqp2);
1807 isl_pw_qpolynomial_free(pwqp1);
1808 isl_pw_qpolynomial_free(pwqp2);
1812 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
1813 __isl_take isl_pw_qpolynomial *pwqp)
1816 struct isl_pw_qpolynomial *res;
1822 if (isl_pw_qpolynomial_is_zero(pwqp))
1825 pwqp = isl_pw_qpolynomial_cow(pwqp);
1827 for (i = 0; i < pwqp->n; ++i) {
1828 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
1835 isl_pw_qpolynomial_free(pwqp);
1839 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
1840 __isl_take isl_pw_qpolynomial *pwqp1,
1841 __isl_take isl_pw_qpolynomial *pwqp2)
1843 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
1846 __isl_give struct isl_upoly *isl_upoly_eval(
1847 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
1850 struct isl_upoly_rec *rec;
1851 struct isl_upoly *res;
1852 struct isl_upoly *base;
1854 if (isl_upoly_is_cst(up)) {
1859 rec = isl_upoly_as_rec(up);
1863 isl_assert(up->ctx, rec->n >= 1, goto error);
1865 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
1867 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
1870 for (i = rec->n - 2; i >= 0; --i) {
1871 res = isl_upoly_mul(res, isl_upoly_copy(base));
1872 res = isl_upoly_sum(res,
1873 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
1874 isl_vec_copy(vec)));
1877 isl_upoly_free(base);
1887 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
1888 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
1891 struct isl_upoly *up;
1896 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
1898 if (qp->div->n_row == 0)
1899 ext = isl_vec_copy(pnt->vec);
1902 unsigned dim = isl_dim_total(qp->dim);
1903 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
1907 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
1908 for (i = 0; i < qp->div->n_row; ++i) {
1909 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
1910 1 + dim + i, &ext->el[1+dim+i]);
1911 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
1912 qp->div->row[i][0]);
1916 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
1920 dim = isl_dim_copy(qp->dim);
1921 isl_qpolynomial_free(qp);
1922 isl_point_free(pnt);
1924 return isl_qpolynomial_alloc(dim, 0, up);
1926 isl_qpolynomial_free(qp);
1927 isl_point_free(pnt);
1931 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
1932 __isl_keep struct isl_upoly_cst *cst2)
1937 isl_int_mul(t, cst1->n, cst2->d);
1938 isl_int_submul(t, cst2->n, cst1->d);
1939 cmp = isl_int_sgn(t);
1944 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
1945 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1947 struct isl_upoly_cst *cst1, *cst2;
1952 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1953 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1954 cst1 = isl_upoly_as_cst(qp1->upoly);
1955 cst2 = isl_upoly_as_cst(qp2->upoly);
1956 cmp = isl_upoly_cmp(cst1, cst2);
1959 isl_qpolynomial_free(qp2);
1961 isl_qpolynomial_free(qp1);
1966 isl_qpolynomial_free(qp1);
1967 isl_qpolynomial_free(qp2);
1971 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
1972 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1974 struct isl_upoly_cst *cst1, *cst2;
1979 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1980 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1981 cst1 = isl_upoly_as_cst(qp1->upoly);
1982 cst2 = isl_upoly_as_cst(qp2->upoly);
1983 cmp = isl_upoly_cmp(cst1, cst2);
1986 isl_qpolynomial_free(qp2);
1988 isl_qpolynomial_free(qp1);
1993 isl_qpolynomial_free(qp1);
1994 isl_qpolynomial_free(qp2);
1998 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
1999 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2008 qp = isl_qpolynomial_cow(qp);
2012 g_pos = pos(qp->dim, type) + isl_dim_size(qp->dim, type);
2014 qp->div = isl_mat_insert_cols(qp->div, 2 + g_pos, n);
2018 total = qp->div->n_col - 2;
2019 if (total > g_pos) {
2021 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2024 for (i = 0; i < total - g_pos; ++i)
2026 qp->upoly = expand(qp->upoly, exp, g_pos);
2032 qp->dim = isl_dim_add(qp->dim, type, n);
2038 isl_qpolynomial_free(qp);
2042 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2043 __isl_take isl_pw_qpolynomial *pwqp,
2044 enum isl_dim_type type, unsigned n)
2051 pwqp = isl_pw_qpolynomial_cow(pwqp);
2055 pwqp->dim = isl_dim_add(pwqp->dim, type, n);
2059 for (i = 0; i < pwqp->n; ++i) {
2060 pwqp->p[i].set = isl_set_add(pwqp->p[i].set, type, n);
2061 if (!pwqp->p[i].set)
2063 pwqp->p[i].qp = isl_qpolynomial_add_dims(pwqp->p[i].qp, type, n);
2070 isl_pw_qpolynomial_free(pwqp);
2074 static int *reordering_move(isl_ctx *ctx,
2075 unsigned len, unsigned dst, unsigned src, unsigned n)
2080 reordering = isl_alloc_array(ctx, int, len);
2085 for (i = 0; i < dst; ++i)
2087 for (i = 0; i < n; ++i)
2088 reordering[src + i] = dst + i;
2089 for (i = 0; i < src - dst; ++i)
2090 reordering[dst + i] = dst + n + i;
2091 for (i = 0; i < len - src - n; ++i)
2092 reordering[src + n + i] = src + n + i;
2094 for (i = 0; i < src; ++i)
2096 for (i = 0; i < n; ++i)
2097 reordering[src + i] = dst + i;
2098 for (i = 0; i < dst - src; ++i)
2099 reordering[src + n + i] = src + i;
2100 for (i = 0; i < len - dst - n; ++i)
2101 reordering[dst + n + i] = dst + n + i;
2107 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
2111 struct isl_upoly_rec *rec;
2112 struct isl_upoly *base;
2113 struct isl_upoly *res;
2115 if (isl_upoly_is_cst(up))
2118 rec = isl_upoly_as_rec(up);
2122 isl_assert(up->ctx, rec->n >= 1, goto error);
2124 base = isl_upoly_pow(up->ctx, r[up->var], 1);
2125 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
2127 for (i = rec->n - 2; i >= 0; --i) {
2128 res = isl_upoly_mul(res, isl_upoly_copy(base));
2129 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
2132 isl_upoly_free(base);
2141 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
2142 __isl_take isl_qpolynomial *qp,
2143 enum isl_dim_type dst_type, unsigned dst_pos,
2144 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2150 qp = isl_qpolynomial_cow(qp);
2154 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2157 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2158 g_src_pos = pos(qp->dim, src_type) + src_pos;
2159 if (dst_type > src_type)
2162 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2163 qp->div = sort_divs(qp->div);
2167 reordering = reordering_move(qp->dim->ctx,
2168 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2172 qp->upoly = reorder(qp->upoly, reordering);
2177 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2183 isl_qpolynomial_free(qp);
2187 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_move(
2188 __isl_take isl_pw_qpolynomial *pwqp,
2189 enum isl_dim_type dst_type, unsigned dst_pos,
2190 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2194 pwqp = isl_pw_qpolynomial_cow(pwqp);
2198 pwqp->dim = isl_dim_move(pwqp->dim,
2199 dst_type, dst_pos, src_type, src_pos, n);
2203 for (i = 0; i < pwqp->n; ++i) {
2204 pwqp->p[i].set = isl_set_move_dims(pwqp->p[i].set,
2206 src_type, src_pos, n);
2207 if (!pwqp->p[i].set)
2209 pwqp->p[i].qp = isl_qpolynomial_move_dims(pwqp->p[i].qp,
2210 dst_type, dst_pos, src_type, src_pos, n);
2217 isl_pw_qpolynomial_free(pwqp);
2221 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2222 __isl_take isl_mat *div)
2230 n = isl_dim_total(dim) + div->n_row;
2232 term = isl_calloc(dim->ctx, struct isl_term,
2233 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2240 isl_int_init(term->n);
2241 isl_int_init(term->d);
2250 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
2259 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
2268 total = isl_dim_total(term->dim) + term->div->n_row;
2270 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
2274 isl_int_set(dup->n, term->n);
2275 isl_int_set(dup->d, term->d);
2277 for (i = 0; i < total; ++i)
2278 dup->pow[i] = term->pow[i];
2283 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
2291 return isl_term_dup(term);
2294 void isl_term_free(__isl_take isl_term *term)
2299 if (--term->ref > 0)
2302 isl_dim_free(term->dim);
2303 isl_mat_free(term->div);
2304 isl_int_clear(term->n);
2305 isl_int_clear(term->d);
2309 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
2317 case isl_dim_out: return isl_dim_size(term->dim, type);
2318 case isl_dim_div: return term->div->n_row;
2319 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
2323 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
2325 return term ? term->dim->ctx : NULL;
2328 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
2332 isl_int_set(*n, term->n);
2335 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
2339 isl_int_set(*d, term->d);
2342 int isl_term_get_exp(__isl_keep isl_term *term,
2343 enum isl_dim_type type, unsigned pos)
2348 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
2350 if (type >= isl_dim_set)
2351 pos += isl_dim_size(term->dim, isl_dim_param);
2352 if (type >= isl_dim_div)
2353 pos += isl_dim_size(term->dim, isl_dim_set);
2355 return term->pow[pos];
2358 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
2360 isl_basic_map *bmap;
2367 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
2370 total = term->div->n_col - term->div->n_row - 2;
2371 /* No nested divs for now */
2372 isl_assert(term->dim->ctx,
2373 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
2374 term->div->n_row) == -1,
2377 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
2378 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
2381 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
2383 return isl_basic_map_div(bmap, k);
2385 isl_basic_map_free(bmap);
2389 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
2390 int (*fn)(__isl_take isl_term *term, void *user),
2391 __isl_take isl_term *term, void *user)
2394 struct isl_upoly_rec *rec;
2399 if (isl_upoly_is_zero(up))
2402 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
2403 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
2404 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
2406 if (isl_upoly_is_cst(up)) {
2407 struct isl_upoly_cst *cst;
2408 cst = isl_upoly_as_cst(up);
2411 term = isl_term_cow(term);
2414 isl_int_set(term->n, cst->n);
2415 isl_int_set(term->d, cst->d);
2416 if (fn(isl_term_copy(term), user) < 0)
2421 rec = isl_upoly_as_rec(up);
2425 for (i = 0; i < rec->n; ++i) {
2426 term = isl_term_cow(term);
2429 term->pow[up->var] = i;
2430 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
2434 term->pow[up->var] = 0;
2438 isl_term_free(term);
2442 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
2443 int (*fn)(__isl_take isl_term *term, void *user), void *user)
2450 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
2454 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
2456 isl_term_free(term);
2458 return term ? 0 : -1;
2461 int isl_pw_qpolynomial_foreach_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2462 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2463 void *user), void *user)
2470 for (i = 0; i < pwqp->n; ++i)
2471 if (fn(isl_set_copy(pwqp->p[i].set),
2472 isl_qpolynomial_copy(pwqp->p[i].qp), user) < 0)
2478 static int any_divs(__isl_keep isl_set *set)
2485 for (i = 0; i < set->n; ++i)
2486 if (set->p[i]->n_div > 0)
2492 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
2493 __isl_take isl_dim *dim)
2498 if (isl_dim_equal(qp->dim, dim)) {
2503 qp = isl_qpolynomial_cow(qp);
2507 if (qp->div->n_row) {
2513 extra = isl_dim_size(dim, isl_dim_set) -
2514 isl_dim_size(qp->dim, isl_dim_set);
2515 total = isl_dim_total(qp->dim);
2516 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
2519 for (i = 0; i < qp->div->n_row; ++i)
2521 qp->upoly = expand(qp->upoly, exp, total);
2525 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
2528 for (i = 0; i < qp->div->n_row; ++i)
2529 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
2532 isl_dim_free(qp->dim);
2538 isl_qpolynomial_free(qp);
2542 static int foreach_lifted_subset(__isl_take isl_set *set,
2543 __isl_take isl_qpolynomial *qp,
2544 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2545 void *user), void *user)
2552 for (i = 0; i < set->n; ++i) {
2554 isl_qpolynomial *copy;
2556 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
2557 lift = isl_set_lift(lift);
2559 copy = isl_qpolynomial_copy(qp);
2560 copy = isl_qpolynomial_lift(copy, isl_set_get_dim(lift));
2562 if (fn(lift, copy, user) < 0)
2567 isl_qpolynomial_free(qp);
2572 isl_qpolynomial_free(qp);
2576 int isl_pw_qpolynomial_foreach_lifted_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2577 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2578 void *user), void *user)
2585 for (i = 0; i < pwqp->n; ++i) {
2587 isl_qpolynomial *qp;
2589 set = isl_set_copy(pwqp->p[i].set);
2590 qp = isl_qpolynomial_copy(pwqp->p[i].qp);
2591 if (!any_divs(set)) {
2592 if (fn(set, qp, user) < 0)
2596 if (foreach_lifted_subset(set, qp, fn, user) < 0)
2603 /* For each parameter or variable that does not appear in qp,
2604 * first eliminate the variable from all constraints and then set it to zero.
2606 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
2607 __isl_keep isl_qpolynomial *qp)
2618 d = isl_dim_total(set->dim);
2619 active = isl_calloc_array(set->ctx, int, d);
2620 if (set_active(qp, active) < 0)
2623 for (i = 0; i < d; ++i)
2632 nparam = isl_dim_size(set->dim, isl_dim_param);
2633 nvar = isl_dim_size(set->dim, isl_dim_set);
2634 for (i = 0; i < nparam; ++i) {
2637 set = isl_set_eliminate(set, isl_dim_param, i, 1);
2638 set = isl_set_fix_si(set, isl_dim_param, i, 0);
2640 for (i = 0; i < nvar; ++i) {
2641 if (active[nparam + i])
2643 set = isl_set_eliminate(set, isl_dim_set, i, 1);
2644 set = isl_set_fix_si(set, isl_dim_set, i, 0);
2656 struct isl_opt_data {
2657 isl_qpolynomial *qp;
2659 isl_qpolynomial *opt;
2663 static int opt_fn(__isl_take isl_point *pnt, void *user)
2665 struct isl_opt_data *data = (struct isl_opt_data *)user;
2666 isl_qpolynomial *val;
2668 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
2672 } else if (data->max) {
2673 data->opt = isl_qpolynomial_max_cst(data->opt, val);
2675 data->opt = isl_qpolynomial_min_cst(data->opt, val);
2681 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
2682 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
2684 struct isl_opt_data data = { NULL, 1, NULL, max };
2689 if (isl_upoly_is_cst(qp->upoly)) {
2694 set = fix_inactive(set, qp);
2697 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
2701 isl_qpolynomial_free(qp);
2705 isl_qpolynomial_free(qp);
2706 isl_qpolynomial_free(data.opt);