/build/source/polly/lib/External/isl/isl_int

Bug Summary

File:	build/source/polly/lib/External/isl/isl_int_sioimath.h
Warning:	line 154, column 30 The result of the left shift is undefined due to shifting '2147483647' by '32', which is unrepresentable in the unsigned version of the return type 'isl_sioimath'

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name isl_polynomial.c -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -analyzer-config-compatibility-mode=true -mrelocation-model pic -pic-level 2 -mframe-pointer=none -fmath-errno -ffp-contract=on -fno-rounding-math -mconstructor-aliases -funwind-tables=2 -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -fdebug-compilation-dir=/build/source/build-llvm -fdebug-prefix-map=/build/source/build-llvm=build-llvm -fdebug-prefix-map=/build/source/= -fdebug-prefix-map=/build/source/build-llvm=build-llvm -fdebug-prefix-map=/build/source/= -ffunction-sections -fdata-sections -fcoverage-compilation-dir=/build/source/build-llvm -resource-dir /usr/lib/llvm-18/lib/clang/18 -I tools/polly/lib/External -I /build/source/polly/lib/External -I /build/source/polly/lib/External/isl -I /build/source/polly/lib/External/isl/include -I /build/source/polly/lib/External/isl/imath -I tools/polly/lib/External/isl -I tools/polly/include -I /build/source/polly/lib/External/pet/include -I tools/polly/lib/External/isl/include -I /build/source/polly/include -I include -I /build/source/llvm/include -D _DEBUG -D _GLIBCXX_ASSERTIONS -D _GNU_SOURCE -D _LIBCPP_ENABLE_HARDENED_MODE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -D _FORTIFY_SOURCE=2 -D NDEBUG -U NDEBUG -internal-isystem /usr/lib/llvm-18/lib/clang/18/include -internal-isystem /usr/local/include -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../x86_64-linux-gnu/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -fmacro-prefix-map=/build/source/build-llvm=build-llvm -fmacro-prefix-map=/build/source/= -fcoverage-prefix-map=/build/source/build-llvm=build-llvm -fcoverage-prefix-map=/build/source/= -O3 -Wno-unused-command-line-argument -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-comment -std=gnu99 -fconst-strings -ferror-limit 19 -stack-protector 2 -fgnuc-version=4.2.1 -fcolor-diagnostics -vectorize-loops -vectorize-slp -analyzer-output=html -analyzer-config stable-report-filename=true -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /tmp/scan-build-2023-08-29-135633-883758-1 -x c /build/source/polly/lib/External/isl/isl_polynomial.c

/build/source/polly/lib/External/isl/isl_polynomial.c

→

1/*
* Copyright 2010      INRIA Saclay
*
* Use of this software is governed by the MIT license
*
* Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
* Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
* 91893 Orsay, France 
*/

11#include <stdlib.h>
12#include <isl_ctx_private.h>
13#include <isl_map_private.h>
14#include <isl_factorization.h>
15#include <isl_lp_private.h>
16#include <isl_seq.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>

31#undef EL_BASEpw_qpolynomial
32#define EL_BASEpw_qpolynomial qpolynomial

34#include <isl_list_templ.c>

36#undef EL_BASEpw_qpolynomial
37#define EL_BASEpw_qpolynomial pw_qpolynomial

39#include <isl_list_templ.c>

41static unsigned pos(__isl_keep isl_space *space, enum isl_dim_type type)
42{
switch (type) {
case isl_dim_param:	return 0;
case isl_dim_in:	return space->nparam;
case isl_dim_out:	return space->nparam + space->n_in;
default:		return 0;
}
49}

51isl_bool isl_poly_is_cst(__isl_keep isl_poly *poly)
52{
if (!poly)
return isl_bool_error;

return isl_bool_ok(poly->var < 0);
57}

59__isl_keep isl_poly_cst *isl_poly_as_cst(__isl_keep isl_poly *poly)
60{
if (!poly)
return NULL((void*)0);

isl_assert(poly->ctx, poly->var < 0, return NULL)do { if (poly->var < 0) break; do { isl_handle_error(poly
->ctx, isl_error_unknown, "Assertion \"" "poly->var < 0"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 64);
 return ((void*)0); } while (0); } while (0);

return (isl_poly_cst *) poly;
67}

69__isl_keep isl_poly_rec *isl_poly_as_rec(__isl_keep isl_poly *poly)
70{
if (!poly)
return NULL((void*)0);

isl_assert(poly->ctx, poly->var >= 0, return NULL)do { if (poly->var >= 0) break; do { isl_handle_error(poly
->ctx, isl_error_unknown, "Assertion \"" "poly->var >= 0"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 74);
 return ((void*)0); } while (0); } while (0);

return (isl_poly_rec *) poly;
77}

79/* Compare two polynomials.
*
* Return -1 if "poly1" is "smaller" than "poly2", 1 if "poly1" is "greater"
* than "poly2" and 0 if they are equal.
*/
84static int isl_poly_plain_cmp(__isl_keep isl_poly *poly1,
__isl_keep isl_poly *poly2)
86{
int i;
isl_bool is_cst1;
isl_poly_rec *rec1, *rec2;

if (poly1 == poly2)
return 0;
is_cst1 = isl_poly_is_cst(poly1);
if (is_cst1 < 0)
return -1;
if (!poly2)
return 1;
if (poly1->var != poly2->var)
return poly1->var - poly2->var;

if (is_cst1) {
isl_poly_cst *cst1, *cst2;
int cmp;

cst1 = isl_poly_as_cst(poly1);
cst2 = isl_poly_as_cst(poly2);
if (!cst1 || !cst2)
	return 0;
cmp = isl_int_cmp(cst1->n, cst2->n)isl_sioimath_cmp(*(cst1->n), *(cst2->n));
if (cmp != 0)
	return cmp;
return isl_int_cmp(cst1->d, cst2->d)isl_sioimath_cmp(*(cst1->d), *(cst2->d));
}

rec1 = isl_poly_as_rec(poly1);
rec2 = isl_poly_as_rec(poly2);
if (!rec1 || !rec2)
return 0;

if (rec1->n != rec2->n)
return rec1->n - rec2->n;

for (i = 0; i < rec1->n; ++i) {
int cmp = isl_poly_plain_cmp(rec1->p[i], rec2->p[i]);
if (cmp != 0)
	return cmp;
}

return 0;
130}

132isl_bool isl_poly_is_equal(__isl_keep isl_poly *poly1,
__isl_keep isl_poly *poly2)
134{
int i;
isl_bool is_cst1;
isl_poly_rec *rec1, *rec2;

is_cst1 = isl_poly_is_cst(poly1);
if (is_cst1 < 0 || !poly2)
return isl_bool_error;
if (poly1 == poly2)
return isl_bool_true;
if (poly1->var != poly2->var)
return isl_bool_false;
if (is_cst1) {
isl_poly_cst *cst1, *cst2;
int r;
cst1 = isl_poly_as_cst(poly1);
cst2 = isl_poly_as_cst(poly2);
if (!cst1 || !cst2)
	return isl_bool_error;
r = isl_int_eq(cst1->n, cst2->n)(isl_sioimath_cmp(*(cst1->n), *(cst2->n)) == 0) &&
    isl_int_eq(cst1->d, cst2->d)(isl_sioimath_cmp(*(cst1->d), *(cst2->d)) == 0);
return isl_bool_ok(r);
}

rec1 = isl_poly_as_rec(poly1);
rec2 = isl_poly_as_rec(poly2);
if (!rec1 || !rec2)
return isl_bool_error;

if (rec1->n != rec2->n)
return isl_bool_false;

for (i = 0; i < rec1->n; ++i) {
isl_bool eq = isl_poly_is_equal(rec1->p[i], rec2->p[i]);
if (eq < 0 || !eq)
	return eq;
}

return isl_bool_true;
173}

175isl_bool isl_poly_is_zero(__isl_keep isl_poly *poly)
176{
isl_bool is_cst;
isl_poly_cst *cst;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0 || !is_cst)
return is_cst;

cst = isl_poly_as_cst(poly);
if (!cst)
return isl_bool_error;

return isl_bool_ok(isl_int_is_zero(cst->n)(isl_sioimath_sgn(*(cst->n)) == 0) && isl_int_is_pos(cst->d)(isl_sioimath_sgn(*(cst->d)) > 0));
189}

191int isl_poly_sgn(__isl_keep isl_poly *poly)
192{
isl_bool is_cst;
isl_poly_cst *cst;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0 || !is_cst)
return 0;

cst = isl_poly_as_cst(poly);
if (!cst)
return 0;

return isl_int_sgn(cst->n)isl_sioimath_sgn(*(cst->n));
205}

207isl_bool isl_poly_is_nan(__isl_keep isl_poly *poly)
208{
isl_bool is_cst;
isl_poly_cst *cst;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0 || !is_cst)
return is_cst;

cst = isl_poly_as_cst(poly);
if (!cst)
return isl_bool_error;

return isl_bool_ok(isl_int_is_zero(cst->n)(isl_sioimath_sgn(*(cst->n)) == 0) && isl_int_is_zero(cst->d)(isl_sioimath_sgn(*(cst->d)) == 0));
221}

223isl_bool isl_poly_is_infty(__isl_keep isl_poly *poly)
224{
isl_bool is_cst;
isl_poly_cst *cst;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0 || !is_cst)
return is_cst;

cst = isl_poly_as_cst(poly);
if (!cst)
return isl_bool_error;

return isl_bool_ok(isl_int_is_pos(cst->n)(isl_sioimath_sgn(*(cst->n)) > 0) && isl_int_is_zero(cst->d)(isl_sioimath_sgn(*(cst->d)) == 0));
237}

239isl_bool isl_poly_is_neginfty(__isl_keep isl_poly *poly)
240{
isl_bool is_cst;
isl_poly_cst *cst;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0 || !is_cst)
return is_cst;

cst = isl_poly_as_cst(poly);
if (!cst)
return isl_bool_error;

return isl_bool_ok(isl_int_is_neg(cst->n)(isl_sioimath_sgn(*(cst->n)) < 0) && isl_int_is_zero(cst->d)(isl_sioimath_sgn(*(cst->d)) == 0));
253}

255isl_bool isl_poly_is_one(__isl_keep isl_poly *poly)
256{
isl_bool is_cst;
isl_poly_cst *cst;
int r;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0 || !is_cst)
return is_cst;

cst = isl_poly_as_cst(poly);
if (!cst)
return isl_bool_error;

r = isl_int_eq(cst->n, cst->d)(isl_sioimath_cmp(*(cst->n), *(cst->d)) == 0) && isl_int_is_pos(cst->d)(isl_sioimath_sgn(*(cst->d)) > 0);
return isl_bool_ok(r);
271}

273isl_bool isl_poly_is_negone(__isl_keep isl_poly *poly)
274{
isl_bool is_cst;
isl_poly_cst *cst;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0 || !is_cst)
return is_cst;

cst = isl_poly_as_cst(poly);
if (!cst)
return isl_bool_error;

return isl_bool_ok(isl_int_is_negone(cst->n)(isl_sioimath_cmp_si(*(cst->n), -1) == 0) && isl_int_is_one(cst->d)(isl_sioimath_cmp_si(*(cst->d), 1) == 0));
287}

289__isl_give isl_poly_cst *isl_poly_cst_alloc(isl_ctx *ctx)
290{
isl_poly_cst *cst;

cst = isl_alloc_type(ctx, struct isl_poly_cst)((struct isl_poly_cst *)isl_malloc_or_die(ctx, sizeof(struct isl_poly_cst
)));
if (!cst)
return NULL((void*)0);

cst->poly.ref = 1;
cst->poly.ctx = ctx;
isl_ctx_ref(ctx);
cst->poly.var = -1;

isl_int_init(cst->n)isl_sioimath_init((cst->n));
isl_int_init(cst->d)isl_sioimath_init((cst->d));

return cst;
306}

308__isl_give isl_poly *isl_poly_zero(isl_ctx *ctx)
309{
isl_poly_cst *cst;

cst = isl_poly_cst_alloc(ctx);
if (!cst)
return NULL((void*)0);

isl_int_set_si(cst->n, 0)isl_sioimath_set_si((cst->n), 0);
isl_int_set_si(cst->d, 1)isl_sioimath_set_si((cst->d), 1);

return &cst->poly;
320}

322__isl_give isl_poly *isl_poly_one(isl_ctx *ctx)
323{
isl_poly_cst *cst;

cst = isl_poly_cst_alloc(ctx);
if (!cst)
return NULL((void*)0);

isl_int_set_si(cst->n, 1)isl_sioimath_set_si((cst->n), 1);
isl_int_set_si(cst->d, 1)isl_sioimath_set_si((cst->d), 1);

return &cst->poly;
334}

336__isl_give isl_poly *isl_poly_infty(isl_ctx *ctx)
337{
isl_poly_cst *cst;

cst = isl_poly_cst_alloc(ctx);
if (!cst)
return NULL((void*)0);

isl_int_set_si(cst->n, 1)isl_sioimath_set_si((cst->n), 1);
isl_int_set_si(cst->d, 0)isl_sioimath_set_si((cst->d), 0);

return &cst->poly;
348}

350__isl_give isl_poly *isl_poly_neginfty(isl_ctx *ctx)
351{
isl_poly_cst *cst;

cst = isl_poly_cst_alloc(ctx);
if (!cst)
return NULL((void*)0);

isl_int_set_si(cst->n, -1)isl_sioimath_set_si((cst->n), -1);
isl_int_set_si(cst->d, 0)isl_sioimath_set_si((cst->d), 0);

return &cst->poly;
362}

364__isl_give isl_poly *isl_poly_nan(isl_ctx *ctx)
365{
isl_poly_cst *cst;

cst = isl_poly_cst_alloc(ctx);
if (!cst)
return NULL((void*)0);

isl_int_set_si(cst->n, 0)isl_sioimath_set_si((cst->n), 0);
isl_int_set_si(cst->d, 0)isl_sioimath_set_si((cst->d), 0);

return &cst->poly;
376}

378__isl_give isl_poly *isl_poly_rat_cst(isl_ctx *ctx, isl_int n, isl_int d)
379{
isl_poly_cst *cst;

cst = isl_poly_cst_alloc(ctx);
if (!cst)
return NULL((void*)0);

isl_int_set(cst->n, n)isl_sioimath_set((cst->n), *(n));
isl_int_set(cst->d, d)isl_sioimath_set((cst->d), *(d));

return &cst->poly;
390}

392__isl_give isl_poly_rec *isl_poly_alloc_rec(isl_ctx *ctx, int var, int size)
393{
isl_poly_rec *rec;

isl_assert(ctx, var >= 0, return NULL)do { if (var >= 0) break; do { isl_handle_error(ctx, isl_error_unknown
, "Assertion \"" "var >= 0" "\" failed", "polly/lib/External/isl/isl_polynomial.c"
, 396); return ((void*)0); } while (0); } while (0);
isl_assert(ctx, size >= 0, return NULL)do { if (size >= 0) break; do { isl_handle_error(ctx, isl_error_unknown
, "Assertion \"" "size >= 0" "\" failed", "polly/lib/External/isl/isl_polynomial.c"
, 397); return ((void*)0); } while (0); } while (0);
rec = isl_calloc(ctx, struct isl_poly_rec,((struct isl_poly_rec *)isl_calloc_or_die(ctx, 1, sizeof(struct
 isl_poly_rec) + size * sizeof(struct isl_poly *)))
	sizeof(struct isl_poly_rec) +((struct isl_poly_rec *)isl_calloc_or_die(ctx, 1, sizeof(struct
 isl_poly_rec) + size * sizeof(struct isl_poly *)))
	size * sizeof(struct isl_poly *))((struct isl_poly_rec *)isl_calloc_or_die(ctx, 1, sizeof(struct
 isl_poly_rec) + size * sizeof(struct isl_poly *)));
if (!rec)
return NULL((void*)0);

rec->poly.ref = 1;
rec->poly.ctx = ctx;
isl_ctx_ref(ctx);
rec->poly.var = var;

rec->n = 0;
rec->size = size;

return rec;
413}

415__isl_give isl_qpolynomial *isl_qpolynomial_reset_domain_space(
__isl_take isl_qpolynomial *qp, __isl_take isl_space *space)
417{
qp = isl_qpolynomial_cow(qp);
if (!qp || !space)
goto error;

isl_space_free(qp->dim);
qp->dim = space;

return qp;
426error:
isl_qpolynomial_free(qp);
isl_space_free(space);
return NULL((void*)0);
430}

432/* Reset the space of "qp".  This function is called from isl_pw_templ.c
* and doesn't know if the space of an element object is represented
* directly or through its domain.  It therefore passes along both.
*/
436__isl_give isl_qpolynomial *isl_qpolynomial_reset_space_and_domain(
__isl_take isl_qpolynomial *qp, __isl_take isl_space *space,
__isl_take isl_space *domain)
439{
isl_space_free(space);
return isl_qpolynomial_reset_domain_space(qp, domain);
442}

444isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp)
445{
return qp ? qp->dim->ctx : NULL((void*)0);
447}

449/* Return the domain space of "qp".
*/
451static __isl_keep isl_space *isl_qpolynomial_peek_domain_space(
__isl_keep isl_qpolynomial *qp)
453{
return qp ? qp->dim : NULL((void*)0);
455}

457/* Return a copy of the domain space of "qp".
*/
459__isl_give isl_space *isl_qpolynomial_get_domain_space(
__isl_keep isl_qpolynomial *qp)
461{
return isl_space_copy(isl_qpolynomial_peek_domain_space(qp));
463}

465#undef TYPEisl_term
466#define TYPEisl_term		isl_qpolynomial
467#undef PEEK_SPACEpeek_space
468#define PEEK_SPACEpeek_space	peek_domain_space

470static
471#include "isl_type_has_equal_space_bin_templ.c"
472static
473#include "isl_type_check_equal_space_templ.c"

475#undef PEEK_SPACEpeek_space

477/* Return a copy of the local space on which "qp" is defined.
*/
479static __isl_give isl_local_space *isl_qpolynomial_get_domain_local_space(
__isl_keep isl_qpolynomial *qp)
481{
isl_space *space;

if (!qp)
return NULL((void*)0);

space = isl_qpolynomial_get_domain_space(qp);
return isl_local_space_alloc_div(space, isl_mat_copy(qp->div));
489}

491__isl_give isl_space *isl_qpolynomial_get_space(__isl_keep isl_qpolynomial *qp)
492{
isl_space *space;
if (!qp)
return NULL((void*)0);
space = isl_space_copy(qp->dim);
space = isl_space_from_domain(space);
space = isl_space_add_dims(space, isl_dim_out, 1);
return space;
500}

502/* Return the number of variables of the given type in the domain of "qp".
*/
504isl_size isl_qpolynomial_domain_dim(__isl_keep isl_qpolynomial *qp,
enum isl_dim_type type)
506{
isl_space *space;
isl_size dim;

space = isl_qpolynomial_peek_domain_space(qp);

if (!space)
return isl_size_error((int) -1);
if (type == isl_dim_div)
return qp->div->n_row;
dim = isl_space_dim(space, type);
if (dim < 0)
return isl_size_error((int) -1);
if (type == isl_dim_all) {
isl_size n_div;

n_div = isl_qpolynomial_domain_dim(qp, isl_dim_div);
if (n_div < 0)
	return isl_size_error((int) -1);
dim += n_div;
}
return dim;
528}

530/* Given the type of a dimension of an isl_qpolynomial,
* return the type of the corresponding dimension in its domain.
* This function is only called for "type" equal to isl_dim_in or
* isl_dim_param.
*/
535static enum isl_dim_type domain_type(enum isl_dim_type type)
536{
return type == isl_dim_in ? isl_dim_set : type;
538}

540/* Externally, an isl_qpolynomial has a map space, but internally, the
* ls field corresponds to the domain of that space.
*/
543isl_size isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp,
enum isl_dim_type type)
545{
if (!qp)
return isl_size_error((int) -1);
if (type == isl_dim_out)
return 1;
type = domain_type(type);
return isl_qpolynomial_domain_dim(qp, type);
552}

554/* Return the offset of the first variable of type "type" within
* the variables of the domain of "qp".
*/
557static isl_size isl_qpolynomial_domain_var_offset(
__isl_keep isl_qpolynomial *qp, enum isl_dim_type type)
559{
isl_space *space;

space = isl_qpolynomial_peek_domain_space(qp);
if (!space)
return isl_size_error((int) -1);

switch (type) {
case isl_dim_param:
case isl_dim_set:	return isl_space_offset(space, type);
case isl_dim_div:	return isl_space_dim(space, isl_dim_all);
case isl_dim_cst:
default:
isl_die(isl_qpolynomial_get_ctx(qp), isl_error_invalid,do { isl_handle_error(isl_qpolynomial_get_ctx(qp), isl_error_invalid
, "invalid dimension type", "polly/lib/External/isl/isl_polynomial.c"
, 573); return ((int) -1); } while (0)
	"invalid dimension type", return isl_size_error)do { isl_handle_error(isl_qpolynomial_get_ctx(qp), isl_error_invalid
, "invalid dimension type", "polly/lib/External/isl/isl_polynomial.c"
, 573); return ((int) -1); } while (0);
}
575}

577/* Return the offset of the first coefficient of type "type" in
* the domain of "qp".
*/
580unsigned isl_qpolynomial_domain_offset(__isl_keep isl_qpolynomial *qp,
enum isl_dim_type type)
582{
switch (type) {
case isl_dim_cst:
return 0;
case isl_dim_param:
case isl_dim_set:
case isl_dim_div:
return 1 + isl_qpolynomial_domain_var_offset(qp, type);
default:
return 0;
}
593}

595isl_bool isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
596{
return qp ? isl_poly_is_zero(qp->poly) : isl_bool_error;
598}

600isl_bool isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
601{
return qp ? isl_poly_is_one(qp->poly) : isl_bool_error;
603}

605isl_bool isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
606{
return qp ? isl_poly_is_nan(qp->poly) : isl_bool_error;
608}

610isl_bool isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
611{
return qp ? isl_poly_is_infty(qp->poly) : isl_bool_error;
613}

615isl_bool isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
616{
return qp ? isl_poly_is_neginfty(qp->poly) : isl_bool_error;
618}

620int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
621{
return qp ? isl_poly_sgn(qp->poly) : 0;
623}

625static void poly_free_cst(__isl_take isl_poly_cst *cst)
626{
isl_int_clear(cst->n)isl_sioimath_clear((cst->n));
isl_int_clear(cst->d)isl_sioimath_clear((cst->d));
629}

631static void poly_free_rec(__isl_take isl_poly_rec *rec)
632{
int i;

for (i = 0; i < rec->n; ++i)
isl_poly_free(rec->p[i]);
637}

639__isl_give isl_poly *isl_poly_copy(__isl_keep isl_poly *poly)
640{
if (!poly)
return NULL((void*)0);

poly->ref++;
return poly;
646}

648__isl_give isl_poly *isl_poly_dup_cst(__isl_keep isl_poly *poly)
649{
isl_poly_cst *cst;
isl_poly_cst *dup;

cst = isl_poly_as_cst(poly);
if (!cst)
return NULL((void*)0);

dup = isl_poly_as_cst(isl_poly_zero(poly->ctx));
if (!dup)
return NULL((void*)0);
isl_int_set(dup->n, cst->n)isl_sioimath_set((dup->n), *(cst->n));
isl_int_set(dup->d, cst->d)isl_sioimath_set((dup->d), *(cst->d));

return &dup->poly;
664}

666__isl_give isl_poly *isl_poly_dup_rec(__isl_keep isl_poly *poly)
667{
int i;
isl_poly_rec *rec;
isl_poly_rec *dup;

rec = isl_poly_as_rec(poly);
if (!rec)
return NULL((void*)0);

dup = isl_poly_alloc_rec(poly->ctx, poly->var, rec->n);
if (!dup)
return NULL((void*)0);

for (i = 0; i < rec->n; ++i) {
dup->p[i] = isl_poly_copy(rec->p[i]);
if (!dup->p[i])
	goto error;
dup->n++;
}

return &dup->poly;
688error:
isl_poly_free(&dup->poly);
return NULL((void*)0);
691}

693__isl_give isl_poly *isl_poly_dup(__isl_keep isl_poly *poly)
694{
isl_bool is_cst;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0)
return NULL((void*)0);
if (is_cst)
return isl_poly_dup_cst(poly);
else
return isl_poly_dup_rec(poly);
704}

706__isl_give isl_poly *isl_poly_cow(__isl_take isl_poly *poly)
707{
if (!poly)
return NULL((void*)0);

if (poly->ref == 1)
return poly;
poly->ref--;
return isl_poly_dup(poly);
715}

717__isl_null isl_poly *isl_poly_free(__isl_take isl_poly *poly)
718{
if (!poly)
return NULL((void*)0);

if (--poly->ref > 0)
return NULL((void*)0);

if (poly->var < 0)
poly_free_cst((isl_poly_cst *) poly);
else
poly_free_rec((isl_poly_rec *) poly);

isl_ctx_deref(poly->ctx);
free(poly);
return NULL((void*)0);
733}

735static void isl_poly_cst_reduce(__isl_keep isl_poly_cst *cst)
736{
isl_int gcd;

isl_int_init(gcd)isl_sioimath_init((gcd));
isl_int_gcd(gcd, cst->n, cst->d)isl_sioimath_gcd((gcd), *(cst->n), *(cst->d));
if (!isl_int_is_zero(gcd)(isl_sioimath_sgn(*(gcd)) == 0) && !isl_int_is_one(gcd)(isl_sioimath_cmp_si(*(gcd), 1) == 0)) {
isl_int_divexact(cst->n, cst->n, gcd)isl_sioimath_tdiv_q((cst->n), *(cst->n), *(gcd));
isl_int_divexact(cst->d, cst->d, gcd)isl_sioimath_tdiv_q((cst->d), *(cst->d), *(gcd));
}
isl_int_clear(gcd)isl_sioimath_clear((gcd));
746}

748__isl_give isl_poly *isl_poly_sum_cst(__isl_take isl_poly *poly1,
__isl_take isl_poly *poly2)
750{
isl_poly_cst *cst1;
isl_poly_cst *cst2;

poly1 = isl_poly_cow(poly1);
if (!poly1 || !poly2)
goto error;

cst1 = isl_poly_as_cst(poly1);
cst2 = isl_poly_as_cst(poly2);

if (isl_int_eq(cst1->d, cst2->d)(isl_sioimath_cmp(*(cst1->d), *(cst2->d)) == 0))
isl_int_add(cst1->n, cst1->n, cst2->n)isl_sioimath_add((cst1->n), *(cst1->n), *(cst2->n));
else {
isl_int_mul(cst1->n, cst1->n, cst2->d)isl_sioimath_mul((cst1->n), *(cst1->n), *(cst2->d));
isl_int_addmul(cst1->n, cst2->n, cst1->d)isl_sioimath_addmul((cst1->n), *(cst2->n), *(cst1->d
));
isl_int_mul(cst1->d, cst1->d, cst2->d)isl_sioimath_mul((cst1->d), *(cst1->d), *(cst2->d));
}

isl_poly_cst_reduce(cst1);

isl_poly_free(poly2);
return poly1;
773error:
isl_poly_free(poly1);
isl_poly_free(poly2);
return NULL((void*)0);
777}

779static __isl_give isl_poly *replace_by_zero(__isl_take isl_poly *poly)
780{
struct isl_ctx *ctx;

if (!poly)
return NULL((void*)0);
ctx = poly->ctx;
isl_poly_free(poly);
return isl_poly_zero(ctx);
788}

790static __isl_give isl_poly *replace_by_constant_term(__isl_take isl_poly *poly)
791{
isl_poly_rec *rec;
isl_poly *cst;

if (!poly)
return NULL((void*)0);

rec = isl_poly_as_rec(poly);
if (!rec)
goto error;
cst = isl_poly_copy(rec->p[0]);
isl_poly_free(poly);
return cst;
804error:
isl_poly_free(poly);
return NULL((void*)0);
807}

809__isl_give isl_poly *isl_poly_sum(__isl_take isl_poly *poly1,
__isl_take isl_poly *poly2)
811{
int i;
isl_bool is_zero, is_nan, is_cst;
isl_poly_rec *rec1, *rec2;

if (!poly1 || !poly2)
goto error;

is_nan = isl_poly_is_nan(poly1);
if (is_nan < 0)
goto error;
if (is_nan) {
isl_poly_free(poly2);
return poly1;
}

is_nan = isl_poly_is_nan(poly2);
if (is_nan < 0)
goto error;
if (is_nan) {
isl_poly_free(poly1);
return poly2;
}

is_zero = isl_poly_is_zero(poly1);
if (is_zero < 0)
goto error;
if (is_zero) {
isl_poly_free(poly1);
return poly2;
}

is_zero = isl_poly_is_zero(poly2);
if (is_zero < 0)
goto error;
if (is_zero) {
isl_poly_free(poly2);
return poly1;
}

if (poly1->var < poly2->var)
return isl_poly_sum(poly2, poly1);

if (poly2->var < poly1->var) {
isl_poly_rec *rec;
isl_bool is_infty;

is_infty = isl_poly_is_infty(poly2);
if (is_infty >= 0 && !is_infty)
	is_infty = isl_poly_is_neginfty(poly2);
if (is_infty < 0)
	goto error;
if (is_infty) {
	isl_poly_free(poly1);
	return poly2;
}
poly1 = isl_poly_cow(poly1);
rec = isl_poly_as_rec(poly1);
if (!rec)
	goto error;
rec->p[0] = isl_poly_sum(rec->p[0], poly2);
if (rec->n == 1)
	poly1 = replace_by_constant_term(poly1);
return poly1;
}

is_cst = isl_poly_is_cst(poly1);
if (is_cst < 0)
goto error;
if (is_cst)
return isl_poly_sum_cst(poly1, poly2);

rec1 = isl_poly_as_rec(poly1);
rec2 = isl_poly_as_rec(poly2);
if (!rec1 || !rec2)
goto error;

if (rec1->n < rec2->n)
return isl_poly_sum(poly2, poly1);

poly1 = isl_poly_cow(poly1);
rec1 = isl_poly_as_rec(poly1);
if (!rec1)
goto error;

for (i = rec2->n - 1; i >= 0; --i) {
isl_bool is_zero;

rec1->p[i] = isl_poly_sum(rec1->p[i],
			    isl_poly_copy(rec2->p[i]));
if (!rec1->p[i])
	goto error;
if (i != rec1->n - 1)
	continue;
is_zero = isl_poly_is_zero(rec1->p[i]);
if (is_zero < 0)
	goto error;
if (is_zero) {
	isl_poly_free(rec1->p[i]);
	rec1->n--;
}
}

if (rec1->n == 0)
poly1 = replace_by_zero(poly1);
else if (rec1->n == 1)
poly1 = replace_by_constant_term(poly1);

isl_poly_free(poly2);

return poly1;
922error:
isl_poly_free(poly1);
isl_poly_free(poly2);
return NULL((void*)0);
926}

