2 * Copyright 2010 INRIA Saclay
4 * Use of this software is governed by the MIT license
6 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
7 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
12 #include <isl_ctx_private.h>
13 #include <isl_map_private.h>
14 #include <isl_factorization.h>
15 #include <isl_lp_private.h>
17 #include <isl_union_map_private.h>
18 #include <isl_constraint_private.h>
19 #include <isl_polynomial_private.h>
20 #include <isl_point_private.h>
21 #include <isl_space_private.h>
22 #include <isl_mat_private.h>
23 #include <isl_vec_private.h>
24 #include <isl_range.h>
25 #include <isl_local.h>
26 #include <isl_local_space_private.h>
27 #include <isl_aff_private.h>
28 #include <isl_val_private.h>
29 #include <isl_config.h>
32 #define BASE pw_qpolynomial
34 #include <isl_list_templ.c>
36 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
39 case isl_dim_param
: return 0;
40 case isl_dim_in
: return dim
->nparam
;
41 case isl_dim_out
: return dim
->nparam
+ dim
->n_in
;
46 int isl_upoly_is_cst(__isl_keep
struct isl_upoly
*up
)
54 __isl_keep
struct isl_upoly_cst
*isl_upoly_as_cst(__isl_keep
struct isl_upoly
*up
)
59 isl_assert(up
->ctx
, up
->var
< 0, return NULL
);
61 return (struct isl_upoly_cst
*)up
;
64 __isl_keep
struct isl_upoly_rec
*isl_upoly_as_rec(__isl_keep
struct isl_upoly
*up
)
69 isl_assert(up
->ctx
, up
->var
>= 0, return NULL
);
71 return (struct isl_upoly_rec
*)up
;
74 /* Compare two polynomials.
76 * Return -1 if "up1" is "smaller" than "up2", 1 if "up1" is "greater"
77 * than "up2" and 0 if they are equal.
79 static int isl_upoly_plain_cmp(__isl_keep
struct isl_upoly
*up1
,
80 __isl_keep
struct isl_upoly
*up2
)
83 struct isl_upoly_rec
*rec1
, *rec2
;
91 if (up1
->var
!= up2
->var
)
92 return up1
->var
- up2
->var
;
94 if (isl_upoly_is_cst(up1
)) {
95 struct isl_upoly_cst
*cst1
, *cst2
;
98 cst1
= isl_upoly_as_cst(up1
);
99 cst2
= isl_upoly_as_cst(up2
);
102 cmp
= isl_int_cmp(cst1
->n
, cst2
->n
);
105 return isl_int_cmp(cst1
->d
, cst2
->d
);
108 rec1
= isl_upoly_as_rec(up1
);
109 rec2
= isl_upoly_as_rec(up2
);
113 if (rec1
->n
!= rec2
->n
)
114 return rec1
->n
- rec2
->n
;
116 for (i
= 0; i
< rec1
->n
; ++i
) {
117 int cmp
= isl_upoly_plain_cmp(rec1
->p
[i
], rec2
->p
[i
]);
125 isl_bool
isl_upoly_is_equal(__isl_keep
struct isl_upoly
*up1
,
126 __isl_keep
struct isl_upoly
*up2
)
129 struct isl_upoly_rec
*rec1
, *rec2
;
132 return isl_bool_error
;
134 return isl_bool_true
;
135 if (up1
->var
!= up2
->var
)
136 return isl_bool_false
;
137 if (isl_upoly_is_cst(up1
)) {
138 struct isl_upoly_cst
*cst1
, *cst2
;
139 cst1
= isl_upoly_as_cst(up1
);
140 cst2
= isl_upoly_as_cst(up2
);
142 return isl_bool_error
;
143 return isl_int_eq(cst1
->n
, cst2
->n
) &&
144 isl_int_eq(cst1
->d
, cst2
->d
);
147 rec1
= isl_upoly_as_rec(up1
);
148 rec2
= isl_upoly_as_rec(up2
);
150 return isl_bool_error
;
152 if (rec1
->n
!= rec2
->n
)
153 return isl_bool_false
;
155 for (i
= 0; i
< rec1
->n
; ++i
) {
156 isl_bool eq
= isl_upoly_is_equal(rec1
->p
[i
], rec2
->p
[i
]);
161 return isl_bool_true
;
164 int isl_upoly_is_zero(__isl_keep
struct isl_upoly
*up
)
166 struct isl_upoly_cst
*cst
;
170 if (!isl_upoly_is_cst(up
))
173 cst
= isl_upoly_as_cst(up
);
177 return isl_int_is_zero(cst
->n
) && isl_int_is_pos(cst
->d
);
180 int isl_upoly_sgn(__isl_keep
struct isl_upoly
*up
)
182 struct isl_upoly_cst
*cst
;
186 if (!isl_upoly_is_cst(up
))
189 cst
= isl_upoly_as_cst(up
);
193 return isl_int_sgn(cst
->n
);
196 int isl_upoly_is_nan(__isl_keep
struct isl_upoly
*up
)
198 struct isl_upoly_cst
*cst
;
202 if (!isl_upoly_is_cst(up
))
205 cst
= isl_upoly_as_cst(up
);
209 return isl_int_is_zero(cst
->n
) && isl_int_is_zero(cst
->d
);
212 int isl_upoly_is_infty(__isl_keep
struct isl_upoly
*up
)
214 struct isl_upoly_cst
*cst
;
218 if (!isl_upoly_is_cst(up
))
221 cst
= isl_upoly_as_cst(up
);
225 return isl_int_is_pos(cst
->n
) && isl_int_is_zero(cst
->d
);
228 int isl_upoly_is_neginfty(__isl_keep
struct isl_upoly
*up
)
230 struct isl_upoly_cst
*cst
;
234 if (!isl_upoly_is_cst(up
))
237 cst
= isl_upoly_as_cst(up
);
241 return isl_int_is_neg(cst
->n
) && isl_int_is_zero(cst
->d
);
244 int isl_upoly_is_one(__isl_keep
struct isl_upoly
*up
)
246 struct isl_upoly_cst
*cst
;
250 if (!isl_upoly_is_cst(up
))
253 cst
= isl_upoly_as_cst(up
);
257 return isl_int_eq(cst
->n
, cst
->d
) && isl_int_is_pos(cst
->d
);
260 int isl_upoly_is_negone(__isl_keep
struct isl_upoly
*up
)
262 struct isl_upoly_cst
*cst
;
266 if (!isl_upoly_is_cst(up
))
269 cst
= isl_upoly_as_cst(up
);
273 return isl_int_is_negone(cst
->n
) && isl_int_is_one(cst
->d
);
276 __isl_give
struct isl_upoly_cst
*isl_upoly_cst_alloc(struct isl_ctx
*ctx
)
278 struct isl_upoly_cst
*cst
;
280 cst
= isl_alloc_type(ctx
, struct isl_upoly_cst
);
289 isl_int_init(cst
->n
);
290 isl_int_init(cst
->d
);
295 __isl_give
struct isl_upoly
*isl_upoly_zero(struct isl_ctx
*ctx
)
297 struct isl_upoly_cst
*cst
;
299 cst
= isl_upoly_cst_alloc(ctx
);
303 isl_int_set_si(cst
->n
, 0);
304 isl_int_set_si(cst
->d
, 1);
309 __isl_give
struct isl_upoly
*isl_upoly_one(struct isl_ctx
*ctx
)
311 struct isl_upoly_cst
*cst
;
313 cst
= isl_upoly_cst_alloc(ctx
);
317 isl_int_set_si(cst
->n
, 1);
318 isl_int_set_si(cst
->d
, 1);
323 __isl_give
struct isl_upoly
*isl_upoly_infty(struct isl_ctx
*ctx
)
325 struct isl_upoly_cst
*cst
;
327 cst
= isl_upoly_cst_alloc(ctx
);
331 isl_int_set_si(cst
->n
, 1);
332 isl_int_set_si(cst
->d
, 0);
337 __isl_give
struct isl_upoly
*isl_upoly_neginfty(struct isl_ctx
*ctx
)
339 struct isl_upoly_cst
*cst
;
341 cst
= isl_upoly_cst_alloc(ctx
);
345 isl_int_set_si(cst
->n
, -1);
346 isl_int_set_si(cst
->d
, 0);
351 __isl_give
struct isl_upoly
*isl_upoly_nan(struct isl_ctx
*ctx
)
353 struct isl_upoly_cst
*cst
;
355 cst
= isl_upoly_cst_alloc(ctx
);
359 isl_int_set_si(cst
->n
, 0);
360 isl_int_set_si(cst
->d
, 0);
365 __isl_give
struct isl_upoly
*isl_upoly_rat_cst(struct isl_ctx
*ctx
,
366 isl_int n
, isl_int d
)
368 struct isl_upoly_cst
*cst
;
370 cst
= isl_upoly_cst_alloc(ctx
);
374 isl_int_set(cst
->n
, n
);
375 isl_int_set(cst
->d
, d
);
380 __isl_give
struct isl_upoly_rec
*isl_upoly_alloc_rec(struct isl_ctx
*ctx
,
383 struct isl_upoly_rec
*rec
;
385 isl_assert(ctx
, var
>= 0, return NULL
);
386 isl_assert(ctx
, size
>= 0, return NULL
);
387 rec
= isl_calloc(ctx
, struct isl_upoly_rec
,
388 sizeof(struct isl_upoly_rec
) +
389 size
* sizeof(struct isl_upoly
*));
404 __isl_give isl_qpolynomial
*isl_qpolynomial_reset_domain_space(
405 __isl_take isl_qpolynomial
*qp
, __isl_take isl_space
*dim
)
407 qp
= isl_qpolynomial_cow(qp
);
411 isl_space_free(qp
->dim
);
416 isl_qpolynomial_free(qp
);
421 /* Reset the space of "qp". This function is called from isl_pw_templ.c
422 * and doesn't know if the space of an element object is represented
423 * directly or through its domain. It therefore passes along both.
425 __isl_give isl_qpolynomial
*isl_qpolynomial_reset_space_and_domain(
426 __isl_take isl_qpolynomial
*qp
, __isl_take isl_space
*space
,
427 __isl_take isl_space
*domain
)
429 isl_space_free(space
);
430 return isl_qpolynomial_reset_domain_space(qp
, domain
);
433 isl_ctx
*isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial
*qp
)
435 return qp
? qp
->dim
->ctx
: NULL
;
438 __isl_give isl_space
*isl_qpolynomial_get_domain_space(
439 __isl_keep isl_qpolynomial
*qp
)
441 return qp
? isl_space_copy(qp
->dim
) : NULL
;
444 /* Return a copy of the local space on which "qp" is defined.
446 static __isl_give isl_local_space
*isl_qpolynomial_get_domain_local_space(
447 __isl_keep isl_qpolynomial
*qp
)
454 space
= isl_qpolynomial_get_domain_space(qp
);
455 return isl_local_space_alloc_div(space
, isl_mat_copy(qp
->div
));
458 __isl_give isl_space
*isl_qpolynomial_get_space(__isl_keep isl_qpolynomial
*qp
)
463 space
= isl_space_copy(qp
->dim
);
464 space
= isl_space_from_domain(space
);
465 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
469 /* Return the number of variables of the given type in the domain of "qp".
471 unsigned isl_qpolynomial_domain_dim(__isl_keep isl_qpolynomial
*qp
,
472 enum isl_dim_type type
)
476 if (type
== isl_dim_div
)
477 return qp
->div
->n_row
;
478 if (type
== isl_dim_all
)
479 return isl_space_dim(qp
->dim
, isl_dim_all
) +
480 isl_qpolynomial_domain_dim(qp
, isl_dim_div
);
481 return isl_space_dim(qp
->dim
, type
);
484 /* Externally, an isl_qpolynomial has a map space, but internally, the
485 * ls field corresponds to the domain of that space.
487 unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial
*qp
,
488 enum isl_dim_type type
)
492 if (type
== isl_dim_out
)
494 if (type
== isl_dim_in
)
496 return isl_qpolynomial_domain_dim(qp
, type
);
499 /* Return the offset of the first coefficient of type "type" in
500 * the domain of "qp".
502 unsigned isl_qpolynomial_domain_offset(__isl_keep isl_qpolynomial
*qp
,
503 enum isl_dim_type type
)
512 return 1 + isl_space_offset(qp
->dim
, type
);
514 return 1 + isl_space_dim(qp
->dim
, isl_dim_all
);
520 isl_bool
isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial
*qp
)
522 return qp
? isl_upoly_is_zero(qp
->upoly
) : isl_bool_error
;
525 isl_bool
isl_qpolynomial_is_one(__isl_keep isl_qpolynomial
*qp
)
527 return qp
? isl_upoly_is_one(qp
->upoly
) : isl_bool_error
;
530 isl_bool
isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial
*qp
)
532 return qp
? isl_upoly_is_nan(qp
->upoly
) : isl_bool_error
;
535 isl_bool
isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial
*qp
)
537 return qp
? isl_upoly_is_infty(qp
->upoly
) : isl_bool_error
;
540 isl_bool
isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial
*qp
)
542 return qp
? isl_upoly_is_neginfty(qp
->upoly
) : isl_bool_error
;
545 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial
*qp
)
547 return qp
? isl_upoly_sgn(qp
->upoly
) : 0;
550 static void upoly_free_cst(__isl_take
struct isl_upoly_cst
*cst
)
552 isl_int_clear(cst
->n
);
553 isl_int_clear(cst
->d
);
556 static void upoly_free_rec(__isl_take
struct isl_upoly_rec
*rec
)
560 for (i
= 0; i
< rec
->n
; ++i
)
561 isl_upoly_free(rec
->p
[i
]);
564 __isl_give
struct isl_upoly
*isl_upoly_copy(__isl_keep
struct isl_upoly
*up
)
573 __isl_give
struct isl_upoly
*isl_upoly_dup_cst(__isl_keep
struct isl_upoly
*up
)
575 struct isl_upoly_cst
*cst
;
576 struct isl_upoly_cst
*dup
;
578 cst
= isl_upoly_as_cst(up
);
582 dup
= isl_upoly_as_cst(isl_upoly_zero(up
->ctx
));
585 isl_int_set(dup
->n
, cst
->n
);
586 isl_int_set(dup
->d
, cst
->d
);
591 __isl_give
struct isl_upoly
*isl_upoly_dup_rec(__isl_keep
struct isl_upoly
*up
)
594 struct isl_upoly_rec
*rec
;
595 struct isl_upoly_rec
*dup
;
597 rec
= isl_upoly_as_rec(up
);
601 dup
= isl_upoly_alloc_rec(up
->ctx
, up
->var
, rec
->n
);
605 for (i
= 0; i
< rec
->n
; ++i
) {
606 dup
->p
[i
] = isl_upoly_copy(rec
->p
[i
]);
614 isl_upoly_free(&dup
->up
);
618 __isl_give
struct isl_upoly
*isl_upoly_dup(__isl_keep
struct isl_upoly
*up
)
623 if (isl_upoly_is_cst(up
))
624 return isl_upoly_dup_cst(up
);
626 return isl_upoly_dup_rec(up
);
629 __isl_give
struct isl_upoly
*isl_upoly_cow(__isl_take
struct isl_upoly
*up
)
637 return isl_upoly_dup(up
);
640 __isl_null
struct isl_upoly
*isl_upoly_free(__isl_take
struct isl_upoly
*up
)
649 upoly_free_cst((struct isl_upoly_cst
*)up
);
651 upoly_free_rec((struct isl_upoly_rec
*)up
);
653 isl_ctx_deref(up
->ctx
);
658 static void isl_upoly_cst_reduce(__isl_keep
struct isl_upoly_cst
*cst
)
663 isl_int_gcd(gcd
, cst
->n
, cst
->d
);
664 if (!isl_int_is_zero(gcd
) && !isl_int_is_one(gcd
)) {
665 isl_int_divexact(cst
->n
, cst
->n
, gcd
);
666 isl_int_divexact(cst
->d
, cst
->d
, gcd
);
671 __isl_give
struct isl_upoly
*isl_upoly_sum_cst(__isl_take
struct isl_upoly
*up1
,
672 __isl_take
struct isl_upoly
*up2
)
674 struct isl_upoly_cst
*cst1
;
675 struct isl_upoly_cst
*cst2
;
677 up1
= isl_upoly_cow(up1
);
681 cst1
= isl_upoly_as_cst(up1
);
682 cst2
= isl_upoly_as_cst(up2
);
684 if (isl_int_eq(cst1
->d
, cst2
->d
))
685 isl_int_add(cst1
->n
, cst1
->n
, cst2
->n
);
687 isl_int_mul(cst1
->n
, cst1
->n
, cst2
->d
);
688 isl_int_addmul(cst1
->n
, cst2
->n
, cst1
->d
);
689 isl_int_mul(cst1
->d
, cst1
->d
, cst2
->d
);
692 isl_upoly_cst_reduce(cst1
);
702 static __isl_give
struct isl_upoly
*replace_by_zero(
703 __isl_take
struct isl_upoly
*up
)
711 return isl_upoly_zero(ctx
);
714 static __isl_give
struct isl_upoly
*replace_by_constant_term(
715 __isl_take
struct isl_upoly
*up
)
717 struct isl_upoly_rec
*rec
;
718 struct isl_upoly
*cst
;
723 rec
= isl_upoly_as_rec(up
);
726 cst
= isl_upoly_copy(rec
->p
[0]);
734 __isl_give
struct isl_upoly
*isl_upoly_sum(__isl_take
struct isl_upoly
*up1
,
735 __isl_take
struct isl_upoly
*up2
)
738 struct isl_upoly_rec
*rec1
, *rec2
;
743 if (isl_upoly_is_nan(up1
)) {
748 if (isl_upoly_is_nan(up2
)) {
753 if (isl_upoly_is_zero(up1
)) {
758 if (isl_upoly_is_zero(up2
)) {
763 if (up1
->var
< up2
->var
)
764 return isl_upoly_sum(up2
, up1
);
766 if (up2
->var
< up1
->var
) {
767 struct isl_upoly_rec
*rec
;
768 if (isl_upoly_is_infty(up2
) || isl_upoly_is_neginfty(up2
)) {
772 up1
= isl_upoly_cow(up1
);
773 rec
= isl_upoly_as_rec(up1
);
776 rec
->p
[0] = isl_upoly_sum(rec
->p
[0], up2
);
778 up1
= replace_by_constant_term(up1
);
782 if (isl_upoly_is_cst(up1
))
783 return isl_upoly_sum_cst(up1
, up2
);
785 rec1
= isl_upoly_as_rec(up1
);
786 rec2
= isl_upoly_as_rec(up2
);
790 if (rec1
->n
< rec2
->n
)
791 return isl_upoly_sum(up2
, up1
);
793 up1
= isl_upoly_cow(up1
);
794 rec1
= isl_upoly_as_rec(up1
);
798 for (i
= rec2
->n
- 1; i
>= 0; --i
) {
799 rec1
->p
[i
] = isl_upoly_sum(rec1
->p
[i
],
800 isl_upoly_copy(rec2
->p
[i
]));
803 if (i
== rec1
->n
- 1 && isl_upoly_is_zero(rec1
->p
[i
])) {
804 isl_upoly_free(rec1
->p
[i
]);
810 up1
= replace_by_zero(up1
);
811 else if (rec1
->n
== 1)
812 up1
= replace_by_constant_term(up1
);
823 __isl_give
struct isl_upoly
*isl_upoly_cst_add_isl_int(
824 __isl_take
struct isl_upoly
*up
, isl_int v
)
826 struct isl_upoly_cst
*cst
;
828 up
= isl_upoly_cow(up
);
832 cst
= isl_upoly_as_cst(up
);
834 isl_int_addmul(cst
->n
, cst
->d
, v
);
839 __isl_give
struct isl_upoly
*isl_upoly_add_isl_int(
840 __isl_take
struct isl_upoly
*up
, isl_int v
)
842 struct isl_upoly_rec
*rec
;
847 if (isl_upoly_is_cst(up
))
848 return isl_upoly_cst_add_isl_int(up
, v
);
850 up
= isl_upoly_cow(up
);
851 rec
= isl_upoly_as_rec(up
);
855 rec
->p
[0] = isl_upoly_add_isl_int(rec
->p
[0], v
);
865 __isl_give
struct isl_upoly
*isl_upoly_cst_mul_isl_int(
866 __isl_take
struct isl_upoly
*up
, isl_int v
)
868 struct isl_upoly_cst
*cst
;
870 if (isl_upoly_is_zero(up
))
873 up
= isl_upoly_cow(up
);
877 cst
= isl_upoly_as_cst(up
);
879 isl_int_mul(cst
->n
, cst
->n
, v
);
884 __isl_give
struct isl_upoly
*isl_upoly_mul_isl_int(
885 __isl_take
struct isl_upoly
*up
, isl_int v
)
888 struct isl_upoly_rec
*rec
;
893 if (isl_upoly_is_cst(up
))
894 return isl_upoly_cst_mul_isl_int(up
, v
);
896 up
= isl_upoly_cow(up
);
897 rec
= isl_upoly_as_rec(up
);
901 for (i
= 0; i
< rec
->n
; ++i
) {
902 rec
->p
[i
] = isl_upoly_mul_isl_int(rec
->p
[i
], v
);
913 /* Multiply the constant polynomial "up" by "v".
915 static __isl_give
struct isl_upoly
*isl_upoly_cst_scale_val(
916 __isl_take
struct isl_upoly
*up
, __isl_keep isl_val
*v
)
918 struct isl_upoly_cst
*cst
;
920 if (isl_upoly_is_zero(up
))
923 up
= isl_upoly_cow(up
);
927 cst
= isl_upoly_as_cst(up
);
929 isl_int_mul(cst
->n
, cst
->n
, v
->n
);
930 isl_int_mul(cst
->d
, cst
->d
, v
->d
);
931 isl_upoly_cst_reduce(cst
);
936 /* Multiply the polynomial "up" by "v".
938 static __isl_give
struct isl_upoly
*isl_upoly_scale_val(
939 __isl_take
struct isl_upoly
*up
, __isl_keep isl_val
*v
)
942 struct isl_upoly_rec
*rec
;
947 if (isl_upoly_is_cst(up
))
948 return isl_upoly_cst_scale_val(up
, v
);
950 up
= isl_upoly_cow(up
);
951 rec
= isl_upoly_as_rec(up
);
955 for (i
= 0; i
< rec
->n
; ++i
) {
956 rec
->p
[i
] = isl_upoly_scale_val(rec
->p
[i
], v
);
967 __isl_give
struct isl_upoly
*isl_upoly_mul_cst(__isl_take
struct isl_upoly
*up1
,
968 __isl_take
struct isl_upoly
*up2
)
970 struct isl_upoly_cst
*cst1
;
971 struct isl_upoly_cst
*cst2
;
973 up1
= isl_upoly_cow(up1
);
977 cst1
= isl_upoly_as_cst(up1
);
978 cst2
= isl_upoly_as_cst(up2
);
980 isl_int_mul(cst1
->n
, cst1
->n
, cst2
->n
);
981 isl_int_mul(cst1
->d
, cst1
->d
, cst2
->d
);
983 isl_upoly_cst_reduce(cst1
);
993 __isl_give
struct isl_upoly
*isl_upoly_mul_rec(__isl_take
struct isl_upoly
*up1
,
994 __isl_take
struct isl_upoly
*up2
)
996 struct isl_upoly_rec
*rec1
;
997 struct isl_upoly_rec
*rec2
;
998 struct isl_upoly_rec
*res
= NULL
;
1002 rec1
= isl_upoly_as_rec(up1
);
1003 rec2
= isl_upoly_as_rec(up2
);
1006 size
= rec1
->n
+ rec2
->n
- 1;
1007 res
= isl_upoly_alloc_rec(up1
->ctx
, up1
->var
, size
);
1011 for (i
= 0; i
< rec1
->n
; ++i
) {
1012 res
->p
[i
] = isl_upoly_mul(isl_upoly_copy(rec2
->p
[0]),
1013 isl_upoly_copy(rec1
->p
[i
]));
1018 for (; i
< size
; ++i
) {
1019 res
->p
[i
] = isl_upoly_zero(up1
->ctx
);
1024 for (i
= 0; i
< rec1
->n
; ++i
) {
1025 for (j
= 1; j
< rec2
->n
; ++j
) {
1026 struct isl_upoly
*up
;
1027 up
= isl_upoly_mul(isl_upoly_copy(rec2
->p
[j
]),
1028 isl_upoly_copy(rec1
->p
[i
]));
1029 res
->p
[i
+ j
] = isl_upoly_sum(res
->p
[i
+ j
], up
);
1035 isl_upoly_free(up1
);
1036 isl_upoly_free(up2
);
1040 isl_upoly_free(up1
);
1041 isl_upoly_free(up2
);
1042 isl_upoly_free(&res
->up
);
1046 __isl_give
struct isl_upoly
*isl_upoly_mul(__isl_take
struct isl_upoly
*up1
,
1047 __isl_take
struct isl_upoly
*up2
)
1052 if (isl_upoly_is_nan(up1
)) {
1053 isl_upoly_free(up2
);
1057 if (isl_upoly_is_nan(up2
)) {
1058 isl_upoly_free(up1
);
1062 if (isl_upoly_is_zero(up1
)) {
1063 isl_upoly_free(up2
);
1067 if (isl_upoly_is_zero(up2
)) {
1068 isl_upoly_free(up1
);
1072 if (isl_upoly_is_one(up1
)) {
1073 isl_upoly_free(up1
);
1077 if (isl_upoly_is_one(up2
)) {
1078 isl_upoly_free(up2
);
1082 if (up1
->var
< up2
->var
)
1083 return isl_upoly_mul(up2
, up1
);
1085 if (up2
->var
< up1
->var
) {
1087 struct isl_upoly_rec
*rec
;
1088 if (isl_upoly_is_infty(up2
) || isl_upoly_is_neginfty(up2
)) {
1089 isl_ctx
*ctx
= up1
->ctx
;
1090 isl_upoly_free(up1
);
1091 isl_upoly_free(up2
);
1092 return isl_upoly_nan(ctx
);
1094 up1
= isl_upoly_cow(up1
);
1095 rec
= isl_upoly_as_rec(up1
);
1099 for (i
= 0; i
< rec
->n
; ++i
) {
1100 rec
->p
[i
] = isl_upoly_mul(rec
->p
[i
],
1101 isl_upoly_copy(up2
));
1105 isl_upoly_free(up2
);
1109 if (isl_upoly_is_cst(up1
))
1110 return isl_upoly_mul_cst(up1
, up2
);
1112 return isl_upoly_mul_rec(up1
, up2
);
1114 isl_upoly_free(up1
);
1115 isl_upoly_free(up2
);
1119 __isl_give
struct isl_upoly
*isl_upoly_pow(__isl_take
struct isl_upoly
*up
,
1122 struct isl_upoly
*res
;
1130 res
= isl_upoly_copy(up
);
1132 res
= isl_upoly_one(up
->ctx
);
1134 while (power
>>= 1) {
1135 up
= isl_upoly_mul(up
, isl_upoly_copy(up
));
1137 res
= isl_upoly_mul(res
, isl_upoly_copy(up
));
1144 __isl_give isl_qpolynomial
*isl_qpolynomial_alloc(__isl_take isl_space
*space
,
1145 unsigned n_div
, __isl_take
struct isl_upoly
*up
)
1147 struct isl_qpolynomial
*qp
= NULL
;
1153 if (!isl_space_is_set(space
))
1154 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
1155 "domain of polynomial should be a set", goto error
);
1157 total
= isl_space_dim(space
, isl_dim_all
);
1159 qp
= isl_calloc_type(space
->ctx
, struct isl_qpolynomial
);
1164 qp
->div
= isl_mat_alloc(space
->ctx
, n_div
, 1 + 1 + total
+ n_div
);
1173 isl_space_free(space
);
1175 isl_qpolynomial_free(qp
);
1179 __isl_give isl_qpolynomial
*isl_qpolynomial_copy(__isl_keep isl_qpolynomial
*qp
)
1188 __isl_give isl_qpolynomial
*isl_qpolynomial_dup(__isl_keep isl_qpolynomial
*qp
)
1190 struct isl_qpolynomial
*dup
;
1195 dup
= isl_qpolynomial_alloc(isl_space_copy(qp
->dim
), qp
->div
->n_row
,
1196 isl_upoly_copy(qp
->upoly
));
1199 isl_mat_free(dup
->div
);
1200 dup
->div
= isl_mat_copy(qp
->div
);
1206 isl_qpolynomial_free(dup
);
1210 __isl_give isl_qpolynomial
*isl_qpolynomial_cow(__isl_take isl_qpolynomial
*qp
)
1218 return isl_qpolynomial_dup(qp
);
1221 __isl_null isl_qpolynomial
*isl_qpolynomial_free(
1222 __isl_take isl_qpolynomial
*qp
)
1230 isl_space_free(qp
->dim
);
1231 isl_mat_free(qp
->div
);
1232 isl_upoly_free(qp
->upoly
);
1238 __isl_give
struct isl_upoly
*isl_upoly_var_pow(isl_ctx
*ctx
, int pos
, int power
)
1241 struct isl_upoly_rec
*rec
;
1242 struct isl_upoly_cst
*cst
;
1244 rec
= isl_upoly_alloc_rec(ctx
, pos
, 1 + power
);
1247 for (i
= 0; i
< 1 + power
; ++i
) {
1248 rec
->p
[i
] = isl_upoly_zero(ctx
);
1253 cst
= isl_upoly_as_cst(rec
->p
[power
]);
1254 isl_int_set_si(cst
->n
, 1);
1258 isl_upoly_free(&rec
->up
);
1262 /* r array maps original positions to new positions.
1264 static __isl_give
struct isl_upoly
*reorder(__isl_take
struct isl_upoly
*up
,
1268 struct isl_upoly_rec
*rec
;
1269 struct isl_upoly
*base
;
1270 struct isl_upoly
*res
;
1272 if (isl_upoly_is_cst(up
))
1275 rec
= isl_upoly_as_rec(up
);
1279 isl_assert(up
->ctx
, rec
->n
>= 1, goto error
);
1281 base
= isl_upoly_var_pow(up
->ctx
, r
[up
->var
], 1);
1282 res
= reorder(isl_upoly_copy(rec
->p
[rec
->n
- 1]), r
);
1284 for (i
= rec
->n
- 2; i
>= 0; --i
) {
1285 res
= isl_upoly_mul(res
, isl_upoly_copy(base
));
1286 res
= isl_upoly_sum(res
, reorder(isl_upoly_copy(rec
->p
[i
]), r
));
1289 isl_upoly_free(base
);
1298 static isl_bool
compatible_divs(__isl_keep isl_mat
*div1
,
1299 __isl_keep isl_mat
*div2
)
1304 isl_assert(div1
->ctx
, div1
->n_row
>= div2
->n_row
&&
1305 div1
->n_col
>= div2
->n_col
,
1306 return isl_bool_error
);
1308 if (div1
->n_row
== div2
->n_row
)
1309 return isl_mat_is_equal(div1
, div2
);
1311 n_row
= div1
->n_row
;
1312 n_col
= div1
->n_col
;
1313 div1
->n_row
= div2
->n_row
;
1314 div1
->n_col
= div2
->n_col
;
1316 equal
= isl_mat_is_equal(div1
, div2
);
1318 div1
->n_row
= n_row
;
1319 div1
->n_col
= n_col
;
1324 static int cmp_row(__isl_keep isl_mat
*div
, int i
, int j
)
1328 li
= isl_seq_last_non_zero(div
->row
[i
], div
->n_col
);
1329 lj
= isl_seq_last_non_zero(div
->row
[j
], div
->n_col
);
1334 return isl_seq_cmp(div
->row
[i
], div
->row
[j
], div
->n_col
);
1337 struct isl_div_sort_info
{
1342 static int div_sort_cmp(const void *p1
, const void *p2
)
1344 const struct isl_div_sort_info
*i1
, *i2
;
1345 i1
= (const struct isl_div_sort_info
*) p1
;
1346 i2
= (const struct isl_div_sort_info
*) p2
;
1348 return cmp_row(i1
->div
, i1
->row
, i2
->row
);
1351 /* Sort divs and remove duplicates.
1353 static __isl_give isl_qpolynomial
*sort_divs(__isl_take isl_qpolynomial
*qp
)
1358 struct isl_div_sort_info
*array
= NULL
;
1359 int *pos
= NULL
, *at
= NULL
;
1360 int *reordering
= NULL
;
1365 if (qp
->div
->n_row
<= 1)
1368 div_pos
= isl_space_dim(qp
->dim
, isl_dim_all
);
1370 array
= isl_alloc_array(qp
->div
->ctx
, struct isl_div_sort_info
,
1372 pos
= isl_alloc_array(qp
->div
->ctx
, int, qp
->div
->n_row
);
1373 at
= isl_alloc_array(qp
->div
->ctx
, int, qp
->div
->n_row
);
1374 len
= qp
->div
->n_col
- 2;
1375 reordering
= isl_alloc_array(qp
->div
->ctx
, int, len
);
1376 if (!array
|| !pos
|| !at
|| !reordering
)
1379 for (i
= 0; i
< qp
->div
->n_row
; ++i
) {
1380 array
[i
].div
= qp
->div
;
1386 qsort(array
, qp
->div
->n_row
, sizeof(struct isl_div_sort_info
),
1389 for (i
= 0; i
< div_pos
; ++i
)
1392 for (i
= 0; i
< qp
->div
->n_row
; ++i
) {
1393 if (pos
[array
[i
].row
] == i
)
1395 qp
->div
= isl_mat_swap_rows(qp
->div
, i
, pos
[array
[i
].row
]);
1396 pos
[at
[i
]] = pos
[array
[i
].row
];
1397 at
[pos
[array
[i
].row
]] = at
[i
];
1398 at
[i
] = array
[i
].row
;
1399 pos
[array
[i
].row
] = i
;
1403 for (i
= 0; i
< len
- div_pos
; ++i
) {
1405 isl_seq_eq(qp
->div
->row
[i
- skip
- 1],
1406 qp
->div
->row
[i
- skip
], qp
->div
->n_col
)) {
1407 qp
->div
= isl_mat_drop_rows(qp
->div
, i
- skip
, 1);
1408 isl_mat_col_add(qp
->div
, 2 + div_pos
+ i
- skip
- 1,
1409 2 + div_pos
+ i
- skip
);
1410 qp
->div
= isl_mat_drop_cols(qp
->div
,
1411 2 + div_pos
+ i
- skip
, 1);
1414 reordering
[div_pos
+ array
[i
].row
] = div_pos
+ i
- skip
;
1417 qp
->upoly
= reorder(qp
->upoly
, reordering
);
1419 if (!qp
->upoly
|| !qp
->div
)
1433 isl_qpolynomial_free(qp
);
1437 static __isl_give
struct isl_upoly
*expand(__isl_take
struct isl_upoly
*up
,
1438 int *exp
, int first
)
1441 struct isl_upoly_rec
*rec
;
1443 if (isl_upoly_is_cst(up
))
1446 if (up
->var
< first
)
1449 if (exp
[up
->var
- first
] == up
->var
- first
)
1452 up
= isl_upoly_cow(up
);
1456 up
->var
= exp
[up
->var
- first
] + first
;
1458 rec
= isl_upoly_as_rec(up
);
1462 for (i
= 0; i
< rec
->n
; ++i
) {
1463 rec
->p
[i
] = expand(rec
->p
[i
], exp
, first
);
1474 static __isl_give isl_qpolynomial
*with_merged_divs(
1475 __isl_give isl_qpolynomial
*(*fn
)(__isl_take isl_qpolynomial
*qp1
,
1476 __isl_take isl_qpolynomial
*qp2
),
1477 __isl_take isl_qpolynomial
*qp1
, __isl_take isl_qpolynomial
*qp2
)
1481 isl_mat
*div
= NULL
;
1484 qp1
= isl_qpolynomial_cow(qp1
);
1485 qp2
= isl_qpolynomial_cow(qp2
);
1490 isl_assert(qp1
->div
->ctx
, qp1
->div
->n_row
>= qp2
->div
->n_row
&&
1491 qp1
->div
->n_col
>= qp2
->div
->n_col
, goto error
);
1493 n_div1
= qp1
->div
->n_row
;
1494 n_div2
= qp2
->div
->n_row
;
1495 exp1
= isl_alloc_array(qp1
->div
->ctx
, int, n_div1
);
1496 exp2
= isl_alloc_array(qp2
->div
->ctx
, int, n_div2
);
1497 if ((n_div1
&& !exp1
) || (n_div2
&& !exp2
))
1500 div
= isl_merge_divs(qp1
->div
, qp2
->div
, exp1
, exp2
);
1504 isl_mat_free(qp1
->div
);
1505 qp1
->div
= isl_mat_copy(div
);
1506 isl_mat_free(qp2
->div
);
1507 qp2
->div
= isl_mat_copy(div
);
1509 qp1
->upoly
= expand(qp1
->upoly
, exp1
, div
->n_col
- div
->n_row
- 2);
1510 qp2
->upoly
= expand(qp2
->upoly
, exp2
, div
->n_col
- div
->n_row
- 2);
1512 if (!qp1
->upoly
|| !qp2
->upoly
)
1519 return fn(qp1
, qp2
);
1524 isl_qpolynomial_free(qp1
);
1525 isl_qpolynomial_free(qp2
);
1529 __isl_give isl_qpolynomial
*isl_qpolynomial_add(__isl_take isl_qpolynomial
*qp1
,
1530 __isl_take isl_qpolynomial
*qp2
)
1532 isl_bool compatible
;
1534 qp1
= isl_qpolynomial_cow(qp1
);
1539 if (qp1
->div
->n_row
< qp2
->div
->n_row
)
1540 return isl_qpolynomial_add(qp2
, qp1
);
1542 isl_assert(qp1
->dim
->ctx
, isl_space_is_equal(qp1
->dim
, qp2
->dim
), goto error
);
1543 compatible
= compatible_divs(qp1
->div
, qp2
->div
);
1547 return with_merged_divs(isl_qpolynomial_add
, qp1
, qp2
);
1549 qp1
->upoly
= isl_upoly_sum(qp1
->upoly
, isl_upoly_copy(qp2
->upoly
));
1553 isl_qpolynomial_free(qp2
);
1557 isl_qpolynomial_free(qp1
);
1558 isl_qpolynomial_free(qp2
);
1562 __isl_give isl_qpolynomial
*isl_qpolynomial_add_on_domain(
1563 __isl_keep isl_set
*dom
,
1564 __isl_take isl_qpolynomial
*qp1
,
1565 __isl_take isl_qpolynomial
*qp2
)
1567 qp1
= isl_qpolynomial_add(qp1
, qp2
);
1568 qp1
= isl_qpolynomial_gist(qp1
, isl_set_copy(dom
));
1572 __isl_give isl_qpolynomial
*isl_qpolynomial_sub(__isl_take isl_qpolynomial
*qp1
,
1573 __isl_take isl_qpolynomial
*qp2
)
1575 return isl_qpolynomial_add(qp1
, isl_qpolynomial_neg(qp2
));
1578 __isl_give isl_qpolynomial
*isl_qpolynomial_add_isl_int(
1579 __isl_take isl_qpolynomial
*qp
, isl_int v
)
1581 if (isl_int_is_zero(v
))
1584 qp
= isl_qpolynomial_cow(qp
);
1588 qp
->upoly
= isl_upoly_add_isl_int(qp
->upoly
, v
);
1594 isl_qpolynomial_free(qp
);
1599 __isl_give isl_qpolynomial
*isl_qpolynomial_neg(__isl_take isl_qpolynomial
*qp
)
1604 return isl_qpolynomial_mul_isl_int(qp
, qp
->dim
->ctx
->negone
);
1607 __isl_give isl_qpolynomial
*isl_qpolynomial_mul_isl_int(
1608 __isl_take isl_qpolynomial
*qp
, isl_int v
)
1610 if (isl_int_is_one(v
))
1613 if (qp
&& isl_int_is_zero(v
)) {
1614 isl_qpolynomial
*zero
;
1615 zero
= isl_qpolynomial_zero_on_domain(isl_space_copy(qp
->dim
));
1616 isl_qpolynomial_free(qp
);
1620 qp
= isl_qpolynomial_cow(qp
);
1624 qp
->upoly
= isl_upoly_mul_isl_int(qp
->upoly
, v
);
1630 isl_qpolynomial_free(qp
);
1634 __isl_give isl_qpolynomial
*isl_qpolynomial_scale(
1635 __isl_take isl_qpolynomial
*qp
, isl_int v
)
1637 return isl_qpolynomial_mul_isl_int(qp
, v
);
1640 /* Multiply "qp" by "v".
1642 __isl_give isl_qpolynomial
*isl_qpolynomial_scale_val(
1643 __isl_take isl_qpolynomial
*qp
, __isl_take isl_val
*v
)
1648 if (!isl_val_is_rat(v
))
1649 isl_die(isl_qpolynomial_get_ctx(qp
), isl_error_invalid
,
1650 "expecting rational factor", goto error
);
1652 if (isl_val_is_one(v
)) {
1657 if (isl_val_is_zero(v
)) {
1660 space
= isl_qpolynomial_get_domain_space(qp
);
1661 isl_qpolynomial_free(qp
);
1663 return isl_qpolynomial_zero_on_domain(space
);
1666 qp
= isl_qpolynomial_cow(qp
);
1670 qp
->upoly
= isl_upoly_scale_val(qp
->upoly
, v
);
1672 qp
= isl_qpolynomial_free(qp
);
1678 isl_qpolynomial_free(qp
);
1682 /* Divide "qp" by "v".
1684 __isl_give isl_qpolynomial
*isl_qpolynomial_scale_down_val(
1685 __isl_take isl_qpolynomial
*qp
, __isl_take isl_val
*v
)
1690 if (!isl_val_is_rat(v
))
1691 isl_die(isl_qpolynomial_get_ctx(qp
), isl_error_invalid
,
1692 "expecting rational factor", goto error
);
1693 if (isl_val_is_zero(v
))
1694 isl_die(isl_val_get_ctx(v
), isl_error_invalid
,
1695 "cannot scale down by zero", goto error
);
1697 return isl_qpolynomial_scale_val(qp
, isl_val_inv(v
));
1700 isl_qpolynomial_free(qp
);
1704 __isl_give isl_qpolynomial
*isl_qpolynomial_mul(__isl_take isl_qpolynomial
*qp1
,
1705 __isl_take isl_qpolynomial
*qp2
)
1707 isl_bool compatible
;
1709 qp1
= isl_qpolynomial_cow(qp1
);
1714 if (qp1
->div
->n_row
< qp2
->div
->n_row
)
1715 return isl_qpolynomial_mul(qp2
, qp1
);
1717 isl_assert(qp1
->dim
->ctx
, isl_space_is_equal(qp1
->dim
, qp2
->dim
), goto error
);
1718 compatible
= compatible_divs(qp1
->div
, qp2
->div
);
1722 return with_merged_divs(isl_qpolynomial_mul
, qp1
, qp2
);
1724 qp1
->upoly
= isl_upoly_mul(qp1
->upoly
, isl_upoly_copy(qp2
->upoly
));
1728 isl_qpolynomial_free(qp2
);
1732 isl_qpolynomial_free(qp1
);
1733 isl_qpolynomial_free(qp2
);
1737 __isl_give isl_qpolynomial
*isl_qpolynomial_pow(__isl_take isl_qpolynomial
*qp
,
1740 qp
= isl_qpolynomial_cow(qp
);
1745 qp
->upoly
= isl_upoly_pow(qp
->upoly
, power
);
1751 isl_qpolynomial_free(qp
);
1755 __isl_give isl_pw_qpolynomial
*isl_pw_qpolynomial_pow(
1756 __isl_take isl_pw_qpolynomial
*pwqp
, unsigned power
)
1763 pwqp
= isl_pw_qpolynomial_cow(pwqp
);
1767 for (i
= 0; i
< pwqp
->n
; ++i
) {
1768 pwqp
->p
[i
].qp
= isl_qpolynomial_pow(pwqp
->p
[i
].qp
, power
);
1770 return isl_pw_qpolynomial_free(pwqp
);
1776 __isl_give isl_qpolynomial
*isl_qpolynomial_zero_on_domain(
1777 __isl_take isl_space
*domain
)
1781 return isl_qpolynomial_alloc(domain
, 0, isl_upoly_zero(domain
->ctx
));
1784 __isl_give isl_qpolynomial
*isl_qpolynomial_one_on_domain(
1785 __isl_take isl_space
*domain
)
1789 return isl_qpolynomial_alloc(domain
, 0, isl_upoly_one(domain
->ctx
));
1792 __isl_give isl_qpolynomial
*isl_qpolynomial_infty_on_domain(
1793 __isl_take isl_space
*domain
)
1797 return isl_qpolynomial_alloc(domain
, 0, isl_upoly_infty(domain
->ctx
));
1800 __isl_give isl_qpolynomial
*isl_qpolynomial_neginfty_on_domain(
1801 __isl_take isl_space
*domain
)
1805 return isl_qpolynomial_alloc(domain
, 0,
1806 isl_upoly_neginfty(domain
->ctx
));
1809 __isl_give isl_qpolynomial
*isl_qpolynomial_nan_on_domain(
1810 __isl_take isl_space
*domain
)
1814 return isl_qpolynomial_alloc(domain
, 0, isl_upoly_nan(domain
->ctx
));
1817 __isl_give isl_qpolynomial
*isl_qpolynomial_cst_on_domain(
1818 __isl_take isl_space
*domain
,
1821 struct isl_qpolynomial
*qp
;
1822 struct isl_upoly_cst
*cst
;
1827 qp
= isl_qpolynomial_alloc(domain
, 0, isl_upoly_zero(domain
->ctx
));
1831 cst
= isl_upoly_as_cst(qp
->upoly
);
1832 isl_int_set(cst
->n
, v
);
1837 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial
*qp
,
1838 isl_int
*n
, isl_int
*d
)
1840 struct isl_upoly_cst
*cst
;
1845 if (!isl_upoly_is_cst(qp
->upoly
))
1848 cst
= isl_upoly_as_cst(qp
->upoly
);
1853 isl_int_set(*n
, cst
->n
);
1855 isl_int_set(*d
, cst
->d
);
1860 /* Return the constant term of "up".
1862 static __isl_give isl_val
*isl_upoly_get_constant_val(
1863 __isl_keep
struct isl_upoly
*up
)
1865 struct isl_upoly_cst
*cst
;
1870 while (!isl_upoly_is_cst(up
)) {
1871 struct isl_upoly_rec
*rec
;
1873 rec
= isl_upoly_as_rec(up
);
1879 cst
= isl_upoly_as_cst(up
);
1882 return isl_val_rat_from_isl_int(cst
->up
.ctx
, cst
->n
, cst
->d
);
1885 /* Return the constant term of "qp".
1887 __isl_give isl_val
*isl_qpolynomial_get_constant_val(
1888 __isl_keep isl_qpolynomial
*qp
)
1893 return isl_upoly_get_constant_val(qp
->upoly
);
1896 int isl_upoly_is_affine(__isl_keep
struct isl_upoly
*up
)
1899 struct isl_upoly_rec
*rec
;
1907 rec
= isl_upoly_as_rec(up
);
1914 isl_assert(up
->ctx
, rec
->n
> 1, return -1);
1916 is_cst
= isl_upoly_is_cst(rec
->p
[1]);
1922 return isl_upoly_is_affine(rec
->p
[0]);
1925 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial
*qp
)
1930 if (qp
->div
->n_row
> 0)
1933 return isl_upoly_is_affine(qp
->upoly
);
1936 static void update_coeff(__isl_keep isl_vec
*aff
,
1937 __isl_keep
struct isl_upoly_cst
*cst
, int pos
)
1942 if (isl_int_is_zero(cst
->n
))
1947 isl_int_gcd(gcd
, cst
->d
, aff
->el
[0]);
1948 isl_int_divexact(f
, cst
->d
, gcd
);
1949 isl_int_divexact(gcd
, aff
->el
[0], gcd
);
1950 isl_seq_scale(aff
->el
, aff
->el
, f
, aff
->size
);
1951 isl_int_mul(aff
->el
[1 + pos
], gcd
, cst
->n
);
1956 int isl_upoly_update_affine(__isl_keep
struct isl_upoly
*up
,
1957 __isl_keep isl_vec
*aff
)
1959 struct isl_upoly_cst
*cst
;
1960 struct isl_upoly_rec
*rec
;
1966 struct isl_upoly_cst
*cst
;
1968 cst
= isl_upoly_as_cst(up
);
1971 update_coeff(aff
, cst
, 0);
1975 rec
= isl_upoly_as_rec(up
);
1978 isl_assert(up
->ctx
, rec
->n
== 2, return -1);
1980 cst
= isl_upoly_as_cst(rec
->p
[1]);
1983 update_coeff(aff
, cst
, 1 + up
->var
);
1985 return isl_upoly_update_affine(rec
->p
[0], aff
);
1988 __isl_give isl_vec
*isl_qpolynomial_extract_affine(
1989 __isl_keep isl_qpolynomial
*qp
)
1997 d
= isl_space_dim(qp
->dim
, isl_dim_all
);
1998 aff
= isl_vec_alloc(qp
->div
->ctx
, 2 + d
+ qp
->div
->n_row
);
2002 isl_seq_clr(aff
->el
+ 1, 1 + d
+ qp
->div
->n_row
);
2003 isl_int_set_si(aff
->el
[0], 1);
2005 if (isl_upoly_update_affine(qp
->upoly
, aff
) < 0)
2014 /* Compare two quasi-polynomials.
2016 * Return -1 if "qp1" is "smaller" than "qp2", 1 if "qp1" is "greater"
2017 * than "qp2" and 0 if they are equal.
2019 int isl_qpolynomial_plain_cmp(__isl_keep isl_qpolynomial
*qp1
,
2020 __isl_keep isl_qpolynomial
*qp2
)
2031 cmp
= isl_space_cmp(qp1
->dim
, qp2
->dim
);
2035 cmp
= isl_local_cmp(qp1
->div
, qp2
->div
);
2039 return isl_upoly_plain_cmp(qp1
->upoly
, qp2
->upoly
);
2042 /* Is "qp1" obviously equal to "qp2"?
2044 * NaN is not equal to anything, not even to another NaN.
2046 isl_bool
isl_qpolynomial_plain_is_equal(__isl_keep isl_qpolynomial
*qp1
,
2047 __isl_keep isl_qpolynomial
*qp2
)
2052 return isl_bool_error
;
2054 if (isl_qpolynomial_is_nan(qp1
) || isl_qpolynomial_is_nan(qp2
))
2055 return isl_bool_false
;
2057 equal
= isl_space_is_equal(qp1
->dim
, qp2
->dim
);
2058 if (equal
< 0 || !equal
)
2061 equal
= isl_mat_is_equal(qp1
->div
, qp2
->div
);
2062 if (equal
< 0 || !equal
)
2065 return isl_upoly_is_equal(qp1
->upoly
, qp2
->upoly
);
2068 static void upoly_update_den(__isl_keep
struct isl_upoly
*up
, isl_int
*d
)
2071 struct isl_upoly_rec
*rec
;
2073 if (isl_upoly_is_cst(up
)) {
2074 struct isl_upoly_cst
*cst
;
2075 cst
= isl_upoly_as_cst(up
);
2078 isl_int_lcm(*d
, *d
, cst
->d
);
2082 rec
= isl_upoly_as_rec(up
);
2086 for (i
= 0; i
< rec
->n
; ++i
)
2087 upoly_update_den(rec
->p
[i
], d
);
2090 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial
*qp
, isl_int
*d
)
2092 isl_int_set_si(*d
, 1);
2095 upoly_update_den(qp
->upoly
, d
);
2098 __isl_give isl_qpolynomial
*isl_qpolynomial_var_pow_on_domain(
2099 __isl_take isl_space
*domain
, int pos
, int power
)
2101 struct isl_ctx
*ctx
;
2108 return isl_qpolynomial_alloc(domain
, 0,
2109 isl_upoly_var_pow(ctx
, pos
, power
));
2112 __isl_give isl_qpolynomial
*isl_qpolynomial_var_on_domain(
2113 __isl_take isl_space
*domain
, enum isl_dim_type type
, unsigned pos
)
2115 if (isl_space_check_is_set(domain
) < 0)
2117 isl_assert(domain
->ctx
, pos
< isl_space_dim(domain
, type
), goto error
);
2119 if (type
== isl_dim_set
)
2120 pos
+= isl_space_dim(domain
, isl_dim_param
);
2122 return isl_qpolynomial_var_pow_on_domain(domain
, pos
, 1);
2124 isl_space_free(domain
);
2128 __isl_give
struct isl_upoly
*isl_upoly_subs(__isl_take
struct isl_upoly
*up
,
2129 unsigned first
, unsigned n
, __isl_keep
struct isl_upoly
**subs
)
2132 struct isl_upoly_rec
*rec
;
2133 struct isl_upoly
*base
, *res
;
2138 if (isl_upoly_is_cst(up
))
2141 if (up
->var
< first
)
2144 rec
= isl_upoly_as_rec(up
);
2148 isl_assert(up
->ctx
, rec
->n
>= 1, goto error
);
2150 if (up
->var
>= first
+ n
)
2151 base
= isl_upoly_var_pow(up
->ctx
, up
->var
, 1);
2153 base
= isl_upoly_copy(subs
[up
->var
- first
]);
2155 res
= isl_upoly_subs(isl_upoly_copy(rec
->p
[rec
->n
- 1]), first
, n
, subs
);
2156 for (i
= rec
->n
- 2; i
>= 0; --i
) {
2157 struct isl_upoly
*t
;
2158 t
= isl_upoly_subs(isl_upoly_copy(rec
->p
[i
]), first
, n
, subs
);
2159 res
= isl_upoly_mul(res
, isl_upoly_copy(base
));
2160 res
= isl_upoly_sum(res
, t
);
2163 isl_upoly_free(base
);
2172 __isl_give
struct isl_upoly
*isl_upoly_from_affine(isl_ctx
*ctx
, isl_int
*f
,
2173 isl_int denom
, unsigned len
)
2176 struct isl_upoly
*up
;
2178 isl_assert(ctx
, len
>= 1, return NULL
);
2180 up
= isl_upoly_rat_cst(ctx
, f
[0], denom
);
2181 for (i
= 0; i
< len
- 1; ++i
) {
2182 struct isl_upoly
*t
;
2183 struct isl_upoly
*c
;
2185 if (isl_int_is_zero(f
[1 + i
]))
2188 c
= isl_upoly_rat_cst(ctx
, f
[1 + i
], denom
);
2189 t
= isl_upoly_var_pow(ctx
, i
, 1);
2190 t
= isl_upoly_mul(c
, t
);
2191 up
= isl_upoly_sum(up
, t
);
2197 /* Remove common factor of non-constant terms and denominator.
2199 static void normalize_div(__isl_keep isl_qpolynomial
*qp
, int div
)
2201 isl_ctx
*ctx
= qp
->div
->ctx
;
2202 unsigned total
= qp
->div
->n_col
- 2;
2204 isl_seq_gcd(qp
->div
->row
[div
] + 2, total
, &ctx
->normalize_gcd
);
2205 isl_int_gcd(ctx
->normalize_gcd
,
2206 ctx
->normalize_gcd
, qp
->div
->row
[div
][0]);
2207 if (isl_int_is_one(ctx
->normalize_gcd
))
2210 isl_seq_scale_down(qp
->div
->row
[div
] + 2, qp
->div
->row
[div
] + 2,
2211 ctx
->normalize_gcd
, total
);
2212 isl_int_divexact(qp
->div
->row
[div
][0], qp
->div
->row
[div
][0],
2213 ctx
->normalize_gcd
);
2214 isl_int_fdiv_q(qp
->div
->row
[div
][1], qp
->div
->row
[div
][1],
2215 ctx
->normalize_gcd
);
2218 /* Replace the integer division identified by "div" by the polynomial "s".
2219 * The integer division is assumed not to appear in the definition
2220 * of any other integer divisions.
2222 static __isl_give isl_qpolynomial
*substitute_div(
2223 __isl_take isl_qpolynomial
*qp
,
2224 int div
, __isl_take
struct isl_upoly
*s
)
2233 qp
= isl_qpolynomial_cow(qp
);
2237 total
= isl_space_dim(qp
->dim
, isl_dim_all
);
2238 qp
->upoly
= isl_upoly_subs(qp
->upoly
, total
+ div
, 1, &s
);
2242 reordering
= isl_alloc_array(qp
->dim
->ctx
, int, total
+ qp
->div
->n_row
);
2245 for (i
= 0; i
< total
+ div
; ++i
)
2247 for (i
= total
+ div
+ 1; i
< total
+ qp
->div
->n_row
; ++i
)
2248 reordering
[i
] = i
- 1;
2249 qp
->div
= isl_mat_drop_rows(qp
->div
, div
, 1);
2250 qp
->div
= isl_mat_drop_cols(qp
->div
, 2 + total
+ div
, 1);
2251 qp
->upoly
= reorder(qp
->upoly
, reordering
);
2254 if (!qp
->upoly
|| !qp
->div
)
2260 isl_qpolynomial_free(qp
);
2265 /* Replace all integer divisions [e/d] that turn out to not actually be integer
2266 * divisions because d is equal to 1 by their definition, i.e., e.
2268 static __isl_give isl_qpolynomial
*substitute_non_divs(
2269 __isl_take isl_qpolynomial
*qp
)
2273 struct isl_upoly
*s
;
2278 total
= isl_space_dim(qp
->dim
, isl_dim_all
);
2279 for (i
= 0; qp
&& i
< qp
->div
->n_row
; ++i
) {
2280 if (!isl_int_is_one(qp
->div
->row
[i
][0]))
2282 for (j
= i
+ 1; j
< qp
->div
->n_row
; ++j
) {
2283 if (isl_int_is_zero(qp
->div
->row
[j
][2 + total
+ i
]))
2285 isl_seq_combine(qp
->div
->row
[j
] + 1,
2286 qp
->div
->ctx
->one
, qp
->div
->row
[j
] + 1,
2287 qp
->div
->row
[j
][2 + total
+ i
],
2288 qp
->div
->row
[i
] + 1, 1 + total
+ i
);
2289 isl_int_set_si(qp
->div
->row
[j
][2 + total
+ i
], 0);
2290 normalize_div(qp
, j
);
2292 s
= isl_upoly_from_affine(qp
->dim
->ctx
, qp
->div
->row
[i
] + 1,
2293 qp
->div
->row
[i
][0], qp
->div
->n_col
- 1);
2294 qp
= substitute_div(qp
, i
, s
);
2301 /* Reduce the coefficients of div "div" to lie in the interval [0, d-1],
2302 * with d the denominator. When replacing the coefficient e of x by
2303 * d * frac(e/d) = e - d * floor(e/d), we are subtracting d * floor(e/d) * x
2304 * inside the division, so we need to add floor(e/d) * x outside.
2305 * That is, we replace q by q' + floor(e/d) * x and we therefore need
2306 * to adjust the coefficient of x in each later div that depends on the
2307 * current div "div" and also in the affine expressions in the rows of "mat"
2308 * (if they too depend on "div").
2310 static void reduce_div(__isl_keep isl_qpolynomial
*qp
, int div
,
2311 __isl_keep isl_mat
**mat
)
2315 unsigned total
= qp
->div
->n_col
- qp
->div
->n_row
- 2;
2318 for (i
= 0; i
< 1 + total
+ div
; ++i
) {
2319 if (isl_int_is_nonneg(qp
->div
->row
[div
][1 + i
]) &&
2320 isl_int_lt(qp
->div
->row
[div
][1 + i
], qp
->div
->row
[div
][0]))
2322 isl_int_fdiv_q(v
, qp
->div
->row
[div
][1 + i
], qp
->div
->row
[div
][0]);
2323 isl_int_fdiv_r(qp
->div
->row
[div
][1 + i
],
2324 qp
->div
->row
[div
][1 + i
], qp
->div
->row
[div
][0]);
2325 *mat
= isl_mat_col_addmul(*mat
, i
, v
, 1 + total
+ div
);
2326 for (j
= div
+ 1; j
< qp
->div
->n_row
; ++j
) {
2327 if (isl_int_is_zero(qp
->div
->row
[j
][2 + total
+ div
]))
2329 isl_int_addmul(qp
->div
->row
[j
][1 + i
],
2330 v
, qp
->div
->row
[j
][2 + total
+ div
]);
2336 /* Check if the last non-zero coefficient is bigger that half of the
2337 * denominator. If so, we will invert the div to further reduce the number
2338 * of distinct divs that may appear.
2339 * If the last non-zero coefficient is exactly half the denominator,
2340 * then we continue looking for earlier coefficients that are bigger
2341 * than half the denominator.
2343 static int needs_invert(__isl_keep isl_mat
*div
, int row
)
2348 for (i
= div
->n_col
- 1; i
>= 1; --i
) {
2349 if (isl_int_is_zero(div
->row
[row
][i
]))
2351 isl_int_mul_ui(div
->row
[row
][i
], div
->row
[row
][i
], 2);
2352 cmp
= isl_int_cmp(div
->row
[row
][i
], div
->row
[row
][0]);
2353 isl_int_divexact_ui(div
->row
[row
][i
], div
->row
[row
][i
], 2);
2363 /* Replace div "div" q = [e/d] by -[(-e+(d-1))/d].
2364 * We only invert the coefficients of e (and the coefficient of q in
2365 * later divs and in the rows of "mat"). After calling this function, the
2366 * coefficients of e should be reduced again.
2368 static void invert_div(__isl_keep isl_qpolynomial
*qp
, int div
,
2369 __isl_keep isl_mat
**mat
)
2371 unsigned total
= qp
->div
->n_col
- qp
->div
->n_row
- 2;
2373 isl_seq_neg(qp
->div
->row
[div
] + 1,
2374 qp
->div
->row
[div
] + 1, qp
->div
->n_col
- 1);
2375 isl_int_sub_ui(qp
->div
->row
[div
][1], qp
->div
->row
[div
][1], 1);
2376 isl_int_add(qp
->div
->row
[div
][1],
2377 qp
->div
->row
[div
][1], qp
->div
->row
[div
][0]);
2378 *mat
= isl_mat_col_neg(*mat
, 1 + total
+ div
);
2379 isl_mat_col_mul(qp
->div
, 2 + total
+ div
,
2380 qp
->div
->ctx
->negone
, 2 + total
+ div
);
2383 /* Reduce all divs of "qp" to have coefficients
2384 * in the interval [0, d-1], with d the denominator and such that the
2385 * last non-zero coefficient that is not equal to d/2 is smaller than d/2.
2386 * The modifications to the integer divisions need to be reflected
2387 * in the factors of the polynomial that refer to the original
2388 * integer divisions. To this end, the modifications are collected
2389 * as a set of affine expressions and then plugged into the polynomial.
2391 * After the reduction, some divs may have become redundant or identical,
2392 * so we call substitute_non_divs and sort_divs. If these functions
2393 * eliminate divs or merge two or more divs into one, the coefficients
2394 * of the enclosing divs may have to be reduced again, so we call
2395 * ourselves recursively if the number of divs decreases.
2397 static __isl_give isl_qpolynomial
*reduce_divs(__isl_take isl_qpolynomial
*qp
)
2402 struct isl_upoly
**s
;
2403 unsigned o_div
, n_div
, total
;
2408 total
= isl_qpolynomial_domain_dim(qp
, isl_dim_all
);
2409 n_div
= isl_qpolynomial_domain_dim(qp
, isl_dim_div
);
2410 o_div
= isl_qpolynomial_domain_offset(qp
, isl_dim_div
);
2411 ctx
= isl_qpolynomial_get_ctx(qp
);
2412 mat
= isl_mat_zero(ctx
, n_div
, 1 + total
);
2414 for (i
= 0; i
< n_div
; ++i
)
2415 mat
= isl_mat_set_element_si(mat
, i
, o_div
+ i
, 1);
2417 for (i
= 0; i
< qp
->div
->n_row
; ++i
) {
2418 normalize_div(qp
, i
);
2419 reduce_div(qp
, i
, &mat
);
2420 if (needs_invert(qp
->div
, i
)) {
2421 invert_div(qp
, i
, &mat
);
2422 reduce_div(qp
, i
, &mat
);
2428 s
= isl_alloc_array(ctx
, struct isl_upoly
*, n_div
);
2431 for (i
= 0; i
< n_div
; ++i
)
2432 s
[i
] = isl_upoly_from_affine(ctx
, mat
->row
[i
], ctx
->one
,
2434 qp
->upoly
= isl_upoly_subs(qp
->upoly
, o_div
- 1, n_div
, s
);
2435 for (i
= 0; i
< n_div
; ++i
)
2436 isl_upoly_free(s
[i
]);
2443 qp
= substitute_non_divs(qp
);
2445 if (qp
&& isl_qpolynomial_domain_dim(qp
, isl_dim_div
) < n_div
)
2446 return reduce_divs(qp
);
2450 isl_qpolynomial_free(qp
);
2455 __isl_give isl_qpolynomial
*isl_qpolynomial_rat_cst_on_domain(
2456 __isl_take isl_space
*domain
, const isl_int n
, const isl_int d
)
2458 struct isl_qpolynomial
*qp
;
2459 struct isl_upoly_cst
*cst
;
2464 qp
= isl_qpolynomial_alloc(domain
, 0, isl_upoly_zero(domain
->ctx
));
2468 cst
= isl_upoly_as_cst(qp
->upoly
);
2469 isl_int_set(cst
->n
, n
);
2470 isl_int_set(cst
->d
, d
);
2475 /* Return an isl_qpolynomial that is equal to "val" on domain space "domain".
2477 __isl_give isl_qpolynomial
*isl_qpolynomial_val_on_domain(
2478 __isl_take isl_space
*domain
, __isl_take isl_val
*val
)
2480 isl_qpolynomial
*qp
;
2481 struct isl_upoly_cst
*cst
;
2483 if (!domain
|| !val
)
2486 qp
= isl_qpolynomial_alloc(isl_space_copy(domain
), 0,
2487 isl_upoly_zero(domain
->ctx
));
2491 cst
= isl_upoly_as_cst(qp
->upoly
);
2492 isl_int_set(cst
->n
, val
->n
);
2493 isl_int_set(cst
->d
, val
->d
);
2495 isl_space_free(domain
);
2499 isl_space_free(domain
);
2504 static int up_set_active(__isl_keep
struct isl_upoly
*up
, int *active
, int d
)
2506 struct isl_upoly_rec
*rec
;
2512 if (isl_upoly_is_cst(up
))
2516 active
[up
->var
] = 1;
2518 rec
= isl_upoly_as_rec(up
);
2519 for (i
= 0; i
< rec
->n
; ++i
)
2520 if (up_set_active(rec
->p
[i
], active
, d
) < 0)
2526 static int set_active(__isl_keep isl_qpolynomial
*qp
, int *active
)
2529 int d
= isl_space_dim(qp
->dim
, isl_dim_all
);
2534 for (i
= 0; i
< d
; ++i
)
2535 for (j
= 0; j
< qp
->div
->n_row
; ++j
) {
2536 if (isl_int_is_zero(qp
->div
->row
[j
][2 + i
]))
2542 return up_set_active(qp
->upoly
, active
, d
);
2545 isl_bool
isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial
*qp
,
2546 enum isl_dim_type type
, unsigned first
, unsigned n
)
2550 isl_bool involves
= isl_bool_false
;
2553 return isl_bool_error
;
2555 return isl_bool_false
;
2557 isl_assert(qp
->dim
->ctx
,
2558 first
+ n
<= isl_qpolynomial_dim(qp
, type
),
2559 return isl_bool_error
);
2560 isl_assert(qp
->dim
->ctx
, type
== isl_dim_param
||
2561 type
== isl_dim_in
, return isl_bool_error
);
2563 active
= isl_calloc_array(qp
->dim
->ctx
, int,
2564 isl_space_dim(qp
->dim
, isl_dim_all
));
2565 if (set_active(qp
, active
) < 0)
2568 if (type
== isl_dim_in
)
2569 first
+= isl_space_dim(qp
->dim
, isl_dim_param
);
2570 for (i
= 0; i
< n
; ++i
)
2571 if (active
[first
+ i
]) {
2572 involves
= isl_bool_true
;
2581 return isl_bool_error
;
2584 /* Remove divs that do not appear in the quasi-polynomial, nor in any
2585 * of the divs that do appear in the quasi-polynomial.
2587 static __isl_give isl_qpolynomial
*remove_redundant_divs(
2588 __isl_take isl_qpolynomial
*qp
)
2595 int *reordering
= NULL
;
2602 if (qp
->div
->n_row
== 0)
2605 d
= isl_space_dim(qp
->dim
, isl_dim_all
);
2606 len
= qp
->div
->n_col
- 2;
2607 ctx
= isl_qpolynomial_get_ctx(qp
);
2608 active
= isl_calloc_array(ctx
, int, len
);
2612 if (up_set_active(qp
->upoly
, active
, len
) < 0)
2615 for (i
= qp
->div
->n_row
- 1; i
>= 0; --i
) {
2616 if (!active
[d
+ i
]) {
2620 for (j
= 0; j
< i
; ++j
) {
2621 if (isl_int_is_zero(qp
->div
->row
[i
][2 + d
+ j
]))
2633 reordering
= isl_alloc_array(qp
->div
->ctx
, int, len
);
2637 for (i
= 0; i
< d
; ++i
)
2641 n_div
= qp
->div
->n_row
;
2642 for (i
= 0; i
< n_div
; ++i
) {
2643 if (!active
[d
+ i
]) {
2644 qp
->div
= isl_mat_drop_rows(qp
->div
, i
- skip
, 1);
2645 qp
->div
= isl_mat_drop_cols(qp
->div
,
2646 2 + d
+ i
- skip
, 1);
2649 reordering
[d
+ i
] = d
+ i
- skip
;
2652 qp
->upoly
= reorder(qp
->upoly
, reordering
);
2654 if (!qp
->upoly
|| !qp
->div
)
2664 isl_qpolynomial_free(qp
);
2668 __isl_give
struct isl_upoly
*isl_upoly_drop(__isl_take
struct isl_upoly
*up
,
2669 unsigned first
, unsigned n
)
2672 struct isl_upoly_rec
*rec
;
2676 if (n
== 0 || up
->var
< 0 || up
->var
< first
)
2678 if (up
->var
< first
+ n
) {
2679 up
= replace_by_constant_term(up
);
2680 return isl_upoly_drop(up
, first
, n
);
2682 up
= isl_upoly_cow(up
);
2686 rec
= isl_upoly_as_rec(up
);
2690 for (i
= 0; i
< rec
->n
; ++i
) {
2691 rec
->p
[i
] = isl_upoly_drop(rec
->p
[i
], first
, n
);
2702 __isl_give isl_qpolynomial
*isl_qpolynomial_set_dim_name(
2703 __isl_take isl_qpolynomial
*qp
,
2704 enum isl_dim_type type
, unsigned pos
, const char *s
)
2706 qp
= isl_qpolynomial_cow(qp
);
2709 if (type
== isl_dim_out
)
2710 isl_die(isl_qpolynomial_get_ctx(qp
), isl_error_invalid
,
2711 "cannot set name of output/set dimension",
2712 return isl_qpolynomial_free(qp
));
2713 if (type
== isl_dim_in
)
2715 qp
->dim
= isl_space_set_dim_name(qp
->dim
, type
, pos
, s
);
2720 isl_qpolynomial_free(qp
);
2724 __isl_give isl_qpolynomial
*isl_qpolynomial_drop_dims(
2725 __isl_take isl_qpolynomial
*qp
,
2726 enum isl_dim_type type
, unsigned first
, unsigned n
)
2730 if (type
== isl_dim_out
)
2731 isl_die(qp
->dim
->ctx
, isl_error_invalid
,
2732 "cannot drop output/set dimension",
2734 if (type
== isl_dim_in
)
2736 if (n
== 0 && !isl_space_is_named_or_nested(qp
->dim
, type
))
2739 qp
= isl_qpolynomial_cow(qp
);
2743 isl_assert(qp
->dim
->ctx
, first
+ n
<= isl_space_dim(qp
->dim
, type
),
2745 isl_assert(qp
->dim
->ctx
, type
== isl_dim_param
||
2746 type
== isl_dim_set
, goto error
);
2748 qp
->dim
= isl_space_drop_dims(qp
->dim
, type
, first
, n
);
2752 if (type
== isl_dim_set
)
2753 first
+= isl_space_dim(qp
->dim
, isl_dim_param
);
2755 qp
->div
= isl_mat_drop_cols(qp
->div
, 2 + first
, n
);
2759 qp
->upoly
= isl_upoly_drop(qp
->upoly
, first
, n
);
2765 isl_qpolynomial_free(qp
);
2769 /* Project the domain of the quasi-polynomial onto its parameter space.
2770 * The quasi-polynomial may not involve any of the domain dimensions.
2772 __isl_give isl_qpolynomial
*isl_qpolynomial_project_domain_on_params(
2773 __isl_take isl_qpolynomial
*qp
)
2779 n
= isl_qpolynomial_dim(qp
, isl_dim_in
);
2780 involves
= isl_qpolynomial_involves_dims(qp
, isl_dim_in
, 0, n
);
2782 return isl_qpolynomial_free(qp
);
2784 isl_die(isl_qpolynomial_get_ctx(qp
), isl_error_invalid
,
2785 "polynomial involves some of the domain dimensions",
2786 return isl_qpolynomial_free(qp
));
2787 qp
= isl_qpolynomial_drop_dims(qp
, isl_dim_in
, 0, n
);
2788 space
= isl_qpolynomial_get_domain_space(qp
);
2789 space
= isl_space_params(space
);
2790 qp
= isl_qpolynomial_reset_domain_space(qp
, space
);
2794 static __isl_give isl_qpolynomial
*isl_qpolynomial_substitute_equalities_lifted(
2795 __isl_take isl_qpolynomial
*qp
, __isl_take isl_basic_set
*eq
)
2801 struct isl_upoly
*up
;
2805 if (eq
->n_eq
== 0) {
2806 isl_basic_set_free(eq
);
2810 qp
= isl_qpolynomial_cow(qp
);
2813 qp
->div
= isl_mat_cow(qp
->div
);
2817 total
= 1 + isl_space_dim(eq
->dim
, isl_dim_all
);
2819 isl_int_init(denom
);
2820 for (i
= 0; i
< eq
->n_eq
; ++i
) {
2821 j
= isl_seq_last_non_zero(eq
->eq
[i
], total
+ n_div
);
2822 if (j
< 0 || j
== 0 || j
>= total
)
2825 for (k
= 0; k
< qp
->div
->n_row
; ++k
) {
2826 if (isl_int_is_zero(qp
->div
->row
[k
][1 + j
]))
2828 isl_seq_elim(qp
->div
->row
[k
] + 1, eq
->eq
[i
], j
, total
,
2829 &qp
->div
->row
[k
][0]);
2830 normalize_div(qp
, k
);
2833 if (isl_int_is_pos(eq
->eq
[i
][j
]))
2834 isl_seq_neg(eq
->eq
[i
], eq
->eq
[i
], total
);
2835 isl_int_abs(denom
, eq
->eq
[i
][j
]);
2836 isl_int_set_si(eq
->eq
[i
][j
], 0);
2838 up
= isl_upoly_from_affine(qp
->dim
->ctx
,
2839 eq
->eq
[i
], denom
, total
);
2840 qp
->upoly
= isl_upoly_subs(qp
->upoly
, j
- 1, 1, &up
);
2843 isl_int_clear(denom
);
2848 isl_basic_set_free(eq
);
2850 qp
= substitute_non_divs(qp
);
2855 isl_basic_set_free(eq
);
2856 isl_qpolynomial_free(qp
);
2860 /* Exploit the equalities in "eq" to simplify the quasi-polynomial.
2862 __isl_give isl_qpolynomial
*isl_qpolynomial_substitute_equalities(
2863 __isl_take isl_qpolynomial
*qp
, __isl_take isl_basic_set
*eq
)
2867 if (qp
->div
->n_row
> 0)
2868 eq
= isl_basic_set_add_dims(eq
, isl_dim_set
, qp
->div
->n_row
);
2869 return isl_qpolynomial_substitute_equalities_lifted(qp
, eq
);
2871 isl_basic_set_free(eq
);
2872 isl_qpolynomial_free(qp
);
2876 /* Look for equalities among the variables shared by context and qp
2877 * and the integer divisions of qp, if any.
2878 * The equalities are then used to eliminate variables and/or integer
2879 * divisions from qp.
2881 __isl_give isl_qpolynomial
*isl_qpolynomial_gist(
2882 __isl_take isl_qpolynomial
*qp
, __isl_take isl_set
*context
)
2884 isl_local_space
*ls
;
2887 ls
= isl_qpolynomial_get_domain_local_space(qp
);
2888 context
= isl_local_space_lift_set(ls
, context
);
2890 aff
= isl_set_affine_hull(context
);
2891 return isl_qpolynomial_substitute_equalities_lifted(qp
, aff
);
2894 __isl_give isl_qpolynomial
*isl_qpolynomial_gist_params(
2895 __isl_take isl_qpolynomial
*qp
, __isl_take isl_set
*context
)
2897 isl_space
*space
= isl_qpolynomial_get_domain_space(qp
);
2898 isl_set
*dom_context
= isl_set_universe(space
);
2899 dom_context
= isl_set_intersect_params(dom_context
, context
);
2900 return isl_qpolynomial_gist(qp
, dom_context
);
2903 __isl_give isl_pw_qpolynomial
*isl_pw_qpolynomial_from_qpolynomial(
2904 __isl_take isl_qpolynomial
*qp
)
2910 if (isl_qpolynomial_is_zero(qp
)) {
2911 isl_space
*dim
= isl_qpolynomial_get_space(qp
);
2912 isl_qpolynomial_free(qp
);
2913 return isl_pw_qpolynomial_zero(dim
);
2916 dom
= isl_set_universe(isl_qpolynomial_get_domain_space(qp
));
2917 return isl_pw_qpolynomial_alloc(dom
, qp
);
2920 #define isl_qpolynomial_involves_nan isl_qpolynomial_is_nan
2923 #define PW isl_pw_qpolynomial
2925 #define EL isl_qpolynomial
2927 #define EL_IS_ZERO is_zero
2931 #define IS_ZERO is_zero
2934 #undef DEFAULT_IS_ZERO
2935 #define DEFAULT_IS_ZERO 1
2939 #include <isl_pw_templ.c>
2940 #include <isl_pw_eval.c>
2943 #define BASE pw_qpolynomial
2945 #include <isl_union_single.c>
2946 #include <isl_union_eval.c>
2947 #include <isl_union_neg.c>
2949 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial
*pwqp
)
2957 if (!isl_set_plain_is_universe(pwqp
->p
[0].set
))
2960 return isl_qpolynomial_is_one(pwqp
->p
[0].qp
);
2963 __isl_give isl_pw_qpolynomial
*isl_pw_qpolynomial_add(
2964 __isl_take isl_pw_qpolynomial
*pwqp1
,
2965 __isl_take isl_pw_qpolynomial
*pwqp2
)
2967 return isl_pw_qpolynomial_union_add_(pwqp1
, pwqp2
);
2970 __isl_give isl_pw_qpolynomial
*isl_pw_qpolynomial_mul(
2971 __isl_take isl_pw_qpolynomial
*pwqp1
,
2972 __isl_take isl_pw_qpolynomial
*pwqp2
)
2975 struct isl_pw_qpolynomial
*res
;
2977 if (!pwqp1
|| !pwqp2
)
2980 isl_assert(pwqp1
->dim
->ctx
, isl_space_is_equal(pwqp1
->dim
, pwqp2
->dim
),
2983 if (isl_pw_qpolynomial_is_zero(pwqp1
)) {
2984 isl_pw_qpolynomial_free(pwqp2
);
2988 if (isl_pw_qpolynomial_is_zero(pwqp2
)) {
2989 isl_pw_qpolynomial_free(pwqp1
);
2993 if (isl_pw_qpolynomial_is_one(pwqp1
)) {
2994 isl_pw_qpolynomial_free(pwqp1
);
2998 if (isl_pw_qpolynomial_is_one(pwqp2
)) {
2999 isl_pw_qpolynomial_free(pwqp2
);
3003 n
= pwqp1
->n
* pwqp2
->n
;
3004 res
= isl_pw_qpolynomial_alloc_size(isl_space_copy(pwqp1
->dim
), n
);
3006 for (i
= 0; i
< pwqp1
->n
; ++i
) {
3007 for (j
= 0; j
< pwqp2
->n
; ++j
) {
3008 struct isl_set
*common
;
3009 struct isl_qpolynomial
*prod
;
3010 common
= isl_set_intersect(isl_set_copy(pwqp1
->p
[i
].set
),
3011 isl_set_copy(pwqp2
->p
[j
].set
));
3012 if (isl_set_plain_is_empty(common
)) {
3013 isl_set_free(common
);
3017 prod
= isl_qpolynomial_mul(
3018 isl_qpolynomial_copy(pwqp1
->p
[i
].qp
),
3019 isl_qpolynomial_copy(pwqp2
->p
[j
].qp
));
3021 res
= isl_pw_qpolynomial_add_piece(res
, common
, prod
);
3025 isl_pw_qpolynomial_free(pwqp1
);
3026 isl_pw_qpolynomial_free(pwqp2
);
3030 isl_pw_qpolynomial_free(pwqp1
);
3031 isl_pw_qpolynomial_free(pwqp2
);
3035 __isl_give isl_val
*isl_upoly_eval(__isl_take
struct isl_upoly
*up
,
3036 __isl_take isl_vec
*vec
)
3039 struct isl_upoly_rec
*rec
;
3043 if (isl_upoly_is_cst(up
)) {
3045 res
= isl_upoly_get_constant_val(up
);
3050 rec
= isl_upoly_as_rec(up
);
3054 isl_assert(up
->ctx
, rec
->n
>= 1, goto error
);
3056 base
= isl_val_rat_from_isl_int(up
->ctx
,
3057 vec
->el
[1 + up
->var
], vec
->el
[0]);
3059 res
= isl_upoly_eval(isl_upoly_copy(rec
->p
[rec
->n
- 1]),
3062 for (i
= rec
->n
- 2; i
>= 0; --i
) {
3063 res
= isl_val_mul(res
, isl_val_copy(base
));
3064 res
= isl_val_add(res
,
3065 isl_upoly_eval(isl_upoly_copy(rec
->p
[i
]),
3066 isl_vec_copy(vec
)));
3079 /* Evaluate "qp" in the void point "pnt".
3080 * In particular, return the value NaN.
3082 static __isl_give isl_val
*eval_void(__isl_take isl_qpolynomial
*qp
,
3083 __isl_take isl_point
*pnt
)
3087 ctx
= isl_point_get_ctx(pnt
);
3088 isl_qpolynomial_free(qp
);
3089 isl_point_free(pnt
);
3090 return isl_val_nan(ctx
);
3093 __isl_give isl_val
*isl_qpolynomial_eval(__isl_take isl_qpolynomial
*qp
,
3094 __isl_take isl_point
*pnt
)
3102 isl_assert(pnt
->dim
->ctx
, isl_space_is_equal(pnt
->dim
, qp
->dim
), goto error
);
3103 is_void
= isl_point_is_void(pnt
);
3107 return eval_void(qp
, pnt
);
3109 ext
= isl_local_extend_point_vec(qp
->div
, isl_vec_copy(pnt
->vec
));
3111 v
= isl_upoly_eval(isl_upoly_copy(qp
->upoly
), ext
);
3113 isl_qpolynomial_free(qp
);
3114 isl_point_free(pnt
);
3118 isl_qpolynomial_free(qp
);
3119 isl_point_free(pnt
);
3123 int isl_upoly_cmp(__isl_keep
struct isl_upoly_cst
*cst1
,
3124 __isl_keep
struct isl_upoly_cst
*cst2
)
3129 isl_int_mul(t
, cst1
->n
, cst2
->d
);
3130 isl_int_submul(t
, cst2
->n
, cst1
->d
);
3131 cmp
= isl_int_sgn(t
);
3136 __isl_give isl_qpolynomial
*isl_qpolynomial_insert_dims(
3137 __isl_take isl_qpolynomial
*qp
, enum isl_dim_type type
,
3138 unsigned first
, unsigned n
)
3146 if (type
== isl_dim_out
)
3147 isl_die(qp
->div
->ctx
, isl_error_invalid
,
3148 "cannot insert output/set dimensions",
3150 if (type
== isl_dim_in
)
3152 if (n
== 0 && !isl_space_is_named_or_nested(qp
->dim
, type
))
3155 qp
= isl_qpolynomial_cow(qp
);
3159 isl_assert(qp
->div
->ctx
, first
<= isl_space_dim(qp
->dim
, type
),
3162 g_pos
= pos(qp
->dim
, type
) + first
;
3164 qp
->div
= isl_mat_insert_zero_cols(qp
->div
, 2 + g_pos
, n
);
3168 total
= qp
->div
->n_col
- 2;
3169 if (total
> g_pos
) {
3171 exp
= isl_alloc_array(qp
->div
->ctx
, int, total
- g_pos
);
3174 for (i
= 0; i
< total
- g_pos
; ++i
)
3176 qp
->upoly
= expand(qp
->upoly
, exp
, g_pos
);
3182 qp
->dim
= isl_space_insert_dims(qp
->dim
, type
, first
, n
);
3188 isl_qpolynomial_free(qp
);
3192 __isl_give isl_qpolynomial
*isl_qpolynomial_add_dims(
3193 __isl_take isl_qpolynomial
*qp
, enum isl_dim_type type
, unsigned n
)
3197 pos
= isl_qpolynomial_dim(qp
, type
);
3199 return isl_qpolynomial_insert_dims(qp
, type
, pos
, n
);
3202 __isl_give isl_pw_qpolynomial
*isl_pw_qpolynomial_add_dims(
3203 __isl_take isl_pw_qpolynomial
*pwqp
,
3204 enum isl_dim_type type
, unsigned n
)
3208 pos
= isl_pw_qpolynomial_dim(pwqp
, type
);
3210 return isl_pw_qpolynomial_insert_dims(pwqp
, type
, pos
, n
);
3213 static int *reordering_move(isl_ctx
*ctx
,
3214 unsigned len
, unsigned dst
, unsigned src
, unsigned n
)
3219 reordering
= isl_alloc_array(ctx
, int, len
);
3224 for (i
= 0; i
< dst
; ++i
)
3226 for (i
= 0; i
< n
; ++i
)
3227 reordering
[src
+ i
] = dst
+ i
;
3228 for (i
= 0; i
< src
- dst
; ++i
)
3229 reordering
[dst
+ i
] = dst
+ n
+ i
;
3230 for (i
= 0; i
< len
- src
- n
; ++i
)
3231 reordering
[src
+ n
+ i
] = src
+ n
+ i
;
3233 for (i
= 0; i
< src
; ++i
)
3235 for (i
= 0; i
< n
; ++i
)
3236 reordering
[src
+ i
] = dst
+ i
;
3237 for (i
= 0; i
< dst
- src
; ++i
)
3238 reordering
[src
+ n
+ i
] = src
+ i
;
3239 for (i
= 0; i
< len
- dst
- n
; ++i
)
3240 reordering
[dst
+ n
+ i
] = dst
+ n
+ i
;
3246 __isl_give isl_qpolynomial
*isl_qpolynomial_move_dims(
3247 __isl_take isl_qpolynomial
*qp
,
3248 enum isl_dim_type dst_type
, unsigned dst_pos
,
3249 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3258 if (dst_type
== isl_dim_out
|| src_type
== isl_dim_out
)
3259 isl_die(qp
->dim
->ctx
, isl_error_invalid
,
3260 "cannot move output/set dimension",
3262 if (dst_type
== isl_dim_in
)
3263 dst_type
= isl_dim_set
;
3264 if (src_type
== isl_dim_in
)
3265 src_type
= isl_dim_set
;
3268 !isl_space_is_named_or_nested(qp
->dim
, src_type
) &&
3269 !isl_space_is_named_or_nested(qp
->dim
, dst_type
))
3272 qp
= isl_qpolynomial_cow(qp
);
3276 isl_assert(qp
->dim
->ctx
, src_pos
+ n
<= isl_space_dim(qp
->dim
, src_type
),
3279 g_dst_pos
= pos(qp
->dim
, dst_type
) + dst_pos
;
3280 g_src_pos
= pos(qp
->dim
, src_type
) + src_pos
;
3281 if (dst_type
> src_type
)
3284 qp
->div
= isl_mat_move_cols(qp
->div
, 2 + g_dst_pos
, 2 + g_src_pos
, n
);
3291 reordering
= reordering_move(qp
->dim
->ctx
,
3292 qp
->div
->n_col
- 2, g_dst_pos
, g_src_pos
, n
);
3296 qp
->upoly
= reorder(qp
->upoly
, reordering
);
3301 qp
->dim
= isl_space_move_dims(qp
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3307 isl_qpolynomial_free(qp
);
3311 __isl_give isl_qpolynomial
*isl_qpolynomial_from_affine(
3312 __isl_take isl_space
*space
, isl_int
*f
, isl_int denom
)
3314 struct isl_upoly
*up
;
3316 space
= isl_space_domain(space
);
3320 up
= isl_upoly_from_affine(space
->ctx
, f
, denom
,
3321 1 + isl_space_dim(space
, isl_dim_all
));
3323 return isl_qpolynomial_alloc(space
, 0, up
);
3326 __isl_give isl_qpolynomial
*isl_qpolynomial_from_aff(__isl_take isl_aff
*aff
)
3329 struct isl_upoly
*up
;
3330 isl_qpolynomial
*qp
;
3335 ctx
= isl_aff_get_ctx(aff
);
3336 up
= isl_upoly_from_affine(ctx
, aff
->v
->el
+ 1, aff
->v
->el
[0],
3339 qp
= isl_qpolynomial_alloc(isl_aff_get_domain_space(aff
),
3340 aff
->ls
->div
->n_row
, up
);
3344 isl_mat_free(qp
->div
);
3345 qp
->div
= isl_mat_copy(aff
->ls
->div
);
3346 qp
->div
= isl_mat_cow(qp
->div
);
3351 qp
= reduce_divs(qp
);
3352 qp
= remove_redundant_divs(qp
);
3356 return isl_qpolynomial_free(qp
);
3359 __isl_give isl_pw_qpolynomial
*isl_pw_qpolynomial_from_pw_aff(
3360 __isl_take isl_pw_aff
*pwaff
)
3363 isl_pw_qpolynomial
*pwqp
;
3368 pwqp
= isl_pw_qpolynomial_alloc_size(isl_pw_aff_get_space(pwaff
),
3371 for (i
= 0; i
< pwaff
->n
; ++i
) {
3373 isl_qpolynomial
*qp
;
3375 dom
= isl_set_copy(pwaff
->p
[i
].set
);
3376 qp
= isl_qpolynomial_from_aff(isl_aff_copy(pwaff
->p
[i
].aff
));
3377 pwqp
= isl_pw_qpolynomial_add_piece(pwqp
, dom
, qp
);
3380 isl_pw_aff_free(pwaff
);
3384 __isl_give isl_qpolynomial
*isl_qpolynomial_from_constraint(
3385 __isl_take isl_constraint
*c
, enum isl_dim_type type
, unsigned pos
)
3389 aff
= isl_constraint_get_bound(c
, type
, pos
);
3390 isl_constraint_free(c
);
3391 return isl_qpolynomial_from_aff(aff
);
3394 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
3395 * in "qp" by subs[i].
3397 __isl_give isl_qpolynomial
*isl_qpolynomial_substitute(
3398 __isl_take isl_qpolynomial
*qp
,
3399 enum isl_dim_type type
, unsigned first
, unsigned n
,
3400 __isl_keep isl_qpolynomial
**subs
)
3403 struct isl_upoly
**ups
;
3408 qp
= isl_qpolynomial_cow(qp
);
3412 if (type
== isl_dim_out
)
3413 isl_die(qp
->dim
->ctx
, isl_error_invalid
,
3414 "cannot substitute output/set dimension",
3416 if (type
== isl_dim_in
)
3419 for (i
= 0; i
< n
; ++i
)
3423 isl_assert(qp
->dim
->ctx
, first
+ n
<= isl_space_dim(qp
->dim
, type
),
3426 for (i
= 0; i
< n
; ++i
)
3427 isl_assert(qp
->dim
->ctx
, isl_space_is_equal(qp
->dim
, subs
[i
]->dim
),
3430 isl_assert(qp
->dim
->ctx
, qp
->div
->n_row
== 0, goto error
);
3431 for (i
= 0; i
< n
; ++i
)
3432 isl_assert(qp
->dim
->ctx
, subs
[i
]->div
->n_row
== 0, goto error
);
3434 first
+= pos(qp
->dim
, type
);
3436 ups
= isl_alloc_array(qp
->dim
->ctx
, struct isl_upoly
*, n
);
3439 for (i
= 0; i
< n
; ++i
)
3440 ups
[i
] = subs
[i
]->upoly
;
3442 qp
->upoly
= isl_upoly_subs(qp
->upoly
, first
, n
, ups
);
3451 isl_qpolynomial_free(qp
);
3455 /* Extend "bset" with extra set dimensions for each integer division
3456 * in "qp" and then call "fn" with the extended bset and the polynomial
3457 * that results from replacing each of the integer divisions by the
3458 * corresponding extra set dimension.
3460 isl_stat
isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial
*qp
,
3461 __isl_keep isl_basic_set
*bset
,
3462 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
,
3463 __isl_take isl_qpolynomial
*poly
, void *user
), void *user
)
3466 isl_local_space
*ls
;
3467 isl_qpolynomial
*poly
;
3470 return isl_stat_error
;
3471 if (qp
->div
->n_row
== 0)
3472 return fn(isl_basic_set_copy(bset
), isl_qpolynomial_copy(qp
),
3475 space
= isl_space_copy(qp
->dim
);
3476 space
= isl_space_add_dims(space
, isl_dim_set
, qp
->div
->n_row
);
3477 poly
= isl_qpolynomial_alloc(space
, 0, isl_upoly_copy(qp
->upoly
));
3478 bset
= isl_basic_set_copy(bset
);
3479 ls
= isl_qpolynomial_get_domain_local_space(qp
);
3480 bset
= isl_local_space_lift_basic_set(ls
, bset
);
3482 return fn(bset
, poly
, user
);
3485 /* Return total degree in variables first (inclusive) up to last (exclusive).
3487 int isl_upoly_degree(__isl_keep
struct isl_upoly
*up
, int first
, int last
)
3491 struct isl_upoly_rec
*rec
;
3495 if (isl_upoly_is_zero(up
))
3497 if (isl_upoly_is_cst(up
) || up
->var
< first
)
3500 rec
= isl_upoly_as_rec(up
);
3504 for (i
= 0; i
< rec
->n
; ++i
) {
3507 if (isl_upoly_is_zero(rec
->p
[i
]))
3509 d
= isl_upoly_degree(rec
->p
[i
], first
, last
);
3519 /* Return total degree in set variables.
3521 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial
*poly
)
3529 ovar
= isl_space_offset(poly
->dim
, isl_dim_set
);
3530 nvar
= isl_space_dim(poly
->dim
, isl_dim_set
);
3531 return isl_upoly_degree(poly
->upoly
, ovar
, ovar
+ nvar
);
3534 __isl_give
struct isl_upoly
*isl_upoly_coeff(__isl_keep
struct isl_upoly
*up
,
3535 unsigned pos
, int deg
)
3538 struct isl_upoly_rec
*rec
;
3543 if (isl_upoly_is_cst(up
) || up
->var
< pos
) {
3545 return isl_upoly_copy(up
);
3547 return isl_upoly_zero(up
->ctx
);
3550 rec
= isl_upoly_as_rec(up
);
3554 if (up
->var
== pos
) {
3556 return isl_upoly_copy(rec
->p
[deg
]);
3558 return isl_upoly_zero(up
->ctx
);
3561 up
= isl_upoly_copy(up
);
3562 up
= isl_upoly_cow(up
);
3563 rec
= isl_upoly_as_rec(up
);
3567 for (i
= 0; i
< rec
->n
; ++i
) {
3568 struct isl_upoly
*t
;
3569 t
= isl_upoly_coeff(rec
->p
[i
], pos
, deg
);
3572 isl_upoly_free(rec
->p
[i
]);
3582 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
3584 __isl_give isl_qpolynomial
*isl_qpolynomial_coeff(
3585 __isl_keep isl_qpolynomial
*qp
,
3586 enum isl_dim_type type
, unsigned t_pos
, int deg
)
3589 struct isl_upoly
*up
;
3595 if (type
== isl_dim_out
)
3596 isl_die(qp
->div
->ctx
, isl_error_invalid
,
3597 "output/set dimension does not have a coefficient",
3599 if (type
== isl_dim_in
)
3602 isl_assert(qp
->div
->ctx
, t_pos
< isl_space_dim(qp
->dim
, type
),
3605 g_pos
= pos(qp
->dim
, type
) + t_pos
;
3606 up
= isl_upoly_coeff(qp
->upoly
, g_pos
, deg
);
3608 c
= isl_qpolynomial_alloc(isl_space_copy(qp
->dim
), qp
->div
->n_row
, up
);
3611 isl_mat_free(c
->div
);
3612 c
->div
= isl_mat_copy(qp
->div
);
3617 isl_qpolynomial_free(c
);
3621 /* Homogenize the polynomial in the variables first (inclusive) up to
3622 * last (exclusive) by inserting powers of variable first.
3623 * Variable first is assumed not to appear in the input.
3625 __isl_give
struct isl_upoly
*isl_upoly_homogenize(
3626 __isl_take
struct isl_upoly
*up
, int deg
, int target
,
3627 int first
, int last
)
3630 struct isl_upoly_rec
*rec
;
3634 if (isl_upoly_is_zero(up
))
3638 if (isl_upoly_is_cst(up
) || up
->var
< first
) {
3639 struct isl_upoly
*hom
;
3641 hom
= isl_upoly_var_pow(up
->ctx
, first
, target
- deg
);
3644 rec
= isl_upoly_as_rec(hom
);
3645 rec
->p
[target
- deg
] = isl_upoly_mul(rec
->p
[target
- deg
], up
);
3650 up
= isl_upoly_cow(up
);
3651 rec
= isl_upoly_as_rec(up
);
3655 for (i
= 0; i
< rec
->n
; ++i
) {
3656 if (isl_upoly_is_zero(rec
->p
[i
]))
3658 rec
->p
[i
] = isl_upoly_homogenize(rec
->p
[i
],
3659 up
->var
< last
? deg
+ i
: i
, target
,
3671 /* Homogenize the polynomial in the set variables by introducing
3672 * powers of an extra set variable at position 0.
3674 __isl_give isl_qpolynomial
*isl_qpolynomial_homogenize(
3675 __isl_take isl_qpolynomial
*poly
)
3679 int deg
= isl_qpolynomial_degree(poly
);
3684 poly
= isl_qpolynomial_insert_dims(poly
, isl_dim_in
, 0, 1);
3685 poly
= isl_qpolynomial_cow(poly
);
3689 ovar
= isl_space_offset(poly
->dim
, isl_dim_set
);
3690 nvar
= isl_space_dim(poly
->dim
, isl_dim_set
);
3691 poly
->upoly
= isl_upoly_homogenize(poly
->upoly
, 0, deg
,
3698 isl_qpolynomial_free(poly
);
3702 __isl_give isl_term
*isl_term_alloc(__isl_take isl_space
*space
,
3703 __isl_take isl_mat
*div
)
3711 n
= isl_space_dim(space
, isl_dim_all
) + div
->n_row
;
3713 term
= isl_calloc(space
->ctx
, struct isl_term
,
3714 sizeof(struct isl_term
) + (n
- 1) * sizeof(int));
3721 isl_int_init(term
->n
);
3722 isl_int_init(term
->d
);
3726 isl_space_free(space
);
3731 __isl_give isl_term
*isl_term_copy(__isl_keep isl_term
*term
)
3740 __isl_give isl_term
*isl_term_dup(__isl_keep isl_term
*term
)
3749 total
= isl_space_dim(term
->dim
, isl_dim_all
) + term
->div
->n_row
;
3751 dup
= isl_term_alloc(isl_space_copy(term
->dim
), isl_mat_copy(term
->div
));
3755 isl_int_set(dup
->n
, term
->n
);
3756 isl_int_set(dup
->d
, term
->d
);
3758 for (i
= 0; i
< total
; ++i
)
3759 dup
->pow
[i
] = term
->pow
[i
];
3764 __isl_give isl_term
*isl_term_cow(__isl_take isl_term
*term
)
3772 return isl_term_dup(term
);
3775 __isl_null isl_term
*isl_term_free(__isl_take isl_term
*term
)
3780 if (--term
->ref
> 0)
3783 isl_space_free(term
->dim
);
3784 isl_mat_free(term
->div
);
3785 isl_int_clear(term
->n
);
3786 isl_int_clear(term
->d
);
3792 unsigned isl_term_dim(__isl_keep isl_term
*term
, enum isl_dim_type type
)
3800 case isl_dim_out
: return isl_space_dim(term
->dim
, type
);
3801 case isl_dim_div
: return term
->div
->n_row
;
3802 case isl_dim_all
: return isl_space_dim(term
->dim
, isl_dim_all
) +
3808 isl_ctx
*isl_term_get_ctx(__isl_keep isl_term
*term
)
3810 return term
? term
->dim
->ctx
: NULL
;
3813 void isl_term_get_num(__isl_keep isl_term
*term
, isl_int
*n
)
3817 isl_int_set(*n
, term
->n
);
3820 /* Return the coefficient of the term "term".
3822 __isl_give isl_val
*isl_term_get_coefficient_val(__isl_keep isl_term
*term
)
3827 return isl_val_rat_from_isl_int(isl_term_get_ctx(term
),
3831 int isl_term_get_exp(__isl_keep isl_term
*term
,
3832 enum isl_dim_type type
, unsigned pos
)
3837 isl_assert(term
->dim
->ctx
, pos
< isl_term_dim(term
, type
), return -1);
3839 if (type
>= isl_dim_set
)
3840 pos
+= isl_space_dim(term
->dim
, isl_dim_param
);
3841 if (type
>= isl_dim_div
)
3842 pos
+= isl_space_dim(term
->dim
, isl_dim_set
);
3844 return term
->pow
[pos
];
3847 __isl_give isl_aff
*isl_term_get_div(__isl_keep isl_term
*term
, unsigned pos
)
3849 isl_local_space
*ls
;
3855 isl_assert(term
->dim
->ctx
, pos
< isl_term_dim(term
, isl_dim_div
),
3858 ls
= isl_local_space_alloc_div(isl_space_copy(term
->dim
),
3859 isl_mat_copy(term
->div
));
3860 aff
= isl_aff_alloc(ls
);
3864 isl_seq_cpy(aff
->v
->el
, term
->div
->row
[pos
], aff
->v
->size
);
3866 aff
= isl_aff_normalize(aff
);
3871 __isl_give isl_term
*isl_upoly_foreach_term(__isl_keep
struct isl_upoly
*up
,
3872 isl_stat (*fn
)(__isl_take isl_term
*term
, void *user
),
3873 __isl_take isl_term
*term
, void *user
)
3876 struct isl_upoly_rec
*rec
;
3881 if (isl_upoly_is_zero(up
))
3884 isl_assert(up
->ctx
, !isl_upoly_is_nan(up
), goto error
);
3885 isl_assert(up
->ctx
, !isl_upoly_is_infty(up
), goto error
);
3886 isl_assert(up
->ctx
, !isl_upoly_is_neginfty(up
), goto error
);
3888 if (isl_upoly_is_cst(up
)) {
3889 struct isl_upoly_cst
*cst
;
3890 cst
= isl_upoly_as_cst(up
);
3893 term
= isl_term_cow(term
);
3896 isl_int_set(term
->n
, cst
->n
);
3897 isl_int_set(term
->d
, cst
->d
);
3898 if (fn(isl_term_copy(term
), user
) < 0)
3903 rec
= isl_upoly_as_rec(up
);
3907 for (i
= 0; i
< rec
->n
; ++i
) {
3908 term
= isl_term_cow(term
);
3911 term
->pow
[up
->var
] = i
;
3912 term
= isl_upoly_foreach_term(rec
->p
[i
], fn
, term
, user
);
3916 term
->pow
[up
->var
] = 0;
3920 isl_term_free(term
);
3924 isl_stat
isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial
*qp
,
3925 isl_stat (*fn
)(__isl_take isl_term
*term
, void *user
), void *user
)
3930 return isl_stat_error
;
3932 term
= isl_term_alloc(isl_space_copy(qp
->dim
), isl_mat_copy(qp
->div
));
3934 return isl_stat_error
;
3936 term
= isl_upoly_foreach_term(qp
->upoly
, fn
, term
, user
);
3938 isl_term_free(term
);
3940 return term
? isl_stat_ok
: isl_stat_error
;
3943 __isl_give isl_qpolynomial
*isl_qpolynomial_from_term(__isl_take isl_term
*term
)
3945 struct isl_upoly
*up
;
3946 isl_qpolynomial
*qp
;
3952 n
= isl_space_dim(term
->dim
, isl_dim_all
) + term
->div
->n_row
;
3954 up
= isl_upoly_rat_cst(term
->dim
->ctx
, term
->n
, term
->d
);
3955 for (i
= 0; i
< n
; ++i
) {
3958 up
= isl_upoly_mul(up
,
3959 isl_upoly_var_pow(term
->dim
->ctx
, i
, term
->pow
[i
]));
3962 qp
= isl_qpolynomial_alloc(isl_space_copy(term
->dim
), term
->div
->n_row
, up
);
3965 isl_mat_free(qp
->div
);
3966 qp
->div
= isl_mat_copy(term
->div
);
3970 isl_term_free(term
);
3973 isl_qpolynomial_free(qp
);
3974 isl_term_free(term
);
3978 __isl_give isl_qpolynomial
*isl_qpolynomial_lift(__isl_take isl_qpolynomial
*qp
,
3979 __isl_take isl_space
*space
)
3988 if (isl_space_is_equal(qp
->dim
, space
)) {
3989 isl_space_free(space
);
3993 qp
= isl_qpolynomial_cow(qp
);
3997 extra
= isl_space_dim(space
, isl_dim_set
) -
3998 isl_space_dim(qp
->dim
, isl_dim_set
);
3999 total
= isl_space_dim(qp
->dim
, isl_dim_all
);
4000 if (qp
->div
->n_row
) {
4003 exp
= isl_alloc_array(qp
->div
->ctx
, int, qp
->div
->n_row
);
4006 for (i
= 0; i
< qp
->div
->n_row
; ++i
)
4008 qp
->upoly
= expand(qp
->upoly
, exp
, total
);
4013 qp
->div
= isl_mat_insert_cols(qp
->div
, 2 + total
, extra
);
4016 for (i
= 0; i
< qp
->div
->n_row
; ++i
)
4017 isl_seq_clr(qp
->div
->row
[i
] + 2 + total
, extra
);
4019 isl_space_free(qp
->dim
);
4024 isl_space_free(space
);
4025 isl_qpolynomial_free(qp
);
4029 /* For each parameter or variable that does not appear in qp,
4030 * first eliminate the variable from all constraints and then set it to zero.
4032 static __isl_give isl_set
*fix_inactive(__isl_take isl_set
*set
,
4033 __isl_keep isl_qpolynomial
*qp
)
4044 d
= isl_space_dim(set
->dim
, isl_dim_all
);
4045 active
= isl_calloc_array(set
->ctx
, int, d
);
4046 if (set_active(qp
, active
) < 0)
4049 for (i
= 0; i
< d
; ++i
)
4058 nparam
= isl_space_dim(set
->dim
, isl_dim_param
);
4059 nvar
= isl_space_dim(set
->dim
, isl_dim_set
);
4060 for (i
= 0; i
< nparam
; ++i
) {
4063 set
= isl_set_eliminate(set
, isl_dim_param
, i
, 1);
4064 set
= isl_set_fix_si(set
, isl_dim_param
, i
, 0);
4066 for (i
= 0; i
< nvar
; ++i
) {
4067 if (active
[nparam
+ i
])
4069 set
= isl_set_eliminate(set
, isl_dim_set
, i
, 1);
4070 set
= isl_set_fix_si(set
, isl_dim_set
, i
, 0);
4082 struct isl_opt_data
{
4083 isl_qpolynomial
*qp
;
4089 static isl_stat
opt_fn(__isl_take isl_point
*pnt
, void *user
)
4091 struct isl_opt_data
*data
= (struct isl_opt_data
*)user
;
4094 val
= isl_qpolynomial_eval(isl_qpolynomial_copy(data
->qp
), pnt
);
4098 } else if (data
->max
) {
4099 data
->opt
= isl_val_max(data
->opt
, val
);
4101 data
->opt
= isl_val_min(data
->opt
, val
);
4107 __isl_give isl_val
*isl_qpolynomial_opt_on_domain(
4108 __isl_take isl_qpolynomial
*qp
, __isl_take isl_set
*set
, int max
)
4110 struct isl_opt_data data
= { NULL
, 1, NULL
, max
};
4115 if (isl_upoly_is_cst(qp
->upoly
)) {
4117 data
.opt
= isl_qpolynomial_get_constant_val(qp
);
4118 isl_qpolynomial_free(qp
);
4122 set
= fix_inactive(set
, qp
);
4125 if (isl_set_foreach_point(set
, opt_fn
, &data
) < 0)
4129 data
.opt
= isl_val_zero(isl_set_get_ctx(set
));
4132 isl_qpolynomial_free(qp
);
4136 isl_qpolynomial_free(qp
);
4137 isl_val_free(data
.opt
);
4141 __isl_give isl_qpolynomial
*isl_qpolynomial_morph_domain(
4142 __isl_take isl_qpolynomial
*qp
, __isl_take isl_morph
*morph
)
4147 struct isl_upoly
**subs
;
4148 isl_mat
*mat
, *diag
;
4150 qp
= isl_qpolynomial_cow(qp
);
4155 isl_assert(ctx
, isl_space_is_equal(qp
->dim
, morph
->dom
->dim
), goto error
);
4157 n_sub
= morph
->inv
->n_row
- 1;
4158 if (morph
->inv
->n_row
!= morph
->inv
->n_col
)
4159 n_sub
+= qp
->div
->n_row
;
4160 subs
= isl_calloc_array(ctx
, struct isl_upoly
*, n_sub
);
4164 for (i
= 0; 1 + i
< morph
->inv
->n_row
; ++i
)
4165 subs
[i
] = isl_upoly_from_affine(ctx
, morph
->inv
->row
[1 + i
],
4166 morph
->inv
->row
[0][0], morph
->inv
->n_col
);
4167 if (morph
->inv
->n_row
!= morph
->inv
->n_col
)
4168 for (i
= 0; i
< qp
->div
->n_row
; ++i
)
4169 subs
[morph
->inv
->n_row
- 1 + i
] =
4170 isl_upoly_var_pow(ctx
, morph
->inv
->n_col
- 1 + i
, 1);
4172 qp
->upoly
= isl_upoly_subs(qp
->upoly
, 0, n_sub
, subs
);
4174 for (i
= 0; i
< n_sub
; ++i
)
4175 isl_upoly_free(subs
[i
]);
4178 diag
= isl_mat_diag(ctx
, 1, morph
->inv
->row
[0][0]);
4179 mat
= isl_mat_diagonal(diag
, isl_mat_copy(morph
->inv
));
4180 diag
= isl_mat_diag(ctx
, qp
->div
->n_row
, morph
->inv
->row
[0][0]);
4181 mat
= isl_mat_diagonal(mat
, diag
);
4182 qp
->div
= isl_mat_product(qp
->div
, mat
);
4183 isl_space_free(qp
->dim
);
4184 qp
->dim
= isl_space_copy(morph
->ran
->dim
);
4186 if (!qp
->upoly
|| !qp
->div
|| !qp
->dim
)
4189 isl_morph_free(morph
);
4193 isl_qpolynomial_free(qp
);
4194 isl_morph_free(morph
);
4198 __isl_give isl_union_pw_qpolynomial
*isl_union_pw_qpolynomial_mul(
4199 __isl_take isl_union_pw_qpolynomial
*upwqp1
,
4200 __isl_take isl_union_pw_qpolynomial
*upwqp2
)
4202 return isl_union_pw_qpolynomial_match_bin_op(upwqp1
, upwqp2
,
4203 &isl_pw_qpolynomial_mul
);
4206 /* Reorder the dimension of "qp" according to the given reordering.
4208 __isl_give isl_qpolynomial
*isl_qpolynomial_realign_domain(
4209 __isl_take isl_qpolynomial
*qp
, __isl_take isl_reordering
*r
)
4213 qp
= isl_qpolynomial_cow(qp
);
4217 r
= isl_reordering_extend(r
, qp
->div
->n_row
);
4221 qp
->div
= isl_local_reorder(qp
->div
, isl_reordering_copy(r
));
4225 qp
->upoly
= reorder(qp
->upoly
, r
->pos
);
4229 space
= isl_reordering_get_space(r
);
4230 qp
= isl_qpolynomial_reset_domain_space(qp
, space
);
4232 isl_reordering_free(r
);
4235 isl_qpolynomial_free(qp
);
4236 isl_reordering_free(r
);
4240 __isl_give isl_qpolynomial
*isl_qpolynomial_align_params(
4241 __isl_take isl_qpolynomial
*qp
, __isl_take isl_space
*model
)
4243 isl_bool equal_params
;
4248 equal_params
= isl_space_has_equal_params(qp
->dim
, model
);
4249 if (equal_params
< 0)
4251 if (!equal_params
) {
4252 isl_reordering
*exp
;
4254 exp
= isl_parameter_alignment_reordering(qp
->dim
, model
);
4255 exp
= isl_reordering_extend_space(exp
,
4256 isl_qpolynomial_get_domain_space(qp
));
4257 qp
= isl_qpolynomial_realign_domain(qp
, exp
);
4260 isl_space_free(model
);
4263 isl_space_free(model
);
4264 isl_qpolynomial_free(qp
);
4268 struct isl_split_periods_data
{
4270 isl_pw_qpolynomial
*res
;
4273 /* Create a slice where the integer division "div" has the fixed value "v".
4274 * In particular, if "div" refers to floor(f/m), then create a slice
4276 * m v <= f <= m v + (m - 1)
4281 * -f + m v + (m - 1) >= 0
4283 static __isl_give isl_set
*set_div_slice(__isl_take isl_space
*space
,
4284 __isl_keep isl_qpolynomial
*qp
, int div
, isl_int v
)
4287 isl_basic_set
*bset
= NULL
;
4293 total
= isl_space_dim(space
, isl_dim_all
);
4294 bset
= isl_basic_set_alloc_space(isl_space_copy(space
), 0, 0, 2);
4296 k
= isl_basic_set_alloc_inequality(bset
);
4299 isl_seq_cpy(bset
->ineq
[k
], qp
->div
->row
[div
] + 1, 1 + total
);
4300 isl_int_submul(bset
->ineq
[k
][0], v
, qp
->div
->row
[div
][0]);
4302 k
= isl_basic_set_alloc_inequality(bset
);
4305 isl_seq_neg(bset
->ineq
[k
], qp
->div
->row
[div
] + 1, 1 + total
);
4306 isl_int_addmul(bset
->ineq
[k
][0], v
, qp
->div
->row
[div
][0]);
4307 isl_int_add(bset
->ineq
[k
][0], bset
->ineq
[k
][0], qp
->div
->row
[div
][0]);
4308 isl_int_sub_ui(bset
->ineq
[k
][0], bset
->ineq
[k
][0], 1);
4310 isl_space_free(space
);
4311 return isl_set_from_basic_set(bset
);
4313 isl_basic_set_free(bset
);
4314 isl_space_free(space
);
4318 static isl_stat
split_periods(__isl_take isl_set
*set
,
4319 __isl_take isl_qpolynomial
*qp
, void *user
);
4321 /* Create a slice of the domain "set" such that integer division "div"
4322 * has the fixed value "v" and add the results to data->res,
4323 * replacing the integer division by "v" in "qp".
4325 static isl_stat
set_div(__isl_take isl_set
*set
,
4326 __isl_take isl_qpolynomial
*qp
, int div
, isl_int v
,
4327 struct isl_split_periods_data
*data
)
4332 struct isl_upoly
*cst
;
4334 slice
= set_div_slice(isl_set_get_space(set
), qp
, div
, v
);
4335 set
= isl_set_intersect(set
, slice
);
4340 total
= isl_space_dim(qp
->dim
, isl_dim_all
);
4342 for (i
= div
+ 1; i
< qp
->div
->n_row
; ++i
) {
4343 if (isl_int_is_zero(qp
->div
->row
[i
][2 + total
+ div
]))
4345 isl_int_addmul(qp
->div
->row
[i
][1],
4346 qp
->div
->row
[i
][2 + total
+ div
], v
);
4347 isl_int_set_si(qp
->div
->row
[i
][2 + total
+ div
], 0);
4350 cst
= isl_upoly_rat_cst(qp
->dim
->ctx
, v
, qp
->dim
->ctx
->one
);
4351 qp
= substitute_div(qp
, div
, cst
);
4353 return split_periods(set
, qp
, data
);
4356 isl_qpolynomial_free(qp
);
4357 return isl_stat_error
;
4360 /* Split the domain "set" such that integer division "div"
4361 * has a fixed value (ranging from "min" to "max") on each slice
4362 * and add the results to data->res.
4364 static isl_stat
split_div(__isl_take isl_set
*set
,
4365 __isl_take isl_qpolynomial
*qp
, int div
, isl_int min
, isl_int max
,
4366 struct isl_split_periods_data
*data
)
4368 for (; isl_int_le(min
, max
); isl_int_add_ui(min
, min
, 1)) {
4369 isl_set
*set_i
= isl_set_copy(set
);
4370 isl_qpolynomial
*qp_i
= isl_qpolynomial_copy(qp
);
4372 if (set_div(set_i
, qp_i
, div
, min
, data
) < 0)
4376 isl_qpolynomial_free(qp
);
4380 isl_qpolynomial_free(qp
);
4381 return isl_stat_error
;
4384 /* If "qp" refers to any integer division
4385 * that can only attain "max_periods" distinct values on "set"
4386 * then split the domain along those distinct values.
4387 * Add the results (or the original if no splitting occurs)
4390 static isl_stat
split_periods(__isl_take isl_set
*set
,
4391 __isl_take isl_qpolynomial
*qp
, void *user
)
4394 isl_pw_qpolynomial
*pwqp
;
4395 struct isl_split_periods_data
*data
;
4398 isl_stat r
= isl_stat_ok
;
4400 data
= (struct isl_split_periods_data
*)user
;
4405 if (qp
->div
->n_row
== 0) {
4406 pwqp
= isl_pw_qpolynomial_alloc(set
, qp
);
4407 data
->res
= isl_pw_qpolynomial_add_disjoint(data
->res
, pwqp
);
4413 total
= isl_space_dim(qp
->dim
, isl_dim_all
);
4414 for (i
= 0; i
< qp
->div
->n_row
; ++i
) {
4415 enum isl_lp_result lp_res
;
4417 if (isl_seq_first_non_zero(qp
->div
->row
[i
] + 2 + total
,
4418 qp
->div
->n_row
) != -1)
4421 lp_res
= isl_set_solve_lp(set
, 0, qp
->div
->row
[i
] + 1,
4422 set
->ctx
->one
, &min
, NULL
, NULL
);
4423 if (lp_res
== isl_lp_error
)
4425 if (lp_res
== isl_lp_unbounded
|| lp_res
== isl_lp_empty
)
4427 isl_int_fdiv_q(min
, min
, qp
->div
->row
[i
][0]);
4429 lp_res
= isl_set_solve_lp(set
, 1, qp
->div
->row
[i
] + 1,
4430 set
->ctx
->one
, &max
, NULL
, NULL
);
4431 if (lp_res
== isl_lp_error
)
4433 if (lp_res
== isl_lp_unbounded
|| lp_res
== isl_lp_empty
)
4435 isl_int_fdiv_q(max
, max
, qp
->div
->row
[i
][0]);
4437 isl_int_sub(max
, max
, min
);
4438 if (isl_int_cmp_si(max
, data
->max_periods
) < 0) {
4439 isl_int_add(max
, max
, min
);
4444 if (i
< qp
->div
->n_row
) {
4445 r
= split_div(set
, qp
, i
, min
, max
, data
);
4447 pwqp
= isl_pw_qpolynomial_alloc(set
, qp
);
4448 data
->res
= isl_pw_qpolynomial_add_disjoint(data
->res
, pwqp
);
4460 isl_qpolynomial_free(qp
);
4461 return isl_stat_error
;
4464 /* If any quasi-polynomial in pwqp refers to any integer division
4465 * that can only attain "max_periods" distinct values on its domain
4466 * then split the domain along those distinct values.
4468 __isl_give isl_pw_qpolynomial
*isl_pw_qpolynomial_split_periods(
4469 __isl_take isl_pw_qpolynomial
*pwqp
, int max_periods
)
4471 struct isl_split_periods_data data
;
4473 data
.max_periods
= max_periods
;
4474 data
.res
= isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_space(pwqp
));
4476 if (isl_pw_qpolynomial_foreach_piece(pwqp
, &split_periods
, &data
) < 0)
4479 isl_pw_qpolynomial_free(pwqp
);
4483 isl_pw_qpolynomial_free(data
.res
);
4484 isl_pw_qpolynomial_free(pwqp
);
4488 /* Construct a piecewise quasipolynomial that is constant on the given
4489 * domain. In particular, it is
4492 * infinity if cst == -1
4494 * If cst == -1, then explicitly check whether the domain is empty and,
4495 * if so, return 0 instead.
4497 static __isl_give isl_pw_qpolynomial
*constant_on_domain(
4498 __isl_take isl_basic_set
*bset
, int cst
)
4501 isl_qpolynomial
*qp
;
4503 if (cst
< 0 && isl_basic_set_is_empty(bset
) == isl_bool_true
)
4508 bset
= isl_basic_set_params(bset
);
4509 dim
= isl_basic_set_get_space(bset
);
4511 qp
= isl_qpolynomial_infty_on_domain(dim
);
4513 qp
= isl_qpolynomial_zero_on_domain(dim
);
4515 qp
= isl_qpolynomial_one_on_domain(dim
);
4516 return isl_pw_qpolynomial_alloc(isl_set_from_basic_set(bset
), qp
);
4519 /* Factor bset, call fn on each of the factors and return the product.
4521 * If no factors can be found, simply call fn on the input.
4522 * Otherwise, construct the factors based on the factorizer,
4523 * call fn on each factor and compute the product.
4525 static __isl_give isl_pw_qpolynomial
*compressed_multiplicative_call(
4526 __isl_take isl_basic_set
*bset
,
4527 __isl_give isl_pw_qpolynomial
*(*fn
)(__isl_take isl_basic_set
*bset
))
4533 isl_qpolynomial
*qp
;
4534 isl_pw_qpolynomial
*pwqp
;
4538 f
= isl_basic_set_factorizer(bset
);
4541 if (f
->n_group
== 0) {
4542 isl_factorizer_free(f
);
4546 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4547 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
4549 space
= isl_basic_set_get_space(bset
);
4550 space
= isl_space_params(space
);
4551 set
= isl_set_universe(isl_space_copy(space
));
4552 qp
= isl_qpolynomial_one_on_domain(space
);
4553 pwqp
= isl_pw_qpolynomial_alloc(set
, qp
);
4555 bset
= isl_morph_basic_set(isl_morph_copy(f
->morph
), bset
);
4557 for (i
= 0, n
= 0; i
< f
->n_group
; ++i
) {
4558 isl_basic_set
*bset_i
;
4559 isl_pw_qpolynomial
*pwqp_i
;
4561 bset_i
= isl_basic_set_copy(bset
);
4562 bset_i
= isl_basic_set_drop_constraints_involving(bset_i
,
4563 nparam
+ n
+ f
->len
[i
], nvar
- n
- f
->len
[i
]);
4564 bset_i
= isl_basic_set_drop_constraints_involving(bset_i
,
4566 bset_i
= isl_basic_set_drop(bset_i
, isl_dim_set
,
4567 n
+ f
->len
[i
], nvar
- n
- f
->len
[i
]);
4568 bset_i
= isl_basic_set_drop(bset_i
, isl_dim_set
, 0, n
);
4570 pwqp_i
= fn(bset_i
);
4571 pwqp
= isl_pw_qpolynomial_mul(pwqp
, pwqp_i
);
4576 isl_basic_set_free(bset
);
4577 isl_factorizer_free(f
);
4581 isl_basic_set_free(bset
);
4585 /* Factor bset, call fn on each of the factors and return the product.
4586 * The function is assumed to evaluate to zero on empty domains,
4587 * to one on zero-dimensional domains and to infinity on unbounded domains
4588 * and will not be called explicitly on zero-dimensional or unbounded domains.
4590 * We first check for some special cases and remove all equalities.
4591 * Then we hand over control to compressed_multiplicative_call.
4593 __isl_give isl_pw_qpolynomial
*isl_basic_set_multiplicative_call(
4594 __isl_take isl_basic_set
*bset
,
4595 __isl_give isl_pw_qpolynomial
*(*fn
)(__isl_take isl_basic_set
*bset
))
4599 isl_pw_qpolynomial
*pwqp
;
4604 if (isl_basic_set_plain_is_empty(bset
))
4605 return constant_on_domain(bset
, 0);
4607 if (isl_basic_set_dim(bset
, isl_dim_set
) == 0)
4608 return constant_on_domain(bset
, 1);
4610 bounded
= isl_basic_set_is_bounded(bset
);
4614 return constant_on_domain(bset
, -1);
4616 if (bset
->n_eq
== 0)
4617 return compressed_multiplicative_call(bset
, fn
);
4619 morph
= isl_basic_set_full_compression(bset
);
4620 bset
= isl_morph_basic_set(isl_morph_copy(morph
), bset
);
4622 pwqp
= compressed_multiplicative_call(bset
, fn
);
4624 morph
= isl_morph_dom_params(morph
);
4625 morph
= isl_morph_ran_params(morph
);
4626 morph
= isl_morph_inverse(morph
);
4628 pwqp
= isl_pw_qpolynomial_morph_domain(pwqp
, morph
);
4632 isl_basic_set_free(bset
);
4636 /* Drop all floors in "qp", turning each integer division [a/m] into
4637 * a rational division a/m. If "down" is set, then the integer division
4638 * is replaced by (a-(m-1))/m instead.
4640 static __isl_give isl_qpolynomial
*qp_drop_floors(
4641 __isl_take isl_qpolynomial
*qp
, int down
)
4644 struct isl_upoly
*s
;
4648 if (qp
->div
->n_row
== 0)
4651 qp
= isl_qpolynomial_cow(qp
);
4655 for (i
= qp
->div
->n_row
- 1; i
>= 0; --i
) {
4657 isl_int_sub(qp
->div
->row
[i
][1],
4658 qp
->div
->row
[i
][1], qp
->div
->row
[i
][0]);
4659 isl_int_add_ui(qp
->div
->row
[i
][1],
4660 qp
->div
->row
[i
][1], 1);
4662 s
= isl_upoly_from_affine(qp
->dim
->ctx
, qp
->div
->row
[i
] + 1,
4663 qp
->div
->row
[i
][0], qp
->div
->n_col
- 1);
4664 qp
= substitute_div(qp
, i
, s
);
4672 /* Drop all floors in "pwqp", turning each integer division [a/m] into
4673 * a rational division a/m.
4675 static __isl_give isl_pw_qpolynomial
*pwqp_drop_floors(
4676 __isl_take isl_pw_qpolynomial
*pwqp
)
4683 if (isl_pw_qpolynomial_is_zero(pwqp
))
4686 pwqp
= isl_pw_qpolynomial_cow(pwqp
);
4690 for (i
= 0; i
< pwqp
->n
; ++i
) {
4691 pwqp
->p
[i
].qp
= qp_drop_floors(pwqp
->p
[i
].qp
, 0);
4698 isl_pw_qpolynomial_free(pwqp
);
4702 /* Adjust all the integer divisions in "qp" such that they are at least
4703 * one over the given orthant (identified by "signs"). This ensures
4704 * that they will still be non-negative even after subtracting (m-1)/m.
4706 * In particular, f is replaced by f' + v, changing f = [a/m]
4707 * to f' = [(a - m v)/m].
4708 * If the constant term k in a is smaller than m,
4709 * the constant term of v is set to floor(k/m) - 1.
4710 * For any other term, if the coefficient c and the variable x have
4711 * the same sign, then no changes are needed.
4712 * Otherwise, if the variable is positive (and c is negative),
4713 * then the coefficient of x in v is set to floor(c/m).
4714 * If the variable is negative (and c is positive),
4715 * then the coefficient of x in v is set to ceil(c/m).
4717 static __isl_give isl_qpolynomial
*make_divs_pos(__isl_take isl_qpolynomial
*qp
,
4723 struct isl_upoly
*s
;
4725 qp
= isl_qpolynomial_cow(qp
);
4728 qp
->div
= isl_mat_cow(qp
->div
);
4732 total
= isl_space_dim(qp
->dim
, isl_dim_all
);
4733 v
= isl_vec_alloc(qp
->div
->ctx
, qp
->div
->n_col
- 1);
4735 for (i
= 0; i
< qp
->div
->n_row
; ++i
) {
4736 isl_int
*row
= qp
->div
->row
[i
];
4740 if (isl_int_lt(row
[1], row
[0])) {
4741 isl_int_fdiv_q(v
->el
[0], row
[1], row
[0]);
4742 isl_int_sub_ui(v
->el
[0], v
->el
[0], 1);
4743 isl_int_submul(row
[1], row
[0], v
->el
[0]);
4745 for (j
= 0; j
< total
; ++j
) {
4746 if (isl_int_sgn(row
[2 + j
]) * signs
[j
] >= 0)
4749 isl_int_cdiv_q(v
->el
[1 + j
], row
[2 + j
], row
[0]);
4751 isl_int_fdiv_q(v
->el
[1 + j
], row
[2 + j
], row
[0]);
4752 isl_int_submul(row
[2 + j
], row
[0], v
->el
[1 + j
]);
4754 for (j
= 0; j
< i
; ++j
) {
4755 if (isl_int_sgn(row
[2 + total
+ j
]) >= 0)
4757 isl_int_fdiv_q(v
->el
[1 + total
+ j
],
4758 row
[2 + total
+ j
], row
[0]);
4759 isl_int_submul(row
[2 + total
+ j
],
4760 row
[0], v
->el
[1 + total
+ j
]);
4762 for (j
= i
+ 1; j
< qp
->div
->n_row
; ++j
) {
4763 if (isl_int_is_zero(qp
->div
->row
[j
][2 + total
+ i
]))
4765 isl_seq_combine(qp
->div
->row
[j
] + 1,
4766 qp
->div
->ctx
->one
, qp
->div
->row
[j
] + 1,
4767 qp
->div
->row
[j
][2 + total
+ i
], v
->el
, v
->size
);
4769 isl_int_set_si(v
->el
[1 + total
+ i
], 1);
4770 s
= isl_upoly_from_affine(qp
->dim
->ctx
, v
->el
,
4771 qp
->div
->ctx
->one
, v
->size
);
4772 qp
->upoly
= isl_upoly_subs(qp
->upoly
, total
+ i
, 1, &s
);
4782 isl_qpolynomial_free(qp
);
4786 struct isl_to_poly_data
{
4788 isl_pw_qpolynomial
*res
;
4789 isl_qpolynomial
*qp
;
4792 /* Appoximate data->qp by a polynomial on the orthant identified by "signs".
4793 * We first make all integer divisions positive and then split the
4794 * quasipolynomials into terms with sign data->sign (the direction
4795 * of the requested approximation) and terms with the opposite sign.
4796 * In the first set of terms, each integer division [a/m] is
4797 * overapproximated by a/m, while in the second it is underapproximated
4800 static isl_stat
to_polynomial_on_orthant(__isl_take isl_set
*orthant
,
4801 int *signs
, void *user
)
4803 struct isl_to_poly_data
*data
= user
;
4804 isl_pw_qpolynomial
*t
;
4805 isl_qpolynomial
*qp
, *up
, *down
;
4807 qp
= isl_qpolynomial_copy(data
->qp
);
4808 qp
= make_divs_pos(qp
, signs
);
4810 up
= isl_qpolynomial_terms_of_sign(qp
, signs
, data
->sign
);
4811 up
= qp_drop_floors(up
, 0);
4812 down
= isl_qpolynomial_terms_of_sign(qp
, signs
, -data
->sign
);
4813 down
= qp_drop_floors(down
, 1);
4815 isl_qpolynomial_free(qp
);
4816 qp
= isl_qpolynomial_add(up
, down
);
4818 t
= isl_pw_qpolynomial_alloc(orthant
, qp
);
4819 data
->res
= isl_pw_qpolynomial_add_disjoint(data
->res
, t
);
4824 /* Approximate each quasipolynomial by a polynomial. If "sign" is positive,
4825 * the polynomial will be an overapproximation. If "sign" is negative,
4826 * it will be an underapproximation. If "sign" is zero, the approximation
4827 * will lie somewhere in between.
4829 * In particular, is sign == 0, we simply drop the floors, turning
4830 * the integer divisions into rational divisions.
4831 * Otherwise, we split the domains into orthants, make all integer divisions
4832 * positive and then approximate each [a/m] by either a/m or (a-(m-1))/m,
4833 * depending on the requested sign and the sign of the term in which
4834 * the integer division appears.
4836 __isl_give isl_pw_qpolynomial
*isl_pw_qpolynomial_to_polynomial(
4837 __isl_take isl_pw_qpolynomial
*pwqp
, int sign
)
4840 struct isl_to_poly_data data
;
4843 return pwqp_drop_floors(pwqp
);
4849 data
.res
= isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_space(pwqp
));
4851 for (i
= 0; i
< pwqp
->n
; ++i
) {
4852 if (pwqp
->p
[i
].qp
->div
->n_row
== 0) {
4853 isl_pw_qpolynomial
*t
;
4854 t
= isl_pw_qpolynomial_alloc(
4855 isl_set_copy(pwqp
->p
[i
].set
),
4856 isl_qpolynomial_copy(pwqp
->p
[i
].qp
));
4857 data
.res
= isl_pw_qpolynomial_add_disjoint(data
.res
, t
);
4860 data
.qp
= pwqp
->p
[i
].qp
;
4861 if (isl_set_foreach_orthant(pwqp
->p
[i
].set
,
4862 &to_polynomial_on_orthant
, &data
) < 0)
4866 isl_pw_qpolynomial_free(pwqp
);
4870 isl_pw_qpolynomial_free(pwqp
);
4871 isl_pw_qpolynomial_free(data
.res
);
4875 static __isl_give isl_pw_qpolynomial
*poly_entry(
4876 __isl_take isl_pw_qpolynomial
*pwqp
, void *user
)
4880 return isl_pw_qpolynomial_to_polynomial(pwqp
, *sign
);
4883 __isl_give isl_union_pw_qpolynomial
*isl_union_pw_qpolynomial_to_polynomial(
4884 __isl_take isl_union_pw_qpolynomial
*upwqp
, int sign
)
4886 return isl_union_pw_qpolynomial_transform_inplace(upwqp
,
4887 &poly_entry
, &sign
);
4890 __isl_give isl_basic_map
*isl_basic_map_from_qpolynomial(
4891 __isl_take isl_qpolynomial
*qp
)
4895 isl_vec
*aff
= NULL
;
4896 isl_basic_map
*bmap
= NULL
;
4902 if (!isl_upoly_is_affine(qp
->upoly
))
4903 isl_die(qp
->dim
->ctx
, isl_error_invalid
,
4904 "input quasi-polynomial not affine", goto error
);
4905 aff
= isl_qpolynomial_extract_affine(qp
);
4908 dim
= isl_qpolynomial_get_space(qp
);
4909 pos
= 1 + isl_space_offset(dim
, isl_dim_out
);
4910 n_div
= qp
->div
->n_row
;
4911 bmap
= isl_basic_map_alloc_space(dim
, n_div
, 1, 2 * n_div
);
4913 for (i
= 0; i
< n_div
; ++i
) {
4914 k
= isl_basic_map_alloc_div(bmap
);
4917 isl_seq_cpy(bmap
->div
[k
], qp
->div
->row
[i
], qp
->div
->n_col
);
4918 isl_int_set_si(bmap
->div
[k
][qp
->div
->n_col
], 0);
4919 if (isl_basic_map_add_div_constraints(bmap
, k
) < 0)
4922 k
= isl_basic_map_alloc_equality(bmap
);
4925 isl_int_neg(bmap
->eq
[k
][pos
], aff
->el
[0]);
4926 isl_seq_cpy(bmap
->eq
[k
], aff
->el
+ 1, pos
);
4927 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->el
+ 1 + pos
, n_div
);
4930 isl_qpolynomial_free(qp
);
4931 bmap
= isl_basic_map_finalize(bmap
);
4935 isl_qpolynomial_free(qp
);
4936 isl_basic_map_free(bmap
);