File: [local] / OpenXM_contrib / gmp / tests / devel / Attic / addmul_1.c (download)
Revision 1.1.1.1 (vendor branch), Mon Aug 25 16:06:12 2003 UTC (21 years ago) by ohara
Branch: GMP
CVS Tags: VERSION_4_1_2, RELEASE_1_2_3, RELEASE_1_2_2_KNOPPIX_b, RELEASE_1_2_2_KNOPPIX Changes since 1.1: +0 -0
lines
Import gmp 4.1.2
|
/*
Copyright 1996, 1997, 1998, 1999, 2000, 2001, 2002 Free Software Foundation,
Inc.
This file is part of the GNU MP Library.
The GNU MP Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or (at your
option) any later version.
The GNU MP Library 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 Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the GNU MP Library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
MA 02111-1307, USA.
*/
#include <stdio.h>
#include "gmp.h"
#include "gmp-impl.h"
#include "longlong.h"
#if defined (USG) || defined (__SVR4) || defined (_UNICOS) || defined (__hpux)
#include <time.h>
int
cputime ()
{
if (CLOCKS_PER_SEC < 100000)
return clock () * 1000 / CLOCKS_PER_SEC;
return clock () / (CLOCKS_PER_SEC / 1000);
}
#else
#include <sys/types.h>
#include <sys/time.h>
#include <sys/resource.h>
int
cputime ()
{
struct rusage rus;
getrusage (0, &rus);
return rus.ru_utime.tv_sec * 1000 + rus.ru_utime.tv_usec / 1000;
}
#endif
#define M * 1000000
#ifndef CLOCK
#error "Don't know CLOCK of your machine"
#endif
#ifndef OPS
#define OPS (CLOCK/5)
#endif
#ifndef SIZE
#define SIZE 496
#endif
#ifndef TIMES
#define TIMES OPS/SIZE
#else
#undef OPS
#define OPS (SIZE*TIMES)
#endif
mp_limb_t
refmpn_addmul_1 (res_ptr, s1_ptr, s1_size, s2_limb)
register mp_ptr res_ptr;
register mp_srcptr s1_ptr;
mp_size_t s1_size;
register mp_limb_t s2_limb;
{
register mp_limb_t cy_limb;
register mp_size_t j;
register mp_limb_t prod_high, prod_low;
register mp_limb_t x;
/* The loop counter and index J goes from -S1_SIZE to -1. This way
the loop becomes faster. */
j = -s1_size;
/* Offset the base pointers to compensate for the negative indices. */
res_ptr -= j;
s1_ptr -= j;
cy_limb = 0;
s2_limb <<= GMP_NAIL_BITS;
do
{
umul_ppmm (prod_high, prod_low, s1_ptr[j], s2_limb);
prod_low >>= GMP_NAIL_BITS;
prod_low = (prod_low + cy_limb) & GMP_NUMB_MASK;
cy_limb = (prod_low < cy_limb) + prod_high;
x = res_ptr[j];
prod_low = (x + prod_low) & GMP_NUMB_MASK;
cy_limb += (prod_low < x);
res_ptr[j] = prod_low;
}
while (++j != 0);
return cy_limb;
}
main (argc, argv)
int argc;
char **argv;
{
mp_limb_t s1[SIZE];
mp_limb_t dx[SIZE+2];
mp_limb_t dy[SIZE+2];
mp_limb_t cyx, cyy;
int i;
long t0, t;
unsigned int test;
mp_limb_t xlimb;
mp_size_t size;
double cyc;
unsigned int ntests;
ntests = ~(unsigned) 0;
if (argc == 2)
ntests = strtol (argv[1], 0, 0);
for (test = 1; test <= ntests; test++)
{
#if TIMES == 1 && ! defined (PRINT)
if (test % (SIZE > 10000 ? 1 : 10000 / SIZE) == 0)
{
printf ("\r%u", test);
fflush (stdout);
}
#endif
#ifdef RANDOM
size = random () % SIZE + 1;
#else
size = SIZE;
#endif
dy[size+1] = 0x12345678;
dy[0] = 0x87654321;
#ifdef FIXED_XLIMB
xlimb = FIXED_XLIMB;
#else
mpn_random2 (&xlimb, 1);
#endif
#if TIMES != 1
mpn_random (s1, size);
mpn_random (dy+1, size);
#ifndef NOCHECK
MPN_COPY (dx, dy, size+2);
t0 = cputime();
for (i = 0; i < TIMES; i++)
refmpn_addmul_1 (dx+1, s1, size, xlimb);
t = cputime() - t0;
cyc = ((double) t * CLOCK) / (OPS * 1000.0);
printf ("refmpn_addmul_1: %5ldms (%.2f cycles/limb) [%.2f Gb/s]\n",
t, cyc,
CLOCK/cyc*BITS_PER_MP_LIMB*BITS_PER_MP_LIMB/1e9);
#endif
MPN_COPY (dx, dy, size+2);
t0 = cputime();
for (i = 0; i < TIMES; i++)
mpn_addmul_1 (dx+1, s1, size, xlimb);
t = cputime() - t0;
cyc = ((double) t * CLOCK) / (OPS * 1000.0);
printf ("mpn_addmul_1: %5ldms (%.2f cycles/limb) [%.2f Gb/s]\n",
t, cyc,
CLOCK/cyc*BITS_PER_MP_LIMB*BITS_PER_MP_LIMB/1e9);
#endif
mpn_random2 (s1, size);
mpn_random2 (dy+1, size);
#if defined (PRINT) || defined (XPRINT)
printf ("xlimb=");
mpn_print (&xlimb, 1);
#endif
#ifdef PRINT
printf ("%*s ", (int) (2 * sizeof(mp_limb_t)), "");
mpn_print (dy+1, size);
printf ("%*s ", (int) (2 * sizeof(mp_limb_t)), "");
mpn_print (s1, size);
#endif
MPN_COPY (dx, dy, size+2);
cyx = refmpn_addmul_1 (dx+1, s1, size, xlimb);
cyy = mpn_addmul_1 (dy+1, s1, size, xlimb);
#ifdef PRINT
printf ("%*lX ", (int) (2 * sizeof(mp_limb_t)), cyx);
mpn_print (dx+1, size);
printf ("%*lX ", (int) (2 * sizeof(mp_limb_t)), cyy);
mpn_print (dy+1, size);
#endif
#ifndef NOCHECK
if (cyx != cyy || mpn_cmp (dx, dy, size+2) != 0
|| dx[size+1] != 0x12345678 || dx[0] != 0x87654321)
{
printf ("\n");
#ifndef PRINT
printf ("%*lX ", (int) (2 * sizeof(mp_limb_t)), cyx);
mpn_print (dx+1, size);
printf ("%*lX ", (int) (2 * sizeof(mp_limb_t)), cyy);
mpn_print (dy+1, size);
#endif
printf ("%*s ", (int) (2 * sizeof(mp_limb_t)), "DIFF:");
for (i = size; i != 0; i--)
{
mp_limb_t diff = dy[i] ^ dx[i];
if (diff != 0)
printf ("%*lX", (int) (2 * sizeof(mp_limb_t)), diff);
else
printf ("%*s", (int) (2 * sizeof(mp_limb_t)), "");
#ifdef SPACE
if (i != 0)
printf (" ");
#endif
}
printf ("\n");
if (dy[0] != 0x87654321)
printf ("clobbered at low end\n");
if (dy[size+1] != 0x12345678)
printf ("clobbered at high end\n");
printf ("TEST NUMBER %u\n", test);
abort();
}
#endif
#ifdef ONE
return 0;
#endif
}
}
mpn_print (mp_ptr p, mp_size_t size)
{
mp_size_t i;
for (i = size - 1; i >= 0; i--)
{
#ifdef _LONG_LONG_LIMB
printf ("%0*lX%0*lX", (int) (sizeof(mp_limb_t)),
(unsigned long) (p[i] >> (BITS_PER_MP_LIMB/2)),
(int) (sizeof(mp_limb_t)), (unsigned long) (p[i]));
#else
printf ("%0*lX", (int) (2 * sizeof(mp_limb_t)), p[i]);
#endif
#ifdef SPACE
if (i != 0)
printf (" ");
#endif
}
puts ("");
}