mirror of
https://github.com/vale981/arb
synced 2025-03-06 01:41:39 -05:00
132 lines
3.6 KiB
C
132 lines
3.6 KiB
C
/*=============================================================================
|
||
|
||
This file is part of ARB.
|
||
|
||
ARB 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.
|
||
|
||
ARB 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 ARB; if not, write to the Free Software
|
||
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||
|
||
=============================================================================*/
|
||
/******************************************************************************
|
||
|
||
Copyright (C) 2016 Pascal Molin
|
||
|
||
******************************************************************************/
|
||
|
||
#include "dlog.h"
|
||
#include "profiler.h"
|
||
|
||
#define NPRIMES 640
|
||
#define LOG 0
|
||
#define CSV 1
|
||
#define JSON 2
|
||
#define OUT JSON
|
||
|
||
|
||
typedef void (*vec_f) (ulong *v, ulong nv, ulong a, ulong va, const nmod_t mod, ulong na, const nmod_t order);
|
||
|
||
void
|
||
f_empty(ulong *v, ulong nv, ulong a, ulong va, const nmod_t mod, ulong na, const nmod_t order)
|
||
{
|
||
return;
|
||
}
|
||
|
||
int main()
|
||
{
|
||
int i, ni = 8;
|
||
int bits[9] = { 10, 15, 20, 25, 30, 35, 40, 45, 50 };
|
||
|
||
int j, nj = 6;
|
||
ulong * v;
|
||
ulong nv[6] = { 50, 200, 1000, 2000, 10000, 30000 };
|
||
|
||
int k, np = NPRIMES;
|
||
nmod_t * p;
|
||
ulong * a;
|
||
|
||
int l, nf = 5;
|
||
vec_f func[5] = { f_empty, dlog_vec_loop, dlog_vec_eratos, dlog_vec_sieve, dlog_vec_crt };
|
||
char * n[5] = { "empty", "loop", "eratos", "sieve", "crt" };
|
||
|
||
flint_rand_t state;
|
||
nmod_t order;
|
||
|
||
nmod_init(&order, 100);
|
||
p = flint_malloc(np * sizeof(nmod_t));
|
||
a = flint_malloc(np * sizeof(ulong));
|
||
|
||
flint_randinit(state);
|
||
|
||
for (i = 0; i < ni; i++)
|
||
{
|
||
for (k = 0; k < np; k++)
|
||
{
|
||
nmod_init(&p[k], n_randprime(state, bits[i], 0));
|
||
a[k] = n_primitive_root_prime(p[k].n);
|
||
}
|
||
|
||
for (j = 0; j < nj; j++)
|
||
{
|
||
|
||
v = flint_malloc(nv[j] * sizeof(ulong));
|
||
|
||
#if OUT == LOG
|
||
flint_printf("log(1..%wu) mod %d primes of size %d bits....\n", nv[j], np, bits[i]);
|
||
fflush(stdout);
|
||
#endif
|
||
|
||
for (l = 0; l < nf; l++)
|
||
{
|
||
if (l == 1 && i > 2)
|
||
continue;
|
||
if (l == 2 && i > 5)
|
||
continue;
|
||
|
||
#if OUT == LOG
|
||
flint_printf("%-20s... ",n[l]);
|
||
fflush(stdout);
|
||
#elif OUT == CSV
|
||
flint_printf("%-8s, %2d, %4d, %3d, ",n[l],bits[i],nv[j],np);
|
||
#elif OUT == JSON
|
||
flint_printf("{ \"name\": \"%s\", \"bits\": %d, \"nv\": %d, \"nprimes\": %d, \"time\": ",
|
||
n[l],bits[i],nv[j],np);
|
||
#endif
|
||
|
||
TIMEIT_ONCE_START
|
||
for (k = 0; k < np; k++)
|
||
{
|
||
int kk;
|
||
for (kk=0; kk < nv[j]; kk++)
|
||
v[kk] = 0;
|
||
(func[l])(v, nv[j], a[k], 1, p[k], p[k].n - 1, order);
|
||
}
|
||
TIMEIT_ONCE_STOP
|
||
|
||
#if OUT == JSON
|
||
flint_printf("}\n");
|
||
#else
|
||
flint_printf("\n");
|
||
#endif
|
||
}
|
||
flint_free(v);
|
||
}
|
||
np /= 2;
|
||
}
|
||
|
||
flint_free(p);
|
||
flint_free(a);
|
||
flint_randclear(state);
|
||
flint_cleanup();
|
||
flint_printf("PASS\n");
|
||
return EXIT_SUCCESS;
|
||
}
|