928__isl_give isl_poly *isl_poly_cst_add_isl_int(__isl_take isl_poly *poly,
isl_int v)
930{
isl_poly_cst *cst;

poly = isl_poly_cow(poly);
if (!poly)
return NULL((void*)0);

cst = isl_poly_as_cst(poly);

isl_int_addmul(cst->n, cst->d, v)isl_sioimath_addmul((cst->n), *(cst->d), *(v));

return poly;
942}

944__isl_give isl_poly *isl_poly_add_isl_int(__isl_take isl_poly *poly, isl_int v)
945{
isl_bool is_cst;
isl_poly_rec *rec;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0)
return isl_poly_free(poly);
if (is_cst)
return isl_poly_cst_add_isl_int(poly, v);

poly = isl_poly_cow(poly);
rec = isl_poly_as_rec(poly);
if (!rec)
goto error;

rec->p[0] = isl_poly_add_isl_int(rec->p[0], v);
if (!rec->p[0])
goto error;

return poly;
965error:
isl_poly_free(poly);
return NULL((void*)0);
968}

970__isl_give isl_poly *isl_poly_cst_mul_isl_int(__isl_take isl_poly *poly,
isl_int v)
972{
isl_bool is_zero;
isl_poly_cst *cst;

is_zero = isl_poly_is_zero(poly);
if (is_zero < 0)
return isl_poly_free(poly);
if (is_zero)
return poly;

poly = isl_poly_cow(poly);
if (!poly)
return NULL((void*)0);

cst = isl_poly_as_cst(poly);

isl_int_mul(cst->n, cst->n, v)isl_sioimath_mul((cst->n), *(cst->n), *(v));

return poly;
991}

993__isl_give isl_poly *isl_poly_mul_isl_int(__isl_take isl_poly *poly, isl_int v)
994{
int i;
isl_bool is_cst;
isl_poly_rec *rec;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0)
return isl_poly_free(poly);
if (is_cst)
return isl_poly_cst_mul_isl_int(poly, v);

poly = isl_poly_cow(poly);
rec = isl_poly_as_rec(poly);
if (!rec)
goto error;

for (i = 0; i < rec->n; ++i) {
rec->p[i] = isl_poly_mul_isl_int(rec->p[i], v);
if (!rec->p[i])
	goto error;
}

return poly;
1017error:
isl_poly_free(poly);
return NULL((void*)0);
1020}

1022/* Multiply the constant polynomial "poly" by "v".
*/
1024static __isl_give isl_poly *isl_poly_cst_scale_val(__isl_take isl_poly *poly,
__isl_keep isl_val *v)
1026{
isl_bool is_zero;
isl_poly_cst *cst;

is_zero = isl_poly_is_zero(poly);
if (is_zero < 0)
return isl_poly_free(poly);
if (is_zero)
return poly;

poly = isl_poly_cow(poly);
if (!poly)
return NULL((void*)0);

cst = isl_poly_as_cst(poly);

isl_int_mul(cst->n, cst->n, v->n)isl_sioimath_mul((cst->n), *(cst->n), *(v->n));
isl_int_mul(cst->d, cst->d, v->d)isl_sioimath_mul((cst->d), *(cst->d), *(v->d));
isl_poly_cst_reduce(cst);

return poly;
1047}

1049/* Multiply the polynomial "poly" by "v".
*/
1051static __isl_give isl_poly *isl_poly_scale_val(__isl_take isl_poly *poly,
__isl_keep isl_val *v)
1053{
int i;
isl_bool is_cst;
isl_poly_rec *rec;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0)
return isl_poly_free(poly);
if (is_cst)
return isl_poly_cst_scale_val(poly, v);

poly = isl_poly_cow(poly);
rec = isl_poly_as_rec(poly);
if (!rec)
goto error;

for (i = 0; i < rec->n; ++i) {
rec->p[i] = isl_poly_scale_val(rec->p[i], v);
if (!rec->p[i])
	goto error;
}

return poly;
1076error:
isl_poly_free(poly);
return NULL((void*)0);
1079}

1081__isl_give isl_poly *isl_poly_mul_cst(__isl_take isl_poly *poly1,
__isl_take isl_poly *poly2)
1083{
isl_poly_cst *cst1;
isl_poly_cst *cst2;

poly1 = isl_poly_cow(poly1);
if (!poly1 || !poly2)
goto error;

cst1 = isl_poly_as_cst(poly1);
cst2 = isl_poly_as_cst(poly2);

isl_int_mul(cst1->n, cst1->n, cst2->n)isl_sioimath_mul((cst1->n), *(cst1->n), *(cst2->n));
isl_int_mul(cst1->d, cst1->d, cst2->d)isl_sioimath_mul((cst1->d), *(cst1->d), *(cst2->d));

isl_poly_cst_reduce(cst1);

isl_poly_free(poly2);
return poly1;
1101error:
isl_poly_free(poly1);
isl_poly_free(poly2);
return NULL((void*)0);
1105}

1107__isl_give isl_poly *isl_poly_mul_rec(__isl_take isl_poly *poly1,
__isl_take isl_poly *poly2)
1109{
isl_poly_rec *rec1;
isl_poly_rec *rec2;
isl_poly_rec *res = NULL((void*)0);
int i, j;
int size;

rec1 = isl_poly_as_rec(poly1);
rec2 = isl_poly_as_rec(poly2);
if (!rec1 || !rec2)
goto error;
size = rec1->n + rec2->n - 1;
res = isl_poly_alloc_rec(poly1->ctx, poly1->var, size);
if (!res)
goto error;

for (i = 0; i < rec1->n; ++i) {
res->p[i] = isl_poly_mul(isl_poly_copy(rec2->p[0]),
			    isl_poly_copy(rec1->p[i]));
if (!res->p[i])
	goto error;
res->n++;
}
for (; i < size; ++i) {
res->p[i] = isl_poly_zero(poly1->ctx);
if (!res->p[i])
	goto error;
res->n++;
}
for (i = 0; i < rec1->n; ++i) {
for (j = 1; j < rec2->n; ++j) {
	isl_poly *poly;
	poly = isl_poly_mul(isl_poly_copy(rec2->p[j]),
			    isl_poly_copy(rec1->p[i]));
	res->p[i + j] = isl_poly_sum(res->p[i + j], poly);
	if (!res->p[i + j])
		goto error;
}
}

isl_poly_free(poly1);
isl_poly_free(poly2);

return &res->poly;
1153error:
isl_poly_free(poly1);
isl_poly_free(poly2);
isl_poly_free(&res->poly);
return NULL((void*)0);
1158}

1160__isl_give isl_poly *isl_poly_mul(__isl_take isl_poly *poly1,
__isl_take isl_poly *poly2)
1162{
isl_bool is_zero, is_nan, is_one, is_cst;

if (!poly1 || !poly2)
goto error;

is_nan = isl_poly_is_nan(poly1);
if (is_nan < 0)
goto error;
if (is_nan) {
isl_poly_free(poly2);
return poly1;
}

is_nan = isl_poly_is_nan(poly2);
if (is_nan < 0)
goto error;
if (is_nan) {
isl_poly_free(poly1);
return poly2;
}

is_zero = isl_poly_is_zero(poly1);
if (is_zero < 0)
goto error;
if (is_zero) {
isl_poly_free(poly2);
return poly1;
}

is_zero = isl_poly_is_zero(poly2);
if (is_zero < 0)
goto error;
if (is_zero) {
isl_poly_free(poly1);
return poly2;
}

is_one = isl_poly_is_one(poly1);
if (is_one < 0)
goto error;
if (is_one) {
isl_poly_free(poly1);
return poly2;
}

is_one = isl_poly_is_one(poly2);
if (is_one < 0)
goto error;
if (is_one) {
isl_poly_free(poly2);
return poly1;
}

if (poly1->var < poly2->var)
return isl_poly_mul(poly2, poly1);

if (poly2->var < poly1->var) {
int i;
isl_poly_rec *rec;
isl_bool is_infty;

is_infty = isl_poly_is_infty(poly2);
if (is_infty >= 0 && !is_infty)
	is_infty = isl_poly_is_neginfty(poly2);
if (is_infty < 0)
	goto error;
if (is_infty) {
	isl_ctx *ctx = poly1->ctx;
	isl_poly_free(poly1);
	isl_poly_free(poly2);
	return isl_poly_nan(ctx);
}
poly1 = isl_poly_cow(poly1);
rec = isl_poly_as_rec(poly1);
if (!rec)
	goto error;

for (i = 0; i < rec->n; ++i) {
	rec->p[i] = isl_poly_mul(rec->p[i],
				isl_poly_copy(poly2));
	if (!rec->p[i])
		goto error;
}
isl_poly_free(poly2);
return poly1;
}

is_cst = isl_poly_is_cst(poly1);
if (is_cst < 0)
goto error;
if (is_cst)
return isl_poly_mul_cst(poly1, poly2);

return isl_poly_mul_rec(poly1, poly2);
1257error:
isl_poly_free(poly1);
isl_poly_free(poly2);
return NULL((void*)0);
1261}

1263__isl_give isl_poly *isl_poly_pow(__isl_take isl_poly *poly, unsigned power)
1264{
isl_poly *res;

if (!poly)
return NULL((void*)0);
if (power == 1)
return poly;

if (power % 2)
res = isl_poly_copy(poly);
else
res = isl_poly_one(poly->ctx);

while (power >>= 1) {
poly = isl_poly_mul(poly, isl_poly_copy(poly));
if (power % 2)
	res = isl_poly_mul(res, isl_poly_copy(poly));
}

isl_poly_free(poly);
return res;
1285}

1287__isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_space *space,
unsigned n_div, __isl_take isl_poly *poly)
1289{
struct isl_qpolynomial *qp = NULL((void*)0);
isl_size total;

total = isl_space_dim(space, isl_dim_all);
if (total < 0 || !poly)
goto error;

if (!isl_space_is_set(space))
isl_die(isl_space_get_ctx(space), isl_error_invalid,do { isl_handle_error(isl_space_get_ctx(space), isl_error_invalid
, "domain of polynomial should be a set", "polly/lib/External/isl/isl_polynomial.c"
, 1299); goto error; } while (0)
	"domain of polynomial should be a set", goto error)do { isl_handle_error(isl_space_get_ctx(space), isl_error_invalid
, "domain of polynomial should be a set", "polly/lib/External/isl/isl_polynomial.c"
, 1299); goto error; } while (0);

qp = isl_calloc_type(space->ctx, struct isl_qpolynomial)((struct isl_qpolynomial *)isl_calloc_or_die(space->ctx, 1
, sizeof(struct isl_qpolynomial)));
if (!qp)
goto error;

qp->ref = 1;
qp->div = isl_mat_alloc(space->ctx, n_div, 1 + 1 + total + n_div);
if (!qp->div)
goto error;

qp->dim = space;
qp->poly = poly;

return qp;
1314error:
isl_space_free(space);
isl_poly_free(poly);
isl_qpolynomial_free(qp);
return NULL((void*)0);
1319}

1321__isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
1322{
if (!qp)
return NULL((void*)0);

qp->ref++;
return qp;
1328}

1330__isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
1331{
struct isl_qpolynomial *dup;

if (!qp)
return NULL((void*)0);

dup = isl_qpolynomial_alloc(isl_space_copy(qp->dim), qp->div->n_row,
		    isl_poly_copy(qp->poly));
if (!dup)
return NULL((void*)0);
isl_mat_free(dup->div);
dup->div = isl_mat_copy(qp->div);
if (!dup->div)
goto error;

return dup;
1347error:
isl_qpolynomial_free(dup);
return NULL((void*)0);
1350}

1352__isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
1353{
if (!qp)
return NULL((void*)0);

if (qp->ref == 1)
return qp;
qp->ref--;
return isl_qpolynomial_dup(qp);
1361}

1363__isl_null isl_qpolynomial *isl_qpolynomial_free(
__isl_take isl_qpolynomial *qp)
1365{
if (!qp)
return NULL((void*)0);

if (--qp->ref > 0)
return NULL((void*)0);

isl_space_free(qp->dim);
isl_mat_free(qp->div);
isl_poly_free(qp->poly);

free(qp);
return NULL((void*)0);
1378}

1380__isl_give isl_poly *isl_poly_var_pow(isl_ctx *ctx, int pos, int power)
1381{
int i;
isl_poly_rec *rec;
isl_poly_cst *cst;

rec = isl_poly_alloc_rec(ctx, pos, 1 + power);
if (!rec)
return NULL((void*)0);
for (i = 0; i < 1 + power; ++i) {
rec->p[i] = isl_poly_zero(ctx);
if (!rec->p[i])
	goto error;
rec->n++;
}
cst = isl_poly_as_cst(rec->p[power]);
isl_int_set_si(cst->n, 1)isl_sioimath_set_si((cst->n), 1);

return &rec->poly;
1399error:
isl_poly_free(&rec->poly);
return NULL((void*)0);
1402}

1404/* r array maps original positions to new positions.
*/
1406static __isl_give isl_poly *reorder(__isl_take isl_poly *poly, int *r)
1407{
int i;
isl_bool is_cst;
isl_poly_rec *rec;
isl_poly *base;
isl_poly *res;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0)
return isl_poly_free(poly);
if (is_cst)
return poly;

rec = isl_poly_as_rec(poly);
if (!rec)
goto error;

isl_assert(poly->ctx, rec->n >= 1, goto error)do { if (rec->n >= 1) break; do { isl_handle_error(poly
->ctx, isl_error_unknown, "Assertion \"" "rec->n >= 1"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 1424
); goto error; } while (0); } while (0);

base = isl_poly_var_pow(poly->ctx, r[poly->var], 1);
res = reorder(isl_poly_copy(rec->p[rec->n - 1]), r);

for (i = rec->n - 2; i >= 0; --i) {
res = isl_poly_mul(res, isl_poly_copy(base));
res = isl_poly_sum(res, reorder(isl_poly_copy(rec->p[i]), r));
}

isl_poly_free(base);
isl_poly_free(poly);

return res;
1438error:
isl_poly_free(poly);
return NULL((void*)0);
1441}

1443static isl_bool compatible_divs(__isl_keep isl_mat *div1,
__isl_keep isl_mat *div2)
1445{
int n_row, n_col;
isl_bool equal;

isl_assert(div1->ctx, div1->n_row >= div2->n_row &&do { if (div1->n_row >= div2->n_row && div1->
n_col >= div2->n_col) break; do { isl_handle_error(div1
->ctx, isl_error_unknown, "Assertion \"" "div1->n_row >= div2->n_row && div1->n_col >= div2->n_col"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 1451
); return isl_bool_error; } while (0); } while (0)
		div1->n_col >= div2->n_col,do { if (div1->n_row >= div2->n_row && div1->
n_col >= div2->n_col) break; do { isl_handle_error(div1
->ctx, isl_error_unknown, "Assertion \"" "div1->n_row >= div2->n_row && div1->n_col >= div2->n_col"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 1451
); return isl_bool_error; } while (0); } while (0)
    return isl_bool_error)do { if (div1->n_row >= div2->n_row && div1->
n_col >= div2->n_col) break; do { isl_handle_error(div1
->ctx, isl_error_unknown, "Assertion \"" "div1->n_row >= div2->n_row && div1->n_col >= div2->n_col"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 1451
); return isl_bool_error; } while (0); } while (0);

if (div1->n_row == div2->n_row)
return isl_mat_is_equal(div1, div2);

n_row = div1->n_row;
n_col = div1->n_col;
div1->n_row = div2->n_row;
div1->n_col = div2->n_col;

equal = isl_mat_is_equal(div1, div2);

div1->n_row = n_row;
div1->n_col = n_col;

return equal;
1467}

1469static int cmp_row(__isl_keep isl_mat *div, int i, int j)
1470{
int li, lj;

li = isl_seq_last_non_zero(div->row[i], div->n_col);
lj = isl_seq_last_non_zero(div->row[j], div->n_col);

if (li != lj)
return li - lj;

return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
1480}

1482struct isl_div_sort_info {
isl_mat	*div;
int	 row;
1485};

1487static int div_sort_cmp(const void *p1, const void *p2)
1488{
const struct isl_div_sort_info *i1, *i2;
i1 = (const struct isl_div_sort_info *) p1;
i2 = (const struct isl_div_sort_info *) p2;

return cmp_row(i1->div, i1->row, i2->row);
1494}

1496/* Sort divs and remove duplicates.
*/
1498static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp)
1499{
int i;
int skip;
int len;
struct isl_div_sort_info *array = NULL((void*)0);
int *pos = NULL((void*)0), *at = NULL((void*)0);
int *reordering = NULL((void*)0);
isl_size div_pos;

if (!qp)
return NULL((void*)0);
if (qp->div->n_row <= 1)
return qp;

div_pos = isl_qpolynomial_domain_var_offset(qp, isl_dim_div);
if (div_pos < 0)
return isl_qpolynomial_free(qp);

array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info,((struct isl_div_sort_info *)isl_malloc_or_die(qp->div->
ctx, (qp->div->n_row)*sizeof(struct isl_div_sort_info))
)
		qp->div->n_row)((struct isl_div_sort_info *)isl_malloc_or_die(qp->div->
ctx, (qp->div->n_row)*sizeof(struct isl_div_sort_info))
);
pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row)((int *)isl_malloc_or_die(qp->div->ctx, (qp->div->
n_row)*sizeof(int)));
at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row)((int *)isl_malloc_or_die(qp->div->ctx, (qp->div->
n_row)*sizeof(int)));
len = qp->div->n_col - 2;
reordering = isl_alloc_array(qp->div->ctx, int, len)((int *)isl_malloc_or_die(qp->div->ctx, (len)*sizeof(int
)));
if (!array || !pos || !at || !reordering)
goto error;

for (i = 0; i < qp->div->n_row; ++i) {
array[i].div = qp->div;
array[i].row = i;
pos[i] = i;
at[i] = i;
}

qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
div_sort_cmp);

for (i = 0; i < div_pos; ++i)
reordering[i] = i;

for (i = 0; i < qp->div->n_row; ++i) {
if (pos[array[i].row] == i)
	continue;
qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]);
pos[at[i]] = pos[array[i].row];
at[pos[array[i].row]] = at[i];
at[i] = array[i].row;
pos[array[i].row] = i;
}

skip = 0;
for (i = 0; i < len - div_pos; ++i) {
if (i > 0 &&
    isl_seq_eq(qp->div->row[i - skip - 1],
	       qp->div->row[i - skip], qp->div->n_col)) {
	qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
	isl_mat_col_add(qp->div, 2 + div_pos + i - skip - 1,
				 2 + div_pos + i - skip);
	qp->div = isl_mat_drop_cols(qp->div,
				    2 + div_pos + i - skip, 1);
	skip++;
}
reordering[div_pos + array[i].row] = div_pos + i - skip;
}

qp->poly = reorder(qp->poly, reordering);

if (!qp->poly || !qp->div)
goto error;

free(at);
free(pos);
free(array);
free(reordering);

return qp;
1575error:
free(at);
free(pos);
free(array);
free(reordering);
isl_qpolynomial_free(qp);
return NULL((void*)0);
1582}

1584static __isl_give isl_poly *expand(__isl_take isl_poly *poly, int *exp,
int first)
1586{
int i;
isl_bool is_cst;
isl_poly_rec *rec;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0)
return isl_poly_free(poly);
if (is_cst)
return poly;

if (poly->var < first)
return poly;

if (exp[poly->var - first] == poly->var - first)
return poly;

poly = isl_poly_cow(poly);
if (!poly)
goto error;

poly->var = exp[poly->var - first] + first;

rec = isl_poly_as_rec(poly);
if (!rec)
goto error;

for (i = 0; i < rec->n; ++i) {
rec->p[i] = expand(rec->p[i], exp, first);
if (!rec->p[i])
	goto error;
}

return poly;
1620error:
isl_poly_free(poly);
return NULL((void*)0);
1623}

1625static __isl_give isl_qpolynomial *with_merged_divs(
__isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
			  __isl_take isl_qpolynomial *qp2),
__isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1629{
int *exp1 = NULL((void*)0);
int *exp2 = NULL((void*)0);
isl_mat *div = NULL((void*)0);
int n_div1, n_div2;

qp1 = isl_qpolynomial_cow(qp1);
qp2 = isl_qpolynomial_cow(qp2);

if (!qp1 || !qp2)
goto error;

isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&do { if (qp1->div->n_row >= qp2->div->n_row &&
 qp1->div->n_col >= qp2->div->n_col) break; do
 { isl_handle_error(qp1->div->ctx, isl_error_unknown, "Assertion \""
 "qp1->div->n_row >= qp2->div->n_row && qp1->div->n_col >= qp2->div->n_col"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 1642
); goto error; } while (0); } while (0)
		qp1->div->n_col >= qp2->div->n_col, goto error)do { if (qp1->div->n_row >= qp2->div->n_row &&
 qp1->div->n_col >= qp2->div->n_col) break; do
 { isl_handle_error(qp1->div->ctx, isl_error_unknown, "Assertion \""
 "qp1->div->n_row >= qp2->div->n_row && qp1->div->n_col >= qp2->div->n_col"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 1642
); goto error; } while (0); } while (0);

n_div1 = qp1->div->n_row;
n_div2 = qp2->div->n_row;
exp1 = isl_alloc_array(qp1->div->ctx, int, n_div1)((int *)isl_malloc_or_die(qp1->div->ctx, (n_div1)*sizeof
(int)));
exp2 = isl_alloc_array(qp2->div->ctx, int, n_div2)((int *)isl_malloc_or_die(qp2->div->ctx, (n_div2)*sizeof
(int)));
if ((n_div1 && !exp1) || (n_div2 && !exp2))
goto error;

div = isl_merge_divs(qp1->div, qp2->div, exp1, exp2);
if (!div)
goto error;

isl_mat_free(qp1->div);
qp1->div = isl_mat_copy(div);
isl_mat_free(qp2->div);
qp2->div = isl_mat_copy(div);

qp1->poly = expand(qp1->poly, exp1, div->n_col - div->n_row - 2);
qp2->poly = expand(qp2->poly, exp2, div->n_col - div->n_row - 2);

if (!qp1->poly || !qp2->poly)
goto error;

isl_mat_free(div);
free(exp1);
free(exp2);

return fn(qp1, qp2);
1671error:
isl_mat_free(div);
free(exp1);
free(exp2);
isl_qpolynomial_free(qp1);
isl_qpolynomial_free(qp2);
return NULL((void*)0);
1678}

1680__isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
__isl_take isl_qpolynomial *qp2)
1682{
isl_bool compatible;

qp1 = isl_qpolynomial_cow(qp1);

if (isl_qpolynomial_check_equal_space(qp1, qp2) < 0)
goto error;

if (qp1->div->n_row < qp2->div->n_row)
return isl_qpolynomial_add(qp2, qp1);

compatible = compatible_divs(qp1->div, qp2->div);
if (compatible < 0)
goto error;
if (!compatible)
return with_merged_divs(isl_qpolynomial_add, qp1, qp2);

qp1->poly = isl_poly_sum(qp1->poly, isl_poly_copy(qp2->poly));
if (!qp1->poly)
goto error;

isl_qpolynomial_free(qp2);

return qp1;
1706error:
isl_qpolynomial_free(qp1);
isl_qpolynomial_free(qp2);
return NULL((void*)0);
1710}

1712__isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain(
__isl_keep isl_setisl_map *dom,
__isl_take isl_qpolynomial *qp1,
__isl_take isl_qpolynomial *qp2)
1716{
qp1 = isl_qpolynomial_add(qp1, qp2);
qp1 = isl_qpolynomial_gist(qp1, isl_set_copy(dom));
return qp1;
1720}

1722__isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
__isl_take isl_qpolynomial *qp2)
1724{
return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1726}

1728__isl_give isl_qpolynomial *isl_qpolynomial_add_isl_int(
__isl_take isl_qpolynomial *qp, isl_int v)
1730{
if (isl_int_is_zero(v)(isl_sioimath_sgn(*(v)) == 0))
return qp;

qp = isl_qpolynomial_cow(qp);
if (!qp)
return NULL((void*)0);

qp->poly = isl_poly_add_isl_int(qp->poly, v);
if (!qp->poly)
goto error;

return qp;
1743error:
isl_qpolynomial_free(qp);
return NULL((void*)0);

1747}

1749__isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1750{
if (!qp)
return NULL((void*)0);

return isl_qpolynomial_mul_isl_int(qp, qp->dim->ctx->negone);
1755}

1757__isl_give isl_qpolynomial *isl_qpolynomial_mul_isl_int(
__isl_take isl_qpolynomial *qp, isl_int v)
1759{
if (isl_int_is_one(v)(isl_sioimath_cmp_si(*(v), 1) == 0))
return qp;

if (qp && isl_int_is_zero(v)(isl_sioimath_sgn(*(v)) == 0)) {
isl_qpolynomial *zero;
zero = isl_qpolynomial_zero_on_domain(isl_space_copy(qp->dim));
isl_qpolynomial_free(qp);
return zero;
}

qp = isl_qpolynomial_cow(qp);
if (!qp)
return NULL((void*)0);

qp->poly = isl_poly_mul_isl_int(qp->poly, v);
if (!qp->poly)
goto error;

return qp;
1779error:
isl_qpolynomial_free(qp);
return NULL((void*)0);
1782}

1784__isl_give isl_qpolynomial *isl_qpolynomial_scale(
__isl_take isl_qpolynomial *qp, isl_int v)
1786{
return isl_qpolynomial_mul_isl_int(qp, v);
1788}

1790/* Multiply "qp" by "v".
*/
1792__isl_give isl_qpolynomial *isl_qpolynomial_scale_val(
__isl_take isl_qpolynomial *qp, __isl_take isl_val *v)
1794{
if (!qp || !v)
goto error;

if (!isl_val_is_rat(v))
isl_die(isl_qpolynomial_get_ctx(qp), isl_error_invalid,do { isl_handle_error(isl_qpolynomial_get_ctx(qp), isl_error_invalid
, "expecting rational factor", "polly/lib/External/isl/isl_polynomial.c"
, 1800); goto error; } while (0)
	"expecting rational factor", goto error)do { isl_handle_error(isl_qpolynomial_get_ctx(qp), isl_error_invalid
, "expecting rational factor", "polly/lib/External/isl/isl_polynomial.c"
, 1800); goto error; } while (0);

if (isl_val_is_one(v)) {
isl_val_free(v);
return qp;
}

if (isl_val_is_zero(v)) {
isl_space *space;

space = isl_qpolynomial_get_domain_space(qp);
isl_qpolynomial_free(qp);
isl_val_free(v);
return isl_qpolynomial_zero_on_domain(space);
}

qp = isl_qpolynomial_cow(qp);
if (!qp)
goto error;

qp->poly = isl_poly_scale_val(qp->poly, v);
if (!qp->poly)
qp = isl_qpolynomial_free(qp);

isl_val_free(v);
return qp;
1826error:
isl_val_free(v);
isl_qpolynomial_free(qp);
return NULL((void*)0);
1830}

1832/* Divide "qp" by "v".
*/
1834__isl_give isl_qpolynomial *isl_qpolynomial_scale_down_val(
__isl_take isl_qpolynomial *qp, __isl_take isl_val *v)
1836{
if (!qp || !v)
goto error;

if (!isl_val_is_rat(v))
isl_die(isl_qpolynomial_get_ctx(qp), isl_error_invalid,do { isl_handle_error(isl_qpolynomial_get_ctx(qp), isl_error_invalid
, "expecting rational factor", "polly/lib/External/isl/isl_polynomial.c"
, 1842); goto error; } while (0)
	"expecting rational factor", goto error)do { isl_handle_error(isl_qpolynomial_get_ctx(qp), isl_error_invalid
, "expecting rational factor", "polly/lib/External/isl/isl_polynomial.c"
, 1842); goto error; } while (0);
if (isl_val_is_zero(v))
isl_die(isl_val_get_ctx(v), isl_error_invalid,do { isl_handle_error(isl_val_get_ctx(v), isl_error_invalid, "cannot scale down by zero"
, "polly/lib/External/isl/isl_polynomial.c", 1845); goto error
; } while (0)
	"cannot scale down by zero", goto error)do { isl_handle_error(isl_val_get_ctx(v), isl_error_invalid, "cannot scale down by zero"
, "polly/lib/External/isl/isl_polynomial.c", 1845); goto error
; } while (0);

return isl_qpolynomial_scale_val(qp, isl_val_inv(v));
1848error:
isl_val_free(v);
isl_qpolynomial_free(qp);
return NULL((void*)0);
1852}

