File: [local] / OpenXM / src / kan96xx / gmp-2.0.2 / mpz / tests / Attic / t-mul.c (download)
Revision 1.1.1.1 (vendor branch), Fri Oct 8 02:12:13 1999 UTC (24 years, 10 months ago) by maekawa
Branch: OpenXM
CVS Tags: RELEASE_20000124, RELEASE_1_1_2, ALPHA Changes since 1.1: +0 -0
lines
o import OpenXM sources
|
/* Test mpz_add, mpz_cmp, mpz_cmp_ui, mpz_divmod, mpz_mul.
Copyright (C) 1991, 1993, 1994, 1996 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 Library General Public License as published by
the Free Software Foundation; either version 2 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 Library General Public
License for more details.
You should have received a copy of the GNU Library 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"
#include "urandom.h"
void debug_mp ();
mp_size_t _mpn_mul_classic ();
void mpz_refmul ();
#ifndef SIZE
#define SIZE 128
#endif
main (argc, argv)
int argc;
char **argv;
{
mpz_t multiplier, multiplicand;
mpz_t product, ref_product;
mpz_t quotient, remainder;
mp_size_t multiplier_size, multiplicand_size;
int i;
int reps = 10000;
if (argc == 2)
reps = atoi (argv[1]);
mpz_init (multiplier);
mpz_init (multiplicand);
mpz_init (product);
mpz_init (ref_product);
mpz_init (quotient);
mpz_init (remainder);
for (i = 0; i < reps; i++)
{
multiplier_size = urandom () % SIZE - SIZE/2;
multiplicand_size = urandom () % SIZE - SIZE/2;
mpz_random2 (multiplier, multiplier_size);
mpz_random2 (multiplicand, multiplicand_size);
mpz_mul (product, multiplier, multiplicand);
mpz_refmul (ref_product, multiplier, multiplicand);
if (mpz_cmp_ui (multiplicand, 0) != 0)
mpz_divmod (quotient, remainder, product, multiplicand);
if (mpz_cmp (product, ref_product))
dump_abort (multiplier, multiplicand);
if (mpz_cmp_ui (multiplicand, 0) != 0)
if (mpz_cmp_ui (remainder, 0) || mpz_cmp (quotient, multiplier))
dump_abort (multiplier, multiplicand);
}
exit (0);
}
void
mpz_refmul (w, u, v)
mpz_t w;
const mpz_t u;
const mpz_t v;
{
mp_size_t usize = u->_mp_size;
mp_size_t vsize = v->_mp_size;
mp_size_t wsize;
mp_size_t sign_product;
mp_ptr up, vp;
mp_ptr wp;
mp_ptr free_me = NULL;
size_t free_me_size;
TMP_DECL (marker);
TMP_MARK (marker);
sign_product = usize ^ vsize;
usize = ABS (usize);
vsize = ABS (vsize);
if (usize < vsize)
{
/* Swap U and V. */
{const __mpz_struct *t = u; u = v; v = t;}
{mp_size_t t = usize; usize = vsize; vsize = t;}
}
up = u->_mp_d;
vp = v->_mp_d;
wp = w->_mp_d;
/* Ensure W has space enough to store the result. */
wsize = usize + vsize;
if (w->_mp_alloc < wsize)
{
if (wp == up || wp == vp)
{
free_me = wp;
free_me_size = w->_mp_alloc;
}
else
(*_mp_free_func) (wp, w->_mp_alloc * BYTES_PER_MP_LIMB);
w->_mp_alloc = wsize;
wp = (mp_ptr) (*_mp_allocate_func) (wsize * BYTES_PER_MP_LIMB);
w->_mp_d = wp;
}
else
{
/* Make U and V not overlap with W. */
if (wp == up)
{
/* W and U are identical. Allocate temporary space for U. */
up = (mp_ptr) TMP_ALLOC (usize * BYTES_PER_MP_LIMB);
/* Is V identical too? Keep it identical with U. */
if (wp == vp)
vp = up;
/* Copy to the temporary space. */
MPN_COPY (up, wp, usize);
}
else if (wp == vp)
{
/* W and V are identical. Allocate temporary space for V. */
vp = (mp_ptr) TMP_ALLOC (vsize * BYTES_PER_MP_LIMB);
/* Copy to the temporary space. */
MPN_COPY (vp, wp, vsize);
}
}
wsize = _mpn_mul_classic (wp, up, usize, vp, vsize);
w->_mp_size = sign_product < 0 ? -wsize : wsize;
if (free_me != NULL)
(*_mp_free_func) (free_me, free_me_size * BYTES_PER_MP_LIMB);
TMP_FREE (marker);
}
mp_size_t
_mpn_mul_classic (prodp, up, usize, vp, vsize)
mp_ptr prodp;
mp_srcptr up;
mp_size_t usize;
mp_srcptr vp;
mp_size_t vsize;
{
mp_size_t i, j;
mp_limb_t prod_low, prod_high;
mp_limb_t cy_dig;
mp_limb_t v_limb, c;
if (vsize == 0)
return 0;
/* Offset UP and PRODP so that the inner loop can be faster. */
up += usize;
prodp += usize;
/* Multiply by the first limb in V separately, as the result can
be stored (not added) to PROD. We also avoid a loop for zeroing. */
v_limb = vp[0];
cy_dig = 0;
j = -usize;
do
{
umul_ppmm (prod_high, prod_low, up[j], v_limb);
add_ssaaaa (cy_dig, prodp[j], prod_high, prod_low, 0, cy_dig);
j++;
}
while (j < 0);
prodp[j] = cy_dig;
prodp++;
/* For each iteration in the outer loop, multiply one limb from
U with one limb from V, and add it to PROD. */
for (i = 1; i < vsize; i++)
{
v_limb = vp[i];
cy_dig = 0;
j = -usize;
/* Inner loops. Simulate the carry flag by jumping between
these loops. The first is used when there was no carry
in the previois iteration; the second when there was carry. */
do
{
umul_ppmm (prod_high, prod_low, up[j], v_limb);
add_ssaaaa (cy_dig, prod_low, prod_high, prod_low, 0, cy_dig);
c = prodp[j];
prod_low += c;
prodp[j] = prod_low;
if (prod_low < c)
goto cy_loop;
ncy_loop:
j++;
}
while (j < 0);
prodp[j] = cy_dig;
prodp++;
continue;
do
{
umul_ppmm (prod_high, prod_low, up[j], v_limb);
add_ssaaaa (cy_dig, prod_low, prod_high, prod_low, 0, cy_dig);
c = prodp[j];
prod_low += c + 1;
prodp[j] = prod_low;
if (prod_low > c)
goto ncy_loop;
cy_loop:
j++;
}
while (j < 0);
cy_dig += 1;
prodp[j] = cy_dig;
prodp++;
}
return usize + vsize - (cy_dig == 0);
}
dump_abort (multiplier, multiplicand)
mpz_t multiplier, multiplicand;
{
fprintf (stderr, "ERROR\n");
fprintf (stderr, "multiplier = "); debug_mp (multiplier, -16);
fprintf (stderr, "multiplicand = "); debug_mp (multiplicand, -16);
abort();
}
void
debug_mp (x, base)
mpz_t x;
{
mpz_out_str (stderr, base, x); fputc ('\n', stderr);
}