X-Git-Url: https://oss.titaniummirror.com/gitweb?a=blobdiff_plain;f=mpfr%2Ftests%2Ftcomparisons.c;fp=mpfr%2Ftests%2Ftcomparisons.c;h=cb71a7f6fdaa99c44557bb10a54b41040a831fb8;hb=6fed43773c9b0ce596dca5686f37ac3fc0fa11c0;hp=0000000000000000000000000000000000000000;hpb=27b11d56b743098deb193d510b337ba22dc52e5c;p=msp430-gcc.git diff --git a/mpfr/tests/tcomparisons.c b/mpfr/tests/tcomparisons.c new file mode 100644 index 00000000..cb71a7f6 --- /dev/null +++ b/mpfr/tests/tcomparisons.c @@ -0,0 +1,131 @@ +/* Test file for mpfr_greater_p, mpfr_greaterequal_p, mpfr_less_p, + mpfr_lessequal_p, mpfr_lessgreater_p, mpfr_equal_p, mpfr_unordered_p + functions. + +Copyright 2003, 2006, 2007, 2008, 2009 Free Software Foundation, Inc. +Contributed by the Arenaire and Cacao projects, INRIA. + +This file is part of the GNU MPFR Library. + +The GNU 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 GNU 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 GNU MPFR Library; see the file COPYING.LIB. If not, write to +the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, +MA 02110-1301, USA. */ + +#include +#include + +#include "mpfr-test.h" + +static void +cmp_tests (void) +{ + mpfr_t x, y; + long i; + + mpfr_inits (x, y, (mpfr_ptr) 0); + for (i = 0; i < 80000; i++) + { + mp_prec_t precx, precy; + int signx, signy, cmp; + unsigned int cmpbool = 0; + + precx = (randlimb () % 17) * 11 + MPFR_PREC_MIN; + precy = (randlimb () % 17) * 11 + MPFR_PREC_MIN; + mpfr_set_prec (x, precx); + mpfr_set_prec (y, precy); + mpfr_urandomb (x, RANDS); + mpfr_urandomb (y, RANDS); + signx = randlimb () & 1; + signy = randlimb () % 256 ? signx : 1 - signx; + /* signy = signx most of the time (most interesting case) */ + if (signx) + mpfr_neg (x, x, GMP_RNDN); + if (signy) + mpfr_neg (y, y, GMP_RNDN); + if (i <= 1) + mpfr_set_nan (x); + if (i == 0 || i == 2) + mpfr_set_nan (y); + if (mpfr_greater_p (x, y)) + cmpbool |= 0x01; + if (mpfr_greaterequal_p (x, y)) + cmpbool |= 0x02; + if (mpfr_less_p (x, y)) + cmpbool |= 0x04; + if (mpfr_lessequal_p (x, y)) + cmpbool |= 0x08; + if (mpfr_lessgreater_p (x, y)) + cmpbool |= 0x10; + if (mpfr_equal_p (x, y)) + cmpbool |= 0x20; + if (mpfr_unordered_p (x, y)) + cmpbool |= 0x40; + if ((i <= 2 && cmpbool != 0x40) || + (i > 2 && (cmp = mpfr_cmp (x, y), + (cmp == 0 && cmpbool != 0x2a) || + (cmp < 0 && cmpbool != 0x1c) || + (cmp > 0 && cmpbool != 0x13)))) + { + printf ("Error in cmp_tests for\nx = "); + mpfr_out_str (stdout, 2, 0, x, GMP_RNDN); + printf (" and\ny = "); + mpfr_out_str (stdout, 2, 0, y, GMP_RNDN); + printf ("\n"); + exit (1); + } + } + mpfr_clears (x, y, (mpfr_ptr) 0); +} + +static void +eq_tests (void) +{ + mpfr_t x, y; + long i; + + mpfr_inits (x, y, (mpfr_ptr) 0); + for (i = 0; i < 20000; i++) + { + mp_prec_t precx; + + precx = (randlimb () % 17) * 11 + MPFR_PREC_MIN; + mpfr_set_prec (x, precx); + mpfr_set_prec (y, precx + (randlimb () % 64)); + mpfr_urandomb (x, RANDS); + if (randlimb () & 1) + mpfr_neg (x, x, GMP_RNDN); + mpfr_set (y, x, GMP_RNDN); /* exact -> x = y */ + if (mpfr_greater_p (x, y) || !mpfr_greaterequal_p (x, y) || + mpfr_less_p (x, y) || !mpfr_lessequal_p (x, y) || + mpfr_lessgreater_p (x, y) || !mpfr_equal_p (x, y) || + mpfr_unordered_p (x, y)) + { + printf ("Error in eq_tests for x = "); + mpfr_out_str (stdout, 2, 0, x, GMP_RNDN); + printf ("\n"); + exit (1); + } + } + mpfr_clears (x, y, (mpfr_ptr) 0); +} + +int +main (void) +{ + tests_start_mpfr (); + cmp_tests (); + eq_tests (); + tests_end_mpfr (); + return 0; +}