gnu/lib/libgmp/tests/tst-mdm_ui.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116

/* Test mpz_abs, mpz_add, mpz_cmp.  mpz_cmp_si, mpz_cmp_ui, mpz_divmod,
   mpz_mdiv_ui, mpz_mdivmod_ui, mpz_mmod_ui, mpz_mul, mpz_mul_ui.

Copyright (C) 1993 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 General Public License as published by
the Free Software Foundation; either version 2, 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 General Public License for more details.

You should have received a copy of the GNU General Public License
along with the GNU MP Library; see the file COPYING.  If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.  */

#include <stdio.h>
#include "gmp.h"
#include "gmp-impl.h"
#include "urandom.h"

void debug_mp ();

#ifndef SIZE
#define SIZE 8
#endif

main (argc, argv)
     int argc;
     char **argv;
{
  MP_INT dividend;
  MP_INT quotient, remainder;
  MP_INT quotient2, remainder2;
  MP_INT temp;
  mp_size dividend_size;
  mp_limb divisor;
  int i;
  int reps = 100000;

  if (argc == 2)
     reps = atoi (argv[1]);

  mpz_init (&dividend);
  mpz_init (&quotient);
  mpz_init (&remainder);
  mpz_init (&quotient2);
  mpz_init (&remainder2);
  mpz_init (&temp);

  for (i = 0; i < reps; i++)
    {
      dividend_size = urandom () % SIZE - SIZE/2;
      mpz_random2 (&dividend, dividend_size);

      divisor = urandom ();
      if (divisor == 0)
	continue;

      mpz_mdivmod_ui (&quotient, &remainder, &dividend, divisor);
      mpz_mdiv_ui (&quotient2, &dividend, divisor);
      mpz_mmod_ui (&remainder2, &dividend, divisor);

      /* First determine that the quotients and remainders computed
	 with different functions are equal.  */
      if (mpz_cmp (&quotient, &quotient2) != 0)
	dump_abort (&dividend, divisor);
      if (mpz_cmp (&remainder, &remainder2) != 0)
	dump_abort (&dividend, divisor);

      /* Check if the sign of the quotient is correct.  */
      if (mpz_cmp_ui (&quotient, 0) != 0)
	if ((mpz_cmp_ui (&quotient, 0) < 0)
	    != (mpz_cmp_ui (&dividend, 0) < 0))
	dump_abort (&dividend, divisor);

      /* Check if the remainder has the same sign as the divisor
	 (quotient rounded towards minus infinity).  */
      if (mpz_cmp_ui (&remainder, 0) != 0)
	if (mpz_cmp_ui (&remainder, 0) < 0)
	  dump_abort (&dividend, divisor);

      mpz_mul_ui (&temp, &quotient, divisor);
      mpz_add (&temp, &temp, &remainder);
      if (mpz_cmp (&temp, &dividend) != 0)
	dump_abort (&dividend, divisor);

      mpz_abs (&remainder, &remainder);
      if (mpz_cmp_ui (&remainder, divisor) >= 0)
	dump_abort (&dividend, divisor);
    }

  exit (0);
}

dump_abort (dividend, divisor)
     MP_INT *dividend;
     mp_limb divisor;
{
  fprintf (stderr, "ERROR\n");
  fprintf (stderr, "dividend = "); debug_mp (dividend, -16);
  fprintf (stderr, "divisor  = %lX\n", divisor);
  abort();
}

void
debug_mp (x, base)
     MP_INT *x;
{
  mpz_out_str (stderr, base, x); fputc ('\n', stderr);
}