1854__isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
__isl_take isl_qpolynomial *qp2)
1856{
isl_bool compatible;

qp1 = isl_qpolynomial_cow(qp1);

if (isl_qpolynomial_check_equal_space(qp1, qp2) < 0)
goto error;

if (qp1->div->n_row < qp2->div->n_row)
return isl_qpolynomial_mul(qp2, qp1);

compatible = compatible_divs(qp1->div, qp2->div);
if (compatible < 0)
goto error;
if (!compatible)
return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);

qp1->poly = isl_poly_mul(qp1->poly, isl_poly_copy(qp2->poly));
if (!qp1->poly)
goto error;

isl_qpolynomial_free(qp2);

return qp1;
1880error:
isl_qpolynomial_free(qp1);
isl_qpolynomial_free(qp2);
return NULL((void*)0);
1884}

1886__isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_qpolynomial *qp,
unsigned power)
1888{
qp = isl_qpolynomial_cow(qp);

if (!qp)
return NULL((void*)0);

qp->poly = isl_poly_pow(qp->poly, power);
if (!qp->poly)
goto error;

return qp;
1899error:
isl_qpolynomial_free(qp);
return NULL((void*)0);
1902}

1904__isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_pow(
__isl_take isl_pw_qpolynomial *pwqp, unsigned power)
1906{
int i;

if (power == 1)
return pwqp;

pwqp = isl_pw_qpolynomial_cow(pwqp);
if (!pwqp)
return NULL((void*)0);

for (i = 0; i < pwqp->n; ++i) {
pwqp->p[i].qp = isl_qpolynomial_pow(pwqp->p[i].qp, power);
if (!pwqp->p[i].qp)
	return isl_pw_qpolynomial_free(pwqp);
}

return pwqp;
1923}

1925__isl_give isl_qpolynomial *isl_qpolynomial_zero_on_domain(
__isl_take isl_space *domain)
1927{
if (!domain)
return NULL((void*)0);
return isl_qpolynomial_alloc(domain, 0, isl_poly_zero(domain->ctx));
1931}

1933__isl_give isl_qpolynomial *isl_qpolynomial_one_on_domain(
__isl_take isl_space *domain)
1935{
if (!domain)
return NULL((void*)0);
return isl_qpolynomial_alloc(domain, 0, isl_poly_one(domain->ctx));
1939}

1941__isl_give isl_qpolynomial *isl_qpolynomial_infty_on_domain(
__isl_take isl_space *domain)
1943{
if (!domain)
return NULL((void*)0);
return isl_qpolynomial_alloc(domain, 0, isl_poly_infty(domain->ctx));
1947}

1949__isl_give isl_qpolynomial *isl_qpolynomial_neginfty_on_domain(
__isl_take isl_space *domain)
1951{
if (!domain)
return NULL((void*)0);
return isl_qpolynomial_alloc(domain, 0, isl_poly_neginfty(domain->ctx));
1955}

1957__isl_give isl_qpolynomial *isl_qpolynomial_nan_on_domain(
__isl_take isl_space *domain)
1959{
if (!domain)
return NULL((void*)0);
return isl_qpolynomial_alloc(domain, 0, isl_poly_nan(domain->ctx));
1963}

1965__isl_give isl_qpolynomial *isl_qpolynomial_cst_on_domain(
__isl_take isl_space *domain,
isl_int v)
1968{
struct isl_qpolynomial *qp;
isl_poly_cst *cst;

qp = isl_qpolynomial_zero_on_domain(domain);
if (!qp)
return NULL((void*)0);

cst = isl_poly_as_cst(qp->poly);
isl_int_set(cst->n, v)isl_sioimath_set((cst->n), *(v));

return qp;
1980}

1982isl_bool isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
isl_int *n, isl_int *d)
1984{
isl_bool is_cst;
isl_poly_cst *cst;

if (!qp)
return isl_bool_error;

is_cst = isl_poly_is_cst(qp->poly);
if (is_cst < 0 || !is_cst)
return is_cst;

cst = isl_poly_as_cst(qp->poly);
if (!cst)
return isl_bool_error;

if (n)
isl_int_set(*n, cst->n)isl_sioimath_set((*n), *(cst->n));
if (d)
isl_int_set(*d, cst->d)isl_sioimath_set((*d), *(cst->d));

return isl_bool_true;
2005}

2007/* Return the constant term of "poly".
*/
2009static __isl_give isl_val *isl_poly_get_constant_val(__isl_keep isl_poly *poly)
2010{
isl_bool is_cst;
isl_poly_cst *cst;

if (!poly)
return NULL((void*)0);

while ((is_cst = isl_poly_is_cst(poly)) == isl_bool_false) {
isl_poly_rec *rec;

rec = isl_poly_as_rec(poly);
if (!rec)
	return NULL((void*)0);
poly = rec->p[0];
}
if (is_cst < 0)
return NULL((void*)0);

cst = isl_poly_as_cst(poly);
if (!cst)
return NULL((void*)0);
return isl_val_rat_from_isl_int(cst->poly.ctx, cst->n, cst->d);
2032}

2034/* Return the constant term of "qp".
*/
2036__isl_give isl_val *isl_qpolynomial_get_constant_val(
__isl_keep isl_qpolynomial *qp)
2038{
if (!qp)
return NULL((void*)0);

return isl_poly_get_constant_val(qp->poly);
2043}

2045isl_bool isl_poly_is_affine(__isl_keep isl_poly *poly)
2046{
isl_bool is_cst;
isl_poly_rec *rec;

if (!poly)
return isl_bool_error;

if (poly->var < 0)
return isl_bool_true;

rec = isl_poly_as_rec(poly);
if (!rec)
return isl_bool_error;

if (rec->n > 2)
return isl_bool_false;

isl_assert(poly->ctx, rec->n > 1, return isl_bool_error)do { if (rec->n > 1) break; do { isl_handle_error(poly->
ctx, isl_error_unknown, "Assertion \"" "rec->n > 1" "\" failed"
, "polly/lib/External/isl/isl_polynomial.c", 2063); return isl_bool_error
; } while (0); } while (0);

is_cst = isl_poly_is_cst(rec->p[1]);
if (is_cst < 0 || !is_cst)
return is_cst;

return isl_poly_is_affine(rec->p[0]);
2070}

2072isl_bool isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
2073{
if (!qp)
return isl_bool_error;

if (qp->div->n_row > 0)
return isl_bool_false;

return isl_poly_is_affine(qp->poly);
2081}

2083static void update_coeff(__isl_keep isl_vec *aff,
__isl_keep isl_poly_cst *cst, int pos)
2085{
isl_int gcd;
isl_int f;

if (isl_int_is_zero(cst->n)(isl_sioimath_sgn(*(cst->n)) == 0))
return;

isl_int_init(gcd)isl_sioimath_init((gcd));
isl_int_init(f)isl_sioimath_init((f));
isl_int_gcd(gcd, cst->d, aff->el[0])isl_sioimath_gcd((gcd), *(cst->d), *(aff->el[0]));
isl_int_divexact(f, cst->d, gcd)isl_sioimath_tdiv_q((f), *(cst->d), *(gcd));
isl_int_divexact(gcd, aff->el[0], gcd)isl_sioimath_tdiv_q((gcd), *(aff->el[0]), *(gcd));
isl_seq_scale(aff->el, aff->el, f, aff->size);
isl_int_mul(aff->el[1 + pos], gcd, cst->n)isl_sioimath_mul((aff->el[1 + pos]), *(gcd), *(cst->n));
isl_int_clear(gcd)isl_sioimath_clear((gcd));
isl_int_clear(f)isl_sioimath_clear((f));
2101}

2103int isl_poly_update_affine(__isl_keep isl_poly *poly, __isl_keep isl_vec *aff)
2104{
isl_poly_cst *cst;
isl_poly_rec *rec;

if (!poly || !aff)
return -1;

if (poly->var < 0) {
isl_poly_cst *cst;

cst = isl_poly_as_cst(poly);
if (!cst)
	return -1;
update_coeff(aff, cst, 0);
return 0;
}

rec = isl_poly_as_rec(poly);
if (!rec)
return -1;
isl_assert(poly->ctx, rec->n == 2, return -1)do { if (rec->n == 2) break; do { isl_handle_error(poly->
ctx, isl_error_unknown, "Assertion \"" "rec->n == 2" "\" failed"
, "polly/lib/External/isl/isl_polynomial.c", 2124); return -1
; } while (0); } while (0);

cst = isl_poly_as_cst(rec->p[1]);
if (!cst)
return -1;
update_coeff(aff, cst, 1 + poly->var);

return isl_poly_update_affine(rec->p[0], aff);
2132}

2134__isl_give isl_vec *isl_qpolynomial_extract_affine(
__isl_keep isl_qpolynomial *qp)
2136{
isl_vec *aff;
isl_size d;

d = isl_qpolynomial_domain_dim(qp, isl_dim_all);
if (d < 0)
return NULL((void*)0);

aff = isl_vec_alloc(qp->div->ctx, 2 + d);
if (!aff)
return NULL((void*)0);

isl_seq_clr(aff->el + 1, 1 + d);
isl_int_set_si(aff->el[0], 1)isl_sioimath_set_si((aff->el[0]), 1);

if (isl_poly_update_affine(qp->poly, aff) < 0)
goto error;

return aff;
2155error:
isl_vec_free(aff);
return NULL((void*)0);
2158}

2160/* Compare two quasi-polynomials.
*
* Return -1 if "qp1" is "smaller" than "qp2", 1 if "qp1" is "greater"
* than "qp2" and 0 if they are equal.
*/
2165int isl_qpolynomial_plain_cmp(__isl_keep isl_qpolynomial *qp1,
__isl_keep isl_qpolynomial *qp2)
2167{
int cmp;

if (qp1 == qp2)
return 0;
if (!qp1)
return -1;
if (!qp2)
return 1;

cmp = isl_space_cmp(qp1->dim, qp2->dim);
if (cmp != 0)
return cmp;

cmp = isl_local_cmp(qp1->div, qp2->div);
if (cmp != 0)
return cmp;

return isl_poly_plain_cmp(qp1->poly, qp2->poly);
2186}

2188/* Is "qp1" obviously equal to "qp2"?
*
* NaN is not equal to anything, not even to another NaN.
*/
2192isl_bool isl_qpolynomial_plain_is_equal(__isl_keep isl_qpolynomial *qp1,
__isl_keep isl_qpolynomial *qp2)
2194{
isl_bool equal;

if (!qp1 || !qp2)
return isl_bool_error;

if (isl_qpolynomial_is_nan(qp1) || isl_qpolynomial_is_nan(qp2))
return isl_bool_false;

equal = isl_space_is_equal(qp1->dim, qp2->dim);
if (equal < 0 || !equal)
return equal;

equal = isl_mat_is_equal(qp1->div, qp2->div);
if (equal < 0 || !equal)
return equal;

return isl_poly_is_equal(qp1->poly, qp2->poly);
2212}

2214static isl_stat poly_update_den(__isl_keep isl_poly *poly, isl_int *d)
2215{
int i;
isl_bool is_cst;
isl_poly_rec *rec;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0)
return isl_stat_error;
if (is_cst) {
isl_poly_cst *cst;
cst = isl_poly_as_cst(poly);
if (!cst)
	return isl_stat_error;
isl_int_lcm(*d, *d, cst->d)isl_sioimath_lcm((*d), *(*d), *(cst->d));
return isl_stat_ok;
}

rec = isl_poly_as_rec(poly);
if (!rec)
return isl_stat_error;

for (i = 0; i < rec->n; ++i)
poly_update_den(rec->p[i], d);

return isl_stat_ok;
2240}

2242__isl_give isl_val *isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp)
2243{
isl_val *d;

if (!qp)
return NULL((void*)0);
d = isl_val_one(isl_qpolynomial_get_ctx(qp));
if (!d)
return NULL((void*)0);
if (poly_update_den(qp->poly, &d->n) < 0)
return isl_val_free(d);
return d;
2254}

2256__isl_give isl_qpolynomial *isl_qpolynomial_var_pow_on_domain(
__isl_take isl_space *domain, int pos, int power)
2258{
struct isl_ctx *ctx;

if (!domain)
return NULL((void*)0);

ctx = domain->ctx;

return isl_qpolynomial_alloc(domain, 0,
			isl_poly_var_pow(ctx, pos, power));
2268}

2270__isl_give isl_qpolynomial *isl_qpolynomial_var_on_domain(
__isl_take isl_space *domain, enum isl_dim_type type, unsigned pos)
2272{
if (isl_space_check_is_set(domain ) < 0)
goto error;
if (isl_space_check_range(domain, type, pos, 1) < 0)
goto error;

pos += isl_space_offset(domain, type);

return isl_qpolynomial_var_pow_on_domain(domain, pos, 1);
2281error:
isl_space_free(domain);
return NULL((void*)0);
2284}

2286__isl_give isl_poly *isl_poly_subs(__isl_take isl_poly *poly,
unsigned first, unsigned n, __isl_keep isl_poly **subs)
2288{
int i;
isl_bool is_cst;
isl_poly_rec *rec;
isl_poly *base, *res;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0)
return isl_poly_free(poly);
if (is_cst)
return poly;

if (poly->var < first)
return poly;

rec = isl_poly_as_rec(poly);
if (!rec)
goto error;

isl_assert(poly->ctx, rec->n >= 1, goto error)do { if (rec->n >= 1) break; do { isl_handle_error(poly
->ctx, isl_error_unknown, "Assertion \"" "rec->n >= 1"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 2307
); goto error; } while (0); } while (0);

if (poly->var >= first + n)
base = isl_poly_var_pow(poly->ctx, poly->var, 1);
else
base = isl_poly_copy(subs[poly->var - first]);

res = isl_poly_subs(isl_poly_copy(rec->p[rec->n - 1]), first, n, subs);
for (i = rec->n - 2; i >= 0; --i) {
isl_poly *t;
t = isl_poly_subs(isl_poly_copy(rec->p[i]), first, n, subs);
res = isl_poly_mul(res, isl_poly_copy(base));
res = isl_poly_sum(res, t);
}

isl_poly_free(base);
isl_poly_free(poly);
		
return res;
2326error:
isl_poly_free(poly);
return NULL((void*)0);
2329}	

2331__isl_give isl_poly *isl_poly_from_affine(isl_ctx *ctx, isl_int *f,
isl_int denom, unsigned len)
2333{
int i;
isl_poly *poly;

isl_assert(ctx, len >= 1, return NULL)do { if (len >= 1) break; do { isl_handle_error(ctx, isl_error_unknown
, "Assertion \"" "len >= 1" "\" failed", "polly/lib/External/isl/isl_polynomial.c"
, 2337); return ((void*)0); } while (0); } while (0);

poly = isl_poly_rat_cst(ctx, f[0], denom);
for (i = 0; i < len - 1; ++i) {
isl_poly *t;
isl_poly *c;

if (isl_int_is_zero(f[1 + i])(isl_sioimath_sgn(*(f[1 + i])) == 0))
	continue;

c = isl_poly_rat_cst(ctx, f[1 + i], denom);
t = isl_poly_var_pow(ctx, i, 1);
t = isl_poly_mul(c, t);
poly = isl_poly_sum(poly, t);
}

return poly;
2354}

2356/* Remove common factor of non-constant terms and denominator.
*/
2358static void normalize_div(__isl_keep isl_qpolynomial *qp, int div)
2359{
isl_ctx *ctx = qp->div->ctx;
unsigned total = qp->div->n_col - 2;

isl_seq_gcd(qp->div->row[div] + 2, total, &ctx->normalize_gcd);
isl_int_gcd(ctx->normalize_gcd,isl_sioimath_gcd((ctx->normalize_gcd), *(ctx->normalize_gcd
), *(qp->div->row[div][0]))
    ctx->normalize_gcd, qp->div->row[div][0])isl_sioimath_gcd((ctx->normalize_gcd), *(ctx->normalize_gcd
), *(qp->div->row[div][0]));
if (isl_int_is_one(ctx->normalize_gcd)(isl_sioimath_cmp_si(*(ctx->normalize_gcd), 1) == 0))
return;

isl_seq_scale_down(qp->div->row[div] + 2, qp->div->row[div] + 2,
	    ctx->normalize_gcd, total);
isl_int_divexact(qp->div->row[div][0], qp->div->row[div][0],isl_sioimath_tdiv_q((qp->div->row[div][0]), *(qp->div
->row[div][0]), *(ctx->normalize_gcd))
	    ctx->normalize_gcd)isl_sioimath_tdiv_q((qp->div->row[div][0]), *(qp->div
->row[div][0]), *(ctx->normalize_gcd));
isl_int_fdiv_q(qp->div->row[div][1], qp->div->row[div][1],isl_sioimath_fdiv_q((qp->div->row[div][1]), *(qp->div
->row[div][1]), *(ctx->normalize_gcd))
	    ctx->normalize_gcd)isl_sioimath_fdiv_q((qp->div->row[div][1]), *(qp->div
->row[div][1]), *(ctx->normalize_gcd));
2375}

2377/* Replace the integer division identified by "div" by the polynomial "s".
* The integer division is assumed not to appear in the definition
* of any other integer divisions.
*/
2381static __isl_give isl_qpolynomial *substitute_div(
__isl_take isl_qpolynomial *qp, int div, __isl_take isl_poly *s)
2383{
int i;
isl_size div_pos;
int *reordering;
isl_ctx *ctx;

if (!qp || !s)
goto error;

qp = isl_qpolynomial_cow(qp);
if (!qp)
goto error;

div_pos = isl_qpolynomial_domain_var_offset(qp, isl_dim_div);
if (div_pos < 0)
goto error;
qp->poly = isl_poly_subs(qp->poly, div_pos + div, 1, &s);
if (!qp->poly)
goto error;

ctx = isl_qpolynomial_get_ctx(qp);
reordering = isl_alloc_array(ctx, int, div_pos + qp->div->n_row)((int *)isl_malloc_or_die(ctx, (div_pos + qp->div->n_row
)*sizeof(int)));
if (!reordering)
goto error;
for (i = 0; i < div_pos + div; ++i)
reordering[i] = i;
for (i = div_pos + div + 1; i < div_pos + qp->div->n_row; ++i)
reordering[i] = i - 1;
qp->div = isl_mat_drop_rows(qp->div, div, 1);
qp->div = isl_mat_drop_cols(qp->div, 2 + div_pos + div, 1);
qp->poly = reorder(qp->poly, reordering);
free(reordering);

if (!qp->poly || !qp->div)
goto error;

isl_poly_free(s);
return qp;
2421error:
isl_qpolynomial_free(qp);
isl_poly_free(s);
return NULL((void*)0);
2425}

2427/* Replace all integer divisions [e/d] that turn out to not actually be integer
* divisions because d is equal to 1 by their definition, i.e., e.
*/
2430static __isl_give isl_qpolynomial *substitute_non_divs(
__isl_take isl_qpolynomial *qp)
2432{
int i, j;
isl_size div_pos;
isl_poly *s;

div_pos = isl_qpolynomial_domain_var_offset(qp, isl_dim_div);
if (div_pos < 0)
return isl_qpolynomial_free(qp);

for (i = 0; qp && i < qp->div->n_row; ++i) {
if (!isl_int_is_one(qp->div->row[i][0])(isl_sioimath_cmp_si(*(qp->div->row[i][0]), 1) == 0))
	continue;
for (j = i + 1; j < qp->div->n_row; ++j) {
	if (isl_int_is_zero(qp->div->row[j][2 + div_pos + i])(isl_sioimath_sgn(*(qp->div->row[j][2 + div_pos + i])) ==
 0))
		continue;
	isl_seq_combine(qp->div->row[j] + 1,
		qp->div->ctx->one, qp->div->row[j] + 1,
		qp->div->row[j][2 + div_pos + i],
		qp->div->row[i] + 1, 1 + div_pos + i);
	isl_int_set_si(qp->div->row[j][2 + div_pos + i], 0)isl_sioimath_set_si((qp->div->row[j][2 + div_pos + i]),
 0);
	normalize_div(qp, j);
}
s = isl_poly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
			qp->div->row[i][0], qp->div->n_col - 1);
qp = substitute_div(qp, i, s);
--i;
}

return qp;
2461}

2463/* Reduce the coefficients of div "div" to lie in the interval [0, d-1],
* with d the denominator.  When replacing the coefficient e of x by
* d * frac(e/d) = e - d * floor(e/d), we are subtracting d * floor(e/d) * x
* inside the division, so we need to add floor(e/d) * x outside.
* That is, we replace q by q' + floor(e/d) * x and we therefore need
* to adjust the coefficient of x in each later div that depends on the
* current div "div" and also in the affine expressions in the rows of "mat"
* (if they too depend on "div").
*/
2472static void reduce_div(__isl_keep isl_qpolynomial *qp, int div,
__isl_keep isl_mat **mat)
2474{
int i, j;
isl_int v;
unsigned total = qp->div->n_col - qp->div->n_row - 2;

isl_int_init(v)isl_sioimath_init((v));
for (i = 0; i < 1 + total + div; ++i) {
if (isl_int_is_nonneg(qp->div->row[div][1 + i])(isl_sioimath_sgn(*(qp->div->row[div][1 + i])) >= 0) &&
    isl_int_lt(qp->div->row[div][1 + i], qp->div->row[div][0])(isl_sioimath_cmp(*(qp->div->row[div][1 + i]), *(qp->
div->row[div][0])) < 0))
	continue;
isl_int_fdiv_q(v, qp->div->row[div][1 + i], qp->div->row[div][0])isl_sioimath_fdiv_q((v), *(qp->div->row[div][1 + i]), *
(qp->div->row[div][0]));
isl_int_fdiv_r(qp->div->row[div][1 + i],isl_sioimath_fdiv_r((qp->div->row[div][1 + i]), *(qp->
div->row[div][1 + i]), *(qp->div->row[div][0]))
		qp->div->row[div][1 + i], qp->div->row[div][0])isl_sioimath_fdiv_r((qp->div->row[div][1 + i]), *(qp->
div->row[div][1 + i]), *(qp->div->row[div][0]));
*mat = isl_mat_col_addmul(*mat, i, v, 1 + total + div);
for (j = div + 1; j < qp->div->n_row; ++j) {
	if (isl_int_is_zero(qp->div->row[j][2 + total + div])(isl_sioimath_sgn(*(qp->div->row[j][2 + total + div])) ==
 0))
		continue;
	isl_int_addmul(qp->div->row[j][1 + i],isl_sioimath_addmul((qp->div->row[j][1 + i]), *(v), *(qp
->div->row[j][2 + total + div]))
			v, qp->div->row[j][2 + total + div])isl_sioimath_addmul((qp->div->row[j][1 + i]), *(v), *(qp
->div->row[j][2 + total + div]));
}
}
isl_int_clear(v)isl_sioimath_clear((v));
2496}

2498/* Check if the last non-zero coefficient is bigger that half of the
* denominator.  If so, we will invert the div to further reduce the number
* of distinct divs that may appear.
* If the last non-zero coefficient is exactly half the denominator,
* then we continue looking for earlier coefficients that are bigger
* than half the denominator.
*/
2505static int needs_invert(__isl_keep isl_mat *div, int row)
2506{
int i;
int cmp;

for (i = div->n_col - 1; i >= 1; --i) {
if (isl_int_is_zero(div->row[row][i])(isl_sioimath_sgn(*(div->row[row][i])) == 0))
	continue;
isl_int_mul_ui(div->row[row][i], div->row[row][i], 2)isl_sioimath_mul_ui((div->row[row][i]), *(div->row[row]
[i]), 2);
cmp = isl_int_cmp(div->row[row][i], div->row[row][0])isl_sioimath_cmp(*(div->row[row][i]), *(div->row[row][0
]));
isl_int_divexact_ui(div->row[row][i], div->row[row][i], 2)isl_sioimath_tdiv_q_ui((div->row[row][i]), *(div->row[row
][i]), 2);
if (cmp)
	return cmp > 0;
if (i == 1)
	return 1;
}

return 0;
2523}

2525/* Replace div "div" q = [e/d] by -[(-e+(d-1))/d].
* We only invert the coefficients of e (and the coefficient of q in
* later divs and in the rows of "mat").  After calling this function, the
* coefficients of e should be reduced again.
*/
2530static void invert_div(__isl_keep isl_qpolynomial *qp, int div,
__isl_keep isl_mat **mat)
2532{
unsigned total = qp->div->n_col - qp->div->n_row - 2;

isl_seq_neg(qp->div->row[div] + 1,
    qp->div->row[div] + 1, qp->div->n_col - 1);
isl_int_sub_ui(qp->div->row[div][1], qp->div->row[div][1], 1)isl_sioimath_sub_ui((qp->div->row[div][1]), *(qp->div
->row[div][1]), 1);
isl_int_add(qp->div->row[div][1],isl_sioimath_add((qp->div->row[div][1]), *(qp->div->
row[div][1]), *(qp->div->row[div][0]))
    qp->div->row[div][1], qp->div->row[div][0])isl_sioimath_add((qp->div->row[div][1]), *(qp->div->
row[div][1]), *(qp->div->row[div][0]));
*mat = isl_mat_col_neg(*mat, 1 + total + div);
isl_mat_col_mul(qp->div, 2 + total + div,
	qp->div->ctx->negone, 2 + total + div);
2543}

2545/* Reduce all divs of "qp" to have coefficients
* in the interval [0, d-1], with d the denominator and such that the
* last non-zero coefficient that is not equal to d/2 is smaller than d/2.
* The modifications to the integer divisions need to be reflected
* in the factors of the polynomial that refer to the original
* integer divisions.  To this end, the modifications are collected
* as a set of affine expressions and then plugged into the polynomial.
*
* After the reduction, some divs may have become redundant or identical,
* so we call substitute_non_divs and sort_divs.  If these functions
* eliminate divs or merge two or more divs into one, the coefficients
* of the enclosing divs may have to be reduced again, so we call
* ourselves recursively if the number of divs decreases.
*/
2559static __isl_give isl_qpolynomial *reduce_divs(__isl_take isl_qpolynomial *qp)
2560{
int i;
isl_ctx *ctx;
isl_mat *mat;
isl_poly **s;
unsigned o_div;
isl_size n_div, total, new_n_div;

total = isl_qpolynomial_domain_dim(qp, isl_dim_all);
n_div = isl_qpolynomial_domain_dim(qp, isl_dim_div);
o_div = isl_qpolynomial_domain_offset(qp, isl_dim_div);
if (total < 0 || n_div < 0)
return isl_qpolynomial_free(qp);
ctx = isl_qpolynomial_get_ctx(qp);
mat = isl_mat_zero(ctx, n_div, 1 + total);

for (i = 0; i < n_div; ++i)
mat = isl_mat_set_element_si(mat, i, o_div + i, 1);

for (i = 0; i < qp->div->n_row; ++i) {
normalize_div(qp, i);
reduce_div(qp, i, &mat);
if (needs_invert(qp->div, i)) {
	invert_div(qp, i, &mat);
	reduce_div(qp, i, &mat);
}
}
if (!mat)
goto error;

s = isl_alloc_array(ctx, struct isl_poly *, n_div)((struct isl_poly * *)isl_malloc_or_die(ctx, (n_div)*sizeof(struct
 isl_poly *)));
if (n_div && !s)
goto error;
for (i = 0; i < n_div; ++i)
s[i] = isl_poly_from_affine(ctx, mat->row[i], ctx->one,
			    1 + total);
qp->poly = isl_poly_subs(qp->poly, o_div - 1, n_div, s);
for (i = 0; i < n_div; ++i)
isl_poly_free(s[i]);
free(s);
if (!qp->poly)
goto error;

isl_mat_free(mat);

qp = substitute_non_divs(qp);
qp = sort_divs(qp);
new_n_div = isl_qpolynomial_domain_dim(qp, isl_dim_div);
if (new_n_div < 0)
return isl_qpolynomial_free(qp);
if (new_n_div < n_div)
return reduce_divs(qp);

return qp;
2614error:
isl_qpolynomial_free(qp);
isl_mat_free(mat);
return NULL((void*)0);
2618}

2620__isl_give isl_qpolynomial *isl_qpolynomial_rat_cst_on_domain(
__isl_take isl_space *domain, const isl_int n, const isl_int d)
2622{
struct isl_qpolynomial *qp;
isl_poly_cst *cst;

qp = isl_qpolynomial_zero_on_domain(domain);
if (!qp)
return NULL((void*)0);

cst = isl_poly_as_cst(qp->poly);
isl_int_set(cst->n, n)isl_sioimath_set((cst->n), *(n));
isl_int_set(cst->d, d)isl_sioimath_set((cst->d), *(d));

return qp;
2635}

2637/* Return an isl_qpolynomial that is equal to "val" on domain space "domain".
*/
2639__isl_give isl_qpolynomial *isl_qpolynomial_val_on_domain(
__isl_take isl_space *domain, __isl_take isl_val *val)
2641{
isl_qpolynomial *qp;
isl_poly_cst *cst;

qp = isl_qpolynomial_zero_on_domain(domain);
if (!qp || !val)
goto error;

cst = isl_poly_as_cst(qp->poly);
isl_int_set(cst->n, val->n)isl_sioimath_set((cst->n), *(val->n));
isl_int_set(cst->d, val->d)isl_sioimath_set((cst->d), *(val->d));

isl_val_free(val);
return qp;
2655error:
isl_val_free(val);
isl_qpolynomial_free(qp);
return NULL((void*)0);
2659}

2661static isl_stat poly_set_active(__isl_keep isl_poly *poly, int *active, int d)
2662{
isl_bool is_cst;
isl_poly_rec *rec;
int i;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0)
return isl_stat_error;
if (is_cst)
return isl_stat_ok;

