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 static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp)
1073 struct isl_div_sort_info *array = NULL;
1075 int *reordering = NULL;
1080 if (qp->div->n_row <= 1)
1083 div_pos = isl_dim_total(qp->dim);
1085 array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info,
1087 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1088 reordering = isl_alloc_array(qp->div->ctx, int, qp->div->n_col - 2);
1089 if (!array || !pos || !reordering)
1092 for (i = 0; i < qp->div->n_row; ++i) {
1093 array[i].div = qp->div;
1098 qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
1101 for (i = 0; i < div_pos; ++i)
1104 for (i = 0; i < qp->div->n_row; ++i)
1105 reordering[div_pos + array[i].row] = div_pos + i;
1107 for (i = 0; i < qp->div->n_row; ++i) {
1109 if (pos[array[i].row] == i)
1111 qp->div = isl_mat_cow(qp->div);
1112 qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]);
1113 t = pos[array[i].row];
1114 pos[array[i].row] = pos[i];
1118 qp->upoly = reorder(qp->upoly, reordering);
1120 if (!qp->upoly || !qp->div)
1132 isl_qpolynomial_free(qp);
1136 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
1137 __isl_keep isl_mat *div2, int *exp1, int *exp2)
1140 isl_mat *div = NULL;
1141 unsigned d = div1->n_col - div1->n_row;
1143 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
1144 d + div1->n_row + div2->n_row);
1148 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
1151 expand_row(div, k, div1, i, exp1);
1152 expand_row(div, k + 1, div2, j, exp2);
1154 cmp = cmp_row(div, k, k + 1);
1158 } else if (cmp < 0) {
1162 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1165 for (; i < div1->n_row; ++i, ++k) {
1166 expand_row(div, k, div1, i, exp1);
1169 for (; j < div2->n_row; ++j, ++k) {
1170 expand_row(div, k, div2, j, exp2);
1180 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1181 int *exp, int first)
1184 struct isl_upoly_rec *rec;
1186 if (isl_upoly_is_cst(up))
1189 if (up->var < first)
1192 if (exp[up->var - first] == up->var - first)
1195 up = isl_upoly_cow(up);
1199 up->var = exp[up->var - first] + first;
1201 rec = isl_upoly_as_rec(up);
1205 for (i = 0; i < rec->n; ++i) {
1206 rec->p[i] = expand(rec->p[i], exp, first);
1217 static __isl_give isl_qpolynomial *with_merged_divs(
1218 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1219 __isl_take isl_qpolynomial *qp2),
1220 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1224 isl_mat *div = NULL;
1226 qp1 = isl_qpolynomial_cow(qp1);
1227 qp2 = isl_qpolynomial_cow(qp2);
1232 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1233 qp1->div->n_col >= qp2->div->n_col, goto error);
1235 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1236 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1240 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1244 isl_mat_free(qp1->div);
1245 qp1->div = isl_mat_copy(div);
1246 isl_mat_free(qp2->div);
1247 qp2->div = isl_mat_copy(div);
1249 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1250 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1252 if (!qp1->upoly || !qp2->upoly)
1259 return fn(qp1, qp2);
1264 isl_qpolynomial_free(qp1);
1265 isl_qpolynomial_free(qp2);
1269 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1270 __isl_take isl_qpolynomial *qp2)
1272 qp1 = isl_qpolynomial_cow(qp1);
1277 if (qp1->div->n_row < qp2->div->n_row)
1278 return isl_qpolynomial_add(qp2, qp1);
1280 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1281 if (!compatible_divs(qp1->div, qp2->div))
1282 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1284 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1288 isl_qpolynomial_free(qp2);
1292 isl_qpolynomial_free(qp1);
1293 isl_qpolynomial_free(qp2);
1297 __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain(
1298 __isl_keep isl_set *dom,
1299 __isl_take isl_qpolynomial *qp1,
1300 __isl_take isl_qpolynomial *qp2)
1302 return isl_qpolynomial_add(qp1, qp2);
1305 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1306 __isl_take isl_qpolynomial *qp2)
1308 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1311 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1313 qp = isl_qpolynomial_cow(qp);
1318 qp->upoly = isl_upoly_neg(qp->upoly);
1324 isl_qpolynomial_free(qp);
1328 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1329 __isl_take isl_qpolynomial *qp2)
1331 qp1 = isl_qpolynomial_cow(qp1);
1336 if (qp1->div->n_row < qp2->div->n_row)
1337 return isl_qpolynomial_mul(qp2, qp1);
1339 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1340 if (!compatible_divs(qp1->div, qp2->div))
1341 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1343 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1347 isl_qpolynomial_free(qp2);
1351 isl_qpolynomial_free(qp1);
1352 isl_qpolynomial_free(qp2);
1356 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1358 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1361 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1363 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1366 __isl_give isl_qpolynomial *isl_qpolynomial_neginfty(__isl_take isl_dim *dim)
1368 return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx));
1371 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1373 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1376 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1379 struct isl_qpolynomial *qp;
1380 struct isl_upoly_cst *cst;
1382 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1386 cst = isl_upoly_as_cst(qp->upoly);
1387 isl_int_set(cst->n, v);
1392 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1393 isl_int *n, isl_int *d)
1395 struct isl_upoly_cst *cst;
1400 if (!isl_upoly_is_cst(qp->upoly))
1403 cst = isl_upoly_as_cst(qp->upoly);
1408 isl_int_set(*n, cst->n);
1410 isl_int_set(*d, cst->d);
1415 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1418 struct isl_upoly_rec *rec;
1426 rec = isl_upoly_as_rec(up);
1433 isl_assert(up->ctx, rec->n > 1, return -1);
1435 is_cst = isl_upoly_is_cst(rec->p[1]);
1441 return isl_upoly_is_affine(rec->p[0]);
1444 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1449 if (qp->div->n_row > 0)
1452 return isl_upoly_is_affine(qp->upoly);
1455 static void update_coeff(__isl_keep isl_vec *aff,
1456 __isl_keep struct isl_upoly_cst *cst, int pos)
1461 if (isl_int_is_zero(cst->n))
1466 isl_int_gcd(gcd, cst->d, aff->el[0]);
1467 isl_int_divexact(f, cst->d, gcd);
1468 isl_int_divexact(gcd, aff->el[0], gcd);
1469 isl_seq_scale(aff->el, aff->el, f, aff->size);
1470 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1475 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1476 __isl_keep isl_vec *aff)
1478 struct isl_upoly_cst *cst;
1479 struct isl_upoly_rec *rec;
1485 struct isl_upoly_cst *cst;
1487 cst = isl_upoly_as_cst(up);
1490 update_coeff(aff, cst, 0);
1494 rec = isl_upoly_as_rec(up);
1497 isl_assert(up->ctx, rec->n == 2, return -1);
1499 cst = isl_upoly_as_cst(rec->p[1]);
1502 update_coeff(aff, cst, 1 + up->var);
1504 return isl_upoly_update_affine(rec->p[0], aff);
1507 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1508 __isl_keep isl_qpolynomial *qp)
1516 isl_assert(qp->div->ctx, qp->div->n_row == 0, return NULL);
1517 d = isl_dim_total(qp->dim);
1518 aff = isl_vec_alloc(qp->div->ctx, 2 + d);
1522 isl_seq_clr(aff->el + 1, 1 + d);
1523 isl_int_set_si(aff->el[0], 1);
1525 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1534 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1535 __isl_keep isl_qpolynomial *qp2)
1540 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1543 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1546 struct isl_upoly_rec *rec;
1548 if (isl_upoly_is_cst(up)) {
1549 struct isl_upoly_cst *cst;
1550 cst = isl_upoly_as_cst(up);
1553 isl_int_lcm(*d, *d, cst->d);
1557 rec = isl_upoly_as_rec(up);
1561 for (i = 0; i < rec->n; ++i)
1562 upoly_update_den(rec->p[i], d);
1565 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1567 isl_int_set_si(*d, 1);
1570 upoly_update_den(qp->upoly, d);
1573 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1576 struct isl_ctx *ctx;
1583 return isl_qpolynomial_alloc(dim, 0, isl_upoly_pow(ctx, pos, power));
1586 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1587 enum isl_dim_type type, unsigned pos)
1592 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1593 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1595 if (type == isl_dim_set)
1596 pos += isl_dim_size(dim, isl_dim_param);
1598 return isl_qpolynomial_pow(dim, pos, 1);
1604 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1607 struct isl_qpolynomial *qp = NULL;
1608 struct isl_upoly_rec *rec;
1609 struct isl_upoly_cst *cst;
1615 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1617 pos = isl_dim_total(div->bmap->dim);
1618 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
1619 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1,
1624 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1625 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1627 for (i = 0; i < 1 + power; ++i) {
1628 rec->p[i] = isl_upoly_zero(div->ctx);
1633 cst = isl_upoly_as_cst(rec->p[power]);
1634 isl_int_set_si(cst->n, 1);
1640 isl_qpolynomial_free(qp);
1645 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1647 return isl_qpolynomial_div_pow(div, 1);
1650 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1651 const isl_int n, const isl_int d)
1653 struct isl_qpolynomial *qp;
1654 struct isl_upoly_cst *cst;
1656 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1660 cst = isl_upoly_as_cst(qp->upoly);
1661 isl_int_set(cst->n, n);
1662 isl_int_set(cst->d, d);
1667 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1669 struct isl_upoly_rec *rec;
1675 if (isl_upoly_is_cst(up))
1679 active[up->var] = 1;
1681 rec = isl_upoly_as_rec(up);
1682 for (i = 0; i < rec->n; ++i)
1683 if (up_set_active(rec->p[i], active, d) < 0)
1689 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1692 int d = isl_dim_total(qp->dim);
1697 for (i = 0; i < d; ++i)
1698 for (j = 0; j < qp->div->n_row; ++j) {
1699 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1705 return up_set_active(qp->upoly, active, d);
1708 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1709 enum isl_dim_type type, unsigned first, unsigned n)
1720 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1722 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1723 type == isl_dim_set, return -1);
1725 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1726 if (set_active(qp, active) < 0)
1729 if (type == isl_dim_set)
1730 first += isl_dim_size(qp->dim, isl_dim_param);
1731 for (i = 0; i < n; ++i)
1732 if (active[first + i]) {
1745 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1746 unsigned first, unsigned n)
1749 struct isl_upoly_rec *rec;
1753 if (n == 0 || up->var < 0 || up->var < first)
1755 if (up->var < first + n) {
1756 up = replace_by_constant_term(up);
1757 return isl_upoly_drop(up, first, n);
1759 up = isl_upoly_cow(up);
1763 rec = isl_upoly_as_rec(up);
1767 for (i = 0; i < rec->n; ++i) {
1768 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1779 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1780 __isl_take isl_qpolynomial *qp,
1781 enum isl_dim_type type, unsigned first, unsigned n)
1785 if (n == 0 && !isl_dim_get_tuple_name(qp->dim, type))
1788 qp = isl_qpolynomial_cow(qp);
1792 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1794 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1795 type == isl_dim_set, goto error);
1797 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1801 if (type == isl_dim_set)
1802 first += isl_dim_size(qp->dim, isl_dim_param);
1804 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1808 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1814 isl_qpolynomial_free(qp);
1818 __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up,
1819 unsigned first, unsigned n, __isl_keep struct isl_upoly **subs)
1822 struct isl_upoly_rec *rec;
1823 struct isl_upoly *base, *res;
1828 if (isl_upoly_is_cst(up))
1831 if (up->var < first)
1834 rec = isl_upoly_as_rec(up);
1838 isl_assert(up->ctx, rec->n >= 1, goto error);
1840 if (up->var >= first + n)
1841 base = isl_upoly_pow(up->ctx, up->var, 1);
1843 base = isl_upoly_copy(subs[up->var - first]);
1845 res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs);
1846 for (i = rec->n - 2; i >= 0; --i) {
1847 struct isl_upoly *t;
1848 t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs);
1849 res = isl_upoly_mul(res, isl_upoly_copy(base));
1850 res = isl_upoly_sum(res, t);
1853 isl_upoly_free(base);
1862 __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f,
1863 isl_int denom, unsigned len)
1866 struct isl_upoly *up;
1868 isl_assert(ctx, len >= 1, return NULL);
1870 up = isl_upoly_rat_cst(ctx, f[0], denom);
1871 for (i = 0; i < len - 1; ++i) {
1872 struct isl_upoly *t;
1873 struct isl_upoly *c;
1875 if (isl_int_is_zero(f[1 + i]))
1878 c = isl_upoly_rat_cst(ctx, f[1 + i], denom);
1879 t = isl_upoly_pow(ctx, i, 1);
1880 t = isl_upoly_mul(c, t);
1881 up = isl_upoly_sum(up, t);
1887 __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities(
1888 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
1893 struct isl_upoly *up;
1897 if (eq->n_eq == 0) {
1898 isl_basic_set_free(eq);
1902 qp = isl_qpolynomial_cow(qp);
1905 qp->div = isl_mat_cow(qp->div);
1909 total = 1 + isl_dim_total(eq->dim);
1910 isl_int_init(denom);
1911 for (i = 0; i < eq->n_eq; ++i) {
1912 j = isl_seq_last_non_zero(eq->eq[i], total);
1913 if (j < 0 || j == 0)
1916 for (k = 0; k < qp->div->n_row; ++k) {
1917 if (isl_int_is_zero(qp->div->row[k][1 + j]))
1919 isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total,
1920 &qp->div->row[k][0]);
1921 isl_seq_normalize(qp->div->ctx,
1922 qp->div->row[k], 1 + total);
1925 if (isl_int_is_pos(eq->eq[i][j]))
1926 isl_seq_neg(eq->eq[i], eq->eq[i], total);
1927 isl_int_abs(denom, eq->eq[i][j]);
1928 isl_int_set_si(eq->eq[i][j], 0);
1930 up = isl_upoly_from_affine(qp->dim->ctx,
1931 eq->eq[i], denom, total);
1932 qp->upoly = isl_upoly_subs(qp->upoly, j - 1, 1, &up);
1935 isl_int_clear(denom);
1940 isl_basic_set_free(eq);
1946 isl_basic_set_free(eq);
1947 isl_qpolynomial_free(qp);
1952 #define PW isl_pw_qpolynomial
1954 #define EL isl_qpolynomial
1956 #define IS_ZERO is_zero
1960 #include <isl_pw_templ.c>
1963 #define UNION isl_union_pw_qpolynomial
1965 #define PART isl_pw_qpolynomial
1967 #define PARTS pw_qpolynomial
1969 #include <isl_union_templ.c>
1971 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
1979 if (!isl_set_fast_is_universe(pwqp->p[0].set))
1982 return isl_qpolynomial_is_one(pwqp->p[0].qp);
1985 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
1986 __isl_take isl_pw_qpolynomial *pwqp1,
1987 __isl_take isl_pw_qpolynomial *pwqp2)
1990 struct isl_pw_qpolynomial *res;
1993 if (!pwqp1 || !pwqp2)
1996 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
1999 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
2000 isl_pw_qpolynomial_free(pwqp2);
2004 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
2005 isl_pw_qpolynomial_free(pwqp1);
2009 if (isl_pw_qpolynomial_is_one(pwqp1)) {
2010 isl_pw_qpolynomial_free(pwqp1);
2014 if (isl_pw_qpolynomial_is_one(pwqp2)) {
2015 isl_pw_qpolynomial_free(pwqp2);
2019 n = pwqp1->n * pwqp2->n;
2020 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
2022 for (i = 0; i < pwqp1->n; ++i) {
2023 for (j = 0; j < pwqp2->n; ++j) {
2024 struct isl_set *common;
2025 struct isl_qpolynomial *prod;
2026 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
2027 isl_set_copy(pwqp2->p[j].set));
2028 if (isl_set_fast_is_empty(common)) {
2029 isl_set_free(common);
2033 prod = isl_qpolynomial_mul(
2034 isl_qpolynomial_copy(pwqp1->p[i].qp),
2035 isl_qpolynomial_copy(pwqp2->p[j].qp));
2037 res = isl_pw_qpolynomial_add_piece(res, common, prod);
2041 isl_pw_qpolynomial_free(pwqp1);
2042 isl_pw_qpolynomial_free(pwqp2);
2046 isl_pw_qpolynomial_free(pwqp1);
2047 isl_pw_qpolynomial_free(pwqp2);
2051 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
2052 __isl_take isl_pw_qpolynomial *pwqp)
2059 if (isl_pw_qpolynomial_is_zero(pwqp))
2062 pwqp = isl_pw_qpolynomial_cow(pwqp);
2066 for (i = 0; i < pwqp->n; ++i) {
2067 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
2074 isl_pw_qpolynomial_free(pwqp);
2078 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
2079 __isl_take isl_pw_qpolynomial *pwqp1,
2080 __isl_take isl_pw_qpolynomial *pwqp2)
2082 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
2085 __isl_give struct isl_upoly *isl_upoly_eval(
2086 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
2089 struct isl_upoly_rec *rec;
2090 struct isl_upoly *res;
2091 struct isl_upoly *base;
2093 if (isl_upoly_is_cst(up)) {
2098 rec = isl_upoly_as_rec(up);
2102 isl_assert(up->ctx, rec->n >= 1, goto error);
2104 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
2106 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
2109 for (i = rec->n - 2; i >= 0; --i) {
2110 res = isl_upoly_mul(res, isl_upoly_copy(base));
2111 res = isl_upoly_sum(res,
2112 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
2113 isl_vec_copy(vec)));
2116 isl_upoly_free(base);
2126 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
2127 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
2130 struct isl_upoly *up;
2135 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
2137 if (qp->div->n_row == 0)
2138 ext = isl_vec_copy(pnt->vec);
2141 unsigned dim = isl_dim_total(qp->dim);
2142 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
2146 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
2147 for (i = 0; i < qp->div->n_row; ++i) {
2148 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
2149 1 + dim + i, &ext->el[1+dim+i]);
2150 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
2151 qp->div->row[i][0]);
2155 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
2159 dim = isl_dim_copy(qp->dim);
2160 isl_qpolynomial_free(qp);
2161 isl_point_free(pnt);
2163 return isl_qpolynomial_alloc(dim, 0, up);
2165 isl_qpolynomial_free(qp);
2166 isl_point_free(pnt);
2170 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
2171 __isl_keep struct isl_upoly_cst *cst2)
2176 isl_int_mul(t, cst1->n, cst2->d);
2177 isl_int_submul(t, cst2->n, cst1->d);
2178 cmp = isl_int_sgn(t);
2183 int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1,
2184 __isl_keep isl_qpolynomial *qp2)
2186 struct isl_upoly_cst *cst1, *cst2;
2190 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), return -1);
2191 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), return -1);
2192 if (isl_qpolynomial_is_nan(qp1))
2194 if (isl_qpolynomial_is_nan(qp2))
2196 cst1 = isl_upoly_as_cst(qp1->upoly);
2197 cst2 = isl_upoly_as_cst(qp2->upoly);
2199 return isl_upoly_cmp(cst1, cst2) <= 0;
2202 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
2203 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2205 struct isl_upoly_cst *cst1, *cst2;
2210 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2211 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2212 cst1 = isl_upoly_as_cst(qp1->upoly);
2213 cst2 = isl_upoly_as_cst(qp2->upoly);
2214 cmp = isl_upoly_cmp(cst1, cst2);
2217 isl_qpolynomial_free(qp2);
2219 isl_qpolynomial_free(qp1);
2224 isl_qpolynomial_free(qp1);
2225 isl_qpolynomial_free(qp2);
2229 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
2230 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2232 struct isl_upoly_cst *cst1, *cst2;
2237 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2238 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2239 cst1 = isl_upoly_as_cst(qp1->upoly);
2240 cst2 = isl_upoly_as_cst(qp2->upoly);
2241 cmp = isl_upoly_cmp(cst1, cst2);
2244 isl_qpolynomial_free(qp2);
2246 isl_qpolynomial_free(qp1);
2251 isl_qpolynomial_free(qp1);
2252 isl_qpolynomial_free(qp2);
2256 __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
2257 __isl_take isl_qpolynomial *qp, enum isl_dim_type type,
2258 unsigned first, unsigned n)
2267 qp = isl_qpolynomial_cow(qp);
2271 isl_assert(qp->div->ctx, first <= isl_dim_size(qp->dim, type),
2274 g_pos = pos(qp->dim, type) + first;
2276 qp->div = isl_mat_insert_cols(qp->div, 2 + g_pos, n);
2280 total = qp->div->n_col - 2;
2281 if (total > g_pos) {
2283 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2286 for (i = 0; i < total - g_pos; ++i)
2288 qp->upoly = expand(qp->upoly, exp, g_pos);
2294 qp->dim = isl_dim_insert(qp->dim, type, first, n);
2300 isl_qpolynomial_free(qp);
2304 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
2305 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2309 pos = isl_qpolynomial_dim(qp, type);
2311 return isl_qpolynomial_insert_dims(qp, type, pos, n);
2314 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2315 __isl_take isl_pw_qpolynomial *pwqp,
2316 enum isl_dim_type type, unsigned n)
2320 pos = isl_pw_qpolynomial_dim(pwqp, type);
2322 return isl_pw_qpolynomial_insert_dims(pwqp, type, pos, n);
2325 static int *reordering_move(isl_ctx *ctx,
2326 unsigned len, unsigned dst, unsigned src, unsigned n)
2331 reordering = isl_alloc_array(ctx, int, len);
2336 for (i = 0; i < dst; ++i)
2338 for (i = 0; i < n; ++i)
2339 reordering[src + i] = dst + i;
2340 for (i = 0; i < src - dst; ++i)
2341 reordering[dst + i] = dst + n + i;
2342 for (i = 0; i < len - src - n; ++i)
2343 reordering[src + n + i] = src + n + i;
2345 for (i = 0; i < src; ++i)
2347 for (i = 0; i < n; ++i)
2348 reordering[src + i] = dst + i;
2349 for (i = 0; i < dst - src; ++i)
2350 reordering[src + n + i] = src + i;
2351 for (i = 0; i < len - dst - n; ++i)
2352 reordering[dst + n + i] = dst + n + i;
2358 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
2359 __isl_take isl_qpolynomial *qp,
2360 enum isl_dim_type dst_type, unsigned dst_pos,
2361 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2367 qp = isl_qpolynomial_cow(qp);
2371 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2374 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2375 g_src_pos = pos(qp->dim, src_type) + src_pos;
2376 if (dst_type > src_type)
2379 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2386 reordering = reordering_move(qp->dim->ctx,
2387 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2391 qp->upoly = reorder(qp->upoly, reordering);
2396 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2402 isl_qpolynomial_free(qp);
2406 __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_dim *dim,
2407 isl_int *f, isl_int denom)
2409 struct isl_upoly *up;
2414 up = isl_upoly_from_affine(dim->ctx, f, denom, 1 + isl_dim_total(dim));
2416 return isl_qpolynomial_alloc(dim, 0, up);
2419 __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
2420 __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
2424 struct isl_upoly *up;
2425 isl_qpolynomial *qp;
2431 isl_int_init(denom);
2433 isl_constraint_get_coefficient(c, type, pos, &denom);
2434 isl_constraint_set_coefficient(c, type, pos, c->ctx->zero);
2435 sgn = isl_int_sgn(denom);
2436 isl_int_abs(denom, denom);
2437 up = isl_upoly_from_affine(c->ctx, c->line[0], denom,
2438 1 + isl_constraint_dim(c, isl_dim_all));
2440 isl_int_neg(denom, denom);
2441 isl_constraint_set_coefficient(c, type, pos, denom);
2443 dim = isl_dim_copy(c->bmap->dim);
2445 isl_int_clear(denom);
2446 isl_constraint_free(c);
2448 qp = isl_qpolynomial_alloc(dim, 0, up);
2450 qp = isl_qpolynomial_neg(qp);
2454 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
2455 * in "qp" by subs[i].
2457 __isl_give isl_qpolynomial *isl_qpolynomial_substitute(
2458 __isl_take isl_qpolynomial *qp,
2459 enum isl_dim_type type, unsigned first, unsigned n,
2460 __isl_keep isl_qpolynomial **subs)
2463 struct isl_upoly **ups;
2468 qp = isl_qpolynomial_cow(qp);
2471 for (i = 0; i < n; ++i)
2475 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2478 for (i = 0; i < n; ++i)
2479 isl_assert(qp->dim->ctx, isl_dim_equal(qp->dim, subs[i]->dim),
2482 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
2483 for (i = 0; i < n; ++i)
2484 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
2486 first += pos(qp->dim, type);
2488 ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n);
2491 for (i = 0; i < n; ++i)
2492 ups[i] = subs[i]->upoly;
2494 qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups);
2503 isl_qpolynomial_free(qp);
2507 __isl_give isl_basic_set *add_div_constraints(__isl_take isl_basic_set *bset,
2508 __isl_take isl_mat *div)
2516 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2519 total = isl_basic_set_total_dim(bset);
2520 for (i = 0; i < div->n_row; ++i)
2521 if (isl_basic_set_add_div_constraints_var(bset,
2522 total - div->n_row + i, div->row[i]) < 0)
2529 isl_basic_set_free(bset);
2533 /* Extend "bset" with extra set dimensions for each integer division
2534 * in "qp" and then call "fn" with the extended bset and the polynomial
2535 * that results from replacing each of the integer divisions by the
2536 * corresponding extra set dimension.
2538 int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
2539 __isl_keep isl_basic_set *bset,
2540 int (*fn)(__isl_take isl_basic_set *bset,
2541 __isl_take isl_qpolynomial *poly, void *user), void *user)
2545 isl_qpolynomial *poly;
2549 if (qp->div->n_row == 0)
2550 return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
2553 div = isl_mat_copy(qp->div);
2554 dim = isl_dim_copy(qp->dim);
2555 dim = isl_dim_add(dim, isl_dim_set, qp->div->n_row);
2556 poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly));
2557 bset = isl_basic_set_copy(bset);
2558 bset = isl_basic_set_add(bset, isl_dim_set, qp->div->n_row);
2559 bset = add_div_constraints(bset, div);
2561 return fn(bset, poly, user);
2566 /* Return total degree in variables first (inclusive) up to last (exclusive).
2568 int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last)
2572 struct isl_upoly_rec *rec;
2576 if (isl_upoly_is_zero(up))
2578 if (isl_upoly_is_cst(up) || up->var < first)
2581 rec = isl_upoly_as_rec(up);
2585 for (i = 0; i < rec->n; ++i) {
2588 if (isl_upoly_is_zero(rec->p[i]))
2590 d = isl_upoly_degree(rec->p[i], first, last);
2600 /* Return total degree in set variables.
2602 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
2610 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2611 nvar = isl_dim_size(poly->dim, isl_dim_set);
2612 return isl_upoly_degree(poly->upoly, ovar, ovar + nvar);
2615 __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up,
2616 unsigned pos, int deg)
2619 struct isl_upoly_rec *rec;
2624 if (isl_upoly_is_cst(up) || up->var < pos) {
2626 return isl_upoly_copy(up);
2628 return isl_upoly_zero(up->ctx);
2631 rec = isl_upoly_as_rec(up);
2635 if (up->var == pos) {
2637 return isl_upoly_copy(rec->p[deg]);
2639 return isl_upoly_zero(up->ctx);
2642 up = isl_upoly_copy(up);
2643 up = isl_upoly_cow(up);
2644 rec = isl_upoly_as_rec(up);
2648 for (i = 0; i < rec->n; ++i) {
2649 struct isl_upoly *t;
2650 t = isl_upoly_coeff(rec->p[i], pos, deg);
2653 isl_upoly_free(rec->p[i]);
2663 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
2665 __isl_give isl_qpolynomial *isl_qpolynomial_coeff(
2666 __isl_keep isl_qpolynomial *qp,
2667 enum isl_dim_type type, unsigned t_pos, int deg)
2670 struct isl_upoly *up;
2676 isl_assert(qp->div->ctx, t_pos < isl_dim_size(qp->dim, type),
2679 g_pos = pos(qp->dim, type) + t_pos;
2680 up = isl_upoly_coeff(qp->upoly, g_pos, deg);
2682 c = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row, up);
2685 isl_mat_free(c->div);
2686 c->div = isl_mat_copy(qp->div);
2691 isl_qpolynomial_free(c);
2695 /* Homogenize the polynomial in the variables first (inclusive) up to
2696 * last (exclusive) by inserting powers of variable first.
2697 * Variable first is assumed not to appear in the input.
2699 __isl_give struct isl_upoly *isl_upoly_homogenize(
2700 __isl_take struct isl_upoly *up, int deg, int target,
2701 int first, int last)
2704 struct isl_upoly_rec *rec;
2708 if (isl_upoly_is_zero(up))
2712 if (isl_upoly_is_cst(up) || up->var < first) {
2713 struct isl_upoly *hom;
2715 hom = isl_upoly_pow(up->ctx, first, target - deg);
2718 rec = isl_upoly_as_rec(hom);
2719 rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up);
2724 up = isl_upoly_cow(up);
2725 rec = isl_upoly_as_rec(up);
2729 for (i = 0; i < rec->n; ++i) {
2730 if (isl_upoly_is_zero(rec->p[i]))
2732 rec->p[i] = isl_upoly_homogenize(rec->p[i],
2733 up->var < last ? deg + i : i, target,
2745 /* Homogenize the polynomial in the set variables by introducing
2746 * powers of an extra set variable at position 0.
2748 __isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
2749 __isl_take isl_qpolynomial *poly)
2753 int deg = isl_qpolynomial_degree(poly);
2758 poly = isl_qpolynomial_insert_dims(poly, isl_dim_set, 0, 1);
2759 poly = isl_qpolynomial_cow(poly);
2763 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2764 nvar = isl_dim_size(poly->dim, isl_dim_set);
2765 poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg,
2772 isl_qpolynomial_free(poly);
2776 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2777 __isl_take isl_mat *div)
2785 n = isl_dim_total(dim) + div->n_row;
2787 term = isl_calloc(dim->ctx, struct isl_term,
2788 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2795 isl_int_init(term->n);
2796 isl_int_init(term->d);
2805 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
2814 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
2823 total = isl_dim_total(term->dim) + term->div->n_row;
2825 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
2829 isl_int_set(dup->n, term->n);
2830 isl_int_set(dup->d, term->d);
2832 for (i = 0; i < total; ++i)
2833 dup->pow[i] = term->pow[i];
2838 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
2846 return isl_term_dup(term);
2849 void isl_term_free(__isl_take isl_term *term)
2854 if (--term->ref > 0)
2857 isl_dim_free(term->dim);
2858 isl_mat_free(term->div);
2859 isl_int_clear(term->n);
2860 isl_int_clear(term->d);
2864 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
2872 case isl_dim_out: return isl_dim_size(term->dim, type);
2873 case isl_dim_div: return term->div->n_row;
2874 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
2879 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
2881 return term ? term->dim->ctx : NULL;
2884 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
2888 isl_int_set(*n, term->n);
2891 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
2895 isl_int_set(*d, term->d);
2898 int isl_term_get_exp(__isl_keep isl_term *term,
2899 enum isl_dim_type type, unsigned pos)
2904 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
2906 if (type >= isl_dim_set)
2907 pos += isl_dim_size(term->dim, isl_dim_param);
2908 if (type >= isl_dim_div)
2909 pos += isl_dim_size(term->dim, isl_dim_set);
2911 return term->pow[pos];
2914 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
2916 isl_basic_map *bmap;
2923 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
2926 total = term->div->n_col - term->div->n_row - 2;
2927 /* No nested divs for now */
2928 isl_assert(term->dim->ctx,
2929 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
2930 term->div->n_row) == -1,
2933 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
2934 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
2937 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
2939 return isl_basic_map_div(bmap, k);
2941 isl_basic_map_free(bmap);
2945 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
2946 int (*fn)(__isl_take isl_term *term, void *user),
2947 __isl_take isl_term *term, void *user)
2950 struct isl_upoly_rec *rec;
2955 if (isl_upoly_is_zero(up))
2958 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
2959 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
2960 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
2962 if (isl_upoly_is_cst(up)) {
2963 struct isl_upoly_cst *cst;
2964 cst = isl_upoly_as_cst(up);
2967 term = isl_term_cow(term);
2970 isl_int_set(term->n, cst->n);
2971 isl_int_set(term->d, cst->d);
2972 if (fn(isl_term_copy(term), user) < 0)
2977 rec = isl_upoly_as_rec(up);
2981 for (i = 0; i < rec->n; ++i) {
2982 term = isl_term_cow(term);
2985 term->pow[up->var] = i;
2986 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
2990 term->pow[up->var] = 0;
2994 isl_term_free(term);
2998 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
2999 int (*fn)(__isl_take isl_term *term, void *user), void *user)
3006 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
3010 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
3012 isl_term_free(term);
3014 return term ? 0 : -1;
3017 __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
3019 struct isl_upoly *up;
3020 isl_qpolynomial *qp;
3026 n = isl_dim_total(term->dim) + term->div->n_row;
3028 up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d);
3029 for (i = 0; i < n; ++i) {
3032 up = isl_upoly_mul(up,
3033 isl_upoly_pow(term->dim->ctx, i, term->pow[i]));
3036 qp = isl_qpolynomial_alloc(isl_dim_copy(term->dim), term->div->n_row, up);
3039 isl_mat_free(qp->div);
3040 qp->div = isl_mat_copy(term->div);
3044 isl_term_free(term);
3047 isl_qpolynomial_free(qp);
3048 isl_term_free(term);
3052 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
3053 __isl_take isl_dim *dim)
3062 if (isl_dim_equal(qp->dim, dim)) {
3067 qp = isl_qpolynomial_cow(qp);
3071 extra = isl_dim_size(dim, isl_dim_set) -
3072 isl_dim_size(qp->dim, isl_dim_set);
3073 total = isl_dim_total(qp->dim);
3074 if (qp->div->n_row) {
3077 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
3080 for (i = 0; i < qp->div->n_row; ++i)
3082 qp->upoly = expand(qp->upoly, exp, total);
3087 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
3090 for (i = 0; i < qp->div->n_row; ++i)
3091 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
3093 isl_dim_free(qp->dim);
3099 isl_qpolynomial_free(qp);
3103 /* For each parameter or variable that does not appear in qp,
3104 * first eliminate the variable from all constraints and then set it to zero.
3106 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
3107 __isl_keep isl_qpolynomial *qp)
3118 d = isl_dim_total(set->dim);
3119 active = isl_calloc_array(set->ctx, int, d);
3120 if (set_active(qp, active) < 0)
3123 for (i = 0; i < d; ++i)
3132 nparam = isl_dim_size(set->dim, isl_dim_param);
3133 nvar = isl_dim_size(set->dim, isl_dim_set);
3134 for (i = 0; i < nparam; ++i) {
3137 set = isl_set_eliminate(set, isl_dim_param, i, 1);
3138 set = isl_set_fix_si(set, isl_dim_param, i, 0);
3140 for (i = 0; i < nvar; ++i) {
3141 if (active[nparam + i])
3143 set = isl_set_eliminate(set, isl_dim_set, i, 1);
3144 set = isl_set_fix_si(set, isl_dim_set, i, 0);
3156 struct isl_opt_data {
3157 isl_qpolynomial *qp;
3159 isl_qpolynomial *opt;
3163 static int opt_fn(__isl_take isl_point *pnt, void *user)
3165 struct isl_opt_data *data = (struct isl_opt_data *)user;
3166 isl_qpolynomial *val;
3168 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
3172 } else if (data->max) {
3173 data->opt = isl_qpolynomial_max_cst(data->opt, val);
3175 data->opt = isl_qpolynomial_min_cst(data->opt, val);
3181 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
3182 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
3184 struct isl_opt_data data = { NULL, 1, NULL, max };
3189 if (isl_upoly_is_cst(qp->upoly)) {
3194 set = fix_inactive(set, qp);
3197 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
3201 data.opt = isl_qpolynomial_zero(isl_qpolynomial_get_dim(qp));
3204 isl_qpolynomial_free(qp);
3208 isl_qpolynomial_free(qp);
3209 isl_qpolynomial_free(data.opt);
3213 __isl_give isl_qpolynomial *isl_qpolynomial_morph(__isl_take isl_qpolynomial *qp,
3214 __isl_take isl_morph *morph)
3218 struct isl_upoly *up;
3220 struct isl_upoly **subs;
3223 qp = isl_qpolynomial_cow(qp);
3228 isl_assert(ctx, isl_dim_equal(qp->dim, morph->dom->dim), goto error);
3230 subs = isl_calloc_array(ctx, struct isl_upoly *, morph->inv->n_row - 1);
3234 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3235 subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i],
3236 morph->inv->row[0][0], morph->inv->n_col);
3238 qp->upoly = isl_upoly_subs(qp->upoly, 0, morph->inv->n_row - 1, subs);
3240 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3241 isl_upoly_free(subs[i]);
3244 mat = isl_mat_diagonal(isl_mat_identity(ctx, 1), isl_mat_copy(morph->inv));
3245 mat = isl_mat_diagonal(mat, isl_mat_identity(ctx, qp->div->n_row));
3246 qp->div = isl_mat_product(qp->div, mat);
3247 isl_dim_free(qp->dim);
3248 qp->dim = isl_dim_copy(morph->ran->dim);
3250 if (!qp->upoly || !qp->div || !qp->dim)
3253 isl_morph_free(morph);
3257 isl_qpolynomial_free(qp);
3258 isl_morph_free(morph);
3262 static int neg_entry(void **entry, void *user)
3264 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
3266 *pwqp = isl_pw_qpolynomial_neg(*pwqp);
3268 return *pwqp ? 0 : -1;
3271 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_neg(
3272 __isl_take isl_union_pw_qpolynomial *upwqp)
3274 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
3278 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
3279 &neg_entry, NULL) < 0)
3284 isl_union_pw_qpolynomial_free(upwqp);
3288 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_sub(
3289 __isl_take isl_union_pw_qpolynomial *upwqp1,
3290 __isl_take isl_union_pw_qpolynomial *upwqp2)
3292 return isl_union_pw_qpolynomial_add(upwqp1,
3293 isl_union_pw_qpolynomial_neg(upwqp2));
3296 static int mul_entry(void **entry, void *user)
3298 struct isl_union_pw_qpolynomial_match_bin_data *data = user;
3300 struct isl_hash_table_entry *entry2;
3301 isl_pw_qpolynomial *pwpq = *entry;
3304 hash = isl_dim_get_hash(pwpq->dim);
3305 entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table,
3306 hash, &has_dim, pwpq->dim, 0);
3310 pwpq = isl_pw_qpolynomial_copy(pwpq);
3311 pwpq = isl_pw_qpolynomial_mul(pwpq,
3312 isl_pw_qpolynomial_copy(entry2->data));
3314 empty = isl_pw_qpolynomial_is_zero(pwpq);
3316 isl_pw_qpolynomial_free(pwpq);
3320 isl_pw_qpolynomial_free(pwpq);
3324 data->res = isl_union_pw_qpolynomial_add_pw_qpolynomial(data->res, pwpq);
3329 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
3330 __isl_take isl_union_pw_qpolynomial *upwqp1,
3331 __isl_take isl_union_pw_qpolynomial *upwqp2)
3333 return match_bin_op(upwqp1, upwqp2, &mul_entry);
3336 /* Reorder the columns of the given div definitions according to the
3339 static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div,
3340 __isl_take isl_reordering *r)
3349 extra = isl_dim_total(r->dim) + div->n_row - r->len;
3350 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
3354 for (i = 0; i < div->n_row; ++i) {
3355 isl_seq_cpy(mat->row[i], div->row[i], 2);
3356 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2);
3357 for (j = 0; j < r->len; ++j)
3358 isl_int_set(mat->row[i][2 + r->pos[j]],
3359 div->row[i][2 + j]);
3362 isl_reordering_free(r);
3366 isl_reordering_free(r);
3371 /* Reorder the dimension of "qp" according to the given reordering.
3373 __isl_give isl_qpolynomial *isl_qpolynomial_realign(
3374 __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r)
3376 qp = isl_qpolynomial_cow(qp);
3380 r = isl_reordering_extend(r, qp->div->n_row);
3384 qp->div = reorder_divs(qp->div, isl_reordering_copy(r));
3388 qp->upoly = reorder(qp->upoly, r->pos);
3392 qp = isl_qpolynomial_reset_dim(qp, isl_dim_copy(r->dim));
3394 isl_reordering_free(r);
3397 isl_qpolynomial_free(qp);
3398 isl_reordering_free(r);