118 lines
3.3 KiB
C
118 lines
3.3 KiB
C
/* Test mpz_abs, mpz_add, mpz_cmp, mpz_cmp_ui, mpz_divmod, mpz_mdiv,
|
|
mpz_mdivmod, mpz_mmod, mpz_mul.
|
|
|
|
Copyright (C) 1993 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 General Public License as published by
|
|
the Free Software Foundation; either version 2, 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 General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with the GNU MP Library; see the file COPYING. If not, write to
|
|
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
|
|
|
|
#include <stdio.h>
|
|
#include "gmp.h"
|
|
#include "gmp-impl.h"
|
|
#include "urandom.h"
|
|
|
|
void debug_mp ();
|
|
|
|
#ifndef SIZE
|
|
#define SIZE 8
|
|
#endif
|
|
|
|
main (argc, argv)
|
|
int argc;
|
|
char **argv;
|
|
{
|
|
MP_INT dividend, divisor;
|
|
MP_INT quotient, remainder;
|
|
MP_INT quotient2, remainder2;
|
|
MP_INT temp;
|
|
mp_size dividend_size, divisor_size;
|
|
int i;
|
|
int reps = 100000;
|
|
|
|
if (argc == 2)
|
|
reps = atoi (argv[1]);
|
|
|
|
mpz_init (÷nd);
|
|
mpz_init (&divisor);
|
|
mpz_init ("ient);
|
|
mpz_init (&remainder);
|
|
mpz_init ("ient2);
|
|
mpz_init (&remainder2);
|
|
mpz_init (&temp);
|
|
|
|
for (i = 0; i < reps; i++)
|
|
{
|
|
dividend_size = urandom () % SIZE - SIZE/2;
|
|
mpz_random2 (÷nd, dividend_size);
|
|
|
|
divisor_size = urandom () % SIZE - SIZE/2;
|
|
mpz_random2 (&divisor, divisor_size);
|
|
if (mpz_cmp_ui (&divisor, 0) == 0)
|
|
continue;
|
|
|
|
mpz_mdivmod ("ient, &remainder, ÷nd, &divisor);
|
|
mpz_mdiv ("ient2, ÷nd, &divisor);
|
|
mpz_mmod (&remainder2, ÷nd, &divisor);
|
|
|
|
/* First determine that the quotients and remainders computed
|
|
with different functions are equal. */
|
|
if (mpz_cmp ("ient, "ient2) != 0)
|
|
dump_abort (÷nd, &divisor);
|
|
if (mpz_cmp (&remainder, &remainder2) != 0)
|
|
dump_abort (÷nd, &divisor);
|
|
|
|
/* Check if the sign of the quotient is correct. */
|
|
if (mpz_cmp_ui ("ient, 0) != 0)
|
|
if ((mpz_cmp_ui ("ient, 0) < 0)
|
|
!= ((mpz_cmp_ui (÷nd, 0) ^ mpz_cmp_ui (&divisor, 0)) < 0))
|
|
dump_abort (÷nd, &divisor);
|
|
|
|
/* Check if the remainder has the same sign as the divisor
|
|
(quotient rounded towards minus infinity). */
|
|
if (mpz_cmp_ui (&remainder, 0) != 0)
|
|
if ((mpz_cmp_ui (&remainder, 0) < 0) != (mpz_cmp_ui (&divisor, 0) < 0))
|
|
dump_abort (÷nd, &divisor);
|
|
|
|
mpz_mul (&temp, "ient, &divisor);
|
|
mpz_add (&temp, &temp, &remainder);
|
|
if (mpz_cmp (&temp, ÷nd) != 0)
|
|
dump_abort (÷nd, &divisor);
|
|
|
|
mpz_abs (&temp, &divisor);
|
|
mpz_abs (&remainder, &remainder);
|
|
if (mpz_cmp (&remainder, &temp) >= 0)
|
|
dump_abort (÷nd, &divisor);
|
|
}
|
|
|
|
exit (0);
|
|
}
|
|
|
|
dump_abort (dividend, divisor)
|
|
MP_INT *dividend, *divisor;
|
|
{
|
|
fprintf (stderr, "ERROR\n");
|
|
fprintf (stderr, "dividend = "); debug_mp (dividend, -16);
|
|
fprintf (stderr, "divisor = "); debug_mp (divisor, -16);
|
|
abort();
|
|
}
|
|
|
|
void
|
|
debug_mp (x, base)
|
|
MP_INT *x;
|
|
{
|
|
mpz_out_str (stderr, base, x); fputc ('\n', stderr);
|
|
}
|