if (poly->var < d)
active[poly->var] = 1;

rec = isl_poly_as_rec(poly);
for (i = 0; i < rec->n; ++i)
if (poly_set_active(rec->p[i], active, d) < 0)
	return isl_stat_error;

return isl_stat_ok;
2682}

2684static isl_stat set_active(__isl_keep isl_qpolynomial *qp, int *active)
2685{
int i, j;
isl_size d;
isl_space *space;

space = isl_qpolynomial_peek_domain_space(qp);
d = isl_space_dim(space, isl_dim_all);
if (d < 0 || !active)
return isl_stat_error;

for (i = 0; i < d; ++i)
for (j = 0; j < qp->div->n_row; ++j) {
	if (isl_int_is_zero(qp->div->row[j][2 + i])(isl_sioimath_sgn(*(qp->div->row[j][2 + i])) == 0))
		continue;
	active[i] = 1;
	break;
}

return poly_set_active(qp->poly, active, d);
2704}

2706#undef TYPEisl_term
2707#define TYPEisl_term	isl_qpolynomial
2708static
2709#include "check_type_range_templ.c"

2711isl_bool isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
enum isl_dim_type type, unsigned first, unsigned n)
2713{
int i;
int *active = NULL((void*)0);
isl_bool involves = isl_bool_false;
isl_size offset;
isl_size d;
isl_space *space;

if (!qp)
return isl_bool_error;
if (n == 0)
return isl_bool_false;

if (isl_qpolynomial_check_range(qp, type, first, n) < 0)
return isl_bool_error;
isl_assert(qp->dim->ctx, type == isl_dim_param ||do { if (type == isl_dim_param || type == isl_dim_in) break; do
 { isl_handle_error(qp->dim->ctx, isl_error_unknown, "Assertion \""
 "type == isl_dim_param || type == isl_dim_in" "\" failed", "polly/lib/External/isl/isl_polynomial.c"
, 2729); return isl_bool_error; } while (0); } while (0)
		 type == isl_dim_in, return isl_bool_error)do { if (type == isl_dim_param || type == isl_dim_in) break; do
 { isl_handle_error(qp->dim->ctx, isl_error_unknown, "Assertion \""
 "type == isl_dim_param || type == isl_dim_in" "\" failed", "polly/lib/External/isl/isl_polynomial.c"
, 2729); return isl_bool_error; } while (0); } while (0);

space = isl_qpolynomial_peek_domain_space(qp);
d = isl_space_dim(space, isl_dim_all);
if (d < 0)
return isl_bool_error;
active = isl_calloc_array(qp->dim->ctx, int, d)((int *)isl_calloc_or_die(qp->dim->ctx, d, sizeof(int))
);
if (set_active(qp, active) < 0)
goto error;

offset = isl_qpolynomial_domain_var_offset(qp, domain_type(type));
if (offset < 0)
goto error;
first += offset;
for (i = 0; i < n; ++i)
if (active[first + i]) {
	involves = isl_bool_true;
	break;
}

free(active);

return involves;
2752error:
free(active);
return isl_bool_error;
2755}

2757/* Remove divs that do not appear in the quasi-polynomial, nor in any
* of the divs that do appear in the quasi-polynomial.
*/
2760static __isl_give isl_qpolynomial *remove_redundant_divs(
__isl_take isl_qpolynomial *qp)
2762{
int i, j;
isl_size div_pos;
int len;
int skip;
int *active = NULL((void*)0);
int *reordering = NULL((void*)0);
int redundant = 0;
int n_div;
isl_ctx *ctx;

if (!qp)
return NULL((void*)0);
if (qp->div->n_row == 0)
return qp;

div_pos = isl_qpolynomial_domain_var_offset(qp, isl_dim_div);
if (div_pos < 0)
return isl_qpolynomial_free(qp);
len = qp->div->n_col - 2;
ctx = isl_qpolynomial_get_ctx(qp);
active = isl_calloc_array(ctx, int, len)((int *)isl_calloc_or_die(ctx, len, sizeof(int)));
if (!active)
goto error;

if (poly_set_active(qp->poly, active, len) < 0)
goto error;

for (i = qp->div->n_row - 1; i >= 0; --i) {
if (!active[div_pos + i]) {
	redundant = 1;
	continue;
}
for (j = 0; j < i; ++j) {
	if (isl_int_is_zero(qp->div->row[i][2 + div_pos + j])(isl_sioimath_sgn(*(qp->div->row[i][2 + div_pos + j])) ==
 0))
		continue;
	active[div_pos + j] = 1;
	break;
}
}

if (!redundant) {
free(active);
return qp;
}

reordering = isl_alloc_array(qp->div->ctx, int, len)((int *)isl_malloc_or_die(qp->div->ctx, (len)*sizeof(int
)));
if (!reordering)
goto error;

for (i = 0; i < div_pos; ++i)
reordering[i] = i;

skip = 0;
n_div = qp->div->n_row;
for (i = 0; i < n_div; ++i) {
if (!active[div_pos + i]) {
	qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
	qp->div = isl_mat_drop_cols(qp->div,
				    2 + div_pos + i - skip, 1);
	skip++;
}
reordering[div_pos + i] = div_pos + i - skip;
}

qp->poly = reorder(qp->poly, reordering);

if (!qp->poly || !qp->div)
goto error;

free(active);
free(reordering);

return qp;
2836error:
free(active);
free(reordering);
isl_qpolynomial_free(qp);
return NULL((void*)0);
2841}

2843__isl_give isl_poly *isl_poly_drop(__isl_take isl_poly *poly,
unsigned first, unsigned n)
2845{
int i;
isl_poly_rec *rec;

if (!poly)
return NULL((void*)0);
if (n == 0 || poly->var < 0 || poly->var < first)
return poly;
if (poly->var < first + n) {
poly = replace_by_constant_term(poly);
return isl_poly_drop(poly, first, n);
}
poly = isl_poly_cow(poly);
if (!poly)
return NULL((void*)0);
poly->var -= n;
rec = isl_poly_as_rec(poly);
if (!rec)
goto error;

for (i = 0; i < rec->n; ++i) {
rec->p[i] = isl_poly_drop(rec->p[i], first, n);
if (!rec->p[i])
	goto error;
}

return poly;
2872error:
isl_poly_free(poly);
return NULL((void*)0);
2875}

2877__isl_give isl_qpolynomial *isl_qpolynomial_set_dim_name(
__isl_take isl_qpolynomial *qp,
enum isl_dim_type type, unsigned pos, const char *s)
2880{
qp = isl_qpolynomial_cow(qp);
if (!qp)
return NULL((void*)0);
if (type == isl_dim_out)
isl_die(isl_qpolynomial_get_ctx(qp), isl_error_invalid,do { isl_handle_error(isl_qpolynomial_get_ctx(qp), isl_error_invalid
, "cannot set name of output/set dimension", "polly/lib/External/isl/isl_polynomial.c"
, 2887); return isl_qpolynomial_free(qp); } while (0)
	"cannot set name of output/set dimension",do { isl_handle_error(isl_qpolynomial_get_ctx(qp), isl_error_invalid
, "cannot set name of output/set dimension", "polly/lib/External/isl/isl_polynomial.c"
, 2887); return isl_qpolynomial_free(qp); } while (0)
	return isl_qpolynomial_free(qp))do { isl_handle_error(isl_qpolynomial_get_ctx(qp), isl_error_invalid
, "cannot set name of output/set dimension", "polly/lib/External/isl/isl_polynomial.c"
, 2887); return isl_qpolynomial_free(qp); } while (0);
type = domain_type(type);
qp->dim = isl_space_set_dim_name(qp->dim, type, pos, s);
if (!qp->dim)
goto error;
return qp;
2893error:
isl_qpolynomial_free(qp);
return NULL((void*)0);
2896}

2898__isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
__isl_take isl_qpolynomial *qp,
enum isl_dim_type type, unsigned first, unsigned n)
2901{
isl_size offset;

if (!qp)
return NULL((void*)0);
if (type == isl_dim_out)
isl_die(qp->dim->ctx, isl_error_invalid,do { isl_handle_error(qp->dim->ctx, isl_error_invalid, "cannot drop output/set dimension"
, "polly/lib/External/isl/isl_polynomial.c", 2909); goto error
; } while (0)
	"cannot drop output/set dimension",do { isl_handle_error(qp->dim->ctx, isl_error_invalid, "cannot drop output/set dimension"
, "polly/lib/External/isl/isl_polynomial.c", 2909); goto error
; } while (0)
	goto error)do { isl_handle_error(qp->dim->ctx, isl_error_invalid, "cannot drop output/set dimension"
, "polly/lib/External/isl/isl_polynomial.c", 2909); goto error
; } while (0);
if (isl_qpolynomial_check_range(qp, type, first, n) < 0)
return isl_qpolynomial_free(qp);
type = domain_type(type);
if (n == 0 && !isl_space_is_named_or_nested(qp->dim, type))
return qp;

qp = isl_qpolynomial_cow(qp);
if (!qp)
return NULL((void*)0);

isl_assert(qp->dim->ctx, type == isl_dim_param ||do { if (type == isl_dim_param || type == isl_dim_set) break;
 do { isl_handle_error(qp->dim->ctx, isl_error_unknown,
 "Assertion \"" "type == isl_dim_param || type == isl_dim_set"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 2921
); goto error; } while (0); } while (0)
		 type == isl_dim_set, goto error)do { if (type == isl_dim_param || type == isl_dim_set) break;
 do { isl_handle_error(qp->dim->ctx, isl_error_unknown,
 "Assertion \"" "type == isl_dim_param || type == isl_dim_set"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 2921
); goto error; } while (0); } while (0);

qp->dim = isl_space_drop_dims(qp->dim, type, first, n);
if (!qp->dim)
goto error;

offset = isl_qpolynomial_domain_var_offset(qp, type);
if (offset < 0)
goto error;
first += offset;

qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
if (!qp->div)
goto error;

qp->poly = isl_poly_drop(qp->poly, first, n);
if (!qp->poly)
goto error;

return qp;
2941error:
isl_qpolynomial_free(qp);
return NULL((void*)0);
2944}

2946/* Project the domain of the quasi-polynomial onto its parameter space.
* The quasi-polynomial may not involve any of the domain dimensions.
*/
2949__isl_give isl_qpolynomial *isl_qpolynomial_project_domain_on_params(
__isl_take isl_qpolynomial *qp)
2951{
isl_space *space;
isl_size n;
isl_bool involves;

n = isl_qpolynomial_dim(qp, isl_dim_in);
if (n < 0)
return isl_qpolynomial_free(qp);
involves = isl_qpolynomial_involves_dims(qp, isl_dim_in, 0, n);
if (involves < 0)
return isl_qpolynomial_free(qp);
if (involves)
isl_die(isl_qpolynomial_get_ctx(qp), isl_error_invalid,do { isl_handle_error(isl_qpolynomial_get_ctx(qp), isl_error_invalid
, "polynomial involves some of the domain dimensions", "polly/lib/External/isl/isl_polynomial.c"
, 2965); return isl_qpolynomial_free(qp); } while (0)
	"polynomial involves some of the domain dimensions",do { isl_handle_error(isl_qpolynomial_get_ctx(qp), isl_error_invalid
, "polynomial involves some of the domain dimensions", "polly/lib/External/isl/isl_polynomial.c"
, 2965); return isl_qpolynomial_free(qp); } while (0)
	return isl_qpolynomial_free(qp))do { isl_handle_error(isl_qpolynomial_get_ctx(qp), isl_error_invalid
, "polynomial involves some of the domain dimensions", "polly/lib/External/isl/isl_polynomial.c"
, 2965); return isl_qpolynomial_free(qp); } while (0);
qp = isl_qpolynomial_drop_dims(qp, isl_dim_in, 0, n);
space = isl_qpolynomial_get_domain_space(qp);
space = isl_space_params(space);
qp = isl_qpolynomial_reset_domain_space(qp, space);
return qp;
2971}

2973static __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities_lifted(
__isl_take isl_qpolynomial *qp, __isl_take isl_basic_setisl_basic_map *eq)
2975{
int i, j, k;
isl_int denom;
unsigned total;
unsigned n_div;
isl_poly *poly;

if (!eq)
goto error;
if (eq->n_eq == 0) {
isl_basic_set_free(eq);
return qp;
}

qp = isl_qpolynomial_cow(qp);
if (!qp)
goto error;
qp->div = isl_mat_cow(qp->div);
if (!qp->div)
goto error;

total = isl_basic_set_offset(eq, isl_dim_div);
n_div = eq->n_div;
isl_int_init(denom)isl_sioimath_init((denom));
for (i = 0; i < eq->n_eq; ++i) {
j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
if (j < 0 || j == 0 || j >= total)
	continue;

for (k = 0; k < qp->div->n_row; ++k) {
	if (isl_int_is_zero(qp->div->row[k][1 + j])(isl_sioimath_sgn(*(qp->div->row[k][1 + j])) == 0))
		continue;
	isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total,
			&qp->div->row[k][0]);
	normalize_div(qp, k);
}

if (isl_int_is_pos(eq->eq[i][j])(isl_sioimath_sgn(*(eq->eq[i][j])) > 0))
	isl_seq_neg(eq->eq[i], eq->eq[i], total);
isl_int_abs(denom, eq->eq[i][j])isl_sioimath_abs((denom), *(eq->eq[i][j]));
isl_int_set_si(eq->eq[i][j], 0)isl_sioimath_set_si((eq->eq[i][j]), 0);

poly = isl_poly_from_affine(qp->dim->ctx,
				   eq->eq[i], denom, total);
qp->poly = isl_poly_subs(qp->poly, j - 1, 1, &poly);
isl_poly_free(poly);
}
isl_int_clear(denom)isl_sioimath_clear((denom));

if (!qp->poly)
goto error;

isl_basic_set_free(eq);

qp = substitute_non_divs(qp);
qp = sort_divs(qp);

return qp;
3033error:
isl_basic_set_free(eq);
isl_qpolynomial_free(qp);
return NULL((void*)0);
3037}

3039/* Exploit the equalities in "eq" to simplify the quasi-polynomial.
*/
3041__isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities(
__isl_take isl_qpolynomial *qp, __isl_take isl_basic_setisl_basic_map *eq)
3043{
if (!qp || !eq)
goto error;
if (qp->div->n_row > 0)
eq = isl_basic_set_add_dims(eq, isl_dim_set, qp->div->n_row);
return isl_qpolynomial_substitute_equalities_lifted(qp, eq);
3049error:
isl_basic_set_free(eq);
isl_qpolynomial_free(qp);
return NULL((void*)0);
3053}

3055/* Look for equalities among the variables shared by context and qp
* and the integer divisions of qp, if any.
* The equalities are then used to eliminate variables and/or integer
* divisions from qp.
*/
3060__isl_give isl_qpolynomial *isl_qpolynomial_gist(
__isl_take isl_qpolynomial *qp, __isl_take isl_setisl_map *context)
3062{
isl_local_space *ls;
isl_basic_setisl_basic_map *aff;

ls = isl_qpolynomial_get_domain_local_space(qp);
context = isl_local_space_lift_set(ls, context);

aff = isl_set_affine_hull(context);
return isl_qpolynomial_substitute_equalities_lifted(qp, aff);
3071}

3073__isl_give isl_qpolynomial *isl_qpolynomial_gist_params(
__isl_take isl_qpolynomial *qp, __isl_take isl_setisl_map *context)
3075{
isl_space *space = isl_qpolynomial_get_domain_space(qp);
isl_setisl_map *dom_context = isl_set_universe(space);
dom_context = isl_set_intersect_params(dom_context, context);
return isl_qpolynomial_gist(qp, dom_context);
3080}

3082/* Return a zero isl_qpolynomial in the given space.
*
* This is a helper function for isl_pw_*_as_* that ensures a uniform
* interface over all piecewise types.
*/
3087static __isl_give isl_qpolynomial *isl_qpolynomial_zero_in_space(
__isl_take isl_space *space)
3089{
return isl_qpolynomial_zero_on_domain(isl_space_domain(space));
3091}

3093#define isl_qpolynomial_involves_nanisl_qpolynomial_is_nan isl_qpolynomial_is_nan

3095#undef PWisl_pw_qpolynomial
3096#define PWisl_pw_qpolynomial isl_pw_qpolynomial
3097#undef BASEpw_qpolynomial
3098#define BASEpw_qpolynomial qpolynomial
3099#undef EL_IS_ZEROis_zero
3100#define EL_IS_ZEROis_zero is_zero
3101#undef ZEROzero
3102#define ZEROzero zero
3103#undef IS_ZEROis_zero
3104#define IS_ZEROis_zero is_zero
3105#undef FIELDqp
3106#define FIELDqp qp
3107#undef DEFAULT_IS_ZERO1
3108#define DEFAULT_IS_ZERO1 1

3110#include <isl_pw_templ.c>
3111#include <isl_pw_un_op_templ.c>
3112#include <isl_pw_add_disjoint_templ.c>
3113#include <isl_pw_eval.c>
3114#include <isl_pw_fix_templ.c>
3115#include <isl_pw_from_range_templ.c>
3116#include <isl_pw_insert_dims_templ.c>
3117#include <isl_pw_lift_templ.c>
3118#include <isl_pw_morph_templ.c>
3119#include <isl_pw_move_dims_templ.c>
3120#include <isl_pw_neg_templ.c>
3121#include <isl_pw_opt_templ.c>
3122#include <isl_pw_split_dims_templ.c>
3123#include <isl_pw_sub_templ.c>

3125#undef BASEpw_qpolynomial
3126#define BASEpw_qpolynomial pw_qpolynomial

3128#include <isl_union_single.c>
3129#include <isl_union_eval.c>
3130#include <isl_union_neg.c>
3131#include <isl_union_sub_templ.c>

3133int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
3134{
if (!pwqp)
return -1;

if (pwqp->n != -1)
return 0;

if (!isl_set_plain_is_universe(pwqp->p[0].set))
return 0;

return isl_qpolynomial_is_one(pwqp->p[0].qp);
3145}

3147__isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add(
__isl_take isl_pw_qpolynomial *pwqp1,
__isl_take isl_pw_qpolynomial *pwqp2)
3150{
return isl_pw_qpolynomial_union_add_(pwqp1, pwqp2);
3152}

3154__isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
__isl_take isl_pw_qpolynomial *pwqp1,
__isl_take isl_pw_qpolynomial *pwqp2)
3157{
int i, j, n;
struct isl_pw_qpolynomial *res;

if (!pwqp1 || !pwqp2)
goto error;

isl_assert(pwqp1->dim->ctx, isl_space_is_equal(pwqp1->dim, pwqp2->dim),do { if (isl_space_is_equal(pwqp1->dim, pwqp2->dim)) break
; do { isl_handle_error(pwqp1->dim->ctx, isl_error_unknown
, "Assertion \"" "isl_space_is_equal(pwqp1->dim, pwqp2->dim)"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 3165
); goto error; } while (0); } while (0)
	goto error)do { if (isl_space_is_equal(pwqp1->dim, pwqp2->dim)) break
; do { isl_handle_error(pwqp1->dim->ctx, isl_error_unknown
, "Assertion \"" "isl_space_is_equal(pwqp1->dim, pwqp2->dim)"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 3165
); goto error; } while (0); } while (0);

if (isl_pw_qpolynomial_is_zero(pwqp1)) {
isl_pw_qpolynomial_free(pwqp2);
return pwqp1;
}

if (isl_pw_qpolynomial_is_zero(pwqp2)) {
isl_pw_qpolynomial_free(pwqp1);
return pwqp2;
}

if (isl_pw_qpolynomial_is_one(pwqp1)) {
isl_pw_qpolynomial_free(pwqp1);
return pwqp2;
}

if (isl_pw_qpolynomial_is_one(pwqp2)) {
isl_pw_qpolynomial_free(pwqp2);
return pwqp1;
}

n = pwqp1->n * pwqp2->n;
res = isl_pw_qpolynomial_alloc_size(isl_space_copy(pwqp1->dim), n);

for (i = 0; i < pwqp1->n; ++i) {
for (j = 0; j < pwqp2->n; ++j) {
	struct isl_setisl_map *common;
	struct isl_qpolynomial *prod;
	common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
				isl_set_copy(pwqp2->p[j].set));
	if (isl_set_plain_is_empty(common)) {
		isl_set_free(common);
		continue;
	}

	prod = isl_qpolynomial_mul(
		isl_qpolynomial_copy(pwqp1->p[i].qp),
		isl_qpolynomial_copy(pwqp2->p[j].qp));

	res = isl_pw_qpolynomial_add_piece(res, common, prod);
}
}

isl_pw_qpolynomial_free(pwqp1);
isl_pw_qpolynomial_free(pwqp2);

return res;
3213error:
isl_pw_qpolynomial_free(pwqp1);
isl_pw_qpolynomial_free(pwqp2);
return NULL((void*)0);
3217}

3219__isl_give isl_val *isl_poly_eval(__isl_take isl_poly *poly,
__isl_take isl_vec *vec)
3221{
int i;
isl_bool is_cst;
isl_poly_rec *rec;
isl_val *res;
isl_val *base;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0)
goto error;
if (is_cst) {
isl_vec_free(vec);
res = isl_poly_get_constant_val(poly);
isl_poly_free(poly);
return res;
}

rec = isl_poly_as_rec(poly);
if (!rec || !vec)
goto error;

isl_assert(poly->ctx, rec->n >= 1, goto error)do { if (rec->n >= 1) break; do { isl_handle_error(poly
->ctx, isl_error_unknown, "Assertion \"" "rec->n >= 1"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 3242
); goto error; } while (0); } while (0);

base = isl_val_rat_from_isl_int(poly->ctx,
			vec->el[1 + poly->var], vec->el[0]);

res = isl_poly_eval(isl_poly_copy(rec->p[rec->n - 1]),
		isl_vec_copy(vec));

for (i = rec->n - 2; i >= 0; --i) {
res = isl_val_mul(res, isl_val_copy(base));
res = isl_val_add(res, isl_poly_eval(isl_poly_copy(rec->p[i]),
					    isl_vec_copy(vec)));
}

isl_val_free(base);
isl_poly_free(poly);
isl_vec_free(vec);
return res;
3260error:
isl_poly_free(poly);
isl_vec_free(vec);
return NULL((void*)0);
3264}

3266/* Evaluate "qp" in the void point "pnt".
* In particular, return the value NaN.
*/
3269static __isl_give isl_val *eval_void(__isl_take isl_qpolynomial *qp,
__isl_take isl_point *pnt)
3271{
isl_ctx *ctx;

ctx = isl_point_get_ctx(pnt);
isl_qpolynomial_free(qp);
isl_point_free(pnt);
return isl_val_nan(ctx);
3278}

3280__isl_give isl_val *isl_qpolynomial_eval(__isl_take isl_qpolynomial *qp,
__isl_take isl_point *pnt)
3282{
isl_bool is_void;
isl_vec *ext;
isl_val *v;

if (!qp || !pnt)
goto error;
isl_assert(pnt->dim->ctx, isl_space_is_equal(pnt->dim, qp->dim), goto error)do { if (isl_space_is_equal(pnt->dim, qp->dim)) break; do
 { isl_handle_error(pnt->dim->ctx, isl_error_unknown, "Assertion \""
 "isl_space_is_equal(pnt->dim, qp->dim)" "\" failed", "polly/lib/External/isl/isl_polynomial.c"
, 3289); goto error; } while (0); } while (0);
is_void = isl_point_is_void(pnt);
if (is_void < 0)
goto error;
if (is_void)
return eval_void(qp, pnt);

ext = isl_local_extend_point_vec(qp->div, isl_vec_copy(pnt->vec));

v = isl_poly_eval(isl_poly_copy(qp->poly), ext);

isl_qpolynomial_free(qp);
isl_point_free(pnt);

return v;
3304error:
isl_qpolynomial_free(qp);
isl_point_free(pnt);
return NULL((void*)0);
3308}

3310int isl_poly_cmp(__isl_keep isl_poly_cst *cst1, __isl_keep isl_poly_cst *cst2)
3311{
int cmp;
isl_int t;
isl_int_init(t)isl_sioimath_init((t));
isl_int_mul(t, cst1->n, cst2->d)isl_sioimath_mul((t), *(cst1->n), *(cst2->d));
isl_int_submul(t, cst2->n, cst1->d)isl_sioimath_submul((t), *(cst2->n), *(cst1->d));
cmp = isl_int_sgn(t)isl_sioimath_sgn(*(t));
isl_int_clear(t)isl_sioimath_clear((t));
return cmp;
3320}

3322__isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
__isl_take isl_qpolynomial *qp, enum isl_dim_type type,
unsigned first, unsigned n)
3325{
unsigned total;
unsigned g_pos;
int *exp;

if (!qp)
return NULL((void*)0);
if (type == isl_dim_out)
isl_die(qp->div->ctx, isl_error_invalid,do { isl_handle_error(qp->div->ctx, isl_error_invalid, "cannot insert output/set dimensions"
, "polly/lib/External/isl/isl_polynomial.c", 3335); goto error
; } while (0)
	"cannot insert output/set dimensions",do { isl_handle_error(qp->div->ctx, isl_error_invalid, "cannot insert output/set dimensions"
, "polly/lib/External/isl/isl_polynomial.c", 3335); goto error
; } while (0)
	goto error)do { isl_handle_error(qp->div->ctx, isl_error_invalid, "cannot insert output/set dimensions"
, "polly/lib/External/isl/isl_polynomial.c", 3335); goto error
; } while (0);
if (isl_qpolynomial_check_range(qp, type, first, 0) < 0)
return isl_qpolynomial_free(qp);
type = domain_type(type);
if (n == 0 && !isl_space_is_named_or_nested(qp->dim, type))
return qp;

qp = isl_qpolynomial_cow(qp);
if (!qp)
return NULL((void*)0);

g_pos = pos(qp->dim, type) + first;

qp->div = isl_mat_insert_zero_cols(qp->div, 2 + g_pos, n);
if (!qp->div)
goto error;

total = qp->div->n_col - 2;
if (total > g_pos) {
int i;
exp = isl_alloc_array(qp->div->ctx, int, total - g_pos)((int *)isl_malloc_or_die(qp->div->ctx, (total - g_pos)
*sizeof(int)));
if (!exp)
	goto error;
for (i = 0; i < total - g_pos; ++i)
	exp[i] = i + n;
qp->poly = expand(qp->poly, exp, g_pos);
free(exp);
if (!qp->poly)
	goto error;
}

qp->dim = isl_space_insert_dims(qp->dim, type, first, n);
if (!qp->dim)
goto error;

return qp;
3371error:
isl_qpolynomial_free(qp);
return NULL((void*)0);
3374}

3376__isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
__isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
3378{
isl_size pos;

pos = isl_qpolynomial_dim(qp, type);
if (pos < 0)
return isl_qpolynomial_free(qp);

return isl_qpolynomial_insert_dims(qp, type, pos, n);
3386}

3388static int *reordering_move(isl_ctx *ctx,
unsigned len, unsigned dst, unsigned src, unsigned n)
3390{
int i;
int *reordering;

reordering = isl_alloc_array(ctx, int, len)((int *)isl_malloc_or_die(ctx, (len)*sizeof(int)));
if (!reordering)
return NULL((void*)0);

if (dst <= src) {
for (i = 0; i < dst; ++i)
	reordering[i] = i;
for (i = 0; i < n; ++i)
	reordering[src + i] = dst + i;
for (i = 0; i < src - dst; ++i)
	reordering[dst + i] = dst + n + i;
for (i = 0; i < len - src - n; ++i)
	reordering[src + n + i] = src + n + i;
} else {
for (i = 0; i < src; ++i)
	reordering[i] = i;
for (i = 0; i < n; ++i)
	reordering[src + i] = dst + i;
for (i = 0; i < dst - src; ++i)
	reordering[src + n + i] = src + i;
for (i = 0; i < len - dst - n; ++i)
	reordering[dst + n + i] = dst + n + i;
}

return reordering;
3419}

