#include "test_helpers.h"
#include "radix.h"
TEST_FUNCTION_START(radix_mulmid_classical, state)
{
slong iter;
for (iter = 0; iter < 10000 * flint_test_multiplier(); iter++)
{
radix_t radix;
nn_ptr a, b, c, d;
slong an, bn, lo, hi;
int squaring;
radix_init_randtest(radix, state);
an = 1 + n_randint(state, 30);
bn = 1 + n_randint(state, 30);
squaring = n_randint(state, 2);
if (squaring)
an = bn;
lo = n_randint(state, an + bn);
hi = lo + 1 + n_randint(state, an + bn - lo);
a = flint_malloc(an * sizeof(ulong));
b = flint_malloc(bn * sizeof(ulong));
c = flint_malloc((hi - lo) * sizeof(ulong));
d = flint_malloc((hi - lo) * sizeof(ulong));
radix_randtest_limbs(a, state, an, radix);
radix_randtest_limbs(b, state, bn, radix);
radix_randtest_limbs(c, state, hi - lo, radix);
radix_randtest_limbs(d, state, hi - lo, radix);
if (squaring)
{
radix_mulmid_classical(c, a, an, a, an, lo, hi, radix);
radix_mulmid_naive(d, a, an, a, an, lo, hi, radix);
}
else
{
radix_mulmid_classical(c, a, an, b, bn, lo, hi, radix);
radix_mulmid_naive(d, a, an, b, bn, lo, hi, radix);
}
if (mpn_cmp(c, d, hi - lo) != 0)
{
flint_printf("FAIL: mul\n");
flint_printf("an = %wd, bn = %wd, lo = %wd, hi = %wd, squaring = %d\n", an, bn, lo, hi, squaring);
flint_printf("%{ulong*}\n", a, an);
flint_printf("%{ulong*}\n", b, bn);
flint_printf("%{ulong*}\n", c, hi - lo);
flint_printf("%{ulong*}\n", d, hi - lo);
flint_abort();
}
radix_clear(radix);
flint_free(a);
flint_free(b);
flint_free(c);
flint_free(d);
}
TEST_FUNCTION_END(state);
}