/* Test mpq_get_d and mpq_set_d Copyright 1991, 1993, 1994, 1996, 2000, 2001, 2002, 2003 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include "mpir.h" #include "gmp-impl.h" #include "tests.h" #ifndef SIZE #define SIZE 8 #endif #define EPSIZE SIZE void dump _PROTO ((mpq_t)); void mpz_intrandom2 (mpz_ptr x, gmp_randstate_t rands, mp_size_t size) { mp_size_t abs_size; abs_size = ABS (size); if (abs_size != 0) { if (x->_mp_alloc < abs_size) _mpz_realloc (x, abs_size); mpn_rrandom (x->_mp_d, rands, abs_size); } x->_mp_size = size; } void check_monotonic (int argc, gmp_randstate_t rands, char **argv) { mpq_t a; mp_size_t size; int reps = 100; 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 (rands) % SIZE - SIZE/2; mpz_intrandom2 (mpq_numref (a), rands, size); do { size = urandom (rands) % SIZE - SIZE/2; mpz_intrandom2 (mpq_denref (a), rands, 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 (rands) % EPSIZE + 1; mpz_intrandom2 (mpq_numref (eps), rands, size); size = urandom (rands) % EPSIZE + 1; mpz_intrandom2 (mpq_denref (eps), rands, size); mpq_canonicalize (eps); mpq_add (a, a, eps); mpq_canonicalize (a); new_d = mpq_get_d (a); if (last_d > new_d) { printf ("\nERROR (test %d/%d): bad mpq_get_d results\n", i, j); printf ("last: %.16g\n", last_d); printf (" new: %.16g\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) { printf ("ERROR (test %d/%d): bad mpq_set_d results\n", i, j); printf ("last: %.16g\n", last_d); dump (qlast_d); printf (" new: %.16g\n", new_d); dump (qnew_d); abort (); } last_d = new_d; mpq_set (qlast_d, qnew_d); } } mpq_clear (a); mpq_clear (eps); mpq_clear (qlast_d); mpq_clear (qnew_d); } double my_ldexp (double d, int e) { for (;;) { if (e > 0) { if (e >= 16) { d *= 65536.0; e -= 16; } else { d *= 2.0; e -= 1; } } else if (e < 0) { if (e <= -16) { d /= 65536.0; e += 16; } else { d /= 2.0; e += 1; } } else return d; } } void check_random (int argc, gmp_randstate_t rands, char **argv) { double d, d2, nd, dd; mpq_t q; mp_limb_t rp[LIMBS_PER_DOUBLE + 1]; int test, reps = 100000; int i; if (argc == 2) reps = 100 * atoi (argv[1]); mpq_init (q); for (test = 0; test < reps; test++) { mpn_rrandom (rp, rands, LIMBS_PER_DOUBLE + 1); d = 0.0; for (i = LIMBS_PER_DOUBLE - 1; i >= 0; i--) d = d * MP_BASE_AS_DOUBLE + rp[i]; d = my_ldexp (d, (int) (rp[LIMBS_PER_DOUBLE] % 1000) - 500); mpq_set_d (q, d); nd = mpz_get_d (mpq_numref (q)); dd = mpz_get_d (mpq_denref (q)); d2 = nd / dd; if (d != d2) { printf ("ERROR (check_random test %d): bad mpq_set_d results\n", test); printf ("%.16g\n", d); printf ("%.16g\n", d2); abort (); } } mpq_clear (q); } void dump (mpq_t x) { mpz_out_str (stdout, 10, mpq_numref (x)); printf ("/"); mpz_out_str (stdout, 10, mpq_denref (x)); printf ("\n"); } /* Check various values 2^n and 1/2^n. */ void check_onebit (void) { static const long data[] = { -3*GMP_NUMB_BITS-1, -3*GMP_NUMB_BITS, -3*GMP_NUMB_BITS+1, -2*GMP_NUMB_BITS-1, -2*GMP_NUMB_BITS, -2*GMP_NUMB_BITS+1, -GMP_NUMB_BITS-1, -GMP_NUMB_BITS, -GMP_NUMB_BITS+1, -5, -2, -1, 0, 1, 2, 5, GMP_NUMB_BITS-1, GMP_NUMB_BITS, GMP_NUMB_BITS+1, 2*GMP_NUMB_BITS-1, 2*GMP_NUMB_BITS, 2*GMP_NUMB_BITS+1, 3*GMP_NUMB_BITS-1, 3*GMP_NUMB_BITS, 3*GMP_NUMB_BITS+1, }; int i, neg; long exp, l; mpq_t q; double got, want; mpq_init (q); for (i = 0; i < numberof (data); i++) { exp = data[i]; mpq_set_ui (q, 1L, 1L); if (exp >= 0) mpq_mul_2exp (q, q, exp); else mpq_div_2exp (q, q, -exp); want = 1.0; for (l = 0; l < exp; l++) want *= 2.0; for (l = 0; l > exp; l--) want /= 2.0; for (neg = 0; neg <= 1; neg++) { if (neg) { mpq_neg (q, q); want = -want; } got = mpq_get_d (q); if (got != want) { printf ("mpq_get_d wrong on %s2**%ld\n", neg ? "-" : "", exp); mpq_trace (" q ", q); d_trace (" want ", want); d_trace (" got ", got); abort(); } } } mpq_clear (q); } int main (int argc, char **argv) {gmp_randstate_t rands; tests_start (); gmp_randinit_default(rands); check_onebit (); check_monotonic (argc,rands, argv); check_random (argc,rands, argv); gmp_randclear(rands); tests_end (); exit (0); }