3421__isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
__isl_take isl_qpolynomial *qp,
enum isl_dim_type dst_type, unsigned dst_pos,
enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3425{
unsigned g_dst_pos;
unsigned g_src_pos;
int *reordering;

if (!qp)
return NULL((void*)0);

if (dst_type == isl_dim_out || src_type == isl_dim_out)
isl_die(qp->dim->ctx, isl_error_invalid,do { isl_handle_error(qp->dim->ctx, isl_error_invalid, "cannot move output/set dimension"
, "polly/lib/External/isl/isl_polynomial.c", 3436); goto error
; } while (0)
	"cannot move output/set dimension",do { isl_handle_error(qp->dim->ctx, isl_error_invalid, "cannot move output/set dimension"
, "polly/lib/External/isl/isl_polynomial.c", 3436); goto error
; } while (0)
	goto error)do { isl_handle_error(qp->dim->ctx, isl_error_invalid, "cannot move output/set dimension"
, "polly/lib/External/isl/isl_polynomial.c", 3436); goto error
; } while (0);
if (isl_qpolynomial_check_range(qp, src_type, src_pos, n) < 0)
return isl_qpolynomial_free(qp);
if (dst_type == isl_dim_in)
dst_type = isl_dim_set;
if (src_type == isl_dim_in)
src_type = isl_dim_set;

if (n == 0 &&
   !isl_space_is_named_or_nested(qp->dim, src_type) &&
   !isl_space_is_named_or_nested(qp->dim, dst_type))
return qp;

qp = isl_qpolynomial_cow(qp);
if (!qp)
return NULL((void*)0);

g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
g_src_pos = pos(qp->dim, src_type) + src_pos;
if (dst_type > src_type)
g_dst_pos -= n;

qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
if (!qp->div)
goto error;
qp = sort_divs(qp);
if (!qp)
goto error;

reordering = reordering_move(qp->dim->ctx,
		qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
if (!reordering)
goto error;

qp->poly = reorder(qp->poly, reordering);
free(reordering);
if (!qp->poly)
goto error;

qp->dim = isl_space_move_dims(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
if (!qp->dim)
goto error;

return qp;
3480error:
isl_qpolynomial_free(qp);
return NULL((void*)0);
3483}

3485__isl_give isl_qpolynomial *isl_qpolynomial_from_affine(
__isl_take isl_space *space, isl_int *f, isl_int denom)
3487{
isl_size d;
isl_poly *poly;

space = isl_space_domain(space);
if (!space)
return NULL((void*)0);

d = isl_space_dim(space, isl_dim_all);
poly = d < 0 ? NULL((void*)0) : isl_poly_from_affine(space->ctx, f, denom, 1 + d);

return isl_qpolynomial_alloc(space, 0, poly);
3499}

3501__isl_give isl_qpolynomial *isl_qpolynomial_from_aff(__isl_take isl_aff *aff)
3502{
isl_ctx *ctx;
isl_poly *poly;
isl_qpolynomial *qp;

if (!aff)
return NULL((void*)0);

ctx = isl_aff_get_ctx(aff);
poly = isl_poly_from_affine(ctx, aff->v->el + 1, aff->v->el[0],
		    aff->v->size - 1);

qp = isl_qpolynomial_alloc(isl_aff_get_domain_space(aff),
		    aff->ls->div->n_row, poly);
if (!qp)
goto error;

isl_mat_free(qp->div);
qp->div = isl_mat_copy(aff->ls->div);
qp->div = isl_mat_cow(qp->div);
if (!qp->div)
goto error;

isl_aff_free(aff);
qp = reduce_divs(qp);
qp = remove_redundant_divs(qp);
return qp;
3529error:
isl_aff_free(aff);
return isl_qpolynomial_free(qp);
3532}

3534__isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_from_pw_aff(
__isl_take isl_pw_aff *pwaff)
3536{
int i;
isl_pw_qpolynomial *pwqp;

if (!pwaff)
return NULL((void*)0);

pwqp = isl_pw_qpolynomial_alloc_size(isl_pw_aff_get_space(pwaff),
				pwaff->n);

for (i = 0; i < pwaff->n; ++i) {
isl_setisl_map *dom;
isl_qpolynomial *qp;

dom = isl_set_copy(pwaff->p[i].set);
qp = isl_qpolynomial_from_aff(isl_aff_copy(pwaff->p[i].aff));
pwqp = isl_pw_qpolynomial_add_piece(pwqp,  dom, qp);
}

isl_pw_aff_free(pwaff);
return pwqp;
3557}

3559__isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
__isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
3561{
isl_aff *aff;

aff = isl_constraint_get_bound(c, type, pos);
isl_constraint_free(c);
return isl_qpolynomial_from_aff(aff);
3567}

3569/* For each 0 <= i < "n", replace variable "first" + i of type "type"
* in "qp" by subs[i].
*/
3572__isl_give isl_qpolynomial *isl_qpolynomial_substitute(
__isl_take isl_qpolynomial *qp,
enum isl_dim_type type, unsigned first, unsigned n,
__isl_keep isl_qpolynomial **subs)
3576{
int i;
isl_poly **polys;

if (n == 0)
return qp;

qp = isl_qpolynomial_cow(qp);
if (!qp)
return NULL((void*)0);

if (type == isl_dim_out)
isl_die(qp->dim->ctx, isl_error_invalid,do { isl_handle_error(qp->dim->ctx, isl_error_invalid, "cannot substitute output/set dimension"
, "polly/lib/External/isl/isl_polynomial.c", 3590); goto error
; } while (0)
	"cannot substitute output/set dimension",do { isl_handle_error(qp->dim->ctx, isl_error_invalid, "cannot substitute output/set dimension"
, "polly/lib/External/isl/isl_polynomial.c", 3590); goto error
; } while (0)
	goto error)do { isl_handle_error(qp->dim->ctx, isl_error_invalid, "cannot substitute output/set dimension"
, "polly/lib/External/isl/isl_polynomial.c", 3590); goto error
; } while (0);
if (isl_qpolynomial_check_range(qp, type, first, n) < 0)
return isl_qpolynomial_free(qp);
type = domain_type(type);

for (i = 0; i < n; ++i)
if (!subs[i])
	goto error;

for (i = 0; i < n; ++i)
if (isl_qpolynomial_check_equal_space(qp, subs[i]) < 0)
	goto error;

isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error)do { if (qp->div->n_row == 0) break; do { isl_handle_error
(qp->dim->ctx, isl_error_unknown, "Assertion \"" "qp->div->n_row == 0"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 3603
); goto error; } while (0); } while (0);
for (i = 0; i < n; ++i)
isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error)do { if (subs[i]->div->n_row == 0) break; do { isl_handle_error
(qp->dim->ctx, isl_error_unknown, "Assertion \"" "subs[i]->div->n_row == 0"
 "\" failed", "polly/lib/External/isl/isl_polynomial.c", 3605
); goto error; } while (0); } while (0);

first += pos(qp->dim, type);

polys = isl_alloc_array(qp->dim->ctx, struct isl_poly *, n)((struct isl_poly * *)isl_malloc_or_die(qp->dim->ctx, (
n)*sizeof(struct isl_poly *)));
if (!polys)
goto error;
for (i = 0; i < n; ++i)
polys[i] = subs[i]->poly;

qp->poly = isl_poly_subs(qp->poly, first, n, polys);

free(polys);

if (!qp->poly)
goto error;

return qp;
3623error:
isl_qpolynomial_free(qp);
return NULL((void*)0);
3626}

3628/* Extend "bset" with extra set dimensions for each integer division
* in "qp" and then call "fn" with the extended bset and the polynomial
* that results from replacing each of the integer divisions by the
* corresponding extra set dimension.
*/
3633isl_stat isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
__isl_keep isl_basic_setisl_basic_map *bset,
isl_stat (*fn)(__isl_take isl_basic_setisl_basic_map *bset,
  __isl_take isl_qpolynomial *poly, void *user), void *user)
3637{
isl_space *space;
isl_local_space *ls;
isl_qpolynomial *poly;

if (!qp || !bset)
return isl_stat_error;
if (qp->div->n_row == 0)
return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
	  user);

space = isl_space_copy(qp->dim);
space = isl_space_add_dims(space, isl_dim_set, qp->div->n_row);
poly = isl_qpolynomial_alloc(space, 0, isl_poly_copy(qp->poly));
bset = isl_basic_set_copy(bset);
ls = isl_qpolynomial_get_domain_local_space(qp);
bset = isl_local_space_lift_basic_set(ls, bset);

return fn(bset, poly, user);
3656}

3658/* Return total degree in variables first (inclusive) up to last (exclusive).
*/
3660int isl_poly_degree(__isl_keep isl_poly *poly, int first, int last)
3661{
int deg = -1;
int i;
isl_bool is_zero, is_cst;
isl_poly_rec *rec;

is_zero = isl_poly_is_zero(poly);
if (is_zero < 0)
return -2;
if (is_zero)
return -1;
is_cst = isl_poly_is_cst(poly);
if (is_cst < 0)
return -2;
if (is_cst || poly->var < first)
return 0;

rec = isl_poly_as_rec(poly);
if (!rec)
return -2;

for (i = 0; i < rec->n; ++i) {
int d;

is_zero = isl_poly_is_zero(rec->p[i]);
if (is_zero < 0)
	return -2;
if (is_zero)
	continue;
d = isl_poly_degree(rec->p[i], first, last);
if (poly->var < last)
	d += i;
if (d > deg)
	deg = d;
}

return deg;
3698}

3700/* Return total degree in set variables.
*/
3702int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
3703{
unsigned ovar;
isl_size nvar;

if (!poly)
return -2;

ovar = isl_space_offset(poly->dim, isl_dim_set);
nvar = isl_space_dim(poly->dim, isl_dim_set);
if (nvar < 0)
return -2;
return isl_poly_degree(poly->poly, ovar, ovar + nvar);
3715}

3717__isl_give isl_poly *isl_poly_coeff(__isl_keep isl_poly *poly,
unsigned pos, int deg)
3719{
int i;
isl_bool is_cst;
isl_poly_rec *rec;

is_cst = isl_poly_is_cst(poly);
if (is_cst < 0)
return NULL((void*)0);
if (is_cst || poly->var < pos) {
if (deg == 0)
	return isl_poly_copy(poly);
else
	return isl_poly_zero(poly->ctx);
}

rec = isl_poly_as_rec(poly);
if (!rec)
return NULL((void*)0);

if (poly->var == pos) {
if (deg < rec->n)
	return isl_poly_copy(rec->p[deg]);
else
	return isl_poly_zero(poly->ctx);
}

poly = isl_poly_copy(poly);
poly = isl_poly_cow(poly);
rec = isl_poly_as_rec(poly);
if (!rec)
goto error;

for (i = 0; i < rec->n; ++i) {
isl_poly *t;
t = isl_poly_coeff(rec->p[i], pos, deg);
if (!t)
	goto error;
isl_poly_free(rec->p[i]);
rec->p[i] = t;
}

return poly;
3761error:
isl_poly_free(poly);
return NULL((void*)0);
3764}

3766/* Return coefficient of power "deg" of variable "t_pos" of type "type".
*/
3768__isl_give isl_qpolynomial *isl_qpolynomial_coeff(
__isl_keep isl_qpolynomial *qp,
enum isl_dim_type type, unsigned t_pos, int deg)
3771{
unsigned g_pos;
isl_poly *poly;
isl_qpolynomial *c;

if (!qp)
return NULL((void*)0);

if (type == isl_dim_out)
isl_die(qp->div->ctx, isl_error_invalid,do { isl_handle_error(qp->div->ctx, isl_error_invalid, "output/set dimension does not have a coefficient"
, "polly/lib/External/isl/isl_polynomial.c", 3782); return ((
void*)0); } while (0)
	"output/set dimension does not have a coefficient",do { isl_handle_error(qp->div->ctx, isl_error_invalid, "output/set dimension does not have a coefficient"
, "polly/lib/External/isl/isl_polynomial.c", 3782); return ((
void*)0); } while (0)
	return NULL)do { isl_handle_error(qp->div->ctx, isl_error_invalid, "output/set dimension does not have a coefficient"
, "polly/lib/External/isl/isl_polynomial.c", 3782); return ((
void*)0); } while (0);
if (isl_qpolynomial_check_range(qp, type, t_pos, 1) < 0)
return NULL((void*)0);
type = domain_type(type);

g_pos = pos(qp->dim, type) + t_pos;
poly = isl_poly_coeff(qp->poly, g_pos, deg);

c = isl_qpolynomial_alloc(isl_space_copy(qp->dim),
		qp->div->n_row, poly);
if (!c)
return NULL((void*)0);
isl_mat_free(c->div);
c->div = isl_mat_copy(qp->div);
if (!c->div)
goto error;
return c;
3799error:
isl_qpolynomial_free(c);
return NULL((void*)0);
3802}

3804/* Homogenize the polynomial in the variables first (inclusive) up to
* last (exclusive) by inserting powers of variable first.
* Variable first is assumed not to appear in the input.
*/
3808__isl_give isl_poly *isl_poly_homogenize(__isl_take isl_poly *poly, int deg,
int target, int first, int last)
3810{
int i;
isl_bool is_zero, is_cst;
isl_poly_rec *rec;

is_zero = isl_poly_is_zero(poly);
if (is_zero < 0)
return isl_poly_free(poly);
if (is_zero)
return poly;
if (deg == target)
return poly;
is_cst = isl_poly_is_cst(poly);
if (is_cst < 0)
return isl_poly_free(poly);
if (is_cst || poly->var < first) {
isl_poly *hom;

hom = isl_poly_var_pow(poly->ctx, first, target - deg);
if (!hom)
	goto error;
rec = isl_poly_as_rec(hom);
rec->p[target - deg] = isl_poly_mul(rec->p[target - deg], poly);

return hom;
}

poly = isl_poly_cow(poly);
rec = isl_poly_as_rec(poly);
if (!rec)
goto error;

for (i = 0; i < rec->n; ++i) {
is_zero = isl_poly_is_zero(rec->p[i]);
if (is_zero < 0)
	return isl_poly_free(poly);
if (is_zero)
	continue;
rec->p[i] = isl_poly_homogenize(rec->p[i],
		poly->var < last ? deg + i : i, target,
		first, last);
if (!rec->p[i])
	goto error;
}

return poly;
3856error:
isl_poly_free(poly);
return NULL((void*)0);
3859}

3861/* Homogenize the polynomial in the set variables by introducing
* powers of an extra set variable at position 0.
*/
3864__isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
__isl_take isl_qpolynomial *poly)
3866{
unsigned ovar;
isl_size nvar;
int deg = isl_qpolynomial_degree(poly);

if (deg < -1)
goto error;

poly = isl_qpolynomial_insert_dims(poly, isl_dim_in, 0, 1);
poly = isl_qpolynomial_cow(poly);
if (!poly)
goto error;

ovar = isl_space_offset(poly->dim, isl_dim_set);
nvar = isl_space_dim(poly->dim, isl_dim_set);
if (nvar < 0)
return isl_qpolynomial_free(poly);
poly->poly = isl_poly_homogenize(poly->poly, 0, deg, ovar, ovar + nvar);
if (!poly->poly)
goto error;

return poly;
3888error:
isl_qpolynomial_free(poly);
return NULL((void*)0);
3891}

3893__isl_give isl_term *isl_term_alloc(__isl_take isl_space *space,
__isl_take isl_mat *div)
3895{
isl_term *term;
isl_size d;
int n;

d = isl_space_dim(space, isl_dim_all);
if (d < 0 || !div)
goto error;

n = d + div->n_row;

term = isl_calloc(space->ctx, struct isl_term,((struct isl_term *)isl_calloc_or_die(space->ctx, 1, sizeof
(struct isl_term) + (n - 1) * sizeof(int)))
	sizeof(struct isl_term) + (n - 1) * sizeof(int))((struct isl_term *)isl_calloc_or_die(space->ctx, 1, sizeof
(struct isl_term) + (n - 1) * sizeof(int)));
if (!term)
goto error;

term->ref = 1;
term->dim = space;
term->div = div;
isl_int_init(term->n)isl_sioimath_init((term->n));
isl_int_init(term->d)isl_sioimath_init((term->d));

return term;
3918error:
isl_space_free(space);
isl_mat_free(div);
return NULL((void*)0);
3922}

3924__isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
3925{
if (!term)
return NULL((void*)0);

term->ref++;
return term;
3931}

3933__isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
3934{
int i;
isl_term *dup;
isl_size total;

total = isl_term_dim(term, isl_dim_all);
if (total < 0)
return NULL((void*)0);

dup = isl_term_alloc(isl_space_copy(term->dim), isl_mat_copy(term->div));
if (!dup)
return NULL((void*)0);

isl_int_set(dup->n, term->n)isl_sioimath_set((dup->n), *(term->n));
isl_int_set(dup->d, term->d)isl_sioimath_set((dup->d), *(term->d));

for (i = 0; i < total; ++i)
dup->pow[i] = term->pow[i];

return dup;
3954}

3956__isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
3957{
if (!term)
return NULL((void*)0);

if (term->ref == 1)
return term;
term->ref--;
return isl_term_dup(term);
3965}

3967__isl_null isl_term *isl_term_free(__isl_take isl_term *term)
3968{
if (!term)
return NULL((void*)0);

if (--term->ref > 0)
return NULL((void*)0);

isl_space_free(term->dim);
isl_mat_free(term->div);
isl_int_clear(term->n)isl_sioimath_clear((term->n));
isl_int_clear(term->d)isl_sioimath_clear((term->d));
free(term);

return NULL((void*)0);
3982}

3984isl_size isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
3985{
isl_size dim;

if (!term)
return isl_size_error((int) -1);

switch (type) {
case isl_dim_param:
case isl_dim_in:
case isl_dim_out:	return isl_space_dim(term->dim, type);
case isl_dim_div:	return term->div->n_row;
case isl_dim_all:	dim = isl_space_dim(term->dim, isl_dim_all);
		if (dim < 0)
			return isl_size_error((int) -1);
		return dim + term->div->n_row;
default:		return isl_size_error((int) -1);
}
4002}

4004/* Return the space of "term".
*/
4006static __isl_keep isl_space *isl_term_peek_space(__isl_keep isl_term *term)
4007{
return term ? term->dim : NULL((void*)0);
4009}

4011/* Return the offset of the first variable of type "type" within
* the variables of "term".
*/
4014static isl_size isl_term_offset(__isl_keep isl_term *term,
enum isl_dim_type type)
4016{
isl_space *space;

space = isl_term_peek_space(term);
if (!space)
return isl_size_error((int) -1);

switch (type) {
case isl_dim_param:
case isl_dim_set:	return isl_space_offset(space, type);
case isl_dim_div:	return isl_space_dim(space, isl_dim_all);
default:
isl_die(isl_term_get_ctx(term), isl_error_invalid,do { isl_handle_error(isl_term_get_ctx(term), isl_error_invalid
, "invalid dimension type", "polly/lib/External/isl/isl_polynomial.c"
, 4029); return ((int) -1); } while (0)
	"invalid dimension type", return isl_size_error)do { isl_handle_error(isl_term_get_ctx(term), isl_error_invalid
, "invalid dimension type", "polly/lib/External/isl/isl_polynomial.c"
, 4029); return ((int) -1); } while (0);
}
4031}

4033isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
4034{
return term ? term->dim->ctx : NULL((void*)0);
4036}

4038void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
4039{
if (!term)
return;
isl_int_set(*n, term->n)isl_sioimath_set((*n), *(term->n));
4043}

4045/* Return the coefficient of the term "term".
*/
4047__isl_give isl_val *isl_term_get_coefficient_val(__isl_keep isl_term *term)
4048{
if (!term)
return NULL((void*)0);

return isl_val_rat_from_isl_int(isl_term_get_ctx(term),
			term->n, term->d);
4054}

4056#undef TYPEisl_term
4057#define TYPEisl_term	isl_term
4058static
4059#include "check_type_range_templ.c"

4061isl_size isl_term_get_exp(__isl_keep isl_term *term,
enum isl_dim_type type, unsigned pos)
4063{
isl_size offset;

if (isl_term_check_range(term, type, pos, 1) < 0)
return isl_size_error((int) -1);
offset = isl_term_offset(term, type);
if (offset < 0)
return isl_size_error((int) -1);

return term->pow[offset + pos];
4073}

4075__isl_give isl_aff *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
4076{
isl_local_space *ls;
isl_aff *aff;

if (isl_term_check_range(term, isl_dim_div, pos, 1) < 0)
return NULL((void*)0);

ls = isl_local_space_alloc_div(isl_space_copy(term->dim),
			isl_mat_copy(term->div));
aff = isl_aff_alloc(ls);
if (!aff)
return NULL((void*)0);

isl_seq_cpy(aff->v->el, term->div->row[pos], aff->v->size);

aff = isl_aff_normalize(aff);

return aff;
4094}

4096__isl_give isl_term *isl_poly_foreach_term(__isl_keep isl_poly *poly,
isl_stat (*fn)(__isl_take isl_term *term, void *user),
__isl_take isl_term *term, void *user)
4099{
int i;
isl_bool is_zero, is_bad, is_cst;
isl_poly_rec *rec;

is_zero = isl_poly_is_zero(poly);
if (is_zero < 0 || !term)
goto error;

if (is_zero)
return term;

is_cst = isl_poly_is_cst(poly);
is_bad = isl_poly_is_nan(poly);
if (is_bad >= 0 && !is_bad)
is_bad = isl_poly_is_infty(poly);
if (is_bad >= 0 && !is_bad)
is_bad = isl_poly_is_neginfty(poly);
if (is_cst < 0 || is_bad < 0)
return isl_term_free(term);
if (is_bad)
isl_die(isl_term_get_ctx(term), isl_error_invalid,do { isl_handle_error(isl_term_get_ctx(term), isl_error_invalid
, "cannot handle NaN/infty polynomial", "polly/lib/External/isl/isl_polynomial.c"
, 4122); return isl_term_free(term); } while (0)
	"cannot handle NaN/infty polynomial",do { isl_handle_error(isl_term_get_ctx(term), isl_error_invalid
, "cannot handle NaN/infty polynomial", "polly/lib/External/isl/isl_polynomial.c"
, 4122); return isl_term_free(term); } while (0)
	return isl_term_free(term))do { isl_handle_error(isl_term_get_ctx(term), isl_error_invalid
, "cannot handle NaN/infty polynomial", "polly/lib/External/isl/isl_polynomial.c"
, 4122); return isl_term_free(term); } while (0);

if (is_cst) {
isl_poly_cst *cst;
cst = isl_poly_as_cst(poly);
if (!cst)
	goto error;
term = isl_term_cow(term);
if (!term)
	goto error;
isl_int_set(term->n, cst->n)isl_sioimath_set((term->n), *(cst->n));
isl_int_set(term->d, cst->d)isl_sioimath_set((term->d), *(cst->d));
if (fn(isl_term_copy(term), user) < 0)
	goto error;
return term;
}

rec = isl_poly_as_rec(poly);
if (!rec)
goto error;

for (i = 0; i < rec->n; ++i) {
term = isl_term_cow(term);
if (!term)
	goto error;
term->pow[poly->var] = i;
term = isl_poly_foreach_term(rec->p[i], fn, term, user);
if (!term)
	goto error;
}
term = isl_term_cow(term);
if (!term)
return NULL((void*)0);
term->pow[poly->var] = 0;

return term;
4158error:
isl_term_free(term);
return NULL((void*)0);
4161}

4163isl_stat isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
isl_stat (*fn)(__isl_take isl_term *term, void *user), void *user)
4165{
isl_term *term;

if (!qp)
return isl_stat_error;

term = isl_term_alloc(isl_space_copy(qp->dim), isl_mat_copy(qp->div));
if (!term)
return isl_stat_error;

term = isl_poly_foreach_term(qp->poly, fn, term, user);

isl_term_free(term);

return term ? isl_stat_ok : isl_stat_error;
4180}

4182__isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
4183{
isl_poly *poly;
isl_qpolynomial *qp;
int i;
isl_size n;

n = isl_term_dim(term, isl_dim_all);
if (n < 0)
term = isl_term_free(term);
if (!term)
return NULL((void*)0);

poly = isl_poly_rat_cst(term->dim->ctx, term->n, term->d);
for (i = 0; i < n; ++i) {
if (!term->pow[i])
	continue;
poly = isl_poly_mul(poly,
	    isl_poly_var_pow(term->dim->ctx, i, term->pow[i]));
}

qp = isl_qpolynomial_alloc(isl_space_copy(term->dim),
		    term->div->n_row, poly);
if (!qp)
goto error;
isl_mat_free(qp->div);
qp->div = isl_mat_copy(term->div);
if (!qp->div)
goto error;

isl_term_free(term);
return qp;
4214error:
isl_qpolynomial_free(qp);
isl_term_free(term);
return NULL((void*)0);
4218}

4220__isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
__isl_take isl_space *space)
4222{
int i;
int extra;
isl_size total, d_set, d_qp;

if (!qp || !space)
goto error;

if (isl_space_is_equal(qp->dim, space)) {
isl_space_free(space);
return qp;
}

qp = isl_qpolynomial_cow(qp);
if (!qp)
goto error;

d_set = isl_space_dim(space, isl_dim_set);
d_qp = isl_qpolynomial_domain_dim(qp, isl_dim_set);
extra = d_set - d_qp;
total = isl_space_dim(qp->dim, isl_dim_all);
if (d_set < 0 || d_qp < 0 || total < 0)
goto error;
if (qp->div->n_row) {
int *exp;

exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row)((int *)isl_malloc_or_die(qp->div->ctx, (qp->div->
n_row)*sizeof(int)));
if (!exp)
	goto error;
for (i = 0; i < qp->div->n_row; ++i)
	exp[i] = extra + i;
qp->poly = expand(qp->poly, exp, total);
free(exp);
if (!qp->poly)
	goto error;
}
qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
if (!qp->div)
goto error;
for (i = 0; i < qp->div->n_row; ++i)
isl_seq_clr(qp->div->row[i] + 2 + total, extra);

isl_space_free(qp->dim);
qp->dim = space;

return qp;
4268error:
isl_space_free(space);
isl_qpolynomial_free(qp);
return NULL((void*)0);
4272}

4274/* For each parameter or variable that does not appear in qp,
* first eliminate the variable from all constraints and then set it to zero.
*/
4277static __isl_give isl_setisl_map *fix_inactive(__isl_take isl_setisl_map *set,
__isl_keep isl_qpolynomial *qp)
4279{
int *active = NULL((void*)0);
int i;
isl_size d;
isl_size nparam;
isl_size nvar;

d = isl_set_dim(set, isl_dim_all);
if (d < 0 || !qp)
goto error;

active = isl_calloc_array(set->ctx, int, d)((int *)isl_calloc_or_die(set->ctx, d, sizeof(int)));
if (set_active(qp, active) < 0)
goto error;

for (i = 0; i < d; ++i)
if (!active[i])
	break;

if (i == d) {
free(active);
return set;
}

nparam = isl_set_dim(set, isl_dim_param);
nvar = isl_set_dim(set, isl_dim_set);
if (nparam < 0 || nvar < 0)
goto error;
for (i = 0; i < nparam; ++i) {
if (active[i])
	continue;
set = isl_set_eliminate(set, isl_dim_param, i, 1);
set = isl_set_fix_si(set, isl_dim_param, i, 0);
}
for (i = 0; i < nvar; ++i) {
if (active[nparam + i])
	continue;
set = isl_set_eliminate(set, isl_dim_set, i, 1);
set = isl_set_fix_si(set, isl_dim_set, i, 0);
}

free(active);

return set;
4323error:
free(active);
isl_set_free(set);
return NULL((void*)0);
4327}

4329struct isl_opt_data {
isl_qpolynomial *qp;
int first;
isl_val *opt;
int max;
4334};

4336static isl_stat opt_fn(__isl_take isl_point *pnt, void *user)
4337{
struct isl_opt_data *data = (struct isl_opt_data *)user;
isl_val *val;

val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
if (data->first) {
data->first = 0;
data->opt = val;
} else if (data->max) {
data->opt = isl_val_max(data->opt, val);
} else {
data->opt = isl_val_min(data->opt, val);
}

return isl_stat_ok;
4352}

4354__isl_give isl_val *isl_qpolynomial_opt_on_domain(
__isl_take isl_qpolynomial *qp, __isl_take isl_setisl_map *set, int max)
4356{
struct isl_opt_data data = { NULL((void*)0), 1, NULL((void*)0), max };
isl_bool is_cst;

if (!set || !qp)
goto error;

is_cst = isl_poly_is_cst(qp->poly);
if (is_cst < 0)
goto error;
if (is_cst) {
isl_set_free(set);
data.opt = isl_qpolynomial_get_constant_val(qp);
isl_qpolynomial_free(qp);
return data.opt;
}

set = fix_inactive(set, qp);

data.qp = qp;
if (isl_set_foreach_point(set, opt_fn, &data) < 0)
goto error;

if (data.first)
data.opt = isl_val_zero(isl_set_get_ctx(set));

isl_set_free(set);
isl_qpolynomial_free(qp);
return data.opt;
4385error:
isl_set_free(set);
isl_qpolynomial_free(qp);
isl_val_free(data.opt);
return NULL((void*)0);
4390}

4392__isl_give isl_qpolynomial *isl_qpolynomial_morph_domain(
__isl_take isl_qpolynomial *qp, __isl_take isl_morph *morph)
4394{
int i;
int n_sub;
isl_ctx *ctx;
isl_space *space;
isl_poly **subs;
isl_mat *mat, *diag;

qp = isl_qpolynomial_cow(qp);

space = isl_qpolynomial_peek_domain_space(qp);
if (isl_morph_check_applies(morph, space) < 0)
goto error;

ctx = isl_qpolynomial_get_ctx(qp);
n_sub = morph->inv->n_row - 1;
if (morph->inv->n_row != morph->inv->n_col)
n_sub += qp->div->n_row;
subs = isl_calloc_array(ctx, struct isl_poly *, n_sub)((struct isl_poly * *)isl_calloc_or_die(ctx, n_sub, sizeof(struct
 isl_poly *)));
if (n_sub && !subs)
goto error;

for (i = 0; 1 + i < morph->inv->n_row; ++i)
subs[i] = isl_poly_from_affine(ctx, morph->inv->row[1 + i],
			morph->inv->row[0][0], morph->inv->n_col);
if (morph->inv->n_row != morph->inv->n_col)
for (i = 0; i < qp->div->n_row; ++i)
	subs[morph->inv->n_row - 1 + i] =
	    isl_poly_var_pow(ctx, morph->inv->n_col - 1 + i, 1);

qp->poly = isl_poly_subs(qp->poly, 0, n_sub, subs);

for (i = 0; i < n_sub; ++i)
isl_poly_free(subs[i]);
free(subs);

diag = isl_mat_diag(ctx, 1, morph->inv->row[0][0]);
mat = isl_mat_diagonal(diag, isl_mat_copy(morph->inv));
diag = isl_mat_diag(ctx, qp->div->n_row, morph->inv->row[0][0]);
mat = isl_mat_diagonal(mat, diag);
qp->div = isl_mat_product(qp->div, mat);
isl_space_free(qp->dim);
qp->dim = isl_space_copy(morph->ran->dim);

if (!qp->poly || !qp->div || !qp->dim)
goto error;

isl_morph_free(morph);

return qp;
4444error:
isl_qpolynomial_free(qp);
isl_morph_free(morph);
return NULL((void*)0);
4448}

