132 lines
3.8 KiB
C
132 lines
3.8 KiB
C
/*=============================================================================
|
|
|
|
This file is part of FLINT.
|
|
|
|
FLINT is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
FLINT is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with FLINT; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
=============================================================================*/
|
|
/******************************************************************************
|
|
|
|
Copyright (C) 2009, 2011 William Hart
|
|
Copyright (C) 2010 Sebastian Pancratz
|
|
|
|
******************************************************************************/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <gmp.h>
|
|
#include "flint.h"
|
|
#include "fmpz.h"
|
|
#include "fft.h"
|
|
#include "fmpz_vec.h"
|
|
#include "ulong_extras.h"
|
|
|
|
int
|
|
main(void)
|
|
{
|
|
int i, result;
|
|
FLINT_TEST_INIT(state);
|
|
|
|
flint_printf("get/set_fft....");
|
|
fflush(stdout);
|
|
|
|
|
|
|
|
/* convert back and forth and compare */
|
|
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
|
|
{
|
|
fmpz * a, * b;
|
|
mp_bitcnt_t bits;
|
|
slong len, limbs;
|
|
mp_limb_t ** ii, * ptr;
|
|
slong i, bt;
|
|
|
|
bits = n_randint(state, 300) + 1;
|
|
len = n_randint(state, 300) + 1;
|
|
limbs = 2*((bits - 1)/FLINT_BITS + 1);
|
|
|
|
ii = flint_malloc((len + len*(limbs + 1))*sizeof(mp_limb_t));
|
|
ptr = (mp_limb_t *) ii + len;
|
|
for (i = 0; i < len; i++, ptr += (limbs + 1))
|
|
ii[i] = ptr;
|
|
|
|
a = _fmpz_vec_init(len);
|
|
b = _fmpz_vec_init(len);
|
|
_fmpz_vec_randtest(a, state, len, bits);
|
|
|
|
bt = _fmpz_vec_get_fft(ii, a, limbs, len);
|
|
for (i = 0; i < len; i++)
|
|
mpn_normmod_2expp1(ii[i], limbs);
|
|
_fmpz_vec_set_fft(b, len, ii, limbs, bt < 0);
|
|
|
|
result = (_fmpz_vec_equal(a, b, len));
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL:\n");
|
|
_fmpz_vec_print(a, len), flint_printf("\n\n");
|
|
_fmpz_vec_print(b, len), flint_printf("\n\n");
|
|
abort();
|
|
}
|
|
|
|
flint_free(ii);
|
|
_fmpz_vec_clear(a, len);
|
|
_fmpz_vec_clear(b, len);
|
|
}
|
|
|
|
/* convert back and forth unsigned and compare */
|
|
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
|
|
{
|
|
fmpz * a, * b;
|
|
mp_bitcnt_t bits;
|
|
slong len, limbs;
|
|
mp_limb_t ** ii, * ptr;
|
|
slong i, bt;
|
|
|
|
bits = n_randint(state, 300) + 1;
|
|
len = n_randint(state, 300) + 1;
|
|
limbs = 2*((bits - 1)/FLINT_BITS + 1);
|
|
|
|
ii = flint_malloc((len + len*(limbs + 1))*sizeof(mp_limb_t));
|
|
ptr = (mp_limb_t *) ii + len;
|
|
for (i = 0; i < len; i++, ptr += (limbs + 1))
|
|
ii[i] = ptr;
|
|
|
|
a = _fmpz_vec_init(len);
|
|
b = _fmpz_vec_init(len);
|
|
_fmpz_vec_randtest_unsigned(a, state, len, bits);
|
|
|
|
bt = _fmpz_vec_get_fft(ii, a, limbs, len);
|
|
_fmpz_vec_set_fft(b, len, ii, limbs, bt < 0);
|
|
|
|
result = (_fmpz_vec_equal(a, b, len));
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL:\n");
|
|
_fmpz_vec_print(a, len), flint_printf("\n\n");
|
|
_fmpz_vec_print(b, len), flint_printf("\n\n");
|
|
abort();
|
|
}
|
|
|
|
flint_free(ii);
|
|
_fmpz_vec_clear(a, len);
|
|
_fmpz_vec_clear(b, len);
|
|
}
|
|
|
|
FLINT_TEST_CLEANUP(state);
|
|
|
|
flint_printf("PASS\n");
|
|
return 0;
|
|
}
|