mirror of https://github.com/macssh/macssh.git
133 lines
3.1 KiB
C
Executable File
133 lines
3.1 KiB
C
Executable File
/* Test mpq_get_d and mpq_set_d
|
|
|
|
Copyright (C) 1991, 1993, 1994, 1996, 2000 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 "urandom.h"
|
|
|
|
#ifndef SIZE
|
|
#define SIZE 8
|
|
#endif
|
|
|
|
#if defined (__vax__) && SIZE > 4
|
|
#undef SIZE
|
|
#define SIZE 4
|
|
#endif
|
|
|
|
void
|
|
MPQ_CHECK_FORMAT (q)
|
|
mpq_t q;
|
|
{
|
|
mp_size_t n;
|
|
|
|
n = ABSIZ (mpq_numref (q));
|
|
if (n != 0)
|
|
ASSERT_ALWAYS (PTR(mpq_numref(q))[n - 1] != 0);
|
|
|
|
n = ABSIZ (mpq_denref (q));
|
|
if (n != 0)
|
|
ASSERT_ALWAYS (PTR(mpq_denref(q))[n - 1] != 0);
|
|
}
|
|
|
|
main (argc, argv)
|
|
int argc;
|
|
char **argv;
|
|
{
|
|
mpq_t a;
|
|
mp_size_t size;
|
|
int reps = 1000;
|
|
int i, j;
|
|
double last_d, new_d;
|
|
mpq_t qlast_d, qnew_d;
|
|
mpq_t eps;
|
|
|
|
if (argc == 2)
|
|
reps = atoi (argv[1]);
|
|
|
|
/* The idea here is to test the monotonousness of mpq_get_d by adding
|
|
numbers to the numerator and denominator. */
|
|
|
|
mpq_init (a);
|
|
mpq_init (eps);
|
|
mpq_init (qlast_d);
|
|
mpq_init (qnew_d);
|
|
|
|
for (i = 0; i < reps; i++)
|
|
{
|
|
size = urandom () % SIZE - SIZE/2;
|
|
mpz_random2 (mpq_numref (a), size);
|
|
do
|
|
{
|
|
size = urandom () % SIZE - SIZE/2;
|
|
mpz_random2 (mpq_denref (a), size);
|
|
}
|
|
while (mpz_cmp_ui (mpq_denref (a), 0) == 0);
|
|
|
|
mpq_canonicalize (a);
|
|
|
|
last_d = mpq_get_d (a);
|
|
mpq_set_d (qlast_d, last_d);
|
|
for (j = 0; j < 10; j++)
|
|
{
|
|
size = urandom () % SIZE + 1;
|
|
mpz_random2 (mpq_numref (eps), size);
|
|
size = urandom () % SIZE + 1;
|
|
mpz_random2 (mpq_denref (eps), size);
|
|
mpq_canonicalize (eps);
|
|
|
|
mpq_add (a, a, eps);
|
|
mpq_canonicalize (a);
|
|
new_d = mpq_get_d (a);
|
|
if (last_d > new_d)
|
|
{
|
|
fprintf (stderr, "ERROR (test %d/%d): bad mpq_get_d results\n", i, j);
|
|
printf ("\nlast: %f\n ", last_d);
|
|
printf (" new: %f\n ", new_d); dump (a);
|
|
abort ();
|
|
}
|
|
mpq_set_d (qnew_d, new_d);
|
|
MPQ_CHECK_FORMAT (qnew_d);
|
|
if (mpq_cmp (qlast_d, qnew_d) > 0)
|
|
{
|
|
fprintf (stderr,
|
|
"ERROR (test %d/%d): bad mpq_set_d results\n", i, j);
|
|
printf ("\nlast: %f\n ", last_d); dump (qlast_d);
|
|
printf (" new: %f\n ", new_d); dump (qnew_d);
|
|
abort ();
|
|
}
|
|
last_d = new_d;
|
|
mpq_set (qlast_d, qnew_d);
|
|
}
|
|
}
|
|
|
|
exit (0);
|
|
}
|
|
|
|
dump (x)
|
|
mpq_t x;
|
|
{
|
|
mpz_out_str (stdout, 10, mpq_numref (x));
|
|
printf ("/");
|
|
mpz_out_str (stdout, 10, mpq_denref (x));
|
|
printf ("\n");
|
|
}
|