4450__isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
__isl_take isl_union_pw_qpolynomial *upwqp1,
__isl_take isl_union_pw_qpolynomial *upwqp2)
4453{
return isl_union_pw_qpolynomial_match_bin_op(upwqp1, upwqp2,
				&isl_pw_qpolynomial_mul);
4456}

4458/* Reorder the dimension of "qp" according to the given reordering.
*/
4460__isl_give isl_qpolynomial *isl_qpolynomial_realign_domain(
__isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r)
4462{
isl_space *space;

qp = isl_qpolynomial_cow(qp);
if (!qp)
goto error;

r = isl_reordering_extend(r, qp->div->n_row);
if (!r)
goto error;

qp->div = isl_local_reorder(qp->div, isl_reordering_copy(r));
if (!qp->div)
goto error;

qp->poly = reorder(qp->poly, r->pos);
if (!qp->poly)
goto error;

space = isl_reordering_get_space(r);
qp = isl_qpolynomial_reset_domain_space(qp, space);

isl_reordering_free(r);
return qp;
4486error:
isl_qpolynomial_free(qp);
isl_reordering_free(r);
return NULL((void*)0);
4490}

4492__isl_give isl_qpolynomial *isl_qpolynomial_align_params(
__isl_take isl_qpolynomial *qp, __isl_take isl_space *model)
4494{
isl_space *domain_space;
isl_bool equal_params;

domain_space = isl_qpolynomial_peek_domain_space(qp);
equal_params = isl_space_has_equal_params(domain_space, model);
if (equal_params < 0)
goto error;
if (!equal_params) {
isl_reordering *exp;

exp = isl_parameter_alignment_reordering(domain_space, model);
qp = isl_qpolynomial_realign_domain(qp, exp);
}

isl_space_free(model);
return qp;
4511error:
isl_space_free(model);
isl_qpolynomial_free(qp);
return NULL((void*)0);
4515}

4517struct isl_split_periods_data {
int max_periods;
isl_pw_qpolynomial *res;
4520};

4522/* Create a slice where the integer division "div" has the fixed value "v".
* In particular, if "div" refers to floor(f/m), then create a slice
*
*	m v <= f <= m v + (m - 1)
*
* or
*
*	f - m v >= 0
*	-f + m v + (m - 1) >= 0
*/
4532static __isl_give isl_setisl_map *set_div_slice(__isl_take isl_space *space,
__isl_keep isl_qpolynomial *qp, int div, isl_int v)
4534{
isl_size total;
isl_basic_setisl_basic_map *bset = NULL((void*)0);
int k;

total = isl_space_dim(space, isl_dim_all);
if (total < 0 || !qp)
goto error;

bset = isl_basic_set_alloc_space(isl_space_copy(space), 0, 0, 2);

k = isl_basic_set_alloc_inequality(bset);
if (k < 0)
goto error;
isl_seq_cpy(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
isl_int_submul(bset->ineq[k][0], v, qp->div->row[div][0])isl_sioimath_submul((bset->ineq[k][0]), *(v), *(qp->div
->row[div][0]));

k = isl_basic_set_alloc_inequality(bset);
if (k < 0)
goto error;
isl_seq_neg(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
isl_int_addmul(bset->ineq[k][0], v, qp->div->row[div][0])isl_sioimath_addmul((bset->ineq[k][0]), *(v), *(qp->div
->row[div][0]));
isl_int_add(bset->ineq[k][0], bset->ineq[k][0], qp->div->row[div][0])isl_sioimath_add((bset->ineq[k][0]), *(bset->ineq[k][0]
), *(qp->div->row[div][0]));
isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1)isl_sioimath_sub_ui((bset->ineq[k][0]), *(bset->ineq[k]
[0]), 1);

isl_space_free(space);
return isl_set_from_basic_set(bset);
4561error:
isl_basic_set_free(bset);
isl_space_free(space);
return NULL((void*)0);
4565}

4567static isl_stat split_periods(__isl_take isl_setisl_map *set,
__isl_take isl_qpolynomial *qp, void *user);

4570/* Create a slice of the domain "set" such that integer division "div"
* has the fixed value "v" and add the results to data->res,
* replacing the integer division by "v" in "qp".
*/
4574static isl_stat set_div(__isl_take isl_setisl_map *set,
__isl_take isl_qpolynomial *qp, int div, isl_int v,
struct isl_split_periods_data *data)
4577{
int i;
isl_size div_pos;
isl_setisl_map *slice;
isl_poly *cst;

slice = set_div_slice(isl_set_get_space(set), qp, div, v);
set = isl_set_intersect(set, slice);

div_pos = isl_qpolynomial_domain_var_offset(qp, isl_dim_div);
if (div_pos < 0)
goto error;

for (i = div + 1; i < qp->div->n_row; ++i) {
if (isl_int_is_zero(qp->div->row[i][2 + div_pos + div])(isl_sioimath_sgn(*(qp->div->row[i][2 + div_pos + div])
) == 0))
	continue;
isl_int_addmul(qp->div->row[i][1],isl_sioimath_addmul((qp->div->row[i][1]), *(qp->div->
row[i][2 + div_pos + div]), *(v))
		qp->div->row[i][2 + div_pos + div], v)isl_sioimath_addmul((qp->div->row[i][1]), *(qp->div->
row[i][2 + div_pos + div]), *(v));
isl_int_set_si(qp->div->row[i][2 + div_pos + div], 0)isl_sioimath_set_si((qp->div->row[i][2 + div_pos + div]
), 0);
}

cst = isl_poly_rat_cst(qp->dim->ctx, v, qp->dim->ctx->one);
qp = substitute_div(qp, div, cst);

return split_periods(set, qp, data);
4602error:
isl_set_free(set);
isl_qpolynomial_free(qp);
return isl_stat_error;
4606}

4608/* Split the domain "set" such that integer division "div"
* has a fixed value (ranging from "min" to "max") on each slice
* and add the results to data->res.
*/
4612static isl_stat split_div(__isl_take isl_setisl_map *set,
__isl_take isl_qpolynomial *qp, int div, isl_int min, isl_int max,
struct isl_split_periods_data *data)
4615{
for (; isl_int_le(min, max)(isl_sioimath_cmp(*(min), *(max)) <= 0); isl_int_add_ui(min, min, 1)isl_sioimath_add_ui((min), *(min), 1)) {
isl_setisl_map *set_i = isl_set_copy(set);
isl_qpolynomial *qp_i = isl_qpolynomial_copy(qp);

if (set_div(set_i, qp_i, div, min, data) < 0)
	goto error;
}
isl_set_free(set);
isl_qpolynomial_free(qp);
return isl_stat_ok;
4626error:
isl_set_free(set);
isl_qpolynomial_free(qp);
return isl_stat_error;
4630}

4632/* If "qp" refers to any integer division
* that can only attain "max_periods" distinct values on "set"
* then split the domain along those distinct values.
* Add the results (or the original if no splitting occurs)
* to data->res.
*/
4638static isl_stat split_periods(__isl_take isl_setisl_map *set,
__isl_take isl_qpolynomial *qp, void *user)
4640{
int i;
isl_pw_qpolynomial *pwqp;
struct isl_split_periods_data *data;
isl_int min, max;
isl_size div_pos;
isl_stat r = isl_stat_ok;

data = (struct isl_split_periods_data *)user;

if (!set || !qp)
goto error;

if (qp->div->n_row == 0) {
pwqp = isl_pw_qpolynomial_alloc(set, qp);
data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
return isl_stat_ok;
}

div_pos = isl_qpolynomial_domain_var_offset(qp, isl_dim_div);
if (div_pos < 0)
goto error;

isl_int_init(min)isl_sioimath_init((min));
isl_int_init(max)isl_sioimath_init((max));
for (i = 0; i < qp->div->n_row; ++i) {
enum isl_lp_result lp_res;

if (isl_seq_first_non_zero(qp->div->row[i] + 2 + div_pos,
				qp->div->n_row) != -1)
	continue;

lp_res = isl_set_solve_lp(set, 0, qp->div->row[i] + 1,
			  set->ctx->one, &min, NULL((void*)0), NULL((void*)0));
if (lp_res == isl_lp_error)
	goto error2;
if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
	continue;
isl_int_fdiv_q(min, min, qp->div->row[i][0])isl_sioimath_fdiv_q((min), *(min), *(qp->div->row[i][0]
));

lp_res = isl_set_solve_lp(set, 1, qp->div->row[i] + 1,
			  set->ctx->one, &max, NULL((void*)0), NULL((void*)0));
if (lp_res == isl_lp_error)
	goto error2;
if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
	continue;
isl_int_fdiv_q(max, max, qp->div->row[i][0])isl_sioimath_fdiv_q((max), *(max), *(qp->div->row[i][0]
));

isl_int_sub(max, max, min)isl_sioimath_sub((max), *(max), *(min));
if (isl_int_cmp_si(max, data->max_periods)isl_sioimath_cmp_si(*(max), data->max_periods) < 0) {
	isl_int_add(max, max, min)isl_sioimath_add((max), *(max), *(min));
	break;
}
}

if (i < qp->div->n_row) {
r = split_div(set, qp, i, min, max, data);
} else {
pwqp = isl_pw_qpolynomial_alloc(set, qp);
data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
}

isl_int_clear(max)isl_sioimath_clear((max));
isl_int_clear(min)isl_sioimath_clear((min));

return r;
4706error2:
isl_int_clear(max)isl_sioimath_clear((max));
isl_int_clear(min)isl_sioimath_clear((min));
4709error:
isl_set_free(set);
isl_qpolynomial_free(qp);
return isl_stat_error;
4713}

4715/* If any quasi-polynomial in pwqp refers to any integer division
* that can only attain "max_periods" distinct values on its domain
* then split the domain along those distinct values.
*/
4719__isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_periods(
__isl_take isl_pw_qpolynomial *pwqp, int max_periods)
4721{
struct isl_split_periods_data data;

data.max_periods = max_periods;
data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_space(pwqp));

if (isl_pw_qpolynomial_foreach_piece(pwqp, &split_periods, &data) < 0)
goto error;

isl_pw_qpolynomial_free(pwqp);

return data.res;
4733error:
isl_pw_qpolynomial_free(data.res);
isl_pw_qpolynomial_free(pwqp);
return NULL((void*)0);
4737}

4739/* Construct a piecewise quasipolynomial that is constant on the given
* domain.  In particular, it is
*	0	if cst == 0
*	1	if cst == 1
*  infinity	if cst == -1
*
* If cst == -1, then explicitly check whether the domain is empty and,
* if so, return 0 instead.
*/
4748static __isl_give isl_pw_qpolynomial *constant_on_domain(
__isl_take isl_basic_setisl_basic_map *bset, int cst)
4750{
isl_space *space;
isl_qpolynomial *qp;

if (cst < 0 && isl_basic_set_is_empty(bset) == isl_bool_true)
cst = 0;
if (!bset)
return NULL((void*)0);

bset = isl_basic_set_params(bset);
space = isl_basic_set_get_space(bset);
if (cst < 0)
qp = isl_qpolynomial_infty_on_domain(space);
else if (cst == 0)
qp = isl_qpolynomial_zero_on_domain(space);
else
qp = isl_qpolynomial_one_on_domain(space);
return isl_pw_qpolynomial_alloc(isl_set_from_basic_set(bset), qp);
4768}

4770/* Internal data structure for multiplicative_call_factor_pw_qpolynomial.
* "fn" is the function that is called on each factor.
* "pwpq" collects the results.
*/
4774struct isl_multiplicative_call_data_pw_qpolynomial {
__isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_setisl_basic_map *bset);
isl_pw_qpolynomial *pwqp;
4777};

4779/* Call "fn" on "bset" and return the result,
* but first check if "bset" has any redundant constraints or
* implicit equality constraints.
* If so, there may be further opportunities for detecting factors or
* removing equality constraints, so recursively call
* the top-level isl_basic_set_multiplicative_call.
*/
4786static __isl_give isl_pw_qpolynomial *multiplicative_call_base(
__isl_take isl_basic_setisl_basic_map *bset,
__isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_setisl_basic_map *bset))
4789{
isl_size n1, n2, n_eq;

n1 = isl_basic_set_n_constraint(bset);
if (n1 < 0)
bset = isl_basic_set_free(bset);
bset = isl_basic_set_remove_redundancies(bset);
bset = isl_basic_set_detect_equalities(bset);
n2 = isl_basic_set_n_constraint(bset);
n_eq = isl_basic_set_n_equality(bset);
if (n2 < 0 || n_eq < 0)
bset = isl_basic_set_free(bset);
else if (n2 < n1 || n_eq > 0)
return isl_basic_set_multiplicative_call(bset, fn);
return fn(bset);
4804}

4806/* isl_factorizer_every_factor_basic_set callback that applies
* data->fn to the factor "bset" and multiplies in the result
* in data->pwqp.
*/
4810static isl_bool multiplicative_call_factor_pw_qpolynomial(
__isl_keep isl_basic_setisl_basic_map *bset, void *user)
4812{
struct isl_multiplicative_call_data_pw_qpolynomial *data = user;
isl_pw_qpolynomial *res;

bset = isl_basic_set_copy(bset);
res = multiplicative_call_base(bset, data->fn);
data->pwqp = isl_pw_qpolynomial_mul(data->pwqp, res);
if (!data->pwqp)
return isl_bool_error;

return isl_bool_true;
4823}

4825/* Factor bset, call fn on each of the factors and return the product.
*
* If no factors can be found, simply call fn on the input.
* Otherwise, construct the factors based on the factorizer,
* call fn on each factor and compute the product.
*/
4831static __isl_give isl_pw_qpolynomial *compressed_multiplicative_call(
__isl_take isl_basic_setisl_basic_map *bset,
__isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_setisl_basic_map *bset))
4834{
struct isl_multiplicative_call_data_pw_qpolynomial data = { fn };
isl_space *space;
isl_setisl_map *set;
isl_factorizer *f;
isl_qpolynomial *qp;
isl_bool every;

f = isl_basic_set_factorizer(bset);
if (!f)
goto error;
if (f->n_group == 0) {
isl_factorizer_free(f);
return multiplicative_call_base(bset, fn);
}

space = isl_basic_set_get_space(bset);
space = isl_space_params(space);
set = isl_set_universe(isl_space_copy(space));
qp = isl_qpolynomial_one_on_domain(space);
data.pwqp = isl_pw_qpolynomial_alloc(set, qp);

every = isl_factorizer_every_factor_basic_set(f,
	&multiplicative_call_factor_pw_qpolynomial, &data);
if (every < 0)
data.pwqp = isl_pw_qpolynomial_free(data.pwqp);

isl_basic_set_free(bset);
isl_factorizer_free(f);

return data.pwqp;
4865error:
isl_basic_set_free(bset);
return NULL((void*)0);
4868}

4870/* Factor bset, call fn on each of the factors and return the product.
* The function is assumed to evaluate to zero on empty domains,
* to one on zero-dimensional domains and to infinity on unbounded domains
* and will not be called explicitly on zero-dimensional or unbounded domains.
*
* We first check for some special cases and remove all equalities.
* Then we hand over control to compressed_multiplicative_call.
*/
4878__isl_give isl_pw_qpolynomial *isl_basic_set_multiplicative_call(
__isl_take isl_basic_setisl_basic_map *bset,
__isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_setisl_basic_map *bset))
4881{
isl_bool bounded;
isl_size dim;
isl_morph *morph;
isl_pw_qpolynomial *pwqp;

if (!bset)
return NULL((void*)0);

if (isl_basic_set_plain_is_empty(bset))
return constant_on_domain(bset, 0);

dim = isl_basic_set_dim(bset, isl_dim_set);
if (dim < 0)
goto error;
if (dim == 0)
return constant_on_domain(bset, 1);

bounded = isl_basic_set_is_bounded(bset);
if (bounded < 0)
goto error;
if (!bounded)
return constant_on_domain(bset, -1);

if (bset->n_eq == 0)
return compressed_multiplicative_call(bset, fn);

morph = isl_basic_set_full_compression(bset);
bset = isl_morph_basic_set(isl_morph_copy(morph), bset);

pwqp = compressed_multiplicative_call(bset, fn);

morph = isl_morph_dom_params(morph);
morph = isl_morph_ran_params(morph);
morph = isl_morph_inverse(morph);

pwqp = isl_pw_qpolynomial_morph_domain(pwqp, morph);

return pwqp;
4920error:
isl_basic_set_free(bset);
return NULL((void*)0);
4923}

4925/* Drop all floors in "qp", turning each integer division [a/m] into
* a rational division a/m.  If "down" is set, then the integer division
* is replaced by (a-(m-1))/m instead.
*/
4929static __isl_give isl_qpolynomial *qp_drop_floors(
__isl_take isl_qpolynomial *qp, int down)
4931{
int i;
isl_poly *s;

if (!qp)
return NULL((void*)0);
if (qp->div->n_row == 0)
return qp;

qp = isl_qpolynomial_cow(qp);
if (!qp)
return NULL((void*)0);

for (i = qp->div->n_row - 1; i >= 0; --i) {
if (down) {
	isl_int_sub(qp->div->row[i][1],isl_sioimath_sub((qp->div->row[i][1]), *(qp->div->
row[i][1]), *(qp->div->row[i][0]))
		    qp->div->row[i][1], qp->div->row[i][0])isl_sioimath_sub((qp->div->row[i][1]), *(qp->div->
row[i][1]), *(qp->div->row[i][0]));
	isl_int_add_ui(qp->div->row[i][1],isl_sioimath_add_ui((qp->div->row[i][1]), *(qp->div->
row[i][1]), 1)
		       qp->div->row[i][1], 1)isl_sioimath_add_ui((qp->div->row[i][1]), *(qp->div->
row[i][1]), 1);
}
s = isl_poly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
			qp->div->row[i][0], qp->div->n_col - 1);
qp = substitute_div(qp, i, s);
if (!qp)
	return NULL((void*)0);
}

return qp;
4959}

4961/* Drop all floors in "pwqp", turning each integer division [a/m] into
* a rational division a/m.
*/
4964static __isl_give isl_pw_qpolynomial *pwqp_drop_floors(
__isl_take isl_pw_qpolynomial *pwqp)
4966{
int i;

if (!pwqp)
return NULL((void*)0);

if (isl_pw_qpolynomial_is_zero(pwqp))
return pwqp;

pwqp = isl_pw_qpolynomial_cow(pwqp);
if (!pwqp)
return NULL((void*)0);

for (i = 0; i < pwqp->n; ++i) {
pwqp->p[i].qp = qp_drop_floors(pwqp->p[i].qp, 0);
if (!pwqp->p[i].qp)
	goto error;
}

return pwqp;
4986error:
isl_pw_qpolynomial_free(pwqp);
return NULL((void*)0);
4989}

4991/* Adjust all the integer divisions in "qp" such that they are at least
* one over the given orthant (identified by "signs").  This ensures
* that they will still be non-negative even after subtracting (m-1)/m.
*
* In particular, f is replaced by f' + v, changing f = [a/m]
* to f' = [(a - m v)/m].
* If the constant term k in a is smaller than m,
* the constant term of v is set to floor(k/m) - 1.
* For any other term, if the coefficient c and the variable x have
* the same sign, then no changes are needed.
* Otherwise, if the variable is positive (and c is negative),
* then the coefficient of x in v is set to floor(c/m).
* If the variable is negative (and c is positive),
* then the coefficient of x in v is set to ceil(c/m).
*/
5006static __isl_give isl_qpolynomial *make_divs_pos(__isl_take isl_qpolynomial *qp,
int *signs)
5008{
int i, j;
isl_size div_pos;
isl_vec *v = NULL((void*)0);
isl_poly *s;

qp = isl_qpolynomial_cow(qp);
div_pos = isl_qpolynomial_domain_var_offset(qp, isl_dim_div);
if (div_pos < 0)
2
←
Assuming 'div_pos' is >= 0→
3
←
Taking false branch→
return isl_qpolynomial_free(qp);
qp->div = isl_mat_cow(qp->div);
if (!qp->div)
4
←
Assuming field 'div' is non-null→
5
←
Taking false branch→
goto error;

v = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);

for (i = 0; i < qp->div->n_row; ++i) {
6
←
Assuming 'i' is < field 'n_row'→
7
←
Loop condition is true.  Entering loop body→
isl_int *row = qp->div->row[i];
v = isl_vec_clr(v);
if (!v)
8
←
Assuming 'v' is non-null→
9
←
Taking false branch→
	goto error;
if (isl_int_lt(row[1], row[0])(isl_sioimath_cmp(*(row[1]), *(row[0])) < 0)) {
10
←
Assuming the condition is true→
11
←
Taking true branch→
	isl_int_fdiv_q(v->el[0], row[1], row[0])isl_sioimath_fdiv_q((v->el[0]), *(row[1]), *(row[0]));
	isl_int_sub_ui(v->el[0], v->el[0], 1)isl_sioimath_sub_ui((v->el[0]), *(v->el[0]), 1);
12
←
Calling 'isl_sioimath_sub_ui'→
	isl_int_submul(row[1], row[0], v->el[0])isl_sioimath_submul((row[1]), *(row[0]), *(v->el[0]));
}
for (j = 0; j < div_pos; ++j) {
	if (isl_int_sgn(row[2 + j])isl_sioimath_sgn(*(row[2 + j])) * signs[j] >= 0)
		continue;
	if (signs[j] < 0)
		isl_int_cdiv_q(v->el[1 + j], row[2 + j], row[0])isl_sioimath_cdiv_q((v->el[1 + j]), *(row[2 + j]), *(row[0
]));
	else
		isl_int_fdiv_q(v->el[1 + j], row[2 + j], row[0])isl_sioimath_fdiv_q((v->el[1 + j]), *(row[2 + j]), *(row[0
]));
	isl_int_submul(row[2 + j], row[0], v->el[1 + j])isl_sioimath_submul((row[2 + j]), *(row[0]), *(v->el[1 + j
]));
}
for (j = 0; j < i; ++j) {
	if (isl_int_sgn(row[2 + div_pos + j])isl_sioimath_sgn(*(row[2 + div_pos + j])) >= 0)
		continue;
	isl_int_fdiv_q(v->el[1 + div_pos + j],isl_sioimath_fdiv_q((v->el[1 + div_pos + j]), *(row[2 + div_pos
 + j]), *(row[0]))
			row[2 + div_pos + j], row[0])isl_sioimath_fdiv_q((v->el[1 + div_pos + j]), *(row[2 + div_pos
 + j]), *(row[0]));
	isl_int_submul(row[2 + div_pos + j],isl_sioimath_submul((row[2 + div_pos + j]), *(row[0]), *(v->
el[1 + div_pos + j]))
			row[0], v->el[1 + div_pos + j])isl_sioimath_submul((row[2 + div_pos + j]), *(row[0]), *(v->
el[1 + div_pos + j]));
}
for (j = i + 1; j < qp->div->n_row; ++j) {
	if (isl_int_is_zero(qp->div->row[j][2 + div_pos + i])(isl_sioimath_sgn(*(qp->div->row[j][2 + div_pos + i])) ==
 0))
		continue;
	isl_seq_combine(qp->div->row[j] + 1,
		qp->div->ctx->one, qp->div->row[j] + 1,
		qp->div->row[j][2 + div_pos + i], v->el,
		v->size);
}
isl_int_set_si(v->el[1 + div_pos + i], 1)isl_sioimath_set_si((v->el[1 + div_pos + i]), 1);
s = isl_poly_from_affine(qp->dim->ctx, v->el,
			qp->div->ctx->one, v->size);
qp->poly = isl_poly_subs(qp->poly, div_pos + i, 1, &s);
isl_poly_free(s);
if (!qp->poly)
	goto error;
}

isl_vec_free(v);
return qp;
5070error:
isl_vec_free(v);
isl_qpolynomial_free(qp);
return NULL((void*)0);
5074}

5076struct isl_to_poly_data {
int sign;
isl_pw_qpolynomial *res;
isl_qpolynomial *qp;
5080};

5082/* Appoximate data->qp by a polynomial on the orthant identified by "signs".
* We first make all integer divisions positive and then split the
* quasipolynomials into terms with sign data->sign (the direction
* of the requested approximation) and terms with the opposite sign.
* In the first set of terms, each integer division [a/m] is
* overapproximated by a/m, while in the second it is underapproximated
* by (a-(m-1))/m.
*/
5090static isl_stat to_polynomial_on_orthant(__isl_take isl_setisl_map *orthant,
int *signs, void *user)
5092{
struct isl_to_poly_data *data = user;
isl_pw_qpolynomial *t;
isl_qpolynomial *qp, *up, *down;

qp = isl_qpolynomial_copy(data->qp);
qp = make_divs_pos(qp, signs);
1
Calling 'make_divs_pos'→

up = isl_qpolynomial_terms_of_sign(qp, signs, data->sign);
up = qp_drop_floors(up, 0);
down = isl_qpolynomial_terms_of_sign(qp, signs, -data->sign);
down = qp_drop_floors(down, 1);

isl_qpolynomial_free(qp);
qp = isl_qpolynomial_add(up, down);

t = isl_pw_qpolynomial_alloc(orthant, qp);
data->res = isl_pw_qpolynomial_add_disjoint(data->res, t);

return isl_stat_ok;
5112}

5114/* Approximate each quasipolynomial by a polynomial.  If "sign" is positive,
* the polynomial will be an overapproximation.  If "sign" is negative,
* it will be an underapproximation.  If "sign" is zero, the approximation
* will lie somewhere in between.
*
* In particular, is sign == 0, we simply drop the floors, turning
* the integer divisions into rational divisions.
* Otherwise, we split the domains into orthants, make all integer divisions
* positive and then approximate each [a/m] by either a/m or (a-(m-1))/m,
* depending on the requested sign and the sign of the term in which
* the integer division appears.
*/
5126__isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_to_polynomial(
__isl_take isl_pw_qpolynomial *pwqp, int sign)
5128{
int i;
struct isl_to_poly_data data;

if (sign == 0)
return pwqp_drop_floors(pwqp);

if (!pwqp)
return NULL((void*)0);

data.sign = sign;
data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_space(pwqp));

for (i = 0; i < pwqp->n; ++i) {
if (pwqp->p[i].qp->div->n_row == 0) {
	isl_pw_qpolynomial *t;
	t = isl_pw_qpolynomial_alloc(
			isl_set_copy(pwqp->p[i].set),
			isl_qpolynomial_copy(pwqp->p[i].qp));
	data.res = isl_pw_qpolynomial_add_disjoint(data.res, t);
	continue;
}
data.qp = pwqp->p[i].qp;
if (isl_set_foreach_orthant(pwqp->p[i].set,
			&to_polynomial_on_orthant, &data) < 0)
	goto error;
}

isl_pw_qpolynomial_free(pwqp);

return data.res;
5159error:
isl_pw_qpolynomial_free(pwqp);
isl_pw_qpolynomial_free(data.res);
return NULL((void*)0);
5163}

5165static __isl_give isl_pw_qpolynomial *poly_entry(
__isl_take isl_pw_qpolynomial *pwqp, void *user)
5167{
int *sign = user;

return isl_pw_qpolynomial_to_polynomial(pwqp, *sign);
5171}

5173__isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_to_polynomial(
__isl_take isl_union_pw_qpolynomial *upwqp, int sign)
5175{
return isl_union_pw_qpolynomial_transform_inplace(upwqp,
		   &poly_entry, &sign);
5178}

5180__isl_give isl_basic_map *isl_basic_map_from_qpolynomial(
__isl_take isl_qpolynomial *qp)
5182{
int i, k;
isl_space *space;
isl_vec *aff = NULL((void*)0);
isl_basic_map *bmap = NULL((void*)0);
isl_bool is_affine;
unsigned pos;
unsigned n_div;

if (!qp)
return NULL((void*)0);
is_affine = isl_poly_is_affine(qp->poly);
if (is_affine < 0)
goto error;
if (!is_affine)
isl_die(qp->dim->ctx, isl_error_invalid,do { isl_handle_error(qp->dim->ctx, isl_error_invalid, "input quasi-polynomial not affine"
, "polly/lib/External/isl/isl_polynomial.c", 5198); goto error
; } while (0)
	"input quasi-polynomial not affine", goto error)do { isl_handle_error(qp->dim->ctx, isl_error_invalid, "input quasi-polynomial not affine"
, "polly/lib/External/isl/isl_polynomial.c", 5198); goto error
; } while (0);
aff = isl_qpolynomial_extract_affine(qp);
if (!aff)
goto error;
space = isl_qpolynomial_get_space(qp);
pos = 1 + isl_space_offset(space, isl_dim_out);
n_div = qp->div->n_row;
bmap = isl_basic_map_alloc_space(space, n_div, 1, 2 * n_div);

for (i = 0; i < n_div; ++i) {
k = isl_basic_map_alloc_div(bmap);
if (k < 0)
	goto error;
isl_seq_cpy(bmap->div[k], qp->div->row[i], qp->div->n_col);
isl_int_set_si(bmap->div[k][qp->div->n_col], 0)isl_sioimath_set_si((bmap->div[k][qp->div->n_col]), 0
);
bmap = isl_basic_map_add_div_constraints(bmap, k);
}
k = isl_basic_map_alloc_equality(bmap);
if (k < 0)
goto error;
isl_int_neg(bmap->eq[k][pos], aff->el[0])isl_sioimath_neg((bmap->eq[k][pos]), *(aff->el[0]));
isl_seq_cpy(bmap->eq[k], aff->el + 1, pos);
isl_seq_cpy(bmap->eq[k] + pos + 1, aff->el + 1 + pos, n_div);

isl_vec_free(aff);
isl_qpolynomial_free(qp);
bmap = isl_basic_map_finalize(bmap);
return bmap;
5226error:
isl_vec_free(aff);
isl_qpolynomial_free(qp);
isl_basic_map_free(bmap);
return NULL((void*)0);
5231}

