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)
328 isl_dim_free(qp->dim);
333 isl_qpolynomial_free(qp);
338 isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp)
340 return qp ? qp->dim->ctx : NULL;
343 __isl_give isl_dim *isl_qpolynomial_get_dim(__isl_keep isl_qpolynomial *qp)
345 return qp ? isl_dim_copy(qp->dim) : NULL;
348 unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp,
349 enum isl_dim_type type)
351 return qp ? isl_dim_size(qp->dim, type) : 0;
354 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
356 return qp ? isl_upoly_is_zero(qp->upoly) : -1;
359 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
361 return qp ? isl_upoly_is_one(qp->upoly) : -1;
364 int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
366 return qp ? isl_upoly_is_nan(qp->upoly) : -1;
369 int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
371 return qp ? isl_upoly_is_infty(qp->upoly) : -1;
374 int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
376 return qp ? isl_upoly_is_neginfty(qp->upoly) : -1;
379 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
381 return qp ? isl_upoly_sgn(qp->upoly) : 0;
384 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
386 isl_int_clear(cst->n);
387 isl_int_clear(cst->d);
390 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
394 for (i = 0; i < rec->n; ++i)
395 isl_upoly_free(rec->p[i]);
398 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
407 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
409 struct isl_upoly_cst *cst;
410 struct isl_upoly_cst *dup;
412 cst = isl_upoly_as_cst(up);
416 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
419 isl_int_set(dup->n, cst->n);
420 isl_int_set(dup->d, cst->d);
425 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
428 struct isl_upoly_rec *rec;
429 struct isl_upoly_rec *dup;
431 rec = isl_upoly_as_rec(up);
435 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
439 for (i = 0; i < rec->n; ++i) {
440 dup->p[i] = isl_upoly_copy(rec->p[i]);
448 isl_upoly_free(&dup->up);
452 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
454 struct isl_upoly *dup;
459 if (isl_upoly_is_cst(up))
460 return isl_upoly_dup_cst(up);
462 return isl_upoly_dup_rec(up);
465 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
473 return isl_upoly_dup(up);
476 void isl_upoly_free(__isl_take struct isl_upoly *up)
485 upoly_free_cst((struct isl_upoly_cst *)up);
487 upoly_free_rec((struct isl_upoly_rec *)up);
489 isl_ctx_deref(up->ctx);
493 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
498 isl_int_gcd(gcd, cst->n, cst->d);
499 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
500 isl_int_divexact(cst->n, cst->n, gcd);
501 isl_int_divexact(cst->d, cst->d, gcd);
506 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
507 __isl_take struct isl_upoly *up2)
509 struct isl_upoly_cst *cst1;
510 struct isl_upoly_cst *cst2;
512 up1 = isl_upoly_cow(up1);
516 cst1 = isl_upoly_as_cst(up1);
517 cst2 = isl_upoly_as_cst(up2);
519 if (isl_int_eq(cst1->d, cst2->d))
520 isl_int_add(cst1->n, cst1->n, cst2->n);
522 isl_int_mul(cst1->n, cst1->n, cst2->d);
523 isl_int_addmul(cst1->n, cst2->n, cst1->d);
524 isl_int_mul(cst1->d, cst1->d, cst2->d);
527 isl_upoly_cst_reduce(cst1);
537 static __isl_give struct isl_upoly *replace_by_zero(
538 __isl_take struct isl_upoly *up)
546 return isl_upoly_zero(ctx);
549 static __isl_give struct isl_upoly *replace_by_constant_term(
550 __isl_take struct isl_upoly *up)
552 struct isl_upoly_rec *rec;
553 struct isl_upoly *cst;
558 rec = isl_upoly_as_rec(up);
561 cst = isl_upoly_copy(rec->p[0]);
569 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
570 __isl_take struct isl_upoly *up2)
573 struct isl_upoly_rec *rec1, *rec2;
578 if (isl_upoly_is_nan(up1)) {
583 if (isl_upoly_is_nan(up2)) {
588 if (isl_upoly_is_zero(up1)) {
593 if (isl_upoly_is_zero(up2)) {
598 if (up1->var < up2->var)
599 return isl_upoly_sum(up2, up1);
601 if (up2->var < up1->var) {
602 struct isl_upoly_rec *rec;
603 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
607 up1 = isl_upoly_cow(up1);
608 rec = isl_upoly_as_rec(up1);
611 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
613 up1 = replace_by_constant_term(up1);
617 if (isl_upoly_is_cst(up1))
618 return isl_upoly_sum_cst(up1, up2);
620 rec1 = isl_upoly_as_rec(up1);
621 rec2 = isl_upoly_as_rec(up2);
625 if (rec1->n < rec2->n)
626 return isl_upoly_sum(up2, up1);
628 up1 = isl_upoly_cow(up1);
629 rec1 = isl_upoly_as_rec(up1);
633 for (i = rec2->n - 1; i >= 0; --i) {
634 rec1->p[i] = isl_upoly_sum(rec1->p[i],
635 isl_upoly_copy(rec2->p[i]));
638 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
639 isl_upoly_free(rec1->p[i]);
645 up1 = replace_by_zero(up1);
646 else if (rec1->n == 1)
647 up1 = replace_by_constant_term(up1);
658 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
660 struct isl_upoly_cst *cst;
662 if (isl_upoly_is_zero(up))
665 up = isl_upoly_cow(up);
669 cst = isl_upoly_as_cst(up);
671 isl_int_neg(cst->n, cst->n);
676 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
679 struct isl_upoly_rec *rec;
684 if (isl_upoly_is_cst(up))
685 return isl_upoly_neg_cst(up);
687 up = isl_upoly_cow(up);
688 rec = isl_upoly_as_rec(up);
692 for (i = 0; i < rec->n; ++i) {
693 rec->p[i] = isl_upoly_neg(rec->p[i]);
704 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
705 __isl_take struct isl_upoly *up2)
707 struct isl_upoly_cst *cst1;
708 struct isl_upoly_cst *cst2;
710 up1 = isl_upoly_cow(up1);
714 cst1 = isl_upoly_as_cst(up1);
715 cst2 = isl_upoly_as_cst(up2);
717 isl_int_mul(cst1->n, cst1->n, cst2->n);
718 isl_int_mul(cst1->d, cst1->d, cst2->d);
720 isl_upoly_cst_reduce(cst1);
730 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
731 __isl_take struct isl_upoly *up2)
733 struct isl_upoly_rec *rec1;
734 struct isl_upoly_rec *rec2;
735 struct isl_upoly_rec *res;
739 rec1 = isl_upoly_as_rec(up1);
740 rec2 = isl_upoly_as_rec(up2);
743 size = rec1->n + rec2->n - 1;
744 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
748 for (i = 0; i < rec1->n; ++i) {
749 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
750 isl_upoly_copy(rec1->p[i]));
755 for (; i < size; ++i) {
756 res->p[i] = isl_upoly_zero(up1->ctx);
761 for (i = 0; i < rec1->n; ++i) {
762 for (j = 1; j < rec2->n; ++j) {
763 struct isl_upoly *up;
764 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
765 isl_upoly_copy(rec1->p[i]));
766 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
779 isl_upoly_free(&res->up);
783 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
784 __isl_take struct isl_upoly *up2)
789 if (isl_upoly_is_nan(up1)) {
794 if (isl_upoly_is_nan(up2)) {
799 if (isl_upoly_is_zero(up1)) {
804 if (isl_upoly_is_zero(up2)) {
809 if (isl_upoly_is_one(up1)) {
814 if (isl_upoly_is_one(up2)) {
819 if (up1->var < up2->var)
820 return isl_upoly_mul(up2, up1);
822 if (up2->var < up1->var) {
824 struct isl_upoly_rec *rec;
825 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
826 isl_ctx *ctx = up1->ctx;
829 return isl_upoly_nan(ctx);
831 up1 = isl_upoly_cow(up1);
832 rec = isl_upoly_as_rec(up1);
836 for (i = 0; i < rec->n; ++i) {
837 rec->p[i] = isl_upoly_mul(rec->p[i],
838 isl_upoly_copy(up2));
846 if (isl_upoly_is_cst(up1))
847 return isl_upoly_mul_cst(up1, up2);
849 return isl_upoly_mul_rec(up1, up2);
856 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
857 unsigned n_div, __isl_take struct isl_upoly *up)
859 struct isl_qpolynomial *qp = NULL;
865 total = isl_dim_total(dim);
867 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
872 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
883 isl_qpolynomial_free(qp);
887 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
896 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
898 struct isl_qpolynomial *dup;
903 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row,
904 isl_upoly_copy(qp->upoly));
907 isl_mat_free(dup->div);
908 dup->div = isl_mat_copy(qp->div);
914 isl_qpolynomial_free(dup);
918 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
926 return isl_qpolynomial_dup(qp);
929 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
937 isl_dim_free(qp->dim);
938 isl_mat_free(qp->div);
939 isl_upoly_free(qp->upoly);
944 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
949 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
950 div1->n_col >= div2->n_col, return -1);
952 if (div1->n_row == div2->n_row)
953 return isl_mat_is_equal(div1, div2);
957 div1->n_row = div2->n_row;
958 div1->n_col = div2->n_col;
960 equal = isl_mat_is_equal(div1, div2);
968 static void expand_row(__isl_keep isl_mat *dst, int d,
969 __isl_keep isl_mat *src, int s, int *exp)
972 unsigned c = src->n_col - src->n_row;
974 isl_seq_cpy(dst->row[d], src->row[s], c);
975 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
977 for (i = 0; i < s; ++i)
978 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
981 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
985 li = isl_seq_last_non_zero(div->row[i], div->n_col);
986 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
991 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
994 struct isl_div_sort_info {
999 static int div_sort_cmp(const void *p1, const void *p2)
1001 const struct isl_div_sort_info *i1, *i2;
1002 i1 = (const struct isl_div_sort_info *) p1;
1003 i2 = (const struct isl_div_sort_info *) p2;
1005 return cmp_row(i1->div, i1->row, i2->row);
1008 static __isl_give isl_mat *sort_divs(__isl_take isl_mat *div)
1011 struct isl_div_sort_info *array = NULL;
1016 if (div->n_row <= 1)
1019 array = isl_alloc_array(div->ctx, struct isl_div_sort_info, div->n_row);
1020 pos = isl_alloc_array(div->ctx, int, div->n_row);
1024 for (i = 0; i < div->n_row; ++i) {
1030 qsort(array, div->n_row, sizeof(struct isl_div_sort_info),
1033 for (i = 0; i < div->n_row; ++i) {
1035 if (pos[array[i].row] == i)
1037 div = isl_mat_cow(div);
1038 div = isl_mat_swap_rows(div, i, pos[array[i].row]);
1039 t = pos[array[i].row];
1040 pos[array[i].row] = pos[i];
1054 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
1055 __isl_keep isl_mat *div2, int *exp1, int *exp2)
1058 isl_mat *div = NULL;
1059 unsigned d = div1->n_col - div1->n_row;
1061 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
1062 d + div1->n_row + div2->n_row);
1066 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
1069 expand_row(div, k, div1, i, exp1);
1070 expand_row(div, k + 1, div2, j, exp2);
1072 cmp = cmp_row(div, k, k + 1);
1076 } else if (cmp < 0) {
1080 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1083 for (; i < div1->n_row; ++i, ++k) {
1084 expand_row(div, k, div1, i, exp1);
1087 for (; j < div2->n_row; ++j, ++k) {
1088 expand_row(div, k, div2, j, exp2);
1098 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1099 int *exp, int first)
1102 struct isl_upoly_rec *rec;
1104 if (isl_upoly_is_cst(up))
1107 if (up->var < first)
1110 if (exp[up->var - first] == up->var - first)
1113 up = isl_upoly_cow(up);
1117 up->var = exp[up->var - first] + first;
1119 rec = isl_upoly_as_rec(up);
1123 for (i = 0; i < rec->n; ++i) {
1124 rec->p[i] = expand(rec->p[i], exp, first);
1135 static __isl_give isl_qpolynomial *with_merged_divs(
1136 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1137 __isl_take isl_qpolynomial *qp2),
1138 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1142 isl_mat *div = NULL;
1144 qp1 = isl_qpolynomial_cow(qp1);
1145 qp2 = isl_qpolynomial_cow(qp2);
1150 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1151 qp1->div->n_col >= qp2->div->n_col, goto error);
1153 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1154 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1158 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1162 isl_mat_free(qp1->div);
1163 qp1->div = isl_mat_copy(div);
1164 isl_mat_free(qp2->div);
1165 qp2->div = isl_mat_copy(div);
1167 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1168 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1170 if (!qp1->upoly || !qp2->upoly)
1177 return fn(qp1, qp2);
1182 isl_qpolynomial_free(qp1);
1183 isl_qpolynomial_free(qp2);
1187 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1188 __isl_take isl_qpolynomial *qp2)
1190 qp1 = isl_qpolynomial_cow(qp1);
1195 if (qp1->div->n_row < qp2->div->n_row)
1196 return isl_qpolynomial_add(qp2, qp1);
1198 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1199 if (!compatible_divs(qp1->div, qp2->div))
1200 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1202 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1206 isl_qpolynomial_free(qp2);
1210 isl_qpolynomial_free(qp1);
1211 isl_qpolynomial_free(qp2);
1215 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1216 __isl_take isl_qpolynomial *qp2)
1218 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1221 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1223 qp = isl_qpolynomial_cow(qp);
1228 qp->upoly = isl_upoly_neg(qp->upoly);
1234 isl_qpolynomial_free(qp);
1238 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1239 __isl_take isl_qpolynomial *qp2)
1241 qp1 = isl_qpolynomial_cow(qp1);
1246 if (qp1->div->n_row < qp2->div->n_row)
1247 return isl_qpolynomial_mul(qp2, qp1);
1249 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1250 if (!compatible_divs(qp1->div, qp2->div))
1251 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1253 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1257 isl_qpolynomial_free(qp2);
1261 isl_qpolynomial_free(qp1);
1262 isl_qpolynomial_free(qp2);
1266 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1268 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1271 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1273 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1276 __isl_give isl_qpolynomial *isl_qpolynomial_neginfty(__isl_take isl_dim *dim)
1278 return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx));
1281 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1283 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1286 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1289 struct isl_qpolynomial *qp;
1290 struct isl_upoly_cst *cst;
1292 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1296 cst = isl_upoly_as_cst(qp->upoly);
1297 isl_int_set(cst->n, v);
1302 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1303 isl_int *n, isl_int *d)
1305 struct isl_upoly_cst *cst;
1310 if (!isl_upoly_is_cst(qp->upoly))
1313 cst = isl_upoly_as_cst(qp->upoly);
1318 isl_int_set(*n, cst->n);
1320 isl_int_set(*d, cst->d);
1325 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1328 struct isl_upoly_rec *rec;
1336 rec = isl_upoly_as_rec(up);
1343 isl_assert(up->ctx, rec->n > 1, return -1);
1345 is_cst = isl_upoly_is_cst(rec->p[1]);
1351 return isl_upoly_is_affine(rec->p[0]);
1354 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1359 if (qp->div->n_row > 0)
1362 return isl_upoly_is_affine(qp->upoly);
1365 static void update_coeff(__isl_keep isl_vec *aff,
1366 __isl_keep struct isl_upoly_cst *cst, int pos)
1371 if (isl_int_is_zero(cst->n))
1376 isl_int_gcd(gcd, cst->d, aff->el[0]);
1377 isl_int_divexact(f, cst->d, gcd);
1378 isl_int_divexact(gcd, aff->el[0], gcd);
1379 isl_seq_scale(aff->el, aff->el, f, aff->size);
1380 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1385 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1386 __isl_keep isl_vec *aff)
1388 struct isl_upoly_cst *cst;
1389 struct isl_upoly_rec *rec;
1395 struct isl_upoly_cst *cst;
1397 cst = isl_upoly_as_cst(up);
1400 update_coeff(aff, cst, 0);
1404 rec = isl_upoly_as_rec(up);
1407 isl_assert(up->ctx, rec->n == 2, return -1);
1409 cst = isl_upoly_as_cst(rec->p[1]);
1412 update_coeff(aff, cst, 1 + up->var);
1414 return isl_upoly_update_affine(rec->p[0], aff);
1417 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1418 __isl_keep isl_qpolynomial *qp)
1426 isl_assert(qp->div->ctx, qp->div->n_row == 0, return NULL);
1427 d = isl_dim_total(qp->dim);
1428 aff = isl_vec_alloc(qp->div->ctx, 2 + d);
1432 isl_seq_clr(aff->el + 1, 1 + d);
1433 isl_int_set_si(aff->el[0], 1);
1435 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1444 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1445 __isl_keep isl_qpolynomial *qp2)
1450 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1453 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1456 struct isl_upoly_rec *rec;
1458 if (isl_upoly_is_cst(up)) {
1459 struct isl_upoly_cst *cst;
1460 cst = isl_upoly_as_cst(up);
1463 isl_int_lcm(*d, *d, cst->d);
1467 rec = isl_upoly_as_rec(up);
1471 for (i = 0; i < rec->n; ++i)
1472 upoly_update_den(rec->p[i], d);
1475 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1477 isl_int_set_si(*d, 1);
1480 upoly_update_den(qp->upoly, d);
1483 __isl_give struct isl_upoly *isl_upoly_pow(isl_ctx *ctx, int pos, int power)
1486 struct isl_upoly *up;
1487 struct isl_upoly_rec *rec;
1488 struct isl_upoly_cst *cst;
1490 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
1493 for (i = 0; i < 1 + power; ++i) {
1494 rec->p[i] = isl_upoly_zero(ctx);
1499 cst = isl_upoly_as_cst(rec->p[power]);
1500 isl_int_set_si(cst->n, 1);
1504 isl_upoly_free(&rec->up);
1508 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1511 struct isl_ctx *ctx;
1518 return isl_qpolynomial_alloc(dim, 0, isl_upoly_pow(ctx, pos, power));
1521 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1522 enum isl_dim_type type, unsigned pos)
1527 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1528 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1530 if (type == isl_dim_set)
1531 pos += isl_dim_size(dim, isl_dim_param);
1533 return isl_qpolynomial_pow(dim, pos, 1);
1539 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1542 struct isl_qpolynomial *qp = NULL;
1543 struct isl_upoly_rec *rec;
1544 struct isl_upoly_cst *cst;
1550 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1552 pos = isl_dim_total(div->bmap->dim);
1553 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
1554 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1,
1559 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1560 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1562 for (i = 0; i < 1 + power; ++i) {
1563 rec->p[i] = isl_upoly_zero(div->ctx);
1568 cst = isl_upoly_as_cst(rec->p[power]);
1569 isl_int_set_si(cst->n, 1);
1575 isl_qpolynomial_free(qp);
1580 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1582 return isl_qpolynomial_div_pow(div, 1);
1585 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1586 const isl_int n, const isl_int d)
1588 struct isl_qpolynomial *qp;
1589 struct isl_upoly_cst *cst;
1591 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1595 cst = isl_upoly_as_cst(qp->upoly);
1596 isl_int_set(cst->n, n);
1597 isl_int_set(cst->d, d);
1602 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1604 struct isl_upoly_rec *rec;
1610 if (isl_upoly_is_cst(up))
1614 active[up->var] = 1;
1616 rec = isl_upoly_as_rec(up);
1617 for (i = 0; i < rec->n; ++i)
1618 if (up_set_active(rec->p[i], active, d) < 0)
1624 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1627 int d = isl_dim_total(qp->dim);
1632 for (i = 0; i < d; ++i)
1633 for (j = 0; j < qp->div->n_row; ++j) {
1634 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1640 return up_set_active(qp->upoly, active, d);
1643 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1644 enum isl_dim_type type, unsigned first, unsigned n)
1655 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1657 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1658 type == isl_dim_set, return -1);
1660 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1661 if (set_active(qp, active) < 0)
1664 if (type == isl_dim_set)
1665 first += isl_dim_size(qp->dim, isl_dim_param);
1666 for (i = 0; i < n; ++i)
1667 if (active[first + i]) {
1680 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1681 unsigned first, unsigned n)
1684 struct isl_upoly_rec *rec;
1688 if (n == 0 || up->var < 0 || up->var < first)
1690 if (up->var < first + n) {
1691 up = replace_by_constant_term(up);
1692 return isl_upoly_drop(up, first, n);
1694 up = isl_upoly_cow(up);
1698 rec = isl_upoly_as_rec(up);
1702 for (i = 0; i < rec->n; ++i) {
1703 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1714 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1715 __isl_take isl_qpolynomial *qp,
1716 enum isl_dim_type type, unsigned first, unsigned n)
1720 if (n == 0 && !isl_dim_get_tuple_name(qp->dim, type))
1723 qp = isl_qpolynomial_cow(qp);
1727 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1729 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1730 type == isl_dim_set, goto error);
1732 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1736 if (type == isl_dim_set)
1737 first += isl_dim_size(qp->dim, isl_dim_param);
1739 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1743 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1749 isl_qpolynomial_free(qp);
1754 #define PW isl_pw_qpolynomial
1756 #define EL isl_qpolynomial
1758 #define IS_ZERO is_zero
1762 #define ADD(d,e1,e2) isl_qpolynomial_add(e1,e2)
1764 #include <isl_pw_templ.c>
1767 #define UNION isl_union_pw_qpolynomial
1769 #define PART isl_pw_qpolynomial
1771 #define PARTS pw_qpolynomial
1773 #include <isl_union_templ.c>
1775 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
1783 if (!isl_set_fast_is_universe(pwqp->p[0].set))
1786 return isl_qpolynomial_is_one(pwqp->p[0].qp);
1789 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
1790 __isl_take isl_pw_qpolynomial *pwqp1,
1791 __isl_take isl_pw_qpolynomial *pwqp2)
1794 struct isl_pw_qpolynomial *res;
1797 if (!pwqp1 || !pwqp2)
1800 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
1803 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
1804 isl_pw_qpolynomial_free(pwqp2);
1808 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
1809 isl_pw_qpolynomial_free(pwqp1);
1813 if (isl_pw_qpolynomial_is_one(pwqp1)) {
1814 isl_pw_qpolynomial_free(pwqp1);
1818 if (isl_pw_qpolynomial_is_one(pwqp2)) {
1819 isl_pw_qpolynomial_free(pwqp2);
1823 n = pwqp1->n * pwqp2->n;
1824 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
1826 for (i = 0; i < pwqp1->n; ++i) {
1827 for (j = 0; j < pwqp2->n; ++j) {
1828 struct isl_set *common;
1829 struct isl_qpolynomial *prod;
1830 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
1831 isl_set_copy(pwqp2->p[j].set));
1832 if (isl_set_fast_is_empty(common)) {
1833 isl_set_free(common);
1837 prod = isl_qpolynomial_mul(
1838 isl_qpolynomial_copy(pwqp1->p[i].qp),
1839 isl_qpolynomial_copy(pwqp2->p[j].qp));
1841 res = isl_pw_qpolynomial_add_piece(res, common, prod);
1845 isl_pw_qpolynomial_free(pwqp1);
1846 isl_pw_qpolynomial_free(pwqp2);
1850 isl_pw_qpolynomial_free(pwqp1);
1851 isl_pw_qpolynomial_free(pwqp2);
1855 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
1856 __isl_take isl_pw_qpolynomial *pwqp)
1859 struct isl_pw_qpolynomial *res;
1865 if (isl_pw_qpolynomial_is_zero(pwqp))
1868 pwqp = isl_pw_qpolynomial_cow(pwqp);
1870 for (i = 0; i < pwqp->n; ++i) {
1871 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
1878 isl_pw_qpolynomial_free(pwqp);
1882 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
1883 __isl_take isl_pw_qpolynomial *pwqp1,
1884 __isl_take isl_pw_qpolynomial *pwqp2)
1886 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
1889 __isl_give struct isl_upoly *isl_upoly_eval(
1890 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
1893 struct isl_upoly_rec *rec;
1894 struct isl_upoly *res;
1895 struct isl_upoly *base;
1897 if (isl_upoly_is_cst(up)) {
1902 rec = isl_upoly_as_rec(up);
1906 isl_assert(up->ctx, rec->n >= 1, goto error);
1908 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
1910 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
1913 for (i = rec->n - 2; i >= 0; --i) {
1914 res = isl_upoly_mul(res, isl_upoly_copy(base));
1915 res = isl_upoly_sum(res,
1916 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
1917 isl_vec_copy(vec)));
1920 isl_upoly_free(base);
1930 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
1931 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
1934 struct isl_upoly *up;
1939 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
1941 if (qp->div->n_row == 0)
1942 ext = isl_vec_copy(pnt->vec);
1945 unsigned dim = isl_dim_total(qp->dim);
1946 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
1950 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
1951 for (i = 0; i < qp->div->n_row; ++i) {
1952 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
1953 1 + dim + i, &ext->el[1+dim+i]);
1954 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
1955 qp->div->row[i][0]);
1959 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
1963 dim = isl_dim_copy(qp->dim);
1964 isl_qpolynomial_free(qp);
1965 isl_point_free(pnt);
1967 return isl_qpolynomial_alloc(dim, 0, up);
1969 isl_qpolynomial_free(qp);
1970 isl_point_free(pnt);
1974 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
1975 __isl_keep struct isl_upoly_cst *cst2)
1980 isl_int_mul(t, cst1->n, cst2->d);
1981 isl_int_submul(t, cst2->n, cst1->d);
1982 cmp = isl_int_sgn(t);
1987 int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1,
1988 __isl_keep isl_qpolynomial *qp2)
1990 struct isl_upoly_cst *cst1, *cst2;
1994 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), return -1);
1995 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), return -1);
1996 if (isl_qpolynomial_is_nan(qp1))
1998 if (isl_qpolynomial_is_nan(qp2))
2000 cst1 = isl_upoly_as_cst(qp1->upoly);
2001 cst2 = isl_upoly_as_cst(qp2->upoly);
2003 return isl_upoly_cmp(cst1, cst2) <= 0;
2006 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
2007 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2009 struct isl_upoly_cst *cst1, *cst2;
2014 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2015 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2016 cst1 = isl_upoly_as_cst(qp1->upoly);
2017 cst2 = isl_upoly_as_cst(qp2->upoly);
2018 cmp = isl_upoly_cmp(cst1, cst2);
2021 isl_qpolynomial_free(qp2);
2023 isl_qpolynomial_free(qp1);
2028 isl_qpolynomial_free(qp1);
2029 isl_qpolynomial_free(qp2);
2033 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
2034 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2036 struct isl_upoly_cst *cst1, *cst2;
2041 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2042 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2043 cst1 = isl_upoly_as_cst(qp1->upoly);
2044 cst2 = isl_upoly_as_cst(qp2->upoly);
2045 cmp = isl_upoly_cmp(cst1, cst2);
2048 isl_qpolynomial_free(qp2);
2050 isl_qpolynomial_free(qp1);
2055 isl_qpolynomial_free(qp1);
2056 isl_qpolynomial_free(qp2);
2060 __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
2061 __isl_take isl_qpolynomial *qp, enum isl_dim_type type,
2062 unsigned first, unsigned n)
2071 qp = isl_qpolynomial_cow(qp);
2075 isl_assert(qp->div->ctx, first <= isl_dim_size(qp->dim, type),
2078 g_pos = pos(qp->dim, type) + first;
2080 qp->div = isl_mat_insert_cols(qp->div, 2 + g_pos, n);
2084 total = qp->div->n_col - 2;
2085 if (total > g_pos) {
2087 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2090 for (i = 0; i < total - g_pos; ++i)
2092 qp->upoly = expand(qp->upoly, exp, g_pos);
2098 qp->dim = isl_dim_insert(qp->dim, type, first, n);
2104 isl_qpolynomial_free(qp);
2108 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
2109 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2113 pos = isl_qpolynomial_dim(qp, type);
2115 return isl_qpolynomial_insert_dims(qp, type, pos, n);
2118 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2119 __isl_take isl_pw_qpolynomial *pwqp,
2120 enum isl_dim_type type, unsigned n)
2127 pwqp = isl_pw_qpolynomial_cow(pwqp);
2131 pwqp->dim = isl_dim_add(pwqp->dim, type, n);
2135 for (i = 0; i < pwqp->n; ++i) {
2136 pwqp->p[i].set = isl_set_add(pwqp->p[i].set, type, n);
2137 if (!pwqp->p[i].set)
2139 pwqp->p[i].qp = isl_qpolynomial_add_dims(pwqp->p[i].qp, type, n);
2146 isl_pw_qpolynomial_free(pwqp);
2150 static int *reordering_move(isl_ctx *ctx,
2151 unsigned len, unsigned dst, unsigned src, unsigned n)
2156 reordering = isl_alloc_array(ctx, int, len);
2161 for (i = 0; i < dst; ++i)
2163 for (i = 0; i < n; ++i)
2164 reordering[src + i] = dst + i;
2165 for (i = 0; i < src - dst; ++i)
2166 reordering[dst + i] = dst + n + i;
2167 for (i = 0; i < len - src - n; ++i)
2168 reordering[src + n + i] = src + n + i;
2170 for (i = 0; i < src; ++i)
2172 for (i = 0; i < n; ++i)
2173 reordering[src + i] = dst + i;
2174 for (i = 0; i < dst - src; ++i)
2175 reordering[src + n + i] = src + i;
2176 for (i = 0; i < len - dst - n; ++i)
2177 reordering[dst + n + i] = dst + n + i;
2183 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
2187 struct isl_upoly_rec *rec;
2188 struct isl_upoly *base;
2189 struct isl_upoly *res;
2191 if (isl_upoly_is_cst(up))
2194 rec = isl_upoly_as_rec(up);
2198 isl_assert(up->ctx, rec->n >= 1, goto error);
2200 base = isl_upoly_pow(up->ctx, r[up->var], 1);
2201 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
2203 for (i = rec->n - 2; i >= 0; --i) {
2204 res = isl_upoly_mul(res, isl_upoly_copy(base));
2205 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
2208 isl_upoly_free(base);
2217 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
2218 __isl_take isl_qpolynomial *qp,
2219 enum isl_dim_type dst_type, unsigned dst_pos,
2220 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2226 qp = isl_qpolynomial_cow(qp);
2230 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2233 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2234 g_src_pos = pos(qp->dim, src_type) + src_pos;
2235 if (dst_type > src_type)
2238 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2239 qp->div = sort_divs(qp->div);
2243 reordering = reordering_move(qp->dim->ctx,
2244 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2248 qp->upoly = reorder(qp->upoly, reordering);
2253 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2259 isl_qpolynomial_free(qp);
2263 __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f,
2264 isl_int denom, unsigned len)
2267 struct isl_upoly *up;
2269 isl_assert(ctx, len >= 1, return NULL);
2271 up = isl_upoly_rat_cst(ctx, f[0], denom);
2272 for (i = 0; i < len - 1; ++i) {
2273 struct isl_upoly *t;
2274 struct isl_upoly *c;
2276 if (isl_int_is_zero(f[1 + i]))
2279 c = isl_upoly_rat_cst(ctx, f[1 + i], denom);
2280 t = isl_upoly_pow(ctx, i, 1);
2281 t = isl_upoly_mul(c, t);
2282 up = isl_upoly_sum(up, t);
2288 __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_dim *dim,
2289 isl_int *f, isl_int denom)
2291 struct isl_upoly *up;
2296 up = isl_upoly_from_affine(dim->ctx, f, denom, 1 + isl_dim_total(dim));
2298 return isl_qpolynomial_alloc(dim, 0, up);
2301 __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
2302 __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
2306 struct isl_upoly *up;
2307 isl_qpolynomial *qp;
2313 isl_int_init(denom);
2315 isl_constraint_get_coefficient(c, type, pos, &denom);
2316 isl_constraint_set_coefficient(c, type, pos, c->ctx->zero);
2317 sgn = isl_int_sgn(denom);
2318 isl_int_abs(denom, denom);
2319 up = isl_upoly_from_affine(c->ctx, c->line[0], denom,
2320 1 + isl_constraint_dim(c, isl_dim_all));
2322 isl_int_neg(denom, denom);
2323 isl_constraint_set_coefficient(c, type, pos, denom);
2325 dim = isl_dim_copy(c->bmap->dim);
2327 isl_int_clear(denom);
2328 isl_constraint_free(c);
2330 qp = isl_qpolynomial_alloc(dim, 0, up);
2332 qp = isl_qpolynomial_neg(qp);
2336 __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up,
2337 unsigned first, unsigned n, __isl_keep struct isl_upoly **subs)
2340 struct isl_upoly_rec *rec;
2341 struct isl_upoly *base, *res;
2346 if (isl_upoly_is_cst(up))
2349 if (up->var < first)
2352 rec = isl_upoly_as_rec(up);
2356 isl_assert(up->ctx, rec->n >= 1, goto error);
2358 if (up->var >= first + n)
2359 base = isl_upoly_pow(up->ctx, up->var, 1);
2361 base = isl_upoly_copy(subs[up->var - first]);
2363 res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs);
2364 for (i = rec->n - 2; i >= 0; --i) {
2365 struct isl_upoly *t;
2366 t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs);
2367 res = isl_upoly_mul(res, isl_upoly_copy(base));
2368 res = isl_upoly_sum(res, t);
2371 isl_upoly_free(base);
2380 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
2381 * in "qp" by subs[i].
2383 __isl_give isl_qpolynomial *isl_qpolynomial_substitute(
2384 __isl_take isl_qpolynomial *qp,
2385 enum isl_dim_type type, unsigned first, unsigned n,
2386 __isl_keep isl_qpolynomial **subs)
2389 struct isl_upoly **ups;
2394 qp = isl_qpolynomial_cow(qp);
2397 for (i = 0; i < n; ++i)
2401 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2404 for (i = 0; i < n; ++i)
2405 isl_assert(qp->dim->ctx, isl_dim_equal(qp->dim, subs[i]->dim),
2408 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
2409 for (i = 0; i < n; ++i)
2410 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
2412 first += pos(qp->dim, type);
2414 ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n);
2417 for (i = 0; i < n; ++i)
2418 ups[i] = subs[i]->upoly;
2420 qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups);
2429 isl_qpolynomial_free(qp);
2433 __isl_give isl_basic_set *add_div_constraints(__isl_take isl_basic_set *bset,
2434 __isl_take isl_mat *div)
2442 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2445 total = isl_basic_set_total_dim(bset);
2446 for (i = 0; i < div->n_row; ++i)
2447 if (isl_basic_set_add_div_constraints_var(bset,
2448 total - div->n_row + i, div->row[i]) < 0)
2455 isl_basic_set_free(bset);
2459 /* Extend "bset" with extra set dimensions for each integer division
2460 * in "qp" and then call "fn" with the extended bset and the polynomial
2461 * that results from replacing each of the integer divisions by the
2462 * corresponding extra set dimension.
2464 int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
2465 __isl_keep isl_basic_set *bset,
2466 int (*fn)(__isl_take isl_basic_set *bset,
2467 __isl_take isl_qpolynomial *poly, void *user), void *user)
2471 isl_qpolynomial *poly;
2475 if (qp->div->n_row == 0)
2476 return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
2479 div = isl_mat_copy(qp->div);
2480 dim = isl_dim_copy(qp->dim);
2481 dim = isl_dim_add(dim, isl_dim_set, qp->div->n_row);
2482 poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly));
2483 bset = isl_basic_set_copy(bset);
2484 bset = isl_basic_set_add(bset, isl_dim_set, qp->div->n_row);
2485 bset = add_div_constraints(bset, div);
2487 return fn(bset, poly, user);
2492 /* Return total degree in variables first (inclusive) up to last (exclusive).
2494 int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last)
2498 struct isl_upoly_rec *rec;
2502 if (isl_upoly_is_zero(up))
2504 if (isl_upoly_is_cst(up) || up->var < first)
2507 rec = isl_upoly_as_rec(up);
2511 for (i = 0; i < rec->n; ++i) {
2514 if (isl_upoly_is_zero(rec->p[i]))
2516 d = isl_upoly_degree(rec->p[i], first, last);
2526 /* Return total degree in set variables.
2528 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
2536 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2537 nvar = isl_dim_size(poly->dim, isl_dim_set);
2538 return isl_upoly_degree(poly->upoly, ovar, ovar + nvar);
2541 __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up,
2542 unsigned pos, int deg)
2545 struct isl_upoly_rec *rec;
2550 if (isl_upoly_is_cst(up) || up->var < pos) {
2552 return isl_upoly_copy(up);
2554 return isl_upoly_zero(up->ctx);
2557 rec = isl_upoly_as_rec(up);
2561 if (up->var == pos) {
2563 return isl_upoly_copy(rec->p[deg]);
2565 return isl_upoly_zero(up->ctx);
2568 up = isl_upoly_copy(up);
2569 up = isl_upoly_cow(up);
2570 rec = isl_upoly_as_rec(up);
2574 for (i = 0; i < rec->n; ++i) {
2575 struct isl_upoly *t;
2576 t = isl_upoly_coeff(rec->p[i], pos, deg);
2579 isl_upoly_free(rec->p[i]);
2589 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
2591 __isl_give isl_qpolynomial *isl_qpolynomial_coeff(
2592 __isl_keep isl_qpolynomial *qp,
2593 enum isl_dim_type type, unsigned t_pos, int deg)
2596 struct isl_upoly *up;
2602 isl_assert(qp->div->ctx, t_pos < isl_dim_size(qp->dim, type),
2605 g_pos = pos(qp->dim, type) + t_pos;
2606 up = isl_upoly_coeff(qp->upoly, g_pos, deg);
2608 c = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row, up);
2611 isl_mat_free(c->div);
2612 c->div = isl_mat_copy(qp->div);
2617 isl_qpolynomial_free(c);
2621 /* Homogenize the polynomial in the variables first (inclusive) up to
2622 * last (exclusive) by inserting powers of variable first.
2623 * Variable first is assumed not to appear in the input.
2625 __isl_give struct isl_upoly *isl_upoly_homogenize(
2626 __isl_take struct isl_upoly *up, int deg, int target,
2627 int first, int last)
2630 struct isl_upoly_rec *rec;
2634 if (isl_upoly_is_zero(up))
2638 if (isl_upoly_is_cst(up) || up->var < first) {
2639 struct isl_upoly *hom;
2641 hom = isl_upoly_pow(up->ctx, first, target - deg);
2644 rec = isl_upoly_as_rec(hom);
2645 rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up);
2650 up = isl_upoly_cow(up);
2651 rec = isl_upoly_as_rec(up);
2655 for (i = 0; i < rec->n; ++i) {
2656 if (isl_upoly_is_zero(rec->p[i]))
2658 rec->p[i] = isl_upoly_homogenize(rec->p[i],
2659 up->var < last ? deg + i : i, target,
2671 /* Homogenize the polynomial in the set variables by introducing
2672 * powers of an extra set variable at position 0.
2674 __isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
2675 __isl_take isl_qpolynomial *poly)
2679 int deg = isl_qpolynomial_degree(poly);
2684 poly = isl_qpolynomial_insert_dims(poly, isl_dim_set, 0, 1);
2685 poly = isl_qpolynomial_cow(poly);
2689 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2690 nvar = isl_dim_size(poly->dim, isl_dim_set);
2691 poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg,
2698 isl_qpolynomial_free(poly);
2702 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2703 __isl_take isl_mat *div)
2711 n = isl_dim_total(dim) + div->n_row;
2713 term = isl_calloc(dim->ctx, struct isl_term,
2714 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2721 isl_int_init(term->n);
2722 isl_int_init(term->d);
2731 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
2740 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
2749 total = isl_dim_total(term->dim) + term->div->n_row;
2751 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
2755 isl_int_set(dup->n, term->n);
2756 isl_int_set(dup->d, term->d);
2758 for (i = 0; i < total; ++i)
2759 dup->pow[i] = term->pow[i];
2764 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
2772 return isl_term_dup(term);
2775 void isl_term_free(__isl_take isl_term *term)
2780 if (--term->ref > 0)
2783 isl_dim_free(term->dim);
2784 isl_mat_free(term->div);
2785 isl_int_clear(term->n);
2786 isl_int_clear(term->d);
2790 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
2798 case isl_dim_out: return isl_dim_size(term->dim, type);
2799 case isl_dim_div: return term->div->n_row;
2800 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
2805 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
2807 return term ? term->dim->ctx : NULL;
2810 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
2814 isl_int_set(*n, term->n);
2817 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
2821 isl_int_set(*d, term->d);
2824 int isl_term_get_exp(__isl_keep isl_term *term,
2825 enum isl_dim_type type, unsigned pos)
2830 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
2832 if (type >= isl_dim_set)
2833 pos += isl_dim_size(term->dim, isl_dim_param);
2834 if (type >= isl_dim_div)
2835 pos += isl_dim_size(term->dim, isl_dim_set);
2837 return term->pow[pos];
2840 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
2842 isl_basic_map *bmap;
2849 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
2852 total = term->div->n_col - term->div->n_row - 2;
2853 /* No nested divs for now */
2854 isl_assert(term->dim->ctx,
2855 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
2856 term->div->n_row) == -1,
2859 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
2860 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
2863 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
2865 return isl_basic_map_div(bmap, k);
2867 isl_basic_map_free(bmap);
2871 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
2872 int (*fn)(__isl_take isl_term *term, void *user),
2873 __isl_take isl_term *term, void *user)
2876 struct isl_upoly_rec *rec;
2881 if (isl_upoly_is_zero(up))
2884 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
2885 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
2886 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
2888 if (isl_upoly_is_cst(up)) {
2889 struct isl_upoly_cst *cst;
2890 cst = isl_upoly_as_cst(up);
2893 term = isl_term_cow(term);
2896 isl_int_set(term->n, cst->n);
2897 isl_int_set(term->d, cst->d);
2898 if (fn(isl_term_copy(term), user) < 0)
2903 rec = isl_upoly_as_rec(up);
2907 for (i = 0; i < rec->n; ++i) {
2908 term = isl_term_cow(term);
2911 term->pow[up->var] = i;
2912 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
2916 term->pow[up->var] = 0;
2920 isl_term_free(term);
2924 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
2925 int (*fn)(__isl_take isl_term *term, void *user), void *user)
2932 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
2936 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
2938 isl_term_free(term);
2940 return term ? 0 : -1;
2943 __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
2945 struct isl_upoly *up;
2946 isl_qpolynomial *qp;
2952 n = isl_dim_total(term->dim) + term->div->n_row;
2954 up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d);
2955 for (i = 0; i < n; ++i) {
2958 up = isl_upoly_mul(up,
2959 isl_upoly_pow(term->dim->ctx, i, term->pow[i]));
2962 qp = isl_qpolynomial_alloc(isl_dim_copy(term->dim), term->div->n_row, up);
2965 isl_mat_free(qp->div);
2966 qp->div = isl_mat_copy(term->div);
2970 isl_term_free(term);
2973 isl_qpolynomial_free(qp);
2974 isl_term_free(term);
2978 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
2979 __isl_take isl_dim *dim)
2988 if (isl_dim_equal(qp->dim, dim)) {
2993 qp = isl_qpolynomial_cow(qp);
2997 extra = isl_dim_size(dim, isl_dim_set) -
2998 isl_dim_size(qp->dim, isl_dim_set);
2999 total = isl_dim_total(qp->dim);
3000 if (qp->div->n_row) {
3003 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
3006 for (i = 0; i < qp->div->n_row; ++i)
3008 qp->upoly = expand(qp->upoly, exp, total);
3013 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
3016 for (i = 0; i < qp->div->n_row; ++i)
3017 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
3019 isl_dim_free(qp->dim);
3025 isl_qpolynomial_free(qp);
3029 /* For each parameter or variable that does not appear in qp,
3030 * first eliminate the variable from all constraints and then set it to zero.
3032 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
3033 __isl_keep isl_qpolynomial *qp)
3044 d = isl_dim_total(set->dim);
3045 active = isl_calloc_array(set->ctx, int, d);
3046 if (set_active(qp, active) < 0)
3049 for (i = 0; i < d; ++i)
3058 nparam = isl_dim_size(set->dim, isl_dim_param);
3059 nvar = isl_dim_size(set->dim, isl_dim_set);
3060 for (i = 0; i < nparam; ++i) {
3063 set = isl_set_eliminate(set, isl_dim_param, i, 1);
3064 set = isl_set_fix_si(set, isl_dim_param, i, 0);
3066 for (i = 0; i < nvar; ++i) {
3067 if (active[nparam + i])
3069 set = isl_set_eliminate(set, isl_dim_set, i, 1);
3070 set = isl_set_fix_si(set, isl_dim_set, i, 0);
3082 struct isl_opt_data {
3083 isl_qpolynomial *qp;
3085 isl_qpolynomial *opt;
3089 static int opt_fn(__isl_take isl_point *pnt, void *user)
3091 struct isl_opt_data *data = (struct isl_opt_data *)user;
3092 isl_qpolynomial *val;
3094 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
3098 } else if (data->max) {
3099 data->opt = isl_qpolynomial_max_cst(data->opt, val);
3101 data->opt = isl_qpolynomial_min_cst(data->opt, val);
3107 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
3108 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
3110 struct isl_opt_data data = { NULL, 1, NULL, max };
3115 if (isl_upoly_is_cst(qp->upoly)) {
3120 set = fix_inactive(set, qp);
3123 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
3127 data.opt = isl_qpolynomial_zero(isl_qpolynomial_get_dim(qp));
3130 isl_qpolynomial_free(qp);
3134 isl_qpolynomial_free(qp);
3135 isl_qpolynomial_free(data.opt);
3139 __isl_give isl_qpolynomial *isl_qpolynomial_morph(__isl_take isl_qpolynomial *qp,
3140 __isl_take isl_morph *morph)
3144 struct isl_upoly *up;
3146 struct isl_upoly **subs;
3149 qp = isl_qpolynomial_cow(qp);
3154 isl_assert(ctx, isl_dim_equal(qp->dim, morph->dom->dim), goto error);
3156 subs = isl_calloc_array(ctx, struct isl_upoly *, morph->inv->n_row - 1);
3160 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3161 subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i],
3162 morph->inv->row[0][0], morph->inv->n_col);
3164 qp->upoly = isl_upoly_subs(qp->upoly, 0, morph->inv->n_row - 1, subs);
3166 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3167 isl_upoly_free(subs[i]);
3170 mat = isl_mat_diagonal(isl_mat_identity(ctx, 1), isl_mat_copy(morph->inv));
3171 mat = isl_mat_diagonal(mat, isl_mat_identity(ctx, qp->div->n_row));
3172 qp->div = isl_mat_product(qp->div, mat);
3173 isl_dim_free(qp->dim);
3174 qp->dim = isl_dim_copy(morph->ran->dim);
3176 if (!qp->upoly || !qp->div || !qp->dim)
3179 isl_morph_free(morph);
3183 isl_qpolynomial_free(qp);
3184 isl_morph_free(morph);
3188 static int neg_entry(void **entry, void *user)
3190 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
3192 *pwqp = isl_pw_qpolynomial_neg(*pwqp);
3194 return *pwqp ? 0 : -1;
3197 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_neg(
3198 __isl_take isl_union_pw_qpolynomial *upwqp)
3200 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
3204 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
3205 &neg_entry, NULL) < 0)
3210 isl_union_pw_qpolynomial_free(upwqp);
3214 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_sub(
3215 __isl_take isl_union_pw_qpolynomial *upwqp1,
3216 __isl_take isl_union_pw_qpolynomial *upwqp2)
3218 return isl_union_pw_qpolynomial_add(upwqp1,
3219 isl_union_pw_qpolynomial_neg(upwqp2));
3222 static int mul_entry(void **entry, void *user)
3224 struct isl_union_pw_qpolynomial_match_bin_data *data = user;
3226 struct isl_hash_table_entry *entry2;
3227 isl_pw_qpolynomial *pwpq = *entry;
3230 hash = isl_dim_get_hash(pwpq->dim);
3231 entry2 = isl_hash_table_find(data->upwqp2->dim->ctx,
3232 &data->upwqp2->table,
3233 hash, &has_dim, pwpq->dim, 0);
3237 pwpq = isl_pw_qpolynomial_copy(pwpq);
3238 pwpq = isl_pw_qpolynomial_mul(pwpq,
3239 isl_pw_qpolynomial_copy(entry2->data));
3241 empty = isl_pw_qpolynomial_is_zero(pwpq);
3243 isl_pw_qpolynomial_free(pwpq);
3247 isl_pw_qpolynomial_free(pwpq);
3251 data->res = isl_union_pw_qpolynomial_add_pw_qpolynomial(data->res, pwpq);
3256 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
3257 __isl_take isl_union_pw_qpolynomial *upwqp1,
3258 __isl_take isl_union_pw_qpolynomial *upwqp2)
3260 return match_bin_op(upwqp1, upwqp2, &mul_entry);