/*
Copyright (C) 2017-2019 Daniel Schultz
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 .
*/
#include
#include
#include "fmpz_mpoly.h"
int
main(void)
{
slong i, j, result, max_threads = 5;
slong tmul = 10;
FLINT_TEST_INIT(state);
#ifdef _WIN32
tmul = 2;
#endif
flint_printf("mul_heap_threaded....");
fflush(stdout);
{
fmpz_mpoly_ctx_t ctx;
fmpz_mpoly_t f, g, h1, h2;
const char * vars[] = {"x", "y" ,"z", "t", "u"};
fmpz_mpoly_ctx_init(ctx, 5, ORD_LEX);
fmpz_mpoly_init(f, ctx);
fmpz_mpoly_init(g, ctx);
fmpz_mpoly_init(h1, ctx);
fmpz_mpoly_init(h2, ctx);
fmpz_mpoly_set_str_pretty(f, "(1+x+y+2*z^2+3*t^3+5*u^5)^5", vars, ctx);
fmpz_mpoly_set_str_pretty(g, "(1+u+t+2*z^2+3*y^3+5*x^5)^5", vars, ctx);
flint_set_num_threads(1);
fmpz_mpoly_mul_heap_threaded(h1, f, g, ctx);
flint_set_num_threads(2);
fmpz_mpoly_mul_heap_threaded(h2, f, g, ctx);
if (!fmpz_mpoly_equal(h1, h2, ctx))
{
printf("FAIL\n");
flint_printf("Check example\n");
flint_abort();
}
fmpz_mpoly_clear(f, ctx);
fmpz_mpoly_clear(g, ctx);
fmpz_mpoly_clear(h1, ctx);
fmpz_mpoly_clear(h2, ctx);
fmpz_mpoly_ctx_clear(ctx);
}
/* Check mul_heap_threaded matches mul_johnson */
for (i = 0; i < tmul * flint_test_multiplier(); i++)
{
fmpz_mpoly_ctx_t ctx;
fmpz_mpoly_t f, g, h, k;
slong len, len1, len2;
flint_bitcnt_t coeff_bits, exp_bits, exp_bits1, exp_bits2;
fmpz_mpoly_ctx_init_rand(ctx, state, 10);
fmpz_mpoly_init(f, ctx);
fmpz_mpoly_init(g, ctx);
fmpz_mpoly_init(h, ctx);
fmpz_mpoly_init(k, ctx);
len = n_randint(state, 200);
len1 = n_randint(state, 200);
len2 = n_randint(state, 200);
exp_bits = n_randint(state, 200) + 2;
exp_bits1 = n_randint(state, 200) + 2;
exp_bits2 = n_randint(state, 200) + 2;
coeff_bits = n_randint(state, 200);
for (j = 0; j < 4; j++)
{
fmpz_mpoly_randtest_bits(f, state, len1, coeff_bits, exp_bits1, ctx);
fmpz_mpoly_randtest_bits(g, state, len2, coeff_bits, exp_bits2, ctx);
fmpz_mpoly_randtest_bits(h, state, len, coeff_bits, exp_bits, ctx);
fmpz_mpoly_randtest_bits(k, state, len, coeff_bits, exp_bits, ctx);
flint_set_num_threads(n_randint(state, max_threads) + 1);
fmpz_mpoly_mul_johnson(h, f, g, ctx);
fmpz_mpoly_assert_canonical(h, ctx);
fmpz_mpoly_mul_heap_threaded(k, f, g, ctx);
fmpz_mpoly_assert_canonical(k, ctx);
result = fmpz_mpoly_equal(h, k, ctx);
if (!result)
{
printf("FAIL\n");
flint_printf("Check mul_heap_threaded matches mul_johnson\ni = %wd, j = %wd\n", i ,j);
flint_abort();
}
}
fmpz_mpoly_clear(f, ctx);
fmpz_mpoly_clear(g, ctx);
fmpz_mpoly_clear(h, ctx);
fmpz_mpoly_clear(k, ctx);
fmpz_mpoly_ctx_clear(ctx);
}
/* aliasing first input */
for (i = 0; i < tmul * flint_test_multiplier(); i++)
{
fmpz_mpoly_ctx_t ctx;
fmpz_mpoly_t f, g, h;
slong len, len1, len2;
flint_bitcnt_t coeff_bits, exp_bits, exp_bits1, exp_bits2;
fmpz_mpoly_ctx_init_rand(ctx, state, 10);
fmpz_mpoly_init(f, ctx);
fmpz_mpoly_init(g, ctx);
fmpz_mpoly_init(h, ctx);
len = n_randint(state, 100);
len1 = n_randint(state, 100);
len2 = n_randint(state, 100);
exp_bits = n_randint(state, 200) + 2;
exp_bits1 = n_randint(state, 200) + 2;
exp_bits2 = n_randint(state, 200) + 2;
coeff_bits = n_randint(state, 200);
for (j = 0; j < 4; j++)
{
fmpz_mpoly_randtest_bits(f, state, len1, coeff_bits, exp_bits1, ctx);
fmpz_mpoly_randtest_bits(g, state, len2, coeff_bits, exp_bits2, ctx);
fmpz_mpoly_randtest_bits(h, state, len, coeff_bits, exp_bits, ctx);
flint_set_num_threads(n_randint(state, max_threads) + 1);
fmpz_mpoly_mul_johnson(h, f, g, ctx);
fmpz_mpoly_assert_canonical(h, ctx);
fmpz_mpoly_mul_heap_threaded(f, f, g, ctx);
fmpz_mpoly_assert_canonical(f, ctx);
result = fmpz_mpoly_equal(h, f, ctx);
if (!result)
{
printf("FAIL\n");
flint_printf("Check aliasing first input\ni = %wd, j = %wd\n", i ,j);
flint_abort();
}
}
fmpz_mpoly_clear(f, ctx);
fmpz_mpoly_clear(g, ctx);
fmpz_mpoly_clear(h, ctx);
fmpz_mpoly_ctx_clear(ctx);
}
/* aliasing second input */
for (i = 0; i < tmul * flint_test_multiplier(); i++)
{
fmpz_mpoly_ctx_t ctx;
fmpz_mpoly_t f, g, h;
slong len, len1, len2;
flint_bitcnt_t coeff_bits, exp_bits, exp_bits1, exp_bits2;
fmpz_mpoly_ctx_init_rand(ctx, state, 10);
fmpz_mpoly_init(f, ctx);
fmpz_mpoly_init(g, ctx);
fmpz_mpoly_init(h, ctx);
len = n_randint(state, 100);
len1 = n_randint(state, 100);
len2 = n_randint(state, 100);
exp_bits = n_randint(state, 200) + 2;
exp_bits1 = n_randint(state, 200) + 2;
exp_bits2 = n_randint(state, 200) + 2;
coeff_bits = n_randint(state, 200);
for (j = 0; j < 4; j++)
{
fmpz_mpoly_randtest_bits(f, state, len1, coeff_bits, exp_bits1, ctx);
fmpz_mpoly_randtest_bits(g, state, len2, coeff_bits, exp_bits2, ctx);
fmpz_mpoly_randtest_bits(h, state, len, coeff_bits, exp_bits, ctx);
flint_set_num_threads(n_randint(state, max_threads) + 1);
fmpz_mpoly_mul_johnson(h, f, g, ctx);
fmpz_mpoly_assert_canonical(h, ctx);
fmpz_mpoly_mul_heap_threaded(g, f, g, ctx);
fmpz_mpoly_assert_canonical(g, ctx);
result = fmpz_mpoly_equal(h, g, ctx);
if (!result)
{
printf("FAIL\n");
flint_printf("Check aliasing second input\ni = %wd, j = %wd\n", i ,j);
flint_abort();
}
}
fmpz_mpoly_clear(f, ctx);
fmpz_mpoly_clear(g, ctx);
fmpz_mpoly_clear(h, ctx);
fmpz_mpoly_ctx_clear(ctx);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}