←

/build/source/polly/lib/External/isl/isl_int_sioimath.h

1/*
2 * Copyright 2015 INRIA Paris-Rocquencourt
3 *
4 * Use of this software is governed by the MIT license
5 *
6 * Written by Michael Kruse, INRIA Paris-Rocquencourt,
7 * Domaine de Voluceau, Rocquenqourt, B.P. 105,
8 * 78153 Le Chesnay Cedex France
9 */
10#ifndef ISL_INT_SIOIMATH_H
11#define ISL_INT_SIOIMATH_H
12 
13#include <inttypes.h>
14#include <limits.h>
15#include <stdint.h>
16#include <stdlib.h>
17 
18#include <isl_imath.h>
19#include <isl/hash.h>
20 
21#define ARRAY_SIZE(array)(sizeof(array)/sizeof(*array)) (sizeof(array)/sizeof(*array))
22 
23/* Visual Studio before VS2015 does not support the inline keyword when
24 * compiling in C mode because it was introduced in C99 which it does not
25 * officially support.  Instead, it has a proprietary extension using __inline.
26 */
27#if defined(_MSC_VER) && (_MSC_VER < 1900)
28#define inline __inline
29#endif
30 
31/* The type to represent integers optimized for small values. It is either a
32 * pointer to an mp_int ( = mpz_t*; big representation) or an int32_t (small
33 * represenation) with a discriminator at the least significant bit. In big
34 * representation it will be always zero because of heap alignment. It is set
35 * to 1 for small representation and use the 32 most significant bits for the
36 * int32_t.
37 *
38 * Structure on 64 bit machines, with 8-byte aligment (3 bits):
39 *
40 * Big representation:
41 * MSB                                                          LSB
42 * |------------------------------------------------------------000
43 * |                            mpz_t*                            |
44 * |                           != NULL                            |
45 *
46 * Small representation:
47 * MSB                           32                             LSB
48 * |------------------------------|00000000000000000000000000000001
49 * |          int32_t             |
50 * |  2147483647 ... -2147483647  |
51 *                                                                ^
52 *                                                                |
53 *                                                        discriminator bit
54 *
55 * On 32 bit machines isl_sioimath type is blown up to 8 bytes, i.e.
56 * isl_sioimath is guaranteed to be at least 8 bytes. This is to ensure the
57 * int32_t can be hidden in that type without data loss. In the future we might
58 * optimize this to use 31 hidden bits in a 32 bit pointer. We may also use 63
59 * bits on 64 bit machines, but this comes with the cost of additional overflow
60 * checks because there is no standardized 128 bit integer we could expand to.
61 *
62 * We use native integer types and avoid union structures to avoid assumptions
63 * on the machine's endianness.
64 *
65 * This implementation makes the following assumptions:
66 * - long can represent any int32_t
67 * - mp_small is signed long
68 * - mp_usmall is unsigned long
69 * - adresses returned by malloc are aligned to 2-byte boundaries (leastmost
70 *   bit is zero)
71 */
72#if UINT64_MAX(18446744073709551615UL) > UINTPTR_MAX(18446744073709551615UL)
73typedef uint64_t isl_sioimath;
74#else
75typedef uintptr_t isl_sioimath;
76#endif
77 
78/* The negation of the smallest possible number in int32_t, INT32_MIN
79 * (0x80000000u, -2147483648), cannot be represented in an int32_t, therefore
80 * every operation that may produce this value needs to special-case it.
81 * The operations are:
82 * abs(INT32_MIN)
83 * -INT32_MIN   (negation)
84 * -1 * INT32_MIN (multiplication)
85 * INT32_MIN/-1 (any division: divexact, fdiv, cdiv, tdiv)
86 * To avoid checking these cases, we exclude INT32_MIN from small
87 * representation.
88 */
89#define ISL_SIOIMATH_SMALL_MIN(-(2147483647)) (-INT32_MAX(2147483647))
90 
91/* Largest possible number in small representation */
92#define ISL_SIOIMATH_SMALL_MAX(2147483647) INT32_MAX(2147483647)
93 
94/* Used for function parameters the function modifies. */
95typedef isl_sioimath *isl_sioimath_ptr;
96 
97/* Used for function parameters that are read-only. */
98typedef isl_sioimath isl_sioimath_src;
99 
100/* Return whether the argument is stored in small representation.
101 */
102inline int isl_sioimath_is_small(isl_sioimath val)
103{
104	return val & 0x00000001;
105}
106 
107/* Return whether the argument is stored in big representation.
108 */
109inline int isl_sioimath_is_big(isl_sioimath val)
110{
111	return !isl_sioimath_is_small(val);
112}
113 
114/* Get the number of an isl_int in small representation. Result is undefined if
115 * val is not stored in that format.
116 */
117inline int32_t isl_sioimath_get_small(isl_sioimath val)
118{
119	return val >> 32;
120}
121 
122/* Get the number of an in isl_int in big representation. Result is undefined if
123 * val is not stored in that format.
124 */
125inline mp_int isl_sioimath_get_big(isl_sioimath val)
126{
127	return (mp_int)(uintptr_t) val;
128}
129 
130/* Return 1 if val is stored in small representation and store its value to
131 * small. We rely on the compiler to optimize the isl_sioimath_get_small such
132 * that the shift is moved into the branch that executes in case of small
133 * representation. If there is no such branch, then a single shift is still
134 * cheaper than introducing branching code.
135 */
136inline int isl_sioimath_decode_small(isl_sioimath val, int32_t *small)
137{
138	*small = isl_sioimath_get_small(val);
139	return isl_sioimath_is_small(val);
140}
141 
142/* Return 1 if val is stored in big representation and store its value to big.
143 */
144inline int isl_sioimath_decode_big(isl_sioimath val, mp_int *big)
145{
146	*big = isl_sioimath_get_big(val);
147	return isl_sioimath_is_big(val);
148}
149 
150/* Encode a small representation into an isl_int.
151 */
152inline isl_sioimath isl_sioimath_encode_small(int32_t val)
153{
154	return ((isl_sioimath) val) << 32 | 0x00000001;
26
←
The result of the left shift is undefined due to shifting '2147483647' by '32', which is unrepresentable in the unsigned version of the return type 'isl_sioimath'
155}
156 
157/* Encode a big representation.
158 */
159inline isl_sioimath isl_sioimath_encode_big(mp_int val)
160{
161	return (isl_sioimath)(uintptr_t) val;
162}
163 
164/* A common situation is to call an IMath function with at least one argument
165 * that is currently in small representation or an integer parameter, i.e. a big
166 * representation of the same number is required. Promoting the original
167 * argument comes with multiple problems, such as modifying a read-only
168 * argument, the responsibility of deallocation and the execution cost. Instead,
169 * we make a copy by 'faking' the IMath internal structure.
170 *
171 * We reserve the maximum number of required digits on the stack to avoid heap
172 * allocations.
173 *
174 * mp_digit can be uint32_t or uint16_t. This code must work for little and big
175 * endian digits. The structure for an uint64_t argument and 32-bit mp_digits is
176 * sketched below.
177 *
178 * |----------------------------|
179 *            uint64_t
180 *
181 * |-------------||-------------|
182 *    mp_digit        mp_digit
183 *    digits[1]       digits[0]
184 * Most sig digit  Least sig digit
185 */
186typedef struct {
187	mpz_t big;
188	mp_digit digits[(sizeof(uintmax_t) + sizeof(mp_digit) - 1) /
189	                sizeof(mp_digit)];
190} isl_sioimath_scratchspace_t;
191 
192/* Convert a native integer to IMath's digit representation. A native integer
193 * might be big- or little endian, but IMath always stores the least significant
194 * digit in the lowest array indices.  memcpy therefore is not possible.
195 *
196 * We also have to consider that long and mp_digit can be of different sizes,
197 * depending on the compiler (LP64, LLP64) and IMath's USE_64BIT_WORDS. This
198 * macro should work for all of them.
199 *
200 * "used" is set to the number of written digits. It must be minimal (IMath
201 * checks zeroness using the used field), but always at least one.  Also note
202 * that the result of num>>(sizeof(num)*CHAR_BIT) is undefined.
203 */
204#define ISL_SIOIMATH_TO_DIGITS(num, digits, used)do { int i = 0; do { (digits)[i] = ((num) >> (sizeof(mp_digit
) * 8 * i)); i += 1; if (i >= (sizeof(num) + sizeof(mp_digit
) - 1) / sizeof(mp_digit)) break; if (((num) >> (sizeof
(mp_digit) * 8 * i)) == 0) break; } while (1); (used) = i; } while
 (0)                              \
