/*
Copyright (C) 2010 Fredrik Johansson
This file is part of FLINT.
FLINT is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License (LGPL) as published
by the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version. See .
*/
#ifndef MPN_EXTRAS_H
#define MPN_EXTRAS_H
#ifdef MPN_EXTRAS_INLINES_C
#define MPN_EXTRAS_INLINE FLINT_DLL
#else
#define MPN_EXTRAS_INLINE static __inline__
#endif
#include
#include "flint.h"
#include "fmpz.h"
#include "fmpz_poly.h"
#ifdef __cplusplus
extern "C" {
#endif
#define MPN_NORM(a, an) \
do { \
while ((an) != 0 && (a)[(an) - 1] == 0) \
(an)--; \
} while (0)
#define MPN_SWAP(a, an, b, bn) \
do { \
mp_ptr __t; \
mp_size_t __tn; \
__t = (a); \
(a) = (b); \
(b) = __t; \
__tn = (an); \
(an) = (bn); \
(bn) = __tn; \
} while (0)
#define BITS_TO_LIMBS(b) (((b) + GMP_NUMB_BITS - 1) / GMP_NUMB_BITS)
/*
return the high limb of a two limb left shift by n < GMP_LIMB_BITS bits.
Note: if GMP_NAIL_BITS != 0, the rest of flint is already broken anyways.
*/
#define MPN_LEFT_SHIFT_HI(hi, lo, n) \
((n) > 0 ? (((hi) << (n)) | ((lo) >> (GMP_LIMB_BITS - (n)))) \
: (hi))
#define MPN_RIGHT_SHIFT_LOW(hi, lo, n) \
((n) > 0 ? (((lo) >> (n)) | ((hi) << (GMP_LIMB_BITS - (n)))) \
: (lo))
/* Not defined in gmp.h
mp_limb_t __gmpn_modexact_1_odd(mp_srcptr src, mp_size_t size,
mp_limb_t divisor);
#define mpn_modexact_1_odd __gmpn_modexact_1_odd
*/
#ifdef mpn_modexact_1_odd
#define flint_mpn_divisible_1_p(x, xsize, d) (mpn_modexact_1_odd(x, xsize, d) == 0)
#else
MPN_EXTRAS_INLINE int
flint_mpn_divisible_1_p(mp_srcptr x, mp_size_t xsize, mp_limb_t d)
{
__mpz_struct s;
s._mp_size = xsize;
s._mp_d = (mp_ptr) x;
return flint_mpz_divisible_ui_p(&s, d);
}
#endif
MPN_EXTRAS_INLINE
int flint_mpn_zero_p(mp_srcptr x, mp_size_t xsize)
{
slong i;
for (i = 0; i < xsize; i++)
{
if (x[i])
return 0;
}
return 1;
}
MPN_EXTRAS_INLINE
mp_size_t flint_mpn_divexact_1(mp_ptr x, mp_size_t xsize, mp_limb_t d)
{
mpn_divrem_1(x, 0, x, xsize, d);
if (x[xsize - 1] == UWORD(0))
xsize -= 1;
return xsize;
}
FLINT_DLL void flint_mpn_debug(mp_srcptr x, mp_size_t xsize);
FLINT_DLL mp_size_t flint_mpn_remove_2exp(mp_ptr x, mp_size_t xsize,
flint_bitcnt_t *bits);
FLINT_DLL mp_size_t flint_mpn_remove_power_ascending(mp_ptr x,
mp_size_t xsize, mp_ptr p, mp_size_t psize, ulong *exp);
FLINT_DLL int flint_mpn_factor_trial(mp_srcptr x, mp_size_t xsize,
slong start, slong stop);
FLINT_DLL int flint_mpn_factor_trial_tree(slong * factors,
mp_srcptr x, mp_size_t xsize, slong num_primes);
FLINT_DLL mp_size_t flint_mpn_fmms1(mp_ptr y, mp_limb_t a1, mp_srcptr x1,
mp_limb_t a2, mp_srcptr x2, mp_size_t n);
FLINT_DLL int flint_mpn_divides(mp_ptr q, mp_srcptr array1,
mp_size_t limbs1, mp_srcptr arrayg, mp_size_t limbsg, mp_ptr temp);
FLINT_DLL mp_size_t flint_mpn_gcd_full2(mp_ptr arrayg,
mp_srcptr array1, mp_size_t limbs1,
mp_srcptr array2, mp_size_t limbs2, mp_ptr temp);
FLINT_DLL mp_size_t flint_mpn_gcd_full(mp_ptr arrayg,
mp_srcptr array1, mp_size_t limbs1, mp_srcptr array2, mp_size_t limbs2);
FLINT_DLL mp_limb_t flint_mpn_preinv1(mp_limb_t d, mp_limb_t d2);
FLINT_DLL mp_limb_t flint_mpn_divrem_preinv1(mp_ptr q, mp_ptr a,
mp_size_t m, mp_srcptr b, mp_size_t n, mp_limb_t dinv);
#define flint_mpn_divrem21_preinv(q, a_hi, a_lo, dinv) \
do { \
mp_limb_t __q2, __q3, __q4; \
umul_ppmm((q), __q2, (a_hi), (dinv)); \
umul_ppmm(__q3, __q4, (a_lo), (dinv)); \
add_ssaaaa((q), __q2, (q), __q2, 0, __q3); \
add_ssaaaa((q), __q2, (q), __q2, (a_hi), (a_lo)); \
} while (0)
FLINT_DLL void flint_mpn_mulmod_preinv1(mp_ptr r,
mp_srcptr a, mp_srcptr b, mp_size_t n,
mp_srcptr d, mp_limb_t dinv, ulong norm);
FLINT_DLL void flint_mpn_preinvn(mp_ptr dinv, mp_srcptr d, mp_size_t n);
FLINT_DLL void flint_mpn_mod_preinvn(mp_ptr r, mp_srcptr a, mp_size_t m,
mp_srcptr d, mp_size_t n, mp_srcptr dinv);
FLINT_DLL mp_limb_t flint_mpn_divrem_preinvn(mp_ptr q, mp_ptr r, mp_srcptr a, mp_size_t m,
mp_srcptr d, mp_size_t n, mp_srcptr dinv);
FLINT_DLL void flint_mpn_mulmod_preinvn(mp_ptr r,
mp_srcptr a, mp_srcptr b, mp_size_t n,
mp_srcptr d, mp_srcptr dinv, ulong norm);
FLINT_DLL int flint_mpn_mulmod_2expp1_basecase(mp_ptr xp, mp_srcptr yp, mp_srcptr zp,
int c, flint_bitcnt_t b, mp_ptr tp);
MPN_EXTRAS_INLINE
void flint_mpn_rrandom(mp_limb_t *rp, gmp_randstate_t state, mp_size_t n)
{
__mpz_struct str;
str._mp_d = rp;
str._mp_alloc = n;
str._mp_size =n;
mpz_rrandomb(&str,state,FLINT_BITS*n);
}
MPN_EXTRAS_INLINE
void flint_mpn_urandomb(mp_limb_t *rp, gmp_randstate_t state, flint_bitcnt_t n)
{
__mpz_struct str;
str._mp_d = rp;
str._mp_alloc = (n + FLINT_BITS - 1)/FLINT_BITS;
str._mp_size = (n + FLINT_BITS - 1)/FLINT_BITS;
mpz_rrandomb(&str,state,n);
}
/******************************************************************************
Divisions where the quotient is expected to be small. All function do:
input: n > d > 0
output: q = n/d, r = n%d
for various small sizes of n and d.
Not in a function because compiler refuses to inline eudiv_qrrnndd.
Each macro takes a prefix t for its local vars.
******************************************************************************/
#define eudiv_qrnd(q, r, n, d, t) \
do { \
mp_limb_t t##q, t##a = n, t##b = d; \
\
FLINT_ASSERT(t##a > t##b); \
FLINT_ASSERT(t##b > 0); \
\
t##a -= t##b; \
for (t##q = 1; t##q < 5; t##q++) \
{ \
if (t##a < t##b) \
goto t##quotient_found; \
t##a -= t##b; \
} \
t##q += t##a / t##b; \
t##a = t##a % t##b; \
\
t##quotient_found: \
\
q = t##q; \
r = t##a; \
} while (0)
#define eudiv_qqrnnd(q1, q0, r0, n1, n0, d0, t) \
do { \
mp_limb_t t##a1 = n1, t##a0 = n0, t##b0 = d0; \
mp_limb_t t##q1, t##q0, t##r0, t##u; \
\
FLINT_ASSERT(t##a1 > 0 || t##a0 > t##b0); \
\
udiv_qrnnd(t##q1, t##u, 0, t##a1, t##b0); \
udiv_qrnnd(t##q0, t##r0, t##u, t##a0, t##b0); \
\
q1 = t##q1; \
q0 = t##q0; \
r0 = t##r0; \
} while (0)
/* d must be normalized, i.e. d1 != 0 */
#define eudiv_qrrnndd(q0, r1, r0, n1, n0, d1, d0, t) \
do { \
int t##i; \
mp_limb_t t##a1 = n1, t##a0 = n0, t##b1 = d1, t##b0 = d0; \
mp_limb_t t##r1, t##r0, t##u2, t##u1, t##u0, t##q, t##v1, t##v0; \
\
FLINT_ASSERT(t##a1 != 0); \
FLINT_ASSERT(t##b1 != 0); \
FLINT_ASSERT(t##b1 < t##a1 || (t##b1 == t##a1 && t##b0 < t##a0)); \
\
t##q = 1; \
\
sub_ddmmss(t##r1,t##r0, t##a1,t##a0, t##b1,t##b0); \
\
t##subtract: \
\
for (t##i = 2; t##i <= 4; t##i++) \
{ \
sub_dddmmmsss(t##u2,t##u1,t##u0, 0,t##r1,t##r0, 0,t##b1,t##b0); \
if (t##u2 != 0) \
goto t##quotient_found; \
t##q += 1; \
t##r0 = t##u0; \
t##r1 = t##u1; \
} \
\
if (t##r1 != 0) \
{ \
int t##ncnt, t##dcnt; \
mp_limb_t t##qq = 0; \
\
count_leading_zeros(t##ncnt, t##r1); \
count_leading_zeros(t##dcnt, t##b1); \
t##dcnt -= t##ncnt; \
if (t##dcnt <= 0) \
goto t##subtract; \
\
t##v1 = (t##b1 << t##dcnt) | (t##b0 >> (FLINT_BITS - t##dcnt)); \
t##v0 = t##b0 << t##dcnt; \
\
do { \
sub_dddmmmsss(t##u2,t##u1,t##u0, 0,t##r1,t##r0, 0,t##v1,t##v0); \
t##qq = 2*t##qq + 1 + t##u2; \
t##r1 = t##u2 ? t##r1 : t##u1; \
t##r0 = t##u2 ? t##r0 : t##u0; \
t##v0 = (t##v1 << (FLINT_BITS - 1)) | (t##v0 >> 1); \
t##v1 = t##v1 >> 1; \
t##dcnt--; \
} while (t##dcnt >= 0); \
\
t##q += t##qq; \
} \
\
t##quotient_found: \
\
FLINT_ASSERT(t##r1 < t##b1 || (t##r1 == t##b1 && t##r0 < t##b0)); \
\
q0 = t##q; \
r0 = t##r0; \
r1 = t##r1; \
} while (0)
#ifdef __cplusplus
}
#endif
#endif