int
main(void)
{
int i, result;
flint_rand_t state;
flint_randinit(state);
printf("bit_pack/bit_unpack....");
fflush(stdout);
/* Check aliasing of a and c */
for (i = 0; i < 10000; i++)
{
nmod_poly_t a, b;
mp_limb_t n;
ulong bits;
mp_ptr mpn;
do
{
n = n_randtest_not_zero(state);
} while (n == 1);
bits = 2 * FLINT_BIT_COUNT(n) + n_randint(state, FLINT_BITS);
nmod_poly_init(a, n);
nmod_poly_init(b, n);
do
{
nmod_poly_randtest(a, state, n_randint(state, 100));
} while (a->length == 0);
mpn =
malloc(sizeof(mp_limb_t) *
((bits * a->length - 1) / FLINT_BITS + 1));
_nmod_poly_bit_pack(mpn, a->coeffs, a->length, bits);
nmod_poly_fit_length(b, a->length);
_nmod_poly_bit_unpack(b->coeffs, a->length, mpn, bits, a->mod);
b->length = a->length;
result = (nmod_poly_equal(a, b));
if (!result)
{
printf("FAIL:\n");
nmod_poly_print(a), printf("\n\n");
nmod_poly_print(b), printf("\n\n");
abort();
}
nmod_poly_clear(a);
nmod_poly_clear(b);
}
flint_randclear(state);
printf("PASS\n");
return 0;
}
void
_nmod_poly_mul_KS(mp_ptr out, mp_srcptr in1, long len1,
mp_srcptr in2, long len2, mp_bitcnt_t bits, nmod_t mod)
{
long len_out = len1 + len2 - 1, limbs1, limbs2;
mp_ptr mpn1, mpn2, res;
if (bits == 0)
{
mp_bitcnt_t bits1, bits2, loglen;
bits1 = _nmod_vec_max_bits(in1, len1);
bits2 = (in1 == in2) ? bits1 : _nmod_vec_max_bits(in2, len2);
loglen = FLINT_BIT_COUNT(len2);
bits = bits1 + bits2 + loglen;
}
limbs1 = (len1 * bits - 1) / FLINT_BITS + 1;
limbs2 = (len2 * bits - 1) / FLINT_BITS + 1;
mpn1 = (mp_ptr) malloc(sizeof(mp_limb_t) * limbs1);
mpn2 = (in1 == in2) ? mpn1 : (mp_ptr) malloc(sizeof(mp_limb_t) * limbs2);
_nmod_poly_bit_pack(mpn1, in1, len1, bits);
if (in1 != in2)
_nmod_poly_bit_pack(mpn2, in2, len2, bits);
res = (mp_ptr) malloc(sizeof(mp_limb_t) * (limbs1 + limbs2));
if (in1 != in2)
mpn_mul(res, mpn1, limbs1, mpn2, limbs2);
else
mpn_mul_n(res, mpn1, mpn1, limbs1);
_nmod_poly_bit_unpack(out, len_out, res, bits, mod);
free(mpn2);
if (in1 != in2)
free(mpn1);
free(res);
}
int
main(void)
{
int i, result;
flint_rand_t state;
flint_randinit(state);
printf("bit_pack/bit_unpack....");
fflush(stdout);
/* Check aliasing of a and c */
for (i = 0; i < 10000; i++)
{
nmod_poly_t a, b;
mp_limb_t n;
ulong bits;
mp_ptr mpn;
do
{
n = n_randtest_not_zero(state);
} while (n == 1);
bits = 2 * FLINT_BIT_COUNT(n) + n_randint(state, FLINT_BITS);
nmod_poly_init(a, n);
nmod_poly_init(b, n);
do
{
nmod_poly_randtest(a, state, n_randint(state, 100));
} while (a->length == 0);
mpn =
flint_malloc(sizeof(mp_limb_t) *
((bits * a->length - 1) / FLINT_BITS + 1));
_nmod_poly_bit_pack(mpn, a->coeffs, a->length, bits);
nmod_poly_fit_length(b, a->length);
_nmod_poly_bit_unpack(b->coeffs, a->length, mpn, bits, a->mod);
b->length = a->length;
result = (nmod_poly_equal(a, b));
if (!result)
{
printf("FAIL:\n");
nmod_poly_print(a), printf("\n\n");
nmod_poly_print(b), printf("\n\n");
abort();
}
nmod_poly_clear(a);
nmod_poly_clear(b);
flint_free(mpn);
}
for (i = 0; i < 20000; i++)
{
fmpz_t f;
nmod_poly_t A, B;
long b;
mp_limb_t n;
do
{
n = n_randtest_not_zero(state);
} while (n == 1);
fmpz_init(f);
nmod_poly_init(A, n);
nmod_poly_init(B, n);
nmod_poly_randtest(A, state, 1+n_randint(state,100));
b = FLINT_BIT_COUNT(n) + n_randint(state, FLINT_BITS);
nmod_poly_bit_pack(f, A, b);
nmod_poly_bit_unpack(B, f, b);
if (!nmod_poly_equal(A, B))
{
mpz_t zz;
printf("FAIL:\n");
printf("INPUT: ");
nmod_poly_print(A);
printf("\n");
mpz_init(zz); fmpz_get_mpz(zz, f);
printf("PACKED: ");
mpz_out_str(stdout, 2, zz);
printf("\n");
printf("OUTPUT: ");
nmod_poly_print(B);
printf("\n\n");
abort();
}
fmpz_clear(f);
nmod_poly_clear(A);
nmod_poly_clear(B);
}
flint_randclear(state);
_fmpz_cleanup();
printf("PASS\n");
return 0;
}