1  /* Test mpz_abs, mpz_add, mpz_cmp, mpz_cmp_ui, mpz_fdiv_qr, mpz_fdiv_q,
       2     mpz_fdiv_r, mpz_mul.
       3  
       4  Copyright 1993, 1994, 1996, 2000, 2001 Free Software Foundation, Inc.
       5  
       6  This file is part of the GNU MP Library test suite.
       7  
       8  The GNU MP Library test suite is free software; you can redistribute it
       9  and/or modify it under the terms of the GNU General Public License as
      10  published by the Free Software Foundation; either version 3 of the License,
      11  or (at your option) any later version.
      12  
      13  The GNU MP Library test suite is distributed in the hope that it will be
      14  useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
      15  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General
      16  Public License for more details.
      17  
      18  You should have received a copy of the GNU General Public License along with
      19  the GNU MP Library test suite.  If not, see https://www.gnu.org/licenses/.  */
      20  
      21  #include <stdio.h>
      22  #include <stdlib.h>
      23  
      24  #include "gmp-impl.h"
      25  #include "tests.h"
      26  
      27  void dump_abort (mpz_t, mpz_t);
      28  void debug_mp (mpz_t, int);
      29  
      30  int
      31  main (int argc, char **argv)
      32  {
      33    mpz_t dividend, divisor;
      34    mpz_t quotient, remainder;
      35    mpz_t quotient2, remainder2;
      36    mpz_t temp;
      37    mp_size_t dividend_size, divisor_size;
      38    int i;
      39    int reps = 1000;
      40    gmp_randstate_ptr rands;
      41    mpz_t bs;
      42    unsigned long bsi, size_range;
      43  
      44    tests_start ();
      45    rands = RANDS;
      46  
      47    mpz_init (bs);
      48  
      49    if (argc == 2)
      50       reps = atoi (argv[1]);
      51  
      52    mpz_init (dividend);
      53    mpz_init (divisor);
      54    mpz_init (quotient);
      55    mpz_init (remainder);
      56    mpz_init (quotient2);
      57    mpz_init (remainder2);
      58    mpz_init (temp);
      59  
      60    for (i = 0; i < reps; i++)
      61      {
      62        mpz_urandomb (bs, rands, 32);
      63        size_range = mpz_get_ui (bs) % 16 + 2; /* 0..131071 bit operands */
      64  
      65        do
      66  	{
      67  	  mpz_urandomb (bs, rands, size_range);
      68  	  divisor_size = mpz_get_ui (bs);
      69  	  mpz_rrandomb (divisor, rands, divisor_size);
      70  	}
      71        while (mpz_sgn (divisor) == 0);
      72  
      73        mpz_urandomb (bs, rands, size_range);
      74        dividend_size = mpz_get_ui (bs) + divisor_size;
      75        mpz_rrandomb (dividend, rands, dividend_size);
      76  
      77        mpz_urandomb (bs, rands, 2);
      78        bsi = mpz_get_ui (bs);
      79        if ((bsi & 1) != 0)
      80  	mpz_neg (dividend, dividend);
      81        if ((bsi & 2) != 0)
      82  	mpz_neg (divisor, divisor);
      83  
      84        /* printf ("%ld %ld\n", SIZ (dividend), SIZ (divisor)); */
      85  
      86        mpz_fdiv_qr (quotient, remainder, dividend, divisor);
      87        mpz_fdiv_q (quotient2, dividend, divisor);
      88        mpz_fdiv_r (remainder2, dividend, divisor);
      89  
      90        /* First determine that the quotients and remainders computed
      91  	 with different functions are equal.  */
      92        if (mpz_cmp (quotient, quotient2) != 0)
      93  	dump_abort (dividend, divisor);
      94        if (mpz_cmp (remainder, remainder2) != 0)
      95  	dump_abort (dividend, divisor);
      96  
      97        /* Check if the sign of the quotient is correct.  */
      98        if (mpz_cmp_ui (quotient, 0) != 0)
      99  	if ((mpz_cmp_ui (quotient, 0) < 0)
     100  	    != ((mpz_cmp_ui (dividend, 0) ^ mpz_cmp_ui (divisor, 0)) < 0))
     101  	dump_abort (dividend, divisor);
     102  
     103        /* Check if the remainder has the same sign as the divisor
     104  	 (quotient rounded towards minus infinity).  */
     105        if (mpz_cmp_ui (remainder, 0) != 0)
     106  	if ((mpz_cmp_ui (remainder, 0) < 0) != (mpz_cmp_ui (divisor, 0) < 0))
     107  	  dump_abort (dividend, divisor);
     108  
     109        mpz_mul (temp, quotient, divisor);
     110        mpz_add (temp, temp, remainder);
     111        if (mpz_cmp (temp, dividend) != 0)
     112  	dump_abort (dividend, divisor);
     113  
     114        mpz_abs (temp, divisor);
     115        mpz_abs (remainder, remainder);
     116        if (mpz_cmp (remainder, temp) >= 0)
     117  	dump_abort (dividend, divisor);
     118      }
     119  
     120    mpz_clear (bs);
     121    mpz_clear (dividend);
     122    mpz_clear (divisor);
     123    mpz_clear (quotient);
     124    mpz_clear (remainder);
     125    mpz_clear (quotient2);
     126    mpz_clear (remainder2);
     127    mpz_clear (temp);
     128  
     129    tests_end ();
     130    exit (0);
     131  }
     132  
     133  void
     134  dump_abort (mpz_t dividend, mpz_t divisor)
     135  {
     136    fprintf (stderr, "ERROR\n");
     137    fprintf (stderr, "dividend = "); debug_mp (dividend, -16);
     138    fprintf (stderr, "divisor  = "); debug_mp (divisor, -16);
     139    abort();
     140  }
     141  
     142  void
     143  debug_mp (mpz_t x, int base)
     144  {
     145    mpz_out_str (stderr, base, x); fputc ('\n', stderr);
     146  }