X-Git-Url: https://oss.titaniummirror.com/gitweb?a=blobdiff_plain;f=mpfr%2Ftests%2Ftrandom.c;fp=mpfr%2Ftests%2Ftrandom.c;h=c1680c4f6c2ccec6db998f260758c53cb5a2bfa5;hb=6fed43773c9b0ce596dca5686f37ac3fc0fa11c0;hp=0000000000000000000000000000000000000000;hpb=27b11d56b743098deb193d510b337ba22dc52e5c;p=msp430-gcc.git

diff --git a/mpfr/tests/trandom.c b/mpfr/tests/trandom.c
new file mode 100644
index 00000000..c1680c4f
--- /dev/null
+++ b/mpfr/tests/trandom.c
@@ -0,0 +1,291 @@
+/* Test file for the various mpfr_random fonctions.
+
+Copyright 1999, 2000, 2001, 2002, 2003, 2004, 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 <stdio.h>
+#include <stdlib.h>
+
+#include "mpfr-test.h"
+
+static void
+test_random (long nbtests, mp_prec_t prec, int verbose)
+{
+  mpfr_t x;
+  int *tab, size_tab, k;
+  double d, av = 0, var = 0, chi2 = 0, th;
+
+  size_tab = (nbtests >= 1000 ? nbtests / 50 : 20);
+  tab = (int *) calloc (size_tab, sizeof(int));
+  if (tab == NULL)
+    {
+      fprintf (stderr, "trandom: can't allocate memory in test_random\n");
+      exit (1);
+    }
+
+  mpfr_init2(x, prec);
+
+  for (k = 0; k < nbtests; k++)
+    {
+      mpfr_urandomb (x, RANDS);
+      d = mpfr_get_d1 (x); av += d; var += d*d;
+      tab[(int)(size_tab * d)]++;
+    }
+
+  mpfr_clear(x);
+  if (!verbose)
+    {
+      free(tab);
+      return;
+    }
+
+  av /= nbtests;
+  var = (var / nbtests) - av*av;
+
+  th = (double) nbtests / size_tab;
+
+  printf("Average = %.5f\nVariance = %.5f\n", av, var);
+  printf("Repartition for random. Each integer should be close to %d.\n",
+         (int)th);
+
+  for (k = 0; k < size_tab; k++)
+    {
+      chi2 += (tab[k] - th) * (tab[k] - th) / th;
+      printf("%d ", tab[k]);
+      if (((k+1) & 7) == 0)
+        printf("\n");
+    }
+
+  printf("\nChi2 statistics value (with %d degrees of freedom) : %.5f\n\n",
+         size_tab - 1, chi2);
+
+  printf("\n");
+
+  free(tab);
+  return;
+}
+
+static void
+test_random2 (long nbtests, mp_prec_t prec, int verbose)
+{
+  mpfr_t x;
+  int *tab, size_tab, k, sh, xn;
+  double d, av = 0, var = 0, chi2 = 0, th;
+
+  size_tab = (nbtests >= 1000 ? nbtests / 50 : 20);
+  tab = (int *) calloc (size_tab, sizeof(int));
+  if (tab == NULL)
+    {
+      fprintf (stderr, "trandom: can't allocate memory in test_random2\n");
+      exit (1);
+    }
+
+  mpfr_init2 (x, prec);
+  xn = 1 + (prec - 1) / mp_bits_per_limb;
+  sh = xn * mp_bits_per_limb - prec;
+
+  for (k = 0; k < nbtests; k++)
+    {
+      mpfr_random2 (x, xn, 0);
+      /* check that lower bits are zero */
+      if (MPFR_MANT(x)[0] & MPFR_LIMB_MASK(sh))
+        {
+          printf ("Error: mpfr_random2() returns invalid numbers:\n");
+          mpfr_print_binary (x); puts ("");
+          exit (1);
+        }
+
+      /* check that the number is normalized */
+      if (! (MPFR_MANT(x)[MPFR_LIMB_SIZE(x) - 1] >> (BITS_PER_MP_LIMB - 1)))
+        {
+          printf ("Error: mpfr_random2() returns unnormalized numbers:\n");
+          mpfr_print_binary (x); puts ("");
+          exit (1);
+        }
+
+      /* check that exponent is in correct range */
+      if (mpfr_get_exp (x) != 0)
+        {
+          printf ("Error: mpfr_random2 (.., .., 0) does not return"
+                  " a 0 exponent:\n");
+          mpfr_print_binary (x); puts ("");
+          exit (1);
+        }
+      d = mpfr_get_d1 (x); av += d; var += d*d;
+      if (d < 1)
+        tab[(int)(size_tab * d)]++;
+    }
+
+  /* test size=0 */
+  mpfr_random2 (x, 0, 0);
+  MPFR_ASSERTN (mpfr_cmp_ui (x, 0) == 0 && MPFR_IS_POS (x));
+  mpfr_set_si (x, -1, GMP_RNDN); /* x is negative */
+  mpfr_random2 (x, 0, 0);
+  MPFR_ASSERTN (mpfr_cmp_ui (x, 0) == 0 && MPFR_IS_POS (x));
+
+  /* test size < 0 */
+  mpfr_random2 (x, -1, 0);
+  MPFR_ASSERTN (MPFR_IS_NEG (x) && MPFR_EXP (x) == 0);
+
+  mpfr_clear (x);
+  if (!verbose)
+    {
+      free(tab);
+      return;
+    }
+
+  av /= nbtests;
+  var = (var / nbtests) - av*av;
+
+  th = (double)nbtests / size_tab;
+  printf("Average = %.5f\nVariance = %.5f\n", av, var);
+  printf("Repartition for random2 (taking only values < 1 into account.\n");
+
+  for (k = 0; k < size_tab; k++)
+    {
+      chi2 += (tab[k] - th) * (tab[k] - th) / th;
+      printf("%d ", tab[k]);
+      if (((k+1) & 7) == 0)
+        printf("\n");
+    }
+
+  printf("\nChi2 statistics value (with %d degrees of freedom) : %.5f\n\n",
+         size_tab - 1, chi2);
+
+  free(tab);
+  return;
+}
+
+static void
+test_urandomb (long nbtests, mp_prec_t prec, int verbose)
+{
+  mpfr_t x;
+  int *tab, size_tab, k, sh, xn;
+  double d, av = 0, var = 0, chi2 = 0, th;
+  mp_exp_t emin;
+
+  size_tab = (nbtests >= 1000 ? nbtests / 50 : 20);
+  tab = (int *) calloc (size_tab, sizeof(int));
+  if (tab == NULL)
+    {
+      fprintf (stderr, "trandom: can't allocate memory in test_urandomb\n");
+      exit (1);
+    }
+
+  mpfr_init2 (x, prec);
+  xn = 1 + (prec - 1) / mp_bits_per_limb;
+  sh = xn * mp_bits_per_limb - prec;
+
+  for (k = 0; k < nbtests; k++)
+    {
+      mpfr_urandomb (x, RANDS);
+      /* check that lower bits are zero */
+      if (MPFR_MANT(x)[0] & MPFR_LIMB_MASK(sh))
+        {
+          printf ("Error: mpfr_urandomb() returns invalid numbers:\n");
+          mpfr_print_binary (x); puts ("");
+          exit (1);
+        }
+      d = mpfr_get_d1 (x); av += d; var += d*d;
+      tab[(int)(size_tab * d)]++;
+    }
+
+  /* coverage test */
+  emin = mpfr_get_emin ();
+  set_emin (1); /* the generated number in [0,1[ is not in the exponent
+                        range, except if it is zero */
+  k = mpfr_urandomb (x, RANDS);
+  if (MPFR_IS_ZERO(x) == 0 && (k == 0 || mpfr_nan_p (x) == 0))
+    {
+      printf ("Error in mpfr_urandomb, expected NaN, got ");
+      mpfr_dump (x);
+      exit (1);
+    }
+  set_emin (emin);
+
+  mpfr_clear (x);
+  if (!verbose)
+    {
+      free(tab);
+      return;
+    }
+
+  av /= nbtests;
+  var = (var / nbtests) - av * av;
+
+  th = (double)nbtests / size_tab;
+  printf("Average = %.5f\nVariance = %.5f\n", av, var);
+  printf("Repartition for urandomb. Each integer should be close to %d.\n",
+         (int)th);
+
+  for (k = 0; k < size_tab; k++)
+    {
+      chi2 += (tab[k] - th) * (tab[k] - th) / th;
+      printf("%d ", tab[k]);
+      if (((k+1) & 7) == 0)
+        printf("\n");
+    }
+
+  printf("\nChi2 statistics value (with %d degrees of freedom) : %.5f\n\n",
+         size_tab - 1, chi2);
+
+  free(tab);
+  return;
+}
+
+int
+main (int argc, char *argv[])
+{
+  long nbtests;
+  mp_prec_t prec;
+  int verbose = 0;
+
+  tests_start_mpfr ();
+
+  if (argc > 1)
+    verbose = 1;
+
+  nbtests = 10000;
+  if (argc > 1)
+    {
+      long a = atol(argv[1]);
+      if (a != 0)
+        nbtests = a;
+    }
+
+  if (argc <= 2)
+    prec = 1000;
+  else
+    prec = atol(argv[2]);
+
+  test_random (nbtests, prec, verbose);
+  test_random2 (nbtests, prec, verbose);
+  test_urandomb (nbtests, prec, verbose);
+
+  if (argc == 1)  /* check also small precision */
+    {
+      test_random (nbtests, 2, 0);
+      test_random2 (nbtests, 2, 0);
+      test_urandomb (nbtests, 2, 0);
+    }
+
+  tests_end_mpfr ();
+  return 0;
+}