/* Test file for mpfr_cmp2. Copyright 1999, 2000, 2001, 2002 Free Software Foundation. This file is part of the MPFR Library. The MPFR 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 MPFR 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 MPFR 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 #include #include #include "gmp.h" #include "mpfr.h" #include "mpfr-impl.h" #include "mpfr-test.h" void tcmp2 _PROTO ((double, double, int)); void special _PROTO ((void)); void worst_cases _PROTO ((void)); void set_bit _PROTO ((mpfr_t, unsigned int, int)); /* set bit n of x to b, where bit 0 is the most significant one */ void set_bit (mpfr_t x, unsigned int n, int b) { unsigned l; mp_size_t xn; xn = (MPFR_PREC(x) - 1) / mp_bits_per_limb; l = n / mp_bits_per_limb; n %= mp_bits_per_limb; n = mp_bits_per_limb - 1 - n; if (b) MPFR_MANT(x)[xn - l] |= (mp_limb_t) 1 << n; else MPFR_MANT(x)[xn - l] &= ~((mp_limb_t) 1 << n); } /* check that for x = 1.u 1 v 0^k low(x) y = 1.u 0 v 1^k low(y) mpfr_cmp2 (x, y) returns 1 + |u| + |v| + k for low(x) >= low(y), and 1 + |u| + |v| + k + 1 otherwise */ void worst_cases (void) { mpfr_t x, y; unsigned int i, j, k, b, expected; mp_prec_t l; mpfr_init2 (x, 200); mpfr_init2 (y, 200); mpfr_set_ui (y, 1, GMP_RNDN); for (i=1; i