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_union_map_private.h>
14 #include <isl_polynomial_private.h>
15 #include <isl_point_private.h>
16 #include <isl_dim_private.h>
17 #include <isl_map_private.h>
19 static unsigned pos(__isl_keep isl_dim *dim, enum isl_dim_type type)
22 case isl_dim_param: return 0;
23 case isl_dim_in: return dim->nparam;
24 case isl_dim_out: return dim->nparam + dim->n_in;
29 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
37 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
42 isl_assert(up->ctx, up->var < 0, return NULL);
44 return (struct isl_upoly_cst *)up;
47 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
52 isl_assert(up->ctx, up->var >= 0, return NULL);
54 return (struct isl_upoly_rec *)up;
57 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
58 __isl_keep struct isl_upoly *up2)
61 struct isl_upoly_rec *rec1, *rec2;
67 if (up1->var != up2->var)
69 if (isl_upoly_is_cst(up1)) {
70 struct isl_upoly_cst *cst1, *cst2;
71 cst1 = isl_upoly_as_cst(up1);
72 cst2 = isl_upoly_as_cst(up2);
75 return isl_int_eq(cst1->n, cst2->n) &&
76 isl_int_eq(cst1->d, cst2->d);
79 rec1 = isl_upoly_as_rec(up1);
80 rec2 = isl_upoly_as_rec(up2);
84 if (rec1->n != rec2->n)
87 for (i = 0; i < rec1->n; ++i) {
88 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
96 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
98 struct isl_upoly_cst *cst;
102 if (!isl_upoly_is_cst(up))
105 cst = isl_upoly_as_cst(up);
109 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
112 int isl_upoly_sgn(__isl_keep struct isl_upoly *up)
114 struct isl_upoly_cst *cst;
118 if (!isl_upoly_is_cst(up))
121 cst = isl_upoly_as_cst(up);
125 return isl_int_sgn(cst->n);
128 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
130 struct isl_upoly_cst *cst;
134 if (!isl_upoly_is_cst(up))
137 cst = isl_upoly_as_cst(up);
141 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
144 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
146 struct isl_upoly_cst *cst;
150 if (!isl_upoly_is_cst(up))
153 cst = isl_upoly_as_cst(up);
157 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
160 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
162 struct isl_upoly_cst *cst;
166 if (!isl_upoly_is_cst(up))
169 cst = isl_upoly_as_cst(up);
173 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
176 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
178 struct isl_upoly_cst *cst;
182 if (!isl_upoly_is_cst(up))
185 cst = isl_upoly_as_cst(up);
189 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
192 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
194 struct isl_upoly_cst *cst;
198 if (!isl_upoly_is_cst(up))
201 cst = isl_upoly_as_cst(up);
205 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
208 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
210 struct isl_upoly_cst *cst;
212 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
221 isl_int_init(cst->n);
222 isl_int_init(cst->d);
227 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
229 struct isl_upoly_cst *cst;
231 cst = isl_upoly_cst_alloc(ctx);
235 isl_int_set_si(cst->n, 0);
236 isl_int_set_si(cst->d, 1);
241 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
243 struct isl_upoly_cst *cst;
245 cst = isl_upoly_cst_alloc(ctx);
249 isl_int_set_si(cst->n, 1);
250 isl_int_set_si(cst->d, 0);
255 __isl_give struct isl_upoly *isl_upoly_neginfty(struct isl_ctx *ctx)
257 struct isl_upoly_cst *cst;
259 cst = isl_upoly_cst_alloc(ctx);
263 isl_int_set_si(cst->n, -1);
264 isl_int_set_si(cst->d, 0);
269 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
271 struct isl_upoly_cst *cst;
273 cst = isl_upoly_cst_alloc(ctx);
277 isl_int_set_si(cst->n, 0);
278 isl_int_set_si(cst->d, 0);
283 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
284 isl_int n, isl_int d)
286 struct isl_upoly_cst *cst;
288 cst = isl_upoly_cst_alloc(ctx);
292 isl_int_set(cst->n, n);
293 isl_int_set(cst->d, d);
298 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
301 struct isl_upoly_rec *rec;
303 isl_assert(ctx, var >= 0, return NULL);
304 isl_assert(ctx, size >= 0, return NULL);
305 rec = isl_calloc(ctx, struct isl_upoly_rec,
306 sizeof(struct isl_upoly_rec) +
307 (size - 1) * sizeof(struct isl_upoly *));
322 __isl_give isl_qpolynomial *isl_qpolynomial_reset_dim(
323 __isl_take isl_qpolynomial *qp, __isl_take isl_dim *dim)
325 qp = isl_qpolynomial_cow(qp);
329 isl_dim_free(qp->dim);
334 isl_qpolynomial_free(qp);
339 isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp)
341 return qp ? qp->dim->ctx : NULL;
344 __isl_give isl_dim *isl_qpolynomial_get_dim(__isl_keep isl_qpolynomial *qp)
346 return qp ? isl_dim_copy(qp->dim) : NULL;
349 unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp,
350 enum isl_dim_type type)
352 return qp ? isl_dim_size(qp->dim, type) : 0;
355 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
357 return qp ? isl_upoly_is_zero(qp->upoly) : -1;
360 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
362 return qp ? isl_upoly_is_one(qp->upoly) : -1;
365 int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
367 return qp ? isl_upoly_is_nan(qp->upoly) : -1;
370 int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
372 return qp ? isl_upoly_is_infty(qp->upoly) : -1;
375 int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
377 return qp ? isl_upoly_is_neginfty(qp->upoly) : -1;
380 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
382 return qp ? isl_upoly_sgn(qp->upoly) : 0;
385 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
387 isl_int_clear(cst->n);
388 isl_int_clear(cst->d);
391 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
395 for (i = 0; i < rec->n; ++i)
396 isl_upoly_free(rec->p[i]);
399 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
408 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
410 struct isl_upoly_cst *cst;
411 struct isl_upoly_cst *dup;
413 cst = isl_upoly_as_cst(up);
417 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
420 isl_int_set(dup->n, cst->n);
421 isl_int_set(dup->d, cst->d);
426 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
429 struct isl_upoly_rec *rec;
430 struct isl_upoly_rec *dup;
432 rec = isl_upoly_as_rec(up);
436 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
440 for (i = 0; i < rec->n; ++i) {
441 dup->p[i] = isl_upoly_copy(rec->p[i]);
449 isl_upoly_free(&dup->up);
453 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
455 struct isl_upoly *dup;
460 if (isl_upoly_is_cst(up))
461 return isl_upoly_dup_cst(up);
463 return isl_upoly_dup_rec(up);
466 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
474 return isl_upoly_dup(up);
477 void isl_upoly_free(__isl_take struct isl_upoly *up)
486 upoly_free_cst((struct isl_upoly_cst *)up);
488 upoly_free_rec((struct isl_upoly_rec *)up);
490 isl_ctx_deref(up->ctx);
494 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
499 isl_int_gcd(gcd, cst->n, cst->d);
500 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
501 isl_int_divexact(cst->n, cst->n, gcd);
502 isl_int_divexact(cst->d, cst->d, gcd);
507 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
508 __isl_take struct isl_upoly *up2)
510 struct isl_upoly_cst *cst1;
511 struct isl_upoly_cst *cst2;
513 up1 = isl_upoly_cow(up1);
517 cst1 = isl_upoly_as_cst(up1);
518 cst2 = isl_upoly_as_cst(up2);
520 if (isl_int_eq(cst1->d, cst2->d))
521 isl_int_add(cst1->n, cst1->n, cst2->n);
523 isl_int_mul(cst1->n, cst1->n, cst2->d);
524 isl_int_addmul(cst1->n, cst2->n, cst1->d);
525 isl_int_mul(cst1->d, cst1->d, cst2->d);
528 isl_upoly_cst_reduce(cst1);
538 static __isl_give struct isl_upoly *replace_by_zero(
539 __isl_take struct isl_upoly *up)
547 return isl_upoly_zero(ctx);
550 static __isl_give struct isl_upoly *replace_by_constant_term(
551 __isl_take struct isl_upoly *up)
553 struct isl_upoly_rec *rec;
554 struct isl_upoly *cst;
559 rec = isl_upoly_as_rec(up);
562 cst = isl_upoly_copy(rec->p[0]);
570 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
571 __isl_take struct isl_upoly *up2)
574 struct isl_upoly_rec *rec1, *rec2;
579 if (isl_upoly_is_nan(up1)) {
584 if (isl_upoly_is_nan(up2)) {
589 if (isl_upoly_is_zero(up1)) {
594 if (isl_upoly_is_zero(up2)) {
599 if (up1->var < up2->var)
600 return isl_upoly_sum(up2, up1);
602 if (up2->var < up1->var) {
603 struct isl_upoly_rec *rec;
604 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
608 up1 = isl_upoly_cow(up1);
609 rec = isl_upoly_as_rec(up1);
612 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
614 up1 = replace_by_constant_term(up1);
618 if (isl_upoly_is_cst(up1))
619 return isl_upoly_sum_cst(up1, up2);
621 rec1 = isl_upoly_as_rec(up1);
622 rec2 = isl_upoly_as_rec(up2);
626 if (rec1->n < rec2->n)
627 return isl_upoly_sum(up2, up1);
629 up1 = isl_upoly_cow(up1);
630 rec1 = isl_upoly_as_rec(up1);
634 for (i = rec2->n - 1; i >= 0; --i) {
635 rec1->p[i] = isl_upoly_sum(rec1->p[i],
636 isl_upoly_copy(rec2->p[i]));
639 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
640 isl_upoly_free(rec1->p[i]);
646 up1 = replace_by_zero(up1);
647 else if (rec1->n == 1)
648 up1 = replace_by_constant_term(up1);
659 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
661 struct isl_upoly_cst *cst;
663 if (isl_upoly_is_zero(up))
666 up = isl_upoly_cow(up);
670 cst = isl_upoly_as_cst(up);
672 isl_int_neg(cst->n, cst->n);
677 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
680 struct isl_upoly_rec *rec;
685 if (isl_upoly_is_cst(up))
686 return isl_upoly_neg_cst(up);
688 up = isl_upoly_cow(up);
689 rec = isl_upoly_as_rec(up);
693 for (i = 0; i < rec->n; ++i) {
694 rec->p[i] = isl_upoly_neg(rec->p[i]);
705 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
706 __isl_take struct isl_upoly *up2)
708 struct isl_upoly_cst *cst1;
709 struct isl_upoly_cst *cst2;
711 up1 = isl_upoly_cow(up1);
715 cst1 = isl_upoly_as_cst(up1);
716 cst2 = isl_upoly_as_cst(up2);
718 isl_int_mul(cst1->n, cst1->n, cst2->n);
719 isl_int_mul(cst1->d, cst1->d, cst2->d);
721 isl_upoly_cst_reduce(cst1);
731 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
732 __isl_take struct isl_upoly *up2)
734 struct isl_upoly_rec *rec1;
735 struct isl_upoly_rec *rec2;
736 struct isl_upoly_rec *res;
740 rec1 = isl_upoly_as_rec(up1);
741 rec2 = isl_upoly_as_rec(up2);
744 size = rec1->n + rec2->n - 1;
745 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
749 for (i = 0; i < rec1->n; ++i) {
750 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
751 isl_upoly_copy(rec1->p[i]));
756 for (; i < size; ++i) {
757 res->p[i] = isl_upoly_zero(up1->ctx);
762 for (i = 0; i < rec1->n; ++i) {
763 for (j = 1; j < rec2->n; ++j) {
764 struct isl_upoly *up;
765 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
766 isl_upoly_copy(rec1->p[i]));
767 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
780 isl_upoly_free(&res->up);
784 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
785 __isl_take struct isl_upoly *up2)
790 if (isl_upoly_is_nan(up1)) {
795 if (isl_upoly_is_nan(up2)) {
800 if (isl_upoly_is_zero(up1)) {
805 if (isl_upoly_is_zero(up2)) {
810 if (isl_upoly_is_one(up1)) {
815 if (isl_upoly_is_one(up2)) {
820 if (up1->var < up2->var)
821 return isl_upoly_mul(up2, up1);
823 if (up2->var < up1->var) {
825 struct isl_upoly_rec *rec;
826 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
827 isl_ctx *ctx = up1->ctx;
830 return isl_upoly_nan(ctx);
832 up1 = isl_upoly_cow(up1);
833 rec = isl_upoly_as_rec(up1);
837 for (i = 0; i < rec->n; ++i) {
838 rec->p[i] = isl_upoly_mul(rec->p[i],
839 isl_upoly_copy(up2));
847 if (isl_upoly_is_cst(up1))
848 return isl_upoly_mul_cst(up1, up2);
850 return isl_upoly_mul_rec(up1, up2);
857 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
858 unsigned n_div, __isl_take struct isl_upoly *up)
860 struct isl_qpolynomial *qp = NULL;
866 total = isl_dim_total(dim);
868 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
873 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
884 isl_qpolynomial_free(qp);
888 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
897 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
899 struct isl_qpolynomial *dup;
904 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row,
905 isl_upoly_copy(qp->upoly));
908 isl_mat_free(dup->div);
909 dup->div = isl_mat_copy(qp->div);
915 isl_qpolynomial_free(dup);
919 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
927 return isl_qpolynomial_dup(qp);
930 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
938 isl_dim_free(qp->dim);
939 isl_mat_free(qp->div);
940 isl_upoly_free(qp->upoly);
945 __isl_give struct isl_upoly *isl_upoly_pow(isl_ctx *ctx, int pos, int power)
948 struct isl_upoly *up;
949 struct isl_upoly_rec *rec;
950 struct isl_upoly_cst *cst;
952 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
955 for (i = 0; i < 1 + power; ++i) {
956 rec->p[i] = isl_upoly_zero(ctx);
961 cst = isl_upoly_as_cst(rec->p[power]);
962 isl_int_set_si(cst->n, 1);
966 isl_upoly_free(&rec->up);
970 /* r array maps original positions to new positions.
972 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
976 struct isl_upoly_rec *rec;
977 struct isl_upoly *base;
978 struct isl_upoly *res;
980 if (isl_upoly_is_cst(up))
983 rec = isl_upoly_as_rec(up);
987 isl_assert(up->ctx, rec->n >= 1, goto error);
989 base = isl_upoly_pow(up->ctx, r[up->var], 1);
990 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
992 for (i = rec->n - 2; i >= 0; --i) {
993 res = isl_upoly_mul(res, isl_upoly_copy(base));
994 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
997 isl_upoly_free(base);
1006 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
1011 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1012 div1->n_col >= div2->n_col, return -1);
1014 if (div1->n_row == div2->n_row)
1015 return isl_mat_is_equal(div1, div2);
1017 n_row = div1->n_row;
1018 n_col = div1->n_col;
1019 div1->n_row = div2->n_row;
1020 div1->n_col = div2->n_col;
1022 equal = isl_mat_is_equal(div1, div2);
1024 div1->n_row = n_row;
1025 div1->n_col = n_col;
1030 static void expand_row(__isl_keep isl_mat *dst, int d,
1031 __isl_keep isl_mat *src, int s, int *exp)
1034 unsigned c = src->n_col - src->n_row;
1036 isl_seq_cpy(dst->row[d], src->row[s], c);
1037 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
1039 for (i = 0; i < s; ++i)
1040 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
1043 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
1047 li = isl_seq_last_non_zero(div->row[i], div->n_col);
1048 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
1053 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
1056 struct isl_div_sort_info {
1061 static int div_sort_cmp(const void *p1, const void *p2)
1063 const struct isl_div_sort_info *i1, *i2;
1064 i1 = (const struct isl_div_sort_info *) p1;
1065 i2 = (const struct isl_div_sort_info *) p2;
1067 return cmp_row(i1->div, i1->row, i2->row);
1070 /* Sort divs and remove duplicates.
1072 static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp)
1077 struct isl_div_sort_info *array = NULL;
1078 int *pos = NULL, *at = NULL;
1079 int *reordering = NULL;
1084 if (qp->div->n_row <= 1)
1087 div_pos = isl_dim_total(qp->dim);
1089 array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info,
1091 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1092 at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1093 len = qp->div->n_col - 2;
1094 reordering = isl_alloc_array(qp->div->ctx, int, len);
1095 if (!array || !pos || !at || !reordering)
1098 for (i = 0; i < qp->div->n_row; ++i) {
1099 array[i].div = qp->div;
1105 qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
1108 for (i = 0; i < div_pos; ++i)
1111 for (i = 0; i < qp->div->n_row; ++i) {
1112 if (pos[array[i].row] == i)
1114 qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]);
1115 pos[at[i]] = pos[array[i].row];
1116 at[pos[array[i].row]] = at[i];
1117 at[i] = array[i].row;
1118 pos[array[i].row] = i;
1122 for (i = 0; i < len - div_pos; ++i) {
1124 isl_seq_eq(qp->div->row[i - skip - 1],
1125 qp->div->row[i - skip], qp->div->n_col)) {
1126 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
1127 qp->div = isl_mat_drop_cols(qp->div,
1128 2 + div_pos + i - skip, 1);
1131 reordering[div_pos + array[i].row] = div_pos + i - skip;
1134 qp->upoly = reorder(qp->upoly, reordering);
1136 if (!qp->upoly || !qp->div)
1150 isl_qpolynomial_free(qp);
1154 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
1155 __isl_keep isl_mat *div2, int *exp1, int *exp2)
1158 isl_mat *div = NULL;
1159 unsigned d = div1->n_col - div1->n_row;
1161 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
1162 d + div1->n_row + div2->n_row);
1166 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
1169 expand_row(div, k, div1, i, exp1);
1170 expand_row(div, k + 1, div2, j, exp2);
1172 cmp = cmp_row(div, k, k + 1);
1176 } else if (cmp < 0) {
1180 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1183 for (; i < div1->n_row; ++i, ++k) {
1184 expand_row(div, k, div1, i, exp1);
1187 for (; j < div2->n_row; ++j, ++k) {
1188 expand_row(div, k, div2, j, exp2);
1198 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1199 int *exp, int first)
1202 struct isl_upoly_rec *rec;
1204 if (isl_upoly_is_cst(up))
1207 if (up->var < first)
1210 if (exp[up->var - first] == up->var - first)
1213 up = isl_upoly_cow(up);
1217 up->var = exp[up->var - first] + first;
1219 rec = isl_upoly_as_rec(up);
1223 for (i = 0; i < rec->n; ++i) {
1224 rec->p[i] = expand(rec->p[i], exp, first);
1235 static __isl_give isl_qpolynomial *with_merged_divs(
1236 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1237 __isl_take isl_qpolynomial *qp2),
1238 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1242 isl_mat *div = NULL;
1244 qp1 = isl_qpolynomial_cow(qp1);
1245 qp2 = isl_qpolynomial_cow(qp2);
1250 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1251 qp1->div->n_col >= qp2->div->n_col, goto error);
1253 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1254 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1258 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1262 isl_mat_free(qp1->div);
1263 qp1->div = isl_mat_copy(div);
1264 isl_mat_free(qp2->div);
1265 qp2->div = isl_mat_copy(div);
1267 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1268 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1270 if (!qp1->upoly || !qp2->upoly)
1277 return fn(qp1, qp2);
1282 isl_qpolynomial_free(qp1);
1283 isl_qpolynomial_free(qp2);
1287 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1288 __isl_take isl_qpolynomial *qp2)
1290 qp1 = isl_qpolynomial_cow(qp1);
1295 if (qp1->div->n_row < qp2->div->n_row)
1296 return isl_qpolynomial_add(qp2, qp1);
1298 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1299 if (!compatible_divs(qp1->div, qp2->div))
1300 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1302 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1306 isl_qpolynomial_free(qp2);
1310 isl_qpolynomial_free(qp1);
1311 isl_qpolynomial_free(qp2);
1315 __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain(
1316 __isl_keep isl_set *dom,
1317 __isl_take isl_qpolynomial *qp1,
1318 __isl_take isl_qpolynomial *qp2)
1320 return isl_qpolynomial_add(qp1, qp2);
1323 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1324 __isl_take isl_qpolynomial *qp2)
1326 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1329 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1331 qp = isl_qpolynomial_cow(qp);
1336 qp->upoly = isl_upoly_neg(qp->upoly);
1342 isl_qpolynomial_free(qp);
1346 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1347 __isl_take isl_qpolynomial *qp2)
1349 qp1 = isl_qpolynomial_cow(qp1);
1354 if (qp1->div->n_row < qp2->div->n_row)
1355 return isl_qpolynomial_mul(qp2, qp1);
1357 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1358 if (!compatible_divs(qp1->div, qp2->div))
1359 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1361 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1365 isl_qpolynomial_free(qp2);
1369 isl_qpolynomial_free(qp1);
1370 isl_qpolynomial_free(qp2);
1374 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1376 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1379 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1381 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1384 __isl_give isl_qpolynomial *isl_qpolynomial_neginfty(__isl_take isl_dim *dim)
1386 return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx));
1389 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1391 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1394 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1397 struct isl_qpolynomial *qp;
1398 struct isl_upoly_cst *cst;
1400 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1404 cst = isl_upoly_as_cst(qp->upoly);
1405 isl_int_set(cst->n, v);
1410 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1411 isl_int *n, isl_int *d)
1413 struct isl_upoly_cst *cst;
1418 if (!isl_upoly_is_cst(qp->upoly))
1421 cst = isl_upoly_as_cst(qp->upoly);
1426 isl_int_set(*n, cst->n);
1428 isl_int_set(*d, cst->d);
1433 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1436 struct isl_upoly_rec *rec;
1444 rec = isl_upoly_as_rec(up);
1451 isl_assert(up->ctx, rec->n > 1, return -1);
1453 is_cst = isl_upoly_is_cst(rec->p[1]);
1459 return isl_upoly_is_affine(rec->p[0]);
1462 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1467 if (qp->div->n_row > 0)
1470 return isl_upoly_is_affine(qp->upoly);
1473 static void update_coeff(__isl_keep isl_vec *aff,
1474 __isl_keep struct isl_upoly_cst *cst, int pos)
1479 if (isl_int_is_zero(cst->n))
1484 isl_int_gcd(gcd, cst->d, aff->el[0]);
1485 isl_int_divexact(f, cst->d, gcd);
1486 isl_int_divexact(gcd, aff->el[0], gcd);
1487 isl_seq_scale(aff->el, aff->el, f, aff->size);
1488 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1493 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1494 __isl_keep isl_vec *aff)
1496 struct isl_upoly_cst *cst;
1497 struct isl_upoly_rec *rec;
1503 struct isl_upoly_cst *cst;
1505 cst = isl_upoly_as_cst(up);
1508 update_coeff(aff, cst, 0);
1512 rec = isl_upoly_as_rec(up);
1515 isl_assert(up->ctx, rec->n == 2, return -1);
1517 cst = isl_upoly_as_cst(rec->p[1]);
1520 update_coeff(aff, cst, 1 + up->var);
1522 return isl_upoly_update_affine(rec->p[0], aff);
1525 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1526 __isl_keep isl_qpolynomial *qp)
1534 isl_assert(qp->div->ctx, qp->div->n_row == 0, return NULL);
1535 d = isl_dim_total(qp->dim);
1536 aff = isl_vec_alloc(qp->div->ctx, 2 + d);
1540 isl_seq_clr(aff->el + 1, 1 + d);
1541 isl_int_set_si(aff->el[0], 1);
1543 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1552 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1553 __isl_keep isl_qpolynomial *qp2)
1558 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1561 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1564 struct isl_upoly_rec *rec;
1566 if (isl_upoly_is_cst(up)) {
1567 struct isl_upoly_cst *cst;
1568 cst = isl_upoly_as_cst(up);
1571 isl_int_lcm(*d, *d, cst->d);
1575 rec = isl_upoly_as_rec(up);
1579 for (i = 0; i < rec->n; ++i)
1580 upoly_update_den(rec->p[i], d);
1583 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1585 isl_int_set_si(*d, 1);
1588 upoly_update_den(qp->upoly, d);
1591 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1594 struct isl_ctx *ctx;
1601 return isl_qpolynomial_alloc(dim, 0, isl_upoly_pow(ctx, pos, power));
1604 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1605 enum isl_dim_type type, unsigned pos)
1610 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1611 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1613 if (type == isl_dim_set)
1614 pos += isl_dim_size(dim, isl_dim_param);
1616 return isl_qpolynomial_pow(dim, pos, 1);
1622 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1625 struct isl_qpolynomial *qp = NULL;
1626 struct isl_upoly_rec *rec;
1627 struct isl_upoly_cst *cst;
1633 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1635 pos = isl_dim_total(div->bmap->dim);
1636 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
1637 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1,
1642 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1643 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1645 for (i = 0; i < 1 + power; ++i) {
1646 rec->p[i] = isl_upoly_zero(div->ctx);
1651 cst = isl_upoly_as_cst(rec->p[power]);
1652 isl_int_set_si(cst->n, 1);
1658 isl_qpolynomial_free(qp);
1663 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1665 return isl_qpolynomial_div_pow(div, 1);
1668 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1669 const isl_int n, const isl_int d)
1671 struct isl_qpolynomial *qp;
1672 struct isl_upoly_cst *cst;
1674 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1678 cst = isl_upoly_as_cst(qp->upoly);
1679 isl_int_set(cst->n, n);
1680 isl_int_set(cst->d, d);
1685 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1687 struct isl_upoly_rec *rec;
1693 if (isl_upoly_is_cst(up))
1697 active[up->var] = 1;
1699 rec = isl_upoly_as_rec(up);
1700 for (i = 0; i < rec->n; ++i)
1701 if (up_set_active(rec->p[i], active, d) < 0)
1707 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1710 int d = isl_dim_total(qp->dim);
1715 for (i = 0; i < d; ++i)
1716 for (j = 0; j < qp->div->n_row; ++j) {
1717 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1723 return up_set_active(qp->upoly, active, d);
1726 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1727 enum isl_dim_type type, unsigned first, unsigned n)
1738 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1740 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1741 type == isl_dim_set, return -1);
1743 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1744 if (set_active(qp, active) < 0)
1747 if (type == isl_dim_set)
1748 first += isl_dim_size(qp->dim, isl_dim_param);
1749 for (i = 0; i < n; ++i)
1750 if (active[first + i]) {
1763 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1764 unsigned first, unsigned n)
1767 struct isl_upoly_rec *rec;
1771 if (n == 0 || up->var < 0 || up->var < first)
1773 if (up->var < first + n) {
1774 up = replace_by_constant_term(up);
1775 return isl_upoly_drop(up, first, n);
1777 up = isl_upoly_cow(up);
1781 rec = isl_upoly_as_rec(up);
1785 for (i = 0; i < rec->n; ++i) {
1786 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1797 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1798 __isl_take isl_qpolynomial *qp,
1799 enum isl_dim_type type, unsigned first, unsigned n)
1803 if (n == 0 && !isl_dim_get_tuple_name(qp->dim, type))
1806 qp = isl_qpolynomial_cow(qp);
1810 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1812 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1813 type == isl_dim_set, goto error);
1815 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1819 if (type == isl_dim_set)
1820 first += isl_dim_size(qp->dim, isl_dim_param);
1822 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1826 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1832 isl_qpolynomial_free(qp);
1836 __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up,
1837 unsigned first, unsigned n, __isl_keep struct isl_upoly **subs)
1840 struct isl_upoly_rec *rec;
1841 struct isl_upoly *base, *res;
1846 if (isl_upoly_is_cst(up))
1849 if (up->var < first)
1852 rec = isl_upoly_as_rec(up);
1856 isl_assert(up->ctx, rec->n >= 1, goto error);
1858 if (up->var >= first + n)
1859 base = isl_upoly_pow(up->ctx, up->var, 1);
1861 base = isl_upoly_copy(subs[up->var - first]);
1863 res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs);
1864 for (i = rec->n - 2; i >= 0; --i) {
1865 struct isl_upoly *t;
1866 t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs);
1867 res = isl_upoly_mul(res, isl_upoly_copy(base));
1868 res = isl_upoly_sum(res, t);
1871 isl_upoly_free(base);
1880 __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f,
1881 isl_int denom, unsigned len)
1884 struct isl_upoly *up;
1886 isl_assert(ctx, len >= 1, return NULL);
1888 up = isl_upoly_rat_cst(ctx, f[0], denom);
1889 for (i = 0; i < len - 1; ++i) {
1890 struct isl_upoly *t;
1891 struct isl_upoly *c;
1893 if (isl_int_is_zero(f[1 + i]))
1896 c = isl_upoly_rat_cst(ctx, f[1 + i], denom);
1897 t = isl_upoly_pow(ctx, i, 1);
1898 t = isl_upoly_mul(c, t);
1899 up = isl_upoly_sum(up, t);
1905 __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities(
1906 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
1911 struct isl_upoly *up;
1915 if (eq->n_eq == 0) {
1916 isl_basic_set_free(eq);
1920 qp = isl_qpolynomial_cow(qp);
1923 qp->div = isl_mat_cow(qp->div);
1927 total = 1 + isl_dim_total(eq->dim);
1928 isl_int_init(denom);
1929 for (i = 0; i < eq->n_eq; ++i) {
1930 j = isl_seq_last_non_zero(eq->eq[i], total);
1931 if (j < 0 || j == 0)
1934 for (k = 0; k < qp->div->n_row; ++k) {
1935 if (isl_int_is_zero(qp->div->row[k][1 + j]))
1937 isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total,
1938 &qp->div->row[k][0]);
1939 isl_seq_normalize(qp->div->ctx,
1940 qp->div->row[k], 1 + total);
1943 if (isl_int_is_pos(eq->eq[i][j]))
1944 isl_seq_neg(eq->eq[i], eq->eq[i], total);
1945 isl_int_abs(denom, eq->eq[i][j]);
1946 isl_int_set_si(eq->eq[i][j], 0);
1948 up = isl_upoly_from_affine(qp->dim->ctx,
1949 eq->eq[i], denom, total);
1950 qp->upoly = isl_upoly_subs(qp->upoly, j - 1, 1, &up);
1953 isl_int_clear(denom);
1958 isl_basic_set_free(eq);
1964 isl_basic_set_free(eq);
1965 isl_qpolynomial_free(qp);
1970 #define PW isl_pw_qpolynomial
1972 #define EL isl_qpolynomial
1974 #define IS_ZERO is_zero
1978 #include <isl_pw_templ.c>
1981 #define UNION isl_union_pw_qpolynomial
1983 #define PART isl_pw_qpolynomial
1985 #define PARTS pw_qpolynomial
1987 #include <isl_union_templ.c>
1989 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
1997 if (!isl_set_fast_is_universe(pwqp->p[0].set))
2000 return isl_qpolynomial_is_one(pwqp->p[0].qp);
2003 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
2004 __isl_take isl_pw_qpolynomial *pwqp1,
2005 __isl_take isl_pw_qpolynomial *pwqp2)
2008 struct isl_pw_qpolynomial *res;
2011 if (!pwqp1 || !pwqp2)
2014 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
2017 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
2018 isl_pw_qpolynomial_free(pwqp2);
2022 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
2023 isl_pw_qpolynomial_free(pwqp1);
2027 if (isl_pw_qpolynomial_is_one(pwqp1)) {
2028 isl_pw_qpolynomial_free(pwqp1);
2032 if (isl_pw_qpolynomial_is_one(pwqp2)) {
2033 isl_pw_qpolynomial_free(pwqp2);
2037 n = pwqp1->n * pwqp2->n;
2038 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
2040 for (i = 0; i < pwqp1->n; ++i) {
2041 for (j = 0; j < pwqp2->n; ++j) {
2042 struct isl_set *common;
2043 struct isl_qpolynomial *prod;
2044 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
2045 isl_set_copy(pwqp2->p[j].set));
2046 if (isl_set_fast_is_empty(common)) {
2047 isl_set_free(common);
2051 prod = isl_qpolynomial_mul(
2052 isl_qpolynomial_copy(pwqp1->p[i].qp),
2053 isl_qpolynomial_copy(pwqp2->p[j].qp));
2055 res = isl_pw_qpolynomial_add_piece(res, common, prod);
2059 isl_pw_qpolynomial_free(pwqp1);
2060 isl_pw_qpolynomial_free(pwqp2);
2064 isl_pw_qpolynomial_free(pwqp1);
2065 isl_pw_qpolynomial_free(pwqp2);
2069 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
2070 __isl_take isl_pw_qpolynomial *pwqp)
2077 if (isl_pw_qpolynomial_is_zero(pwqp))
2080 pwqp = isl_pw_qpolynomial_cow(pwqp);
2084 for (i = 0; i < pwqp->n; ++i) {
2085 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
2092 isl_pw_qpolynomial_free(pwqp);
2096 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
2097 __isl_take isl_pw_qpolynomial *pwqp1,
2098 __isl_take isl_pw_qpolynomial *pwqp2)
2100 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
2103 __isl_give struct isl_upoly *isl_upoly_eval(
2104 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
2107 struct isl_upoly_rec *rec;
2108 struct isl_upoly *res;
2109 struct isl_upoly *base;
2111 if (isl_upoly_is_cst(up)) {
2116 rec = isl_upoly_as_rec(up);
2120 isl_assert(up->ctx, rec->n >= 1, goto error);
2122 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
2124 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
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,
2130 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
2131 isl_vec_copy(vec)));
2134 isl_upoly_free(base);
2144 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
2145 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
2148 struct isl_upoly *up;
2153 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
2155 if (qp->div->n_row == 0)
2156 ext = isl_vec_copy(pnt->vec);
2159 unsigned dim = isl_dim_total(qp->dim);
2160 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
2164 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
2165 for (i = 0; i < qp->div->n_row; ++i) {
2166 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
2167 1 + dim + i, &ext->el[1+dim+i]);
2168 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
2169 qp->div->row[i][0]);
2173 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
2177 dim = isl_dim_copy(qp->dim);
2178 isl_qpolynomial_free(qp);
2179 isl_point_free(pnt);
2181 return isl_qpolynomial_alloc(dim, 0, up);
2183 isl_qpolynomial_free(qp);
2184 isl_point_free(pnt);
2188 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
2189 __isl_keep struct isl_upoly_cst *cst2)
2194 isl_int_mul(t, cst1->n, cst2->d);
2195 isl_int_submul(t, cst2->n, cst1->d);
2196 cmp = isl_int_sgn(t);
2201 int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1,
2202 __isl_keep isl_qpolynomial *qp2)
2204 struct isl_upoly_cst *cst1, *cst2;
2208 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), return -1);
2209 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), return -1);
2210 if (isl_qpolynomial_is_nan(qp1))
2212 if (isl_qpolynomial_is_nan(qp2))
2214 cst1 = isl_upoly_as_cst(qp1->upoly);
2215 cst2 = isl_upoly_as_cst(qp2->upoly);
2217 return isl_upoly_cmp(cst1, cst2) <= 0;
2220 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
2221 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2223 struct isl_upoly_cst *cst1, *cst2;
2228 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2229 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2230 cst1 = isl_upoly_as_cst(qp1->upoly);
2231 cst2 = isl_upoly_as_cst(qp2->upoly);
2232 cmp = isl_upoly_cmp(cst1, cst2);
2235 isl_qpolynomial_free(qp2);
2237 isl_qpolynomial_free(qp1);
2242 isl_qpolynomial_free(qp1);
2243 isl_qpolynomial_free(qp2);
2247 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
2248 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2250 struct isl_upoly_cst *cst1, *cst2;
2255 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2256 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2257 cst1 = isl_upoly_as_cst(qp1->upoly);
2258 cst2 = isl_upoly_as_cst(qp2->upoly);
2259 cmp = isl_upoly_cmp(cst1, cst2);
2262 isl_qpolynomial_free(qp2);
2264 isl_qpolynomial_free(qp1);
2269 isl_qpolynomial_free(qp1);
2270 isl_qpolynomial_free(qp2);
2274 __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
2275 __isl_take isl_qpolynomial *qp, enum isl_dim_type type,
2276 unsigned first, unsigned n)
2285 qp = isl_qpolynomial_cow(qp);
2289 isl_assert(qp->div->ctx, first <= isl_dim_size(qp->dim, type),
2292 g_pos = pos(qp->dim, type) + first;
2294 qp->div = isl_mat_insert_cols(qp->div, 2 + g_pos, n);
2298 total = qp->div->n_col - 2;
2299 if (total > g_pos) {
2301 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2304 for (i = 0; i < total - g_pos; ++i)
2306 qp->upoly = expand(qp->upoly, exp, g_pos);
2312 qp->dim = isl_dim_insert(qp->dim, type, first, n);
2318 isl_qpolynomial_free(qp);
2322 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
2323 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2327 pos = isl_qpolynomial_dim(qp, type);
2329 return isl_qpolynomial_insert_dims(qp, type, pos, n);
2332 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2333 __isl_take isl_pw_qpolynomial *pwqp,
2334 enum isl_dim_type type, unsigned n)
2338 pos = isl_pw_qpolynomial_dim(pwqp, type);
2340 return isl_pw_qpolynomial_insert_dims(pwqp, type, pos, n);
2343 static int *reordering_move(isl_ctx *ctx,
2344 unsigned len, unsigned dst, unsigned src, unsigned n)
2349 reordering = isl_alloc_array(ctx, int, len);
2354 for (i = 0; i < dst; ++i)
2356 for (i = 0; i < n; ++i)
2357 reordering[src + i] = dst + i;
2358 for (i = 0; i < src - dst; ++i)
2359 reordering[dst + i] = dst + n + i;
2360 for (i = 0; i < len - src - n; ++i)
2361 reordering[src + n + i] = src + n + i;
2363 for (i = 0; i < src; ++i)
2365 for (i = 0; i < n; ++i)
2366 reordering[src + i] = dst + i;
2367 for (i = 0; i < dst - src; ++i)
2368 reordering[src + n + i] = src + i;
2369 for (i = 0; i < len - dst - n; ++i)
2370 reordering[dst + n + i] = dst + n + i;
2376 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
2377 __isl_take isl_qpolynomial *qp,
2378 enum isl_dim_type dst_type, unsigned dst_pos,
2379 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2385 qp = isl_qpolynomial_cow(qp);
2389 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2392 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2393 g_src_pos = pos(qp->dim, src_type) + src_pos;
2394 if (dst_type > src_type)
2397 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2404 reordering = reordering_move(qp->dim->ctx,
2405 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2409 qp->upoly = reorder(qp->upoly, reordering);
2414 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2420 isl_qpolynomial_free(qp);
2424 __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_dim *dim,
2425 isl_int *f, isl_int denom)
2427 struct isl_upoly *up;
2432 up = isl_upoly_from_affine(dim->ctx, f, denom, 1 + isl_dim_total(dim));
2434 return isl_qpolynomial_alloc(dim, 0, up);
2437 __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
2438 __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
2442 struct isl_upoly *up;
2443 isl_qpolynomial *qp;
2449 isl_int_init(denom);
2451 isl_constraint_get_coefficient(c, type, pos, &denom);
2452 isl_constraint_set_coefficient(c, type, pos, c->ctx->zero);
2453 sgn = isl_int_sgn(denom);
2454 isl_int_abs(denom, denom);
2455 up = isl_upoly_from_affine(c->ctx, c->line[0], denom,
2456 1 + isl_constraint_dim(c, isl_dim_all));
2458 isl_int_neg(denom, denom);
2459 isl_constraint_set_coefficient(c, type, pos, denom);
2461 dim = isl_dim_copy(c->bmap->dim);
2463 isl_int_clear(denom);
2464 isl_constraint_free(c);
2466 qp = isl_qpolynomial_alloc(dim, 0, up);
2468 qp = isl_qpolynomial_neg(qp);
2472 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
2473 * in "qp" by subs[i].
2475 __isl_give isl_qpolynomial *isl_qpolynomial_substitute(
2476 __isl_take isl_qpolynomial *qp,
2477 enum isl_dim_type type, unsigned first, unsigned n,
2478 __isl_keep isl_qpolynomial **subs)
2481 struct isl_upoly **ups;
2486 qp = isl_qpolynomial_cow(qp);
2489 for (i = 0; i < n; ++i)
2493 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2496 for (i = 0; i < n; ++i)
2497 isl_assert(qp->dim->ctx, isl_dim_equal(qp->dim, subs[i]->dim),
2500 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
2501 for (i = 0; i < n; ++i)
2502 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
2504 first += pos(qp->dim, type);
2506 ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n);
2509 for (i = 0; i < n; ++i)
2510 ups[i] = subs[i]->upoly;
2512 qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups);
2521 isl_qpolynomial_free(qp);
2525 __isl_give isl_basic_set *add_div_constraints(__isl_take isl_basic_set *bset,
2526 __isl_take isl_mat *div)
2534 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2537 total = isl_basic_set_total_dim(bset);
2538 for (i = 0; i < div->n_row; ++i)
2539 if (isl_basic_set_add_div_constraints_var(bset,
2540 total - div->n_row + i, div->row[i]) < 0)
2547 isl_basic_set_free(bset);
2551 /* Extend "bset" with extra set dimensions for each integer division
2552 * in "qp" and then call "fn" with the extended bset and the polynomial
2553 * that results from replacing each of the integer divisions by the
2554 * corresponding extra set dimension.
2556 int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
2557 __isl_keep isl_basic_set *bset,
2558 int (*fn)(__isl_take isl_basic_set *bset,
2559 __isl_take isl_qpolynomial *poly, void *user), void *user)
2563 isl_qpolynomial *poly;
2567 if (qp->div->n_row == 0)
2568 return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
2571 div = isl_mat_copy(qp->div);
2572 dim = isl_dim_copy(qp->dim);
2573 dim = isl_dim_add(dim, isl_dim_set, qp->div->n_row);
2574 poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly));
2575 bset = isl_basic_set_copy(bset);
2576 bset = isl_basic_set_add(bset, isl_dim_set, qp->div->n_row);
2577 bset = add_div_constraints(bset, div);
2579 return fn(bset, poly, user);
2584 /* Return total degree in variables first (inclusive) up to last (exclusive).
2586 int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last)
2590 struct isl_upoly_rec *rec;
2594 if (isl_upoly_is_zero(up))
2596 if (isl_upoly_is_cst(up) || up->var < first)
2599 rec = isl_upoly_as_rec(up);
2603 for (i = 0; i < rec->n; ++i) {
2606 if (isl_upoly_is_zero(rec->p[i]))
2608 d = isl_upoly_degree(rec->p[i], first, last);
2618 /* Return total degree in set variables.
2620 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
2628 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2629 nvar = isl_dim_size(poly->dim, isl_dim_set);
2630 return isl_upoly_degree(poly->upoly, ovar, ovar + nvar);
2633 __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up,
2634 unsigned pos, int deg)
2637 struct isl_upoly_rec *rec;
2642 if (isl_upoly_is_cst(up) || up->var < pos) {
2644 return isl_upoly_copy(up);
2646 return isl_upoly_zero(up->ctx);
2649 rec = isl_upoly_as_rec(up);
2653 if (up->var == pos) {
2655 return isl_upoly_copy(rec->p[deg]);
2657 return isl_upoly_zero(up->ctx);
2660 up = isl_upoly_copy(up);
2661 up = isl_upoly_cow(up);
2662 rec = isl_upoly_as_rec(up);
2666 for (i = 0; i < rec->n; ++i) {
2667 struct isl_upoly *t;
2668 t = isl_upoly_coeff(rec->p[i], pos, deg);
2671 isl_upoly_free(rec->p[i]);
2681 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
2683 __isl_give isl_qpolynomial *isl_qpolynomial_coeff(
2684 __isl_keep isl_qpolynomial *qp,
2685 enum isl_dim_type type, unsigned t_pos, int deg)
2688 struct isl_upoly *up;
2694 isl_assert(qp->div->ctx, t_pos < isl_dim_size(qp->dim, type),
2697 g_pos = pos(qp->dim, type) + t_pos;
2698 up = isl_upoly_coeff(qp->upoly, g_pos, deg);
2700 c = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row, up);
2703 isl_mat_free(c->div);
2704 c->div = isl_mat_copy(qp->div);
2709 isl_qpolynomial_free(c);
2713 /* Homogenize the polynomial in the variables first (inclusive) up to
2714 * last (exclusive) by inserting powers of variable first.
2715 * Variable first is assumed not to appear in the input.
2717 __isl_give struct isl_upoly *isl_upoly_homogenize(
2718 __isl_take struct isl_upoly *up, int deg, int target,
2719 int first, int last)
2722 struct isl_upoly_rec *rec;
2726 if (isl_upoly_is_zero(up))
2730 if (isl_upoly_is_cst(up) || up->var < first) {
2731 struct isl_upoly *hom;
2733 hom = isl_upoly_pow(up->ctx, first, target - deg);
2736 rec = isl_upoly_as_rec(hom);
2737 rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up);
2742 up = isl_upoly_cow(up);
2743 rec = isl_upoly_as_rec(up);
2747 for (i = 0; i < rec->n; ++i) {
2748 if (isl_upoly_is_zero(rec->p[i]))
2750 rec->p[i] = isl_upoly_homogenize(rec->p[i],
2751 up->var < last ? deg + i : i, target,
2763 /* Homogenize the polynomial in the set variables by introducing
2764 * powers of an extra set variable at position 0.
2766 __isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
2767 __isl_take isl_qpolynomial *poly)
2771 int deg = isl_qpolynomial_degree(poly);
2776 poly = isl_qpolynomial_insert_dims(poly, isl_dim_set, 0, 1);
2777 poly = isl_qpolynomial_cow(poly);
2781 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2782 nvar = isl_dim_size(poly->dim, isl_dim_set);
2783 poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg,
2790 isl_qpolynomial_free(poly);
2794 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2795 __isl_take isl_mat *div)
2803 n = isl_dim_total(dim) + div->n_row;
2805 term = isl_calloc(dim->ctx, struct isl_term,
2806 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2813 isl_int_init(term->n);
2814 isl_int_init(term->d);
2823 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
2832 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
2841 total = isl_dim_total(term->dim) + term->div->n_row;
2843 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
2847 isl_int_set(dup->n, term->n);
2848 isl_int_set(dup->d, term->d);
2850 for (i = 0; i < total; ++i)
2851 dup->pow[i] = term->pow[i];
2856 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
2864 return isl_term_dup(term);
2867 void isl_term_free(__isl_take isl_term *term)
2872 if (--term->ref > 0)
2875 isl_dim_free(term->dim);
2876 isl_mat_free(term->div);
2877 isl_int_clear(term->n);
2878 isl_int_clear(term->d);
2882 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
2890 case isl_dim_out: return isl_dim_size(term->dim, type);
2891 case isl_dim_div: return term->div->n_row;
2892 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
2897 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
2899 return term ? term->dim->ctx : NULL;
2902 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
2906 isl_int_set(*n, term->n);
2909 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
2913 isl_int_set(*d, term->d);
2916 int isl_term_get_exp(__isl_keep isl_term *term,
2917 enum isl_dim_type type, unsigned pos)
2922 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
2924 if (type >= isl_dim_set)
2925 pos += isl_dim_size(term->dim, isl_dim_param);
2926 if (type >= isl_dim_div)
2927 pos += isl_dim_size(term->dim, isl_dim_set);
2929 return term->pow[pos];
2932 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
2934 isl_basic_map *bmap;
2941 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
2944 total = term->div->n_col - term->div->n_row - 2;
2945 /* No nested divs for now */
2946 isl_assert(term->dim->ctx,
2947 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
2948 term->div->n_row) == -1,
2951 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
2952 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
2955 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
2957 return isl_basic_map_div(bmap, k);
2959 isl_basic_map_free(bmap);
2963 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
2964 int (*fn)(__isl_take isl_term *term, void *user),
2965 __isl_take isl_term *term, void *user)
2968 struct isl_upoly_rec *rec;
2973 if (isl_upoly_is_zero(up))
2976 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
2977 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
2978 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
2980 if (isl_upoly_is_cst(up)) {
2981 struct isl_upoly_cst *cst;
2982 cst = isl_upoly_as_cst(up);
2985 term = isl_term_cow(term);
2988 isl_int_set(term->n, cst->n);
2989 isl_int_set(term->d, cst->d);
2990 if (fn(isl_term_copy(term), user) < 0)
2995 rec = isl_upoly_as_rec(up);
2999 for (i = 0; i < rec->n; ++i) {
3000 term = isl_term_cow(term);
3003 term->pow[up->var] = i;
3004 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
3008 term->pow[up->var] = 0;
3012 isl_term_free(term);
3016 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
3017 int (*fn)(__isl_take isl_term *term, void *user), void *user)
3024 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
3028 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
3030 isl_term_free(term);
3032 return term ? 0 : -1;
3035 __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
3037 struct isl_upoly *up;
3038 isl_qpolynomial *qp;
3044 n = isl_dim_total(term->dim) + term->div->n_row;
3046 up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d);
3047 for (i = 0; i < n; ++i) {
3050 up = isl_upoly_mul(up,
3051 isl_upoly_pow(term->dim->ctx, i, term->pow[i]));
3054 qp = isl_qpolynomial_alloc(isl_dim_copy(term->dim), term->div->n_row, up);
3057 isl_mat_free(qp->div);
3058 qp->div = isl_mat_copy(term->div);
3062 isl_term_free(term);
3065 isl_qpolynomial_free(qp);
3066 isl_term_free(term);
3070 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
3071 __isl_take isl_dim *dim)
3080 if (isl_dim_equal(qp->dim, dim)) {
3085 qp = isl_qpolynomial_cow(qp);
3089 extra = isl_dim_size(dim, isl_dim_set) -
3090 isl_dim_size(qp->dim, isl_dim_set);
3091 total = isl_dim_total(qp->dim);
3092 if (qp->div->n_row) {
3095 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
3098 for (i = 0; i < qp->div->n_row; ++i)
3100 qp->upoly = expand(qp->upoly, exp, total);
3105 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
3108 for (i = 0; i < qp->div->n_row; ++i)
3109 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
3111 isl_dim_free(qp->dim);
3117 isl_qpolynomial_free(qp);
3121 /* For each parameter or variable that does not appear in qp,
3122 * first eliminate the variable from all constraints and then set it to zero.
3124 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
3125 __isl_keep isl_qpolynomial *qp)
3136 d = isl_dim_total(set->dim);
3137 active = isl_calloc_array(set->ctx, int, d);
3138 if (set_active(qp, active) < 0)
3141 for (i = 0; i < d; ++i)
3150 nparam = isl_dim_size(set->dim, isl_dim_param);
3151 nvar = isl_dim_size(set->dim, isl_dim_set);
3152 for (i = 0; i < nparam; ++i) {
3155 set = isl_set_eliminate(set, isl_dim_param, i, 1);
3156 set = isl_set_fix_si(set, isl_dim_param, i, 0);
3158 for (i = 0; i < nvar; ++i) {
3159 if (active[nparam + i])
3161 set = isl_set_eliminate(set, isl_dim_set, i, 1);
3162 set = isl_set_fix_si(set, isl_dim_set, i, 0);
3174 struct isl_opt_data {
3175 isl_qpolynomial *qp;
3177 isl_qpolynomial *opt;
3181 static int opt_fn(__isl_take isl_point *pnt, void *user)
3183 struct isl_opt_data *data = (struct isl_opt_data *)user;
3184 isl_qpolynomial *val;
3186 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
3190 } else if (data->max) {
3191 data->opt = isl_qpolynomial_max_cst(data->opt, val);
3193 data->opt = isl_qpolynomial_min_cst(data->opt, val);
3199 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
3200 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
3202 struct isl_opt_data data = { NULL, 1, NULL, max };
3207 if (isl_upoly_is_cst(qp->upoly)) {
3212 set = fix_inactive(set, qp);
3215 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
3219 data.opt = isl_qpolynomial_zero(isl_qpolynomial_get_dim(qp));
3222 isl_qpolynomial_free(qp);
3226 isl_qpolynomial_free(qp);
3227 isl_qpolynomial_free(data.opt);
3231 __isl_give isl_qpolynomial *isl_qpolynomial_morph(__isl_take isl_qpolynomial *qp,
3232 __isl_take isl_morph *morph)
3236 struct isl_upoly *up;
3238 struct isl_upoly **subs;
3241 qp = isl_qpolynomial_cow(qp);
3246 isl_assert(ctx, isl_dim_equal(qp->dim, morph->dom->dim), goto error);
3248 subs = isl_calloc_array(ctx, struct isl_upoly *, morph->inv->n_row - 1);
3252 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3253 subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i],
3254 morph->inv->row[0][0], morph->inv->n_col);
3256 qp->upoly = isl_upoly_subs(qp->upoly, 0, morph->inv->n_row - 1, subs);
3258 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3259 isl_upoly_free(subs[i]);
3262 mat = isl_mat_diagonal(isl_mat_identity(ctx, 1), isl_mat_copy(morph->inv));
3263 mat = isl_mat_diagonal(mat, isl_mat_identity(ctx, qp->div->n_row));
3264 qp->div = isl_mat_product(qp->div, mat);
3265 isl_dim_free(qp->dim);
3266 qp->dim = isl_dim_copy(morph->ran->dim);
3268 if (!qp->upoly || !qp->div || !qp->dim)
3271 isl_morph_free(morph);
3275 isl_qpolynomial_free(qp);
3276 isl_morph_free(morph);
3280 static int neg_entry(void **entry, void *user)
3282 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
3284 *pwqp = isl_pw_qpolynomial_neg(*pwqp);
3286 return *pwqp ? 0 : -1;
3289 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_neg(
3290 __isl_take isl_union_pw_qpolynomial *upwqp)
3292 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
3296 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
3297 &neg_entry, NULL) < 0)
3302 isl_union_pw_qpolynomial_free(upwqp);
3306 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_sub(
3307 __isl_take isl_union_pw_qpolynomial *upwqp1,
3308 __isl_take isl_union_pw_qpolynomial *upwqp2)
3310 return isl_union_pw_qpolynomial_add(upwqp1,
3311 isl_union_pw_qpolynomial_neg(upwqp2));
3314 static int mul_entry(void **entry, void *user)
3316 struct isl_union_pw_qpolynomial_match_bin_data *data = user;
3318 struct isl_hash_table_entry *entry2;
3319 isl_pw_qpolynomial *pwpq = *entry;
3322 hash = isl_dim_get_hash(pwpq->dim);
3323 entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table,
3324 hash, &has_dim, pwpq->dim, 0);
3328 pwpq = isl_pw_qpolynomial_copy(pwpq);
3329 pwpq = isl_pw_qpolynomial_mul(pwpq,
3330 isl_pw_qpolynomial_copy(entry2->data));
3332 empty = isl_pw_qpolynomial_is_zero(pwpq);
3334 isl_pw_qpolynomial_free(pwpq);
3338 isl_pw_qpolynomial_free(pwpq);
3342 data->res = isl_union_pw_qpolynomial_add_pw_qpolynomial(data->res, pwpq);
3347 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
3348 __isl_take isl_union_pw_qpolynomial *upwqp1,
3349 __isl_take isl_union_pw_qpolynomial *upwqp2)
3351 return match_bin_op(upwqp1, upwqp2, &mul_entry);
3354 /* Reorder the columns of the given div definitions according to the
3357 static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div,
3358 __isl_take isl_reordering *r)
3367 extra = isl_dim_total(r->dim) + div->n_row - r->len;
3368 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
3372 for (i = 0; i < div->n_row; ++i) {
3373 isl_seq_cpy(mat->row[i], div->row[i], 2);
3374 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2);
3375 for (j = 0; j < r->len; ++j)
3376 isl_int_set(mat->row[i][2 + r->pos[j]],
3377 div->row[i][2 + j]);
3380 isl_reordering_free(r);
3384 isl_reordering_free(r);
3389 /* Reorder the dimension of "qp" according to the given reordering.
3391 __isl_give isl_qpolynomial *isl_qpolynomial_realign(
3392 __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r)
3394 qp = isl_qpolynomial_cow(qp);
3398 r = isl_reordering_extend(r, qp->div->n_row);
3402 qp->div = reorder_divs(qp->div, isl_reordering_copy(r));
3406 qp->upoly = reorder(qp->upoly, r->pos);
3410 qp = isl_qpolynomial_reset_dim(qp, isl_dim_copy(r->dim));
3412 isl_reordering_free(r);
3415 isl_qpolynomial_free(qp);
3416 isl_reordering_free(r);