129 lines
3.0 KiB
C
129 lines
3.0 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 2010 William Hart
|
|
|
|
******************************************************************************/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include "profiler.h"
|
|
#include "flint.h"
|
|
#include "ulong_extras.h"
|
|
#include "nmod_vec.h"
|
|
|
|
typedef struct
|
|
{
|
|
mp_bitcnt_t bits;
|
|
int type;
|
|
} info_t;
|
|
|
|
void sample(void * arg, ulong count)
|
|
{
|
|
mp_limb_t n, r = 0;
|
|
nmod_t mod;
|
|
info_t * info = (info_t *) arg;
|
|
mp_bitcnt_t bits = info->bits;
|
|
int type = info->type;
|
|
mp_size_t j;
|
|
slong i;
|
|
FLINT_TEST_INIT(state);
|
|
|
|
|
|
n = n_randbits(state, bits);
|
|
if (n == UWORD(0)) n++;
|
|
|
|
nmod_init(&mod, n);
|
|
|
|
mp_ptr vec1 = _nmod_vec_init(1000);
|
|
mp_ptr vec2 = _nmod_vec_init(1000);
|
|
mp_ptr res = _nmod_vec_init(1000);
|
|
|
|
for (j = 0; j < 1000; j++)
|
|
vec1[j] = n_randint(state, n);
|
|
|
|
for (j = 0; j < 1000; j++)
|
|
vec2[j] = n_randint(state, n);
|
|
|
|
switch (type)
|
|
{
|
|
case 1:
|
|
prof_start();
|
|
for (i = 0; i < count; i++)
|
|
{
|
|
_nmod_vec_add(res, vec1, vec2, 1000, mod);
|
|
}
|
|
prof_stop();
|
|
break;
|
|
|
|
case 2:
|
|
prof_start();
|
|
for (i = 0; i < count; i++)
|
|
{
|
|
_nmod_vec_sub(res, vec1, vec2, 1000, mod);
|
|
}
|
|
prof_stop();
|
|
break;
|
|
|
|
case 3:
|
|
prof_start();
|
|
for (i = 0; i < count; i++)
|
|
{
|
|
_nmod_vec_neg(res, vec1, 1000, mod);
|
|
}
|
|
prof_stop();
|
|
break;
|
|
}
|
|
|
|
flint_randclear(state);
|
|
_nmod_vec_clear(vec1);
|
|
_nmod_vec_clear(vec2);
|
|
}
|
|
|
|
int main(void)
|
|
{
|
|
double min1, min2, min3, max;
|
|
info_t info;
|
|
mp_bitcnt_t i;
|
|
|
|
for (i = 2; i <= FLINT_BITS; i++)
|
|
{
|
|
info.bits = i;
|
|
|
|
info.type = 1;
|
|
prof_repeat(&min1, &max, sample, (void *) &info);
|
|
|
|
info.type = 2;
|
|
prof_repeat(&min2, &max, sample, (void *) &info);
|
|
|
|
info.type = 3;
|
|
prof_repeat(&min3, &max, sample, (void *) &info);
|
|
|
|
flint_printf("bits %wd, add = %.1lf c/l, sub = %.1lf c/l, neg = %.1lf c/l\n",
|
|
i, (min1/(double)FLINT_CLOCK_SCALE_FACTOR)/1000,
|
|
(min2/(double)FLINT_CLOCK_SCALE_FACTOR)/1000,
|
|
(min3/(double)FLINT_CLOCK_SCALE_FACTOR)/1000
|
|
);
|
|
}
|
|
|
|
return 0;
|
|
}
|