205	do {                                                                   \
206		int i = 0;                                                     \
207		do {                                                           \
208			(digits)[i] =                                          \
209			    ((num) >> (sizeof(mp_digit) * CHAR_BIT8 * i));      \
210			i += 1;                                                \
211			if (i >= (sizeof(num) + sizeof(mp_digit) - 1) /        \
212			             sizeof(mp_digit))                         \
213				break;                                         \
214			if (((num) >> (sizeof(mp_digit) * CHAR_BIT8 * i)) == 0) \
215				break;                                         \
216		} while (1);                                                   \
217		(used) = i;                                                    \
218	} while (0)
219 
220inline void isl_siomath_uint32_to_digits(uint32_t num, mp_digit *digits,
221	mp_size *used)
222{
223	ISL_SIOIMATH_TO_DIGITS(num, digits, *used)do { int i = 0; do { (digits)[i] = ((num) >> (sizeof(mp_digit
) * 8 * i)); i += 1; if (i >= (sizeof(num) + sizeof(mp_digit
) - 1) / sizeof(mp_digit)) break; if (((num) >> (sizeof
(mp_digit) * 8 * i)) == 0) break; } while (1); (*used) = i; }
 while (0);
224}
225 
226inline void isl_siomath_ulong_to_digits(unsigned long num, mp_digit *digits,
227	mp_size *used)
228{
229	ISL_SIOIMATH_TO_DIGITS(num, digits, *used)do { int i = 0; do { (digits)[i] = ((num) >> (sizeof(mp_digit
) * 8 * i)); i += 1; if (i >= (sizeof(num) + sizeof(mp_digit
) - 1) / sizeof(mp_digit)) break; if (((num) >> (sizeof
(mp_digit) * 8 * i)) == 0) break; } while (1); (*used) = i; }
 while (0);
230}
231 
232inline void isl_siomath_uint64_to_digits(uint64_t num, mp_digit *digits,
233	mp_size *used)
234{
235	ISL_SIOIMATH_TO_DIGITS(num, digits, *used)do { int i = 0; do { (digits)[i] = ((num) >> (sizeof(mp_digit
) * 8 * i)); i += 1; if (i >= (sizeof(num) + sizeof(mp_digit
) - 1) / sizeof(mp_digit)) break; if (((num) >> (sizeof
(mp_digit) * 8 * i)) == 0) break; } while (1); (*used) = i; }
 while (0);
236}
237 
238/* Get the IMath representation of an isl_int without modifying it.
239 * For the case it is not in big representation yet, pass some scratch space we
240 * can use to store the big representation in.
241 * In order to avoid requiring init and free on the scratch space, we directly
242 * modify the internal representation.
243 *
244 * The name derives from its indented use: getting the big representation of an
245 * input (src) argument.
246 */
247inline mp_int isl_sioimath_bigarg_src(isl_sioimath arg,
248	isl_sioimath_scratchspace_t *scratch)
249{
250	mp_int big;
251	int32_t small;
252	uint32_t num;
253 
254	if (isl_sioimath_decode_big(arg, &big))
255		return big;
256 
257	small = isl_sioimath_get_small(arg);
258	scratch->big.digits = scratch->digits;
259	scratch->big.alloc = ARRAY_SIZE(scratch->digits)(sizeof(scratch->digits)/sizeof(*scratch->digits));
260	if (small >= 0) {
261		scratch->big.sign = MP_ZPOS;
262		num = small;
263	} else {
264		scratch->big.sign = MP_NEG;
265		num = -small;
266	}
267 
268	isl_siomath_uint32_to_digits(num, scratch->digits, &scratch->big.used);
269	return &scratch->big;
270}
271 
272/* Create a temporary IMath mp_int for a signed long.
273 */
274inline mp_int isl_sioimath_siarg_src(signed long arg,
275	isl_sioimath_scratchspace_t *scratch)
276{
277	unsigned long num;
278 
279	scratch->big.digits = scratch->digits;
280	scratch->big.alloc = ARRAY_SIZE(scratch->digits)(sizeof(scratch->digits)/sizeof(*scratch->digits));
281	if (arg >= 0) {
282		scratch->big.sign = MP_ZPOS;
283		num = arg;
284	} else {
285		scratch->big.sign = MP_NEG;
286		num = (arg == LONG_MIN(-9223372036854775807L -1L)) ? ((unsigned long) LONG_MAX9223372036854775807L) + 1 : -arg;
287	}
288 
289	isl_siomath_ulong_to_digits(num, scratch->digits, &scratch->big.used);
290	return &scratch->big;
291}
292 
293/* Create a temporary IMath mp_int for an int64_t.
294 */
295inline mp_int isl_sioimath_si64arg_src(int64_t arg,
296	isl_sioimath_scratchspace_t *scratch)
297{
298	uint64_t num;
299 
300	scratch->big.digits = scratch->digits;
301	scratch->big.alloc = ARRAY_SIZE(scratch->digits)(sizeof(scratch->digits)/sizeof(*scratch->digits));
302	if (arg >= 0) {
303		scratch->big.sign = MP_ZPOS;
304		num = arg;
305	} else {
306		scratch->big.sign = MP_NEG;
307		num = (arg == INT64_MIN(-9223372036854775807L -1)) ? ((uint64_t) INT64_MAX(9223372036854775807L)) + 1 : -arg;
308	}
309 
310	isl_siomath_uint64_to_digits(num, scratch->digits, &scratch->big.used);
311	return &scratch->big;
312}
313 
314/* Create a temporary IMath mp_int for an unsigned long.
315 */
316inline mp_int isl_sioimath_uiarg_src(unsigned long arg,
317	isl_sioimath_scratchspace_t *scratch)
318{
319	scratch->big.digits = scratch->digits;
320	scratch->big.alloc = ARRAY_SIZE(scratch->digits)(sizeof(scratch->digits)/sizeof(*scratch->digits));
321	scratch->big.sign = MP_ZPOS;
322 
323	isl_siomath_ulong_to_digits(arg, scratch->digits, &scratch->big.used);
324	return &scratch->big;
325}
326 
327/* Ensure big representation. Does not preserve the current number.
328 * Callers may use the fact that the value _is_ preserved if the presentation
329 * was big before.
330 */
331inline mp_int isl_sioimath_reinit_big(isl_sioimath_ptr ptr)
332{
333	if (isl_sioimath_is_small(*ptr))
334		*ptr = isl_sioimath_encode_big(mp_int_alloc());
335	return isl_sioimath_get_big(*ptr);
336}
337 
338/* Set ptr to a number in small representation.
339 */
340inline void isl_sioimath_set_small(isl_sioimath_ptr ptr, int32_t val)
341{
342	if (isl_sioimath_is_big(*ptr))
22
←
Assuming the condition is false→
23
←
Taking false branch→
343		mp_int_free(isl_sioimath_get_big(*ptr));
344	*ptr = isl_sioimath_encode_small(val);
24
←
Passing value via 1st parameter 'val'→
25
←
Calling 'isl_sioimath_encode_small'→
345}
346 
347/* Set ptr to val, choosing small representation if possible.
348 */
349inline void isl_sioimath_set_int32(isl_sioimath_ptr ptr, int32_t val)
350{
351	if (ISL_SIOIMATH_SMALL_MIN(-(2147483647)) <= val && val <= ISL_SIOIMATH_SMALL_MAX(2147483647)) {
352		isl_sioimath_set_small(ptr, val);
353		return;
354	}
355 
356	mp_int_init_value(isl_sioimath_reinit_big(ptr), val);
357}
358 
359/* Assign an int64_t number using small representation if possible.
360 */
361inline void isl_sioimath_set_int64(isl_sioimath_ptr ptr, int64_t val)
362{
363	if (ISL_SIOIMATH_SMALL_MIN(-(2147483647)) <= val && val <= ISL_SIOIMATH_SMALL_MAX(2147483647)) {
17
←
Assuming the condition is true→
18
←
Assuming 'val' is <= ISL_SIOIMATH_SMALL_MAX→
19
←
Taking true branch→
364		isl_sioimath_set_small(ptr, val);
20
←
Passing value via 2nd parameter 'val'→
21
←
Calling 'isl_sioimath_set_small'→
365		return;
366	}
367 
368	isl_sioimath_scratchspace_t scratch;
369	mp_int_copy(isl_sioimath_si64arg_src(val, &scratch),
370	    isl_sioimath_reinit_big(ptr));
371}
372 
373/* Convert to big representation while preserving the current number.
374 */
375inline void isl_sioimath_promote(isl_sioimath_ptr dst)
376{
377	int32_t small;
378 
379	if (isl_sioimath_is_big(*dst))
380		return;
381 
382	small = isl_sioimath_get_small(*dst);
383	mp_int_set_value(isl_sioimath_reinit_big(dst), small);
384}
385 
386/* Convert to small representation while preserving the current number. Does
387 * nothing if dst doesn't fit small representation.
388 */
389inline void isl_sioimath_try_demote(isl_sioimath_ptr dst)
390{
391	mp_small small;
392 
393	if (isl_sioimath_is_small(*dst))
394		return;
395 
396	if (mp_int_to_int(isl_sioimath_get_big(*dst), &small) != MP_OK)
397		return;
398 
399	if (ISL_SIOIMATH_SMALL_MIN(-(2147483647)) <= small && small <= ISL_SIOIMATH_SMALL_MAX(2147483647))
400		isl_sioimath_set_small(dst, small);
401}
402 
403/* Initialize an isl_int. The implicit value is 0 in small representation.
404 */
405inline void isl_sioimath_init(isl_sioimath_ptr dst)
406{
407	*dst = isl_sioimath_encode_small(0);
408}
409 
410/* Free the resources taken by an isl_int.
411 */
412inline void isl_sioimath_clear(isl_sioimath_ptr dst)
413{
414	if (isl_sioimath_is_small(*dst))
415		return;
416 
417	mp_int_free(isl_sioimath_get_big(*dst));
418}
419 
420/* Copy the value of one isl_int to another.
421 */
422inline void isl_sioimath_set(isl_sioimath_ptr dst, isl_sioimath_src val)
423{
424	if (isl_sioimath_is_small(val)) {
425		isl_sioimath_set_small(dst, isl_sioimath_get_small(val));
426		return;
427	}
428 
429	mp_int_copy(isl_sioimath_get_big(val), isl_sioimath_reinit_big(dst));
430}
431 
432/* Store a signed long into an isl_int.
433 */
434inline void isl_sioimath_set_si(isl_sioimath_ptr dst, long val)
435{
436	if (ISL_SIOIMATH_SMALL_MIN(-(2147483647)) <= val && val <= ISL_SIOIMATH_SMALL_MAX(2147483647)) {
437		isl_sioimath_set_small(dst, val);
438		return;
439	}
440 
441	mp_int_set_value(isl_sioimath_reinit_big(dst), val);
442}
443 
444/* Store an unsigned long into an isl_int.
445 */
446inline void isl_sioimath_set_ui(isl_sioimath_ptr dst, unsigned long val)
447{
448	if (val <= ISL_SIOIMATH_SMALL_MAX(2147483647)) {
449		isl_sioimath_set_small(dst, val);
450		return;
451	}
452 
453	mp_int_set_uvalue(isl_sioimath_reinit_big(dst), val);
454}
455 
456/* Return whether a number can be represented by a signed long.
457 */
458inline int isl_sioimath_fits_slong(isl_sioimath_src val)
459{
460	mp_small dummy;
461 
462	if (isl_sioimath_is_small(val))
463		return 1;
464 
465	return mp_int_to_int(isl_sioimath_get_big(val), &dummy) == MP_OK;
466}
467 
468/* Return a number as signed long. Result is undefined if the number cannot be
469 * represented as long.
470 */
471inline long isl_sioimath_get_si(isl_sioimath_src val)
472{
473	mp_small result;
474 
475	if (isl_sioimath_is_small(val))
476		return isl_sioimath_get_small(val);
477 
478	mp_int_to_int(isl_sioimath_get_big(val), &result);
479	return result;
480}
481 
482/* Return whether a number can be represented as unsigned long.
483 */
484inline int isl_sioimath_fits_ulong(isl_sioimath_src val)
485{
486	mp_usmall dummy;
487 
488	if (isl_sioimath_is_small(val))
489		return isl_sioimath_get_small(val) >= 0;
490 
491	return mp_int_to_uint(isl_sioimath_get_big(val), &dummy) == MP_OK;
492}
493 
494/* Return a number as unsigned long. Result is undefined if the number cannot be
495 * represented as unsigned long.
496 */
497inline unsigned long isl_sioimath_get_ui(isl_sioimath_src val)
498{
499	mp_usmall result;
500 
501	if (isl_sioimath_is_small(val))
502		return isl_sioimath_get_small(val);
503 
504	mp_int_to_uint(isl_sioimath_get_big(val), &result);
505	return result;
506}
507 
508/* Return a number as floating point value.
509 */
510inline double isl_sioimath_get_d(isl_sioimath_src val)
511{
512	mp_int big;
513	double result = 0;
514	int i;
515 
516	if (isl_sioimath_is_small(val))
517		return isl_sioimath_get_small(val);
518 
519	big = isl_sioimath_get_big(val);
520	for (i = 0; i < big->used; ++i)
521		result = result * (double) ((uintmax_t) MP_DIGIT_MAX((4294967295U) * 1UL) + 1) +
522		         (double) big->digits[i];
523 
524	if (big->sign == MP_NEG)
525		result = -result;
526 
527	return result;
528}
529 
530/* Format a number as decimal string.
531 *
532 * The largest possible string from small representation is 12 characters
533 * ("-2147483647").
534 */
535inline char *isl_sioimath_get_str(isl_sioimath_src val)
536{
537	char *result;
538 
539	if (isl_sioimath_is_small(val)) {
540		result = malloc(12);
541		snprintf(result, 12, "%" PRIi32, isl_sioimath_get_small(val))__builtin___snprintf_chk (result, 12, 2 - 1, __builtin_object_size
 (result, 2 > 1), "%" "i", isl_sioimath_get_small(val));
542		return result;
543	}
544 
545	return impz_get_str(NULL((void*)0), 10, isl_sioimath_get_big(val));
546}
547 
548/* Return the absolute value.
549 */
550inline void isl_sioimath_abs(isl_sioimath_ptr dst, isl_sioimath_src arg)
551{
552	if (isl_sioimath_is_small(arg)) {
553		isl_sioimath_set_small(dst, labs(isl_sioimath_get_small(arg)));
554		return;
555	}
556 
557	mp_int_abs(isl_sioimath_get_big(arg), isl_sioimath_reinit_big(dst));
558}
559 
560/* Return the negation of a number.
561 */
562inline void isl_sioimath_neg(isl_sioimath_ptr dst, isl_sioimath_src arg)
563{
564	if (isl_sioimath_is_small(arg)) {
565		isl_sioimath_set_small(dst, -isl_sioimath_get_small(arg));
566		return;
567	}
568 
569	mp_int_neg(isl_sioimath_get_big(arg), isl_sioimath_reinit_big(dst));
570}
571 
572/* Swap two isl_ints.
573 *
574 * isl_sioimath can be copied bytewise; nothing depends on its address. It can
575 * also be stored in a CPU register.
576 */
577inline void isl_sioimath_swap(isl_sioimath_ptr lhs, isl_sioimath_ptr rhs)
578{
579	isl_sioimath tmp = *lhs;
580	*lhs = *rhs;
581	*rhs = tmp;
582}
583 
584/* Add an unsigned long to the number.
585 *
586 * On LP64 unsigned long exceeds the range of an int64_t, therefore we check in
587 * advance whether small representation possibly overflows.
588 */
589inline void isl_sioimath_add_ui(isl_sioimath_ptr dst, isl_sioimath lhs,
590	unsigned long rhs)
591{
592	int32_t smalllhs;
593	isl_sioimath_scratchspace_t lhsscratch;
594 
595	if (isl_sioimath_decode_small(lhs, &smalllhs) &&
596	    (rhs <= (uint64_t) INT64_MAX(9223372036854775807L) - (uint64_t) ISL_SIOIMATH_SMALL_MAX(2147483647))) {
597		isl_sioimath_set_int64(dst, (int64_t) smalllhs + rhs);
598		return;
599	}
600 
601	impz_add_ui(isl_sioimath_reinit_big(dst),
602	    isl_sioimath_bigarg_src(lhs, &lhsscratch), rhs);
603	isl_sioimath_try_demote(dst);
604}
605 
606/* Subtract an unsigned long.
607 *
608 * On LP64 unsigned long exceeds the range of an int64_t.  If
609 * ISL_SIOIMATH_SMALL_MIN-rhs>=INT64_MIN we can do the calculation using int64_t
610 * without risking an overflow.
611 */
612inline void isl_sioimath_sub_ui(isl_sioimath_ptr dst, isl_sioimath lhs,
613				unsigned long rhs)
614{
615	int32_t smalllhs;
616	isl_sioimath_scratchspace_t lhsscratch;
617 
618	if (isl_sioimath_decode_small(lhs, &smalllhs) &&
13
←
Assuming the condition is true→
14
←
Taking true branch→
619	    (rhs < (uint64_t) INT64_MIN(-9223372036854775807L -1) - (uint64_t) ISL_SIOIMATH_SMALL_MIN(-(2147483647)))) {
620		isl_sioimath_set_int64(dst, (int64_t) smalllhs - rhs);
15
←
Passing value via 2nd parameter 'val'→
16
←
Calling 'isl_sioimath_set_int64'→
621		return;
622	}
623 
624	impz_sub_ui(isl_sioimath_reinit_big(dst),
625	    isl_sioimath_bigarg_src(lhs, &lhsscratch), rhs);
626	isl_sioimath_try_demote(dst);
627}
628 
629/* Sum of two isl_ints.
630 */
631inline void isl_sioimath_add(isl_sioimath_ptr dst, isl_sioimath_src lhs,
632	isl_sioimath_src rhs)
633{
634	isl_sioimath_scratchspace_t scratchlhs, scratchrhs;
635	int32_t smalllhs, smallrhs;
636 
637	if (isl_sioimath_decode_small(lhs, &smalllhs) &&
638	    isl_sioimath_decode_small(rhs, &smallrhs)) {
639		isl_sioimath_set_int64(
640		    dst, (int64_t) smalllhs + (int64_t) smallrhs);
641		return;
642	}
643 
644	mp_int_add(isl_sioimath_bigarg_src(lhs, &scratchlhs),
645	    isl_sioimath_bigarg_src(rhs, &scratchrhs),
646	    isl_sioimath_reinit_big(dst));
647	isl_sioimath_try_demote(dst);
648}
649 
650/* Subtract two isl_ints.
651 */
652inline void isl_sioimath_sub(isl_sioimath_ptr dst, isl_sioimath_src lhs,
653	isl_sioimath_src rhs)
654{
655	isl_sioimath_scratchspace_t scratchlhs, scratchrhs;
656	int32_t smalllhs, smallrhs;
657 
658	if (isl_sioimath_decode_small(lhs, &smalllhs) &&
659	    isl_sioimath_decode_small(rhs, &smallrhs)) {
660		isl_sioimath_set_int64(
661		    dst, (int64_t) smalllhs - (int64_t) smallrhs);
662		return;
663	}
664 
665	mp_int_sub(isl_sioimath_bigarg_src(lhs, &scratchlhs),
666	    isl_sioimath_bigarg_src(rhs, &scratchrhs),
667	    isl_sioimath_reinit_big(dst));
668	isl_sioimath_try_demote(dst);
669}
670 
671/* Multiply two isl_ints.
672 */
673inline void isl_sioimath_mul(isl_sioimath_ptr dst, isl_sioimath_src lhs,
674	isl_sioimath_src rhs)
675{
676	isl_sioimath_scratchspace_t scratchlhs, scratchrhs;
677	int32_t smalllhs, smallrhs;
678 
679	if (isl_sioimath_decode_small(lhs, &smalllhs) &&
680	    isl_sioimath_decode_small(rhs, &smallrhs)) {
681		isl_sioimath_set_int64(
682		    dst, (int64_t) smalllhs * (int64_t) smallrhs);
683		return;
684	}
685 
686	mp_int_mul(isl_sioimath_bigarg_src(lhs, &scratchlhs),
687	    isl_sioimath_bigarg_src(rhs, &scratchrhs),
688	    isl_sioimath_reinit_big(dst));
689	isl_sioimath_try_demote(dst);
690}
691 
692/* Shift lhs by rhs bits to the left and store the result in dst. Effectively,
693 * this operation computes 'lhs * 2^rhs'.
694 */
695inline void isl_sioimath_mul_2exp(isl_sioimath_ptr dst, isl_sioimath lhs,
696	unsigned long rhs)
697{
698	isl_sioimath_scratchspace_t scratchlhs;
699	int32_t smalllhs;
700 
701	if (isl_sioimath_decode_small(lhs, &smalllhs) && (rhs <= 32ul)) {
702		isl_sioimath_set_int64(dst, ((int64_t) smalllhs) << rhs);
703		return;
704	}
705 
706	mp_int_mul_pow2(isl_sioimath_bigarg_src(lhs, &scratchlhs), rhs,
707	    isl_sioimath_reinit_big(dst));
708}
709 
710/* Multiply an isl_int and a signed long.
711 */
712inline void isl_sioimath_mul_si(isl_sioimath_ptr dst, isl_sioimath lhs,
713	signed long rhs)
714{
715	isl_sioimath_scratchspace_t scratchlhs, scratchrhs;
716	int32_t smalllhs;
717 
718	if (isl_sioimath_decode_small(lhs, &smalllhs) && (rhs > LONG_MIN(-9223372036854775807L -1L)) &&
719	    (labs(rhs) <= UINT32_MAX(4294967295U))) {
720		isl_sioimath_set_int64(dst, (int64_t) smalllhs * (int64_t) rhs);
721		return;
722	}
723 
724	mp_int_mul(isl_sioimath_bigarg_src(lhs, &scratchlhs),
725	    isl_sioimath_siarg_src(rhs, &scratchrhs),
726	    isl_sioimath_reinit_big(dst));
727	isl_sioimath_try_demote(dst);
728}
729 
730/* Multiply an isl_int and an unsigned long.
731 */
732inline void isl_sioimath_mul_ui(isl_sioimath_ptr dst, isl_sioimath lhs,
733	unsigned long rhs)
734{
735	isl_sioimath_scratchspace_t scratchlhs, scratchrhs;
736	int32_t smalllhs;
737 
738	if (isl_sioimath_decode_small(lhs, &smalllhs) && (rhs <= UINT32_MAX(4294967295U))) {
739		isl_sioimath_set_int64(dst, (int64_t) smalllhs * (int64_t) rhs);
740		return;
741	}
742 
743	mp_int_mul(isl_sioimath_bigarg_src(lhs, &scratchlhs),
744	    isl_sioimath_uiarg_src(rhs, &scratchrhs),
745	    isl_sioimath_reinit_big(dst));
746	isl_sioimath_try_demote(dst);
747}
748 
749/* Compute the power of an isl_int to an unsigned long.
750 * Always let IMath do it; the result is unlikely to be small except in some
751 * special cases.
752 * Note: 0^0 == 1
753 */
754inline void isl_sioimath_pow_ui(isl_sioimath_ptr dst, isl_sioimath_src lhs,
755	unsigned long rhs)
756{
757	isl_sioimath_scratchspace_t scratchlhs, scratchrhs;
758	int32_t smalllhs;
759 
760	switch (rhs) {
761	case 0:
762		isl_sioimath_set_small(dst, 1);
763		return;
764	case 1:
765		isl_sioimath_set(dst, lhs);
766		return;
767	case 2:
768		isl_sioimath_mul(dst, lhs, lhs);
769		return;
770	}
771 
772	if (isl_sioimath_decode_small(lhs, &smalllhs)) {
773		switch (smalllhs) {
774		case 0:
775			isl_sioimath_set_small(dst, 0);
776			return;
777		case 1:
778			isl_sioimath_set_small(dst, 1);
779			return;
780		case 2:
781			isl_sioimath_set_small(dst, 1);
782			isl_sioimath_mul_2exp(dst, *dst, rhs);
783			return;
784		default:
785			if ((MP_SMALL_MIN(-9223372036854775807L -1L) <= rhs) && (rhs <= MP_SMALL_MAX9223372036854775807L)) {
786				mp_int_expt_value(smalllhs, rhs,
787				    isl_sioimath_reinit_big(dst));
788				isl_sioimath_try_demote(dst);
789				return;
790			}
791		}
792	}
793 
794	mp_int_expt_full(isl_sioimath_bigarg_src(lhs, &scratchlhs),
795	    isl_sioimath_uiarg_src(rhs, &scratchrhs),
796	    isl_sioimath_reinit_big(dst));
797	isl_sioimath_try_demote(dst);
798}
799 
800/* Fused multiply-add.
801 */
802inline void isl_sioimath_addmul(isl_sioimath_ptr dst, isl_sioimath_src lhs,
803	isl_sioimath_src rhs)
804{
805	isl_sioimath tmp;
806	isl_sioimath_init(&tmp);
807	isl_sioimath_mul(&tmp, lhs, rhs);
808	isl_sioimath_add(dst, *dst, tmp);
809	isl_sioimath_clear(&tmp);
810}
811 
812/* Fused multiply-add with an unsigned long.
813 */
814inline void isl_sioimath_addmul_ui(isl_sioimath_ptr dst, isl_sioimath_src lhs,
815	unsigned long rhs)
816{
817	isl_sioimath tmp;
818	isl_sioimath_init(&tmp);
819	isl_sioimath_mul_ui(&tmp, lhs, rhs);
820	isl_sioimath_add(dst, *dst, tmp);
821	isl_sioimath_clear(&tmp);
822}
823 
824/* Fused multiply-subtract.
825 */
826inline void isl_sioimath_submul(isl_sioimath_ptr dst, isl_sioimath_src lhs,
827	isl_sioimath_src rhs)
828{
829	isl_sioimath tmp;
830	isl_sioimath_init(&tmp);
831	isl_sioimath_mul(&tmp, lhs, rhs);
832	isl_sioimath_sub(dst, *dst, tmp);
833	isl_sioimath_clear(&tmp);
834}
835 
836/* Fused multiply-add with an unsigned long.
837 */
838inline void isl_sioimath_submul_ui(isl_sioimath_ptr dst, isl_sioimath_src lhs,
839	unsigned long rhs)
840{
841	isl_sioimath tmp;
842	isl_sioimath_init(&tmp);
843	isl_sioimath_mul_ui(&tmp, lhs, rhs);
844	isl_sioimath_sub(dst, *dst, tmp);
845	isl_sioimath_clear(&tmp);
846}
847 
848void isl_sioimath_gcd(isl_sioimath_ptr dst, isl_sioimath_src lhs,
849		      isl_sioimath_src rhs);
850void isl_sioimath_lcm(isl_sioimath_ptr dst, isl_sioimath_src lhs,
851		      isl_sioimath_src rhs);
852 
853/* Divide lhs by rhs, rounding to zero (Truncate).
854 */
855inline void isl_sioimath_tdiv_q(isl_sioimath_ptr dst, isl_sioimath_src lhs,
856	isl_sioimath_src rhs)
857{
858	isl_sioimath_scratchspace_t lhsscratch, rhsscratch;
859	int32_t lhssmall, rhssmall;
860 
861	if (isl_sioimath_decode_small(lhs, &lhssmall) &&
862	    isl_sioimath_decode_small(rhs, &rhssmall)) {
863		isl_sioimath_set_small(dst, lhssmall / rhssmall);
864		return;
865	}
866 
867	mp_int_div(isl_sioimath_bigarg_src(lhs, &lhsscratch),
868	    isl_sioimath_bigarg_src(rhs, &rhsscratch),
869	    isl_sioimath_reinit_big(dst), NULL((void*)0));
870	isl_sioimath_try_demote(dst);
871	return;
872}
873 
874/* Divide lhs by an unsigned long rhs, rounding to zero (Truncate).
875 */
876inline void isl_sioimath_tdiv_q_ui(isl_sioimath_ptr dst, isl_sioimath_src lhs,
877	unsigned long rhs)
878{
879	isl_sioimath_scratchspace_t lhsscratch, rhsscratch;
880	int32_t lhssmall;
881 
882	if (isl_sioimath_is_small(lhs) && (rhs <= (unsigned long) INT32_MAX(2147483647))) {
883		lhssmall = isl_sioimath_get_small(lhs);
884		isl_sioimath_set_small(dst, lhssmall / (int32_t) rhs);
885		return;
886	}
887 
888	if (rhs <= MP_SMALL_MAX9223372036854775807L) {
889		mp_int_div_value(isl_sioimath_bigarg_src(lhs, &lhsscratch), rhs,
890		    isl_sioimath_reinit_big(dst), NULL((void*)0));
891		isl_sioimath_try_demote(dst);
892		return;
893	}
894 
895	mp_int_div(isl_sioimath_bigarg_src(lhs, &lhsscratch),
896	    isl_sioimath_uiarg_src(rhs, &rhsscratch),
897	    isl_sioimath_reinit_big(dst), NULL((void*)0));
898	isl_sioimath_try_demote(dst);
899}
900 
901/* Divide lhs by rhs, rounding to positive infinity (Ceil).
902 */
903inline void isl_sioimath_cdiv_q(isl_sioimath_ptr dst, isl_sioimath_src lhs,
904	isl_sioimath_src rhs)
905{
906	int32_t lhssmall, rhssmall;
907	isl_sioimath_scratchspace_t lhsscratch, rhsscratch;
908	int32_t q;
909 
910	if (isl_sioimath_decode_small(lhs, &lhssmall) &&
911	    isl_sioimath_decode_small(rhs, &rhssmall)) {
912		if ((lhssmall >= 0) && (rhssmall >= 0))
913			q = ((int64_t) lhssmall + (int64_t) rhssmall - 1) /
914			    rhssmall;
915		else if ((lhssmall < 0) && (rhssmall < 0))
916			q = ((int64_t) lhssmall + (int64_t) rhssmall + 1) /
917			    rhssmall;
918		else
919			q = lhssmall / rhssmall;
920		isl_sioimath_set_small(dst, q);
921		return;
922	}
923 
924	impz_cdiv_q(isl_sioimath_reinit_big(dst),
925	    isl_sioimath_bigarg_src(lhs, &lhsscratch),
926	    isl_sioimath_bigarg_src(rhs, &rhsscratch));
927	isl_sioimath_try_demote(dst);
928}
929 
930/* Compute the division of lhs by a rhs of type unsigned long, rounding towards
931 * positive infinity (Ceil).
932 */
933inline void isl_sioimath_cdiv_q_ui(isl_sioimath_ptr dst, isl_sioimath_src lhs,
934	unsigned long rhs)
935{
936	isl_sioimath_scratchspace_t lhsscratch, rhsscratch;
937	int32_t lhssmall, q;
938 
939	if (isl_sioimath_decode_small(lhs, &lhssmall) && (rhs <= INT32_MAX(2147483647))) {
940		if (lhssmall >= 0)
941			q = ((int64_t) lhssmall + ((int64_t) rhs - 1)) /
942			    (int64_t) rhs;
943		else
944			q = lhssmall / (int32_t) rhs;
945		isl_sioimath_set_small(dst, q);
946		return;
947	}
948 
949	impz_cdiv_q(isl_sioimath_reinit_big(dst),
950	    isl_sioimath_bigarg_src(lhs, &lhsscratch),
951	    isl_sioimath_uiarg_src(rhs, &rhsscratch));
952	isl_sioimath_try_demote(dst);
953}
954 
955/* Divide lhs by rhs, rounding to negative infinity (Floor).
956 */
957inline void isl_sioimath_fdiv_q(isl_sioimath_ptr dst, isl_sioimath_src lhs,
958	isl_sioimath_src rhs)
959{
960	isl_sioimath_scratchspace_t lhsscratch, rhsscratch;
961	int32_t lhssmall, rhssmall;
962	int32_t q;
963 
964	if (isl_sioimath_decode_small(lhs, &lhssmall) &&
965	    isl_sioimath_decode_small(rhs, &rhssmall)) {
966		if ((lhssmall < 0) && (rhssmall >= 0))
967			q = ((int64_t) lhssmall - ((int64_t) rhssmall - 1)) /
968			    rhssmall;
969		else if ((lhssmall >= 0) && (rhssmall < 0))
970			q = ((int64_t) lhssmall - ((int64_t) rhssmall + 1)) /
971			    rhssmall;
972		else
973			q = lhssmall / rhssmall;
974		isl_sioimath_set_small(dst, q);
975		return;
976	}
977 
978	impz_fdiv_q(isl_sioimath_reinit_big(dst),
979	    isl_sioimath_bigarg_src(lhs, &lhsscratch),
980	    isl_sioimath_bigarg_src(rhs, &rhsscratch));
981	isl_sioimath_try_demote(dst);
982}
983 
984/* Compute the division of lhs by a rhs of type unsigned long, rounding towards
985 * negative infinity (Floor).
986 */
987inline void isl_sioimath_fdiv_q_ui(isl_sioimath_ptr dst, isl_sioimath_src lhs,
988	unsigned long rhs)
989{
990	isl_sioimath_scratchspace_t lhsscratch, rhsscratch;
991	int32_t lhssmall, q;
992 
993	if (isl_sioimath_decode_small(lhs, &lhssmall) && (rhs <= INT32_MAX(2147483647))) {
994		if (lhssmall >= 0)
995			q = (uint32_t) lhssmall / rhs;
996		else
997			q = ((int64_t) lhssmall - ((int64_t) rhs - 1)) /
998			    (int64_t) rhs;
999		isl_sioimath_set_small(dst, q);
1000		return;
1001	}
1002 
1003	impz_fdiv_q(isl_sioimath_reinit_big(dst),
1004	    isl_sioimath_bigarg_src(lhs, &lhsscratch),
1005	    isl_sioimath_uiarg_src(rhs, &rhsscratch));
1006	isl_sioimath_try_demote(dst);
1007}
1008 
1009/* Get the remainder of: lhs divided by rhs rounded towards negative infinite
1010 * (Floor).
1011 */
1012inline void isl_sioimath_fdiv_r(isl_sioimath_ptr dst, isl_sioimath_src lhs,
1013	isl_sioimath_src rhs)
1014{
1015	isl_sioimath_scratchspace_t lhsscratch, rhsscratch;
1016	int64_t lhssmall, rhssmall;
1017	int32_t r;
1018 
1019	if (isl_sioimath_is_small(lhs) && isl_sioimath_is_small(rhs)) {
1020		lhssmall = isl_sioimath_get_small(lhs);
1021		rhssmall = isl_sioimath_get_small(rhs);
1022		r = (rhssmall + lhssmall % rhssmall) % rhssmall;
1023		isl_sioimath_set_small(dst, r);
1024		return;
1025	}
1026 
1027	impz_fdiv_r(isl_sioimath_reinit_big(dst),
1028	    isl_sioimath_bigarg_src(lhs, &lhsscratch),
1029	    isl_sioimath_bigarg_src(rhs, &rhsscratch));
1030	isl_sioimath_try_demote(dst);
1031}
1032 
1033void isl_sioimath_read(isl_sioimath_ptr dst, const char *str);
1034 
1035/* Return:
1036 *   +1 for a positive number
1037 *   -1 for a negative number
1038 *    0 if the number is zero
1039 */
1040inline int isl_sioimath_sgn(isl_sioimath_src arg)
1041{
1042	int32_t small;
1043 
1044	if (isl_sioimath_decode_small(arg, &small))
1045		return (small > 0) - (small < 0);
1046 
1047	return mp_int_compare_zero(isl_sioimath_get_big(arg));
1048}
1049 
1050/* Return:
1051 *   +1 if lhs > rhs
1052 *   -1 if lhs < rhs
1053 *    0 if lhs = rhs
1054 */
1055inline int isl_sioimath_cmp(isl_sioimath_src lhs, isl_sioimath_src rhs)
1056{
1057	isl_sioimath_scratchspace_t lhsscratch, rhsscratch;
1058	int32_t lhssmall, rhssmall;
1059 
1060	if (isl_sioimath_decode_small(lhs, &lhssmall) &&
1061	    isl_sioimath_decode_small(rhs, &rhssmall))
1062		return (lhssmall > rhssmall) - (lhssmall < rhssmall);
1063 
1064	if (isl_sioimath_decode_small(rhs, &rhssmall))
1065		return mp_int_compare_value(
1066		    isl_sioimath_bigarg_src(lhs, &lhsscratch), rhssmall);
1067 
1068	if (isl_sioimath_decode_small(lhs, &lhssmall))
1069		return -mp_int_compare_value(
1070		           isl_sioimath_bigarg_src(rhs, &rhsscratch), lhssmall);
1071 
1072	return mp_int_compare(
1073	    isl_sioimath_get_big(lhs), isl_sioimath_get_big(rhs));
1074}
1075 
1076/* As isl_sioimath_cmp, but with signed long rhs.
1077 */
1078inline int isl_sioimath_cmp_si(isl_sioimath_src lhs, signed long rhs)
1079{
1080	int32_t lhssmall;
1081 
1082	if (isl_sioimath_decode_small(lhs, &lhssmall))
1083		return (lhssmall > rhs) - (lhssmall < rhs);
1084 
1085	return mp_int_compare_value(isl_sioimath_get_big(lhs), rhs);
1086}
1087 
1088/* Return:
1089 *   +1 if |lhs| > |rhs|
1090 *   -1 if |lhs| < |rhs|
1091 *    0 if |lhs| = |rhs|
1092 */
1093inline int isl_sioimath_abs_cmp(isl_sioimath_src lhs, isl_sioimath_src rhs)
1094{
1095	isl_sioimath_scratchspace_t lhsscratch, rhsscratch;
1096	int32_t lhssmall, rhssmall;
1097 
1098	if (isl_sioimath_decode_small(lhs, &lhssmall) &&
1099	    isl_sioimath_decode_small(rhs, &rhssmall)) {
1100		lhssmall = labs(lhssmall);
1101		rhssmall = labs(rhssmall);
1102		return (lhssmall > rhssmall) - (lhssmall < rhssmall);
1103	}
1104 
1105	return mp_int_compare_unsigned(
1106	    isl_sioimath_bigarg_src(lhs, &lhsscratch),
1107	    isl_sioimath_bigarg_src(rhs, &rhsscratch));
1108}
1109 
1110/* Return whether lhs is divisible by rhs.
1111 * In particular, can rhs be multiplied by some integer to result in lhs?
1112 * If rhs is zero, then this means lhs has to be zero too.
1113 */
1114inline int isl_sioimath_is_divisible_by(isl_sioimath_src lhs,
1115					isl_sioimath_src rhs)
1116{
1117	isl_sioimath_scratchspace_t lhsscratch, rhsscratch;
1118	int32_t lhssmall, rhssmall;
1119	mpz_t rem;
1120	int cmp;
1121 
1122	if (isl_sioimath_sgn(rhs) == 0)
1123		return isl_sioimath_sgn(lhs) == 0;
1124 
1125	if (isl_sioimath_decode_small(lhs, &lhssmall) &&
1126	    isl_sioimath_decode_small(rhs, &rhssmall))
1127		return lhssmall % rhssmall == 0;
1128 
1129	if (isl_sioimath_decode_small(rhs, &rhssmall))
1130		return mp_int_divisible_value(
1131		    isl_sioimath_bigarg_src(lhs, &lhsscratch), rhssmall);
1132 
1133	mp_int_init(&rem);
1134	mp_int_div(isl_sioimath_bigarg_src(lhs, &lhsscratch),
1135	    isl_sioimath_bigarg_src(rhs, &rhsscratch), NULL((void*)0), &rem);
1136	cmp = mp_int_compare_zero(&rem);
1137	mp_int_clear(&rem);
1138	return cmp == 0;
1139}
1140 
1141/* Return a hash code of an isl_sioimath.
1142 * The hash code for a number in small and big representation must be identical
1143 * on the same machine because small representation if not obligatory if fits.
1144 */
1145inline uint32_t isl_sioimath_hash(isl_sioimath_src arg, uint32_t hash)
1146{
1147	int32_t small;
1148	int i;
1149	uint32_t num;
1150	mp_digit digits[(sizeof(uint32_t) + sizeof(mp_digit) - 1) /
1151	                sizeof(mp_digit)];
1152	mp_size used;
1153	const unsigned char *digitdata = (const unsigned char *) &digits;
1154 
1155	if (isl_sioimath_decode_small(arg, &small)) {
1156		if (small < 0)
1157			isl_hash_byte(hash, 0xFF)do { hash *= 16777619; hash ^= 0xFF; } while(0);
1158		num = labs(small);
1159 
1160		isl_siomath_uint32_to_digits(num, digits, &used);
1161		for (i = 0; i < used * sizeof(mp_digit); i += 1)
1162			isl_hash_byte(hash, digitdata[i])do { hash *= 16777619; hash ^= digitdata[i]; } while(0);
1163		return hash;
1164	}
1165 
1166	return isl_imath_hash(isl_sioimath_get_big(arg), hash);
1167}
1168 
1169/* Return the number of digits in a number of the given base or more, i.e. the
1170 * string length without sign and null terminator.
1171 *
1172 * Current implementation for small representation returns the maximal number
1173 * of binary digits in that representation, which can be much larger than the
1174 * smallest possible solution.
1175 */
1176inline size_t isl_sioimath_sizeinbase(isl_sioimath_src arg, int base)
1177{
1178	int32_t small;
1179 
1180	if (isl_sioimath_decode_small(arg, &small))
1181		return sizeof(int32_t) * CHAR_BIT8 - 1;
1182 
1183	return impz_sizeinbase(isl_sioimath_get_big(arg), base);
1184}
1185 
1186void isl_sioimath_print(FILE *out, isl_sioimath_src i, int width);
1187void isl_sioimath_dump(isl_sioimath_src arg);
1188 
1189typedef isl_sioimath isl_int[1];
1190#define isl_int_init(i)isl_sioimath_init((i))			isl_sioimath_init((i))
1191#define isl_int_clear(i)isl_sioimath_clear((i))		isl_sioimath_clear((i))
1192 
1193#define isl_int_set(r, i)isl_sioimath_set((r), *(i))		isl_sioimath_set((r), *(i))
1194#define isl_int_set_si(r, i)isl_sioimath_set_si((r), i)		isl_sioimath_set_si((r), i)
1195#define isl_int_set_ui(r, i)isl_sioimath_set_ui((r), i)		isl_sioimath_set_ui((r), i)
1196#define isl_int_fits_slong(r)isl_sioimath_fits_slong(*(r))		isl_sioimath_fits_slong(*(r))
1197#define isl_int_get_si(r)isl_sioimath_get_si(*(r))		isl_sioimath_get_si(*(r))
1198#define isl_int_fits_ulong(r)isl_sioimath_fits_ulong(*(r))		isl_sioimath_fits_ulong(*(r))
1199#define isl_int_get_ui(r)isl_sioimath_get_ui(*(r))		isl_sioimath_get_ui(*(r))
1200#define isl_int_get_d(r)isl_sioimath_get_d(*(r))		isl_sioimath_get_d(*(r))
1201#define isl_int_get_str(r)isl_sioimath_get_str(*(r))		isl_sioimath_get_str(*(r))
1202#define isl_int_abs(r, i)isl_sioimath_abs((r), *(i))		isl_sioimath_abs((r), *(i))
1203#define isl_int_neg(r, i)isl_sioimath_neg((r), *(i))		isl_sioimath_neg((r), *(i))
1204#define isl_int_swap(i, j)isl_sioimath_swap((i), (j))		isl_sioimath_swap((i), (j))
1205#define isl_int_swap_or_set(i, j)isl_sioimath_swap((i), (j))	isl_sioimath_swap((i), (j))
1206#define isl_int_add_ui(r, i, j)isl_sioimath_add_ui((r), *(i), j)		isl_sioimath_add_ui((r), *(i), j)
1207#define isl_int_sub_ui(r, i, j)isl_sioimath_sub_ui((r), *(i), j)		isl_sioimath_sub_ui((r), *(i), j)
1208 
1209#define isl_int_add(r, i, j)isl_sioimath_add((r), *(i), *(j))		isl_sioimath_add((r), *(i), *(j))
1210#define isl_int_sub(r, i, j)isl_sioimath_sub((r), *(i), *(j))		isl_sioimath_sub((r), *(i), *(j))
1211#define isl_int_mul(r, i, j)isl_sioimath_mul((r), *(i), *(j))		isl_sioimath_mul((r), *(i), *(j))
1212#define isl_int_mul_2exp(r, i, j)isl_sioimath_mul_2exp((r), *(i), j)	isl_sioimath_mul_2exp((r), *(i), j)
1213#define isl_int_mul_si(r, i, j)isl_sioimath_mul_si((r), *(i), j)		isl_sioimath_mul_si((r), *(i), j)
1214#define isl_int_mul_ui(r, i, j)isl_sioimath_mul_ui((r), *(i), j)		isl_sioimath_mul_ui((r), *(i), j)
1215#define isl_int_pow_ui(r, i, j)isl_sioimath_pow_ui((r), *(i), j)		isl_sioimath_pow_ui((r), *(i), j)
1216#define isl_int_addmul(r, i, j)isl_sioimath_addmul((r), *(i), *(j))		isl_sioimath_addmul((r), *(i), *(j))
1217#define isl_int_addmul_ui(r, i, j)isl_sioimath_addmul_ui((r), *(i), j)	isl_sioimath_addmul_ui((r), *(i), j)
1218#define isl_int_submul(r, i, j)isl_sioimath_submul((r), *(i), *(j))		isl_sioimath_submul((r), *(i), *(j))
1219#define isl_int_submul_ui(r, i, j)isl_sioimath_submul_ui((r), *(i), j)	isl_sioimath_submul_ui((r), *(i), j)
1220 
1221#define isl_int_gcd(r, i, j)isl_sioimath_gcd((r), *(i), *(j))		isl_sioimath_gcd((r), *(i), *(j))
1222#define isl_int_lcm(r, i, j)isl_sioimath_lcm((r), *(i), *(j))		isl_sioimath_lcm((r), *(i), *(j))
1223#define isl_int_divexact(r, i, j)isl_sioimath_tdiv_q((r), *(i), *(j))	isl_sioimath_tdiv_q((r), *(i), *(j))
1224#define isl_int_divexact_ui(r, i, j)isl_sioimath_tdiv_q_ui((r), *(i), j)	isl_sioimath_tdiv_q_ui((r), *(i), j)
1225#define isl_int_tdiv_q(r, i, j)isl_sioimath_tdiv_q((r), *(i), *(j))		isl_sioimath_tdiv_q((r), *(i), *(j))
1226#define isl_int_cdiv_q(r, i, j)isl_sioimath_cdiv_q((r), *(i), *(j))		isl_sioimath_cdiv_q((r), *(i), *(j))
1227#define isl_int_cdiv_q_ui(r, i, j)isl_sioimath_cdiv_q_ui((r), *(i), j)	isl_sioimath_cdiv_q_ui((r), *(i), j)
1228#define isl_int_fdiv_q(r, i, j)isl_sioimath_fdiv_q((r), *(i), *(j))		isl_sioimath_fdiv_q((r), *(i), *(j))
1229#define isl_int_fdiv_r(r, i, j)isl_sioimath_fdiv_r((r), *(i), *(j))		isl_sioimath_fdiv_r((r), *(i), *(j))
1230#define isl_int_fdiv_q_ui(r, i, j)isl_sioimath_fdiv_q_ui((r), *(i), j)	isl_sioimath_fdiv_q_ui((r), *(i), j)
1231 
1232#define isl_int_read(r, s)isl_sioimath_read((r), s)		isl_sioimath_read((r), s)
1233#define isl_int_sgn(i)isl_sioimath_sgn(*(i))			isl_sioimath_sgn(*(i))
1234#define isl_int_cmp(i, j)isl_sioimath_cmp(*(i), *(j))		isl_sioimath_cmp(*(i), *(j))
1235#define isl_int_cmp_si(i, si)isl_sioimath_cmp_si(*(i), si)		isl_sioimath_cmp_si(*(i), si)
1236#define isl_int_eq(i, j)(isl_sioimath_cmp(*(i), *(j)) == 0)		(isl_sioimath_cmp(*(i), *(j)) == 0)
1237#define isl_int_ne(i, j)(isl_sioimath_cmp(*(i), *(j)) != 0)		(isl_sioimath_cmp(*(i), *(j)) != 0)
1238#define isl_int_lt(i, j)(isl_sioimath_cmp(*(i), *(j)) < 0)		(isl_sioimath_cmp(*(i), *(j)) < 0)
1239#define isl_int_le(i, j)(isl_sioimath_cmp(*(i), *(j)) <= 0)		(isl_sioimath_cmp(*(i), *(j)) <= 0)
1240#define isl_int_gt(i, j)(isl_sioimath_cmp(*(i), *(j)) > 0)		(isl_sioimath_cmp(*(i), *(j)) > 0)
1241#define isl_int_ge(i, j)(isl_sioimath_cmp(*(i), *(j)) >= 0)		(isl_sioimath_cmp(*(i), *(j)) >= 0)
1242#define isl_int_abs_cmp(i, j)isl_sioimath_abs_cmp(*(i), *(j))		isl_sioimath_abs_cmp(*(i), *(j))
1243#define isl_int_abs_eq(i, j)(isl_sioimath_abs_cmp(*(i), *(j)) == 0)		(isl_sioimath_abs_cmp(*(i), *(j)) == 0)
1244#define isl_int_abs_ne(i, j)(isl_sioimath_abs_cmp(*(i), *(j)) != 0)		(isl_sioimath_abs_cmp(*(i), *(j)) != 0)
1245#define isl_int_abs_lt(i, j)(isl_sioimath_abs_cmp(*(i), *(j)) < 0)		(isl_sioimath_abs_cmp(*(i), *(j)) < 0)
1246#define isl_int_abs_gt(i, j)(isl_sioimath_abs_cmp(*(i), *(j)) > 0)		(isl_sioimath_abs_cmp(*(i), *(j)) > 0)
1247#define isl_int_abs_ge(i, j)(isl_sioimath_abs_cmp(*(i), *(j)) >= 0)		(isl_sioimath_abs_cmp(*(i), *(j)) >= 0)
1248#define isl_int_is_divisible_by(i, j)isl_sioimath_is_divisible_by(*(i), *(j))	isl_sioimath_is_divisible_by(*(i), *(j))
1249 
1250#define isl_int_hash(v, h)isl_sioimath_hash(*(v), h)		isl_sioimath_hash(*(v), h)
1251#define isl_int_free_str(s)free(s)		free(s)
1252#define isl_int_print(out, i, width)isl_sioimath_print(out, *(i), width)	isl_sioimath_print(out, *(i), width)
1253 
1254#endif /* ISL_INT_SIOIMATH_H */