82 lines
2.2 KiB
C
82 lines
2.2 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 2009 William Hart
|
||
|
|
|
||
|
|
******************************************************************************/
|
||
|
|
|
||
|
|
#include <stdio.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <gmp.h>
|
||
|
|
#include "profiler.h"
|
||
|
|
#include "flint.h"
|
||
|
|
#include "ulong_extras.h"
|
||
|
|
|
||
|
|
void sample(void * arg, ulong count)
|
||
|
|
{
|
||
|
|
mp_limb_t d;
|
||
|
|
mp_ptr array = (mp_ptr) flint_malloc(200 * sizeof(mp_limb_t));
|
||
|
|
FLINT_TEST_INIT(state);
|
||
|
|
ulong i;
|
||
|
|
int j;
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
d = n_randtest_not_zero(state);
|
||
|
|
|
||
|
|
for (i = 0; i < count; i++)
|
||
|
|
{
|
||
|
|
for (j = 0; j < 200; j+=2)
|
||
|
|
{
|
||
|
|
do
|
||
|
|
{
|
||
|
|
array[j] = n_randtest(state);
|
||
|
|
} while (array[j] >= d);
|
||
|
|
array[j + 1] = n_randtest(state);
|
||
|
|
}
|
||
|
|
|
||
|
|
prof_start();
|
||
|
|
for (j = 0; j < 200; j+=2)
|
||
|
|
{
|
||
|
|
udiv_qrnnd(array[j], array[j+1], array[j], array[j+1], d);
|
||
|
|
}
|
||
|
|
prof_stop();
|
||
|
|
|
||
|
|
for (j = 0; j < 200; j++)
|
||
|
|
if (array[j] == 0) flint_printf("\r");
|
||
|
|
}
|
||
|
|
|
||
|
|
flint_randclear(state);
|
||
|
|
flint_free(array);
|
||
|
|
}
|
||
|
|
|
||
|
|
int main(void)
|
||
|
|
{
|
||
|
|
double min, max;
|
||
|
|
|
||
|
|
prof_repeat(&min, &max, sample, NULL);
|
||
|
|
|
||
|
|
flint_printf("udiv_qrnnd min time is %.3f cycles, max time is %.3f cycles\n",
|
||
|
|
(min/(double)FLINT_CLOCK_SCALE_FACTOR)/100, (max/(double)FLINT_CLOCK_SCALE_FACTOR)/100);
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|