Return to cdiv_qr_ui.c CVS log

Up to [local] / OpenXM_contrib / gmp / mpz

Annotation of OpenXM_contrib/gmp/mpz/cdiv_qr_ui.c, Revision 1.1.1.3

1.1       maekawa     1: /* mpz_cdiv_qr_ui -- Division rounding the quotient towards +infinity.  The
                      2:    remainder gets the opposite sign as the denominator.  In order to make it
                      3:    always fit into the return type, the negative of the true remainder is
                      4:    returned.
                      5:
1.1.1.3 ! ohara       6: Copyright 1994, 1995, 1996, 1999, 2001, 2002 Free Software Foundation, Inc.
1.1       maekawa     7:
                      8: This file is part of the GNU MP Library.
                      9:
                     10: The GNU MP Library is free software; you can redistribute it and/or modify
1.1.1.2   maekawa    11: it under the terms of the GNU Lesser General Public License as published by
                     12: the Free Software Foundation; either version 2.1 of the License, or (at your
1.1       maekawa    13: option) any later version.
                     14:
                     15: The GNU MP Library is distributed in the hope that it will be useful, but
                     16: WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
1.1.1.2   maekawa    17: or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
1.1       maekawa    18: License for more details.
                     19:
1.1.1.2   maekawa    20: You should have received a copy of the GNU Lesser General Public License
1.1       maekawa    21: along with the GNU MP Library; see the file COPYING.LIB.  If not, write to
                     22: the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
                     23: MA 02111-1307, USA. */
                     24:
                     25: #include "gmp.h"
                     26: #include "gmp-impl.h"
                     27:
                     28: unsigned long int
                     29: mpz_cdiv_qr_ui (mpz_ptr quot, mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor)
                     30: {
1.1.1.3 ! ohara      31:   mp_size_t ns, nn, qn;
        !            32:   mp_ptr np, qp;
        !            33:   mp_limb_t rl;
1.1       maekawa    34:
1.1.1.2   maekawa    35:   if (divisor == 0)
                     36:     DIVIDE_BY_ZERO;
                     37:
1.1.1.3 ! ohara      38:   ns = SIZ(dividend);
        !            39:   if (ns == 0)
1.1       maekawa    40:     {
1.1.1.3 ! ohara      41:       SIZ(quot) = 0;
        !            42:       SIZ(rem) = 0;
        !            43:       return 0;
1.1       maekawa    44:     }
                     45:
1.1.1.3 ! ohara      46:   nn = ABS(ns);
        !            47:   MPZ_REALLOC (quot, nn);
        !            48:   qp = PTR(quot);
        !            49:   np = PTR(dividend);
1.1       maekawa    50:
1.1.1.3 ! ohara      51: #if GMP_NAIL_BITS != 0
        !            52:   if (divisor > GMP_NUMB_MAX)
        !            53:     {
        !            54:       mp_limb_t dp[2];
        !            55:       mp_ptr rp;
        !            56:       mp_size_t rn;
        !            57:
        !            58:       MPZ_REALLOC (rem, 2);
        !            59:       rp = PTR(rem);
        !            60:
        !            61:       if (nn == 1)             /* tdiv_qr requirements; tested above for 0 */
        !            62:        {
        !            63:          qp[0] = 0;
        !            64:          qn = 1;               /* a white lie, fixed below */
        !            65:          rl = np[0];
        !            66:          rp[0] = rl;
        !            67:        }
        !            68:       else
        !            69:        {
        !            70:          dp[0] = divisor & GMP_NUMB_MASK;
        !            71:          dp[1] = divisor >> GMP_NUMB_BITS;
        !            72:          mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
        !            73:          rl = rp[0] + (rp[1] << GMP_NUMB_BITS);
        !            74:          qn = nn - 2 + 1;
        !            75:        }
        !            76:
        !            77:       if (rl != 0 && ns >= 0)
        !            78:        {
        !            79:          mpn_incr_u (qp, (mp_limb_t) 1);
        !            80:          rl = divisor - rl;
        !            81:          rp[0] = rl & GMP_NUMB_MASK;
        !            82:          rp[1] = rl >> GMP_NUMB_BITS;
        !            83:        }
        !            84:
        !            85:       qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
        !            86:       rn = 1 + (rl > GMP_NUMB_MAX);  rn -= (rp[rn - 1] == 0);
        !            87:       SIZ(rem) = -rn;
        !            88:     }
        !            89:   else
        !            90: #endif
        !            91:     {
        !            92:       rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
        !            93:       if (rl == 0)
        !            94:        SIZ(rem) = 0;
        !            95:       else
        !            96:        {
        !            97:          if (ns >= 0)
        !            98:            {
        !            99:              mpn_incr_u (qp, (mp_limb_t) 1);
        !           100:              rl = divisor - rl;
        !           101:            }
        !           102:
        !           103:          PTR(rem)[0] = rl;
        !           104:          SIZ(rem) = -(rl != 0);
        !           105:        }
        !           106:       qn = nn - (qp[nn - 1] == 0);
        !           107:     }
1.1       maekawa   108:
1.1.1.3 ! ohara     109:   SIZ(quot) = ns >= 0 ? qn : -qn;
        !           110:   return rl;
1.1       maekawa   111: }