xref: /dflybsd-src/contrib/gmp/mpz/divis_ui.c (revision 86d7f5d305c6adaa56ff4582ece9859d73106103)
186d7f5d3SJohn Marino /* mpz_divisible_ui_p -- mpz by ulong divisibility test.
286d7f5d3SJohn Marino 
386d7f5d3SJohn Marino Copyright 2000, 2001, 2002 Free Software Foundation, Inc.
486d7f5d3SJohn Marino 
586d7f5d3SJohn Marino This file is part of the GNU MP Library.
686d7f5d3SJohn Marino 
786d7f5d3SJohn Marino The GNU MP Library is free software; you can redistribute it and/or modify
886d7f5d3SJohn Marino it under the terms of the GNU Lesser General Public License as published by
986d7f5d3SJohn Marino the Free Software Foundation; either version 3 of the License, or (at your
1086d7f5d3SJohn Marino option) any later version.
1186d7f5d3SJohn Marino 
1286d7f5d3SJohn Marino The GNU MP Library is distributed in the hope that it will be useful, but
1386d7f5d3SJohn Marino WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
1486d7f5d3SJohn Marino or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
1586d7f5d3SJohn Marino License for more details.
1686d7f5d3SJohn Marino 
1786d7f5d3SJohn Marino You should have received a copy of the GNU Lesser General Public License
1886d7f5d3SJohn Marino along with the GNU MP Library.  If not, see http://www.gnu.org/licenses/.  */
1986d7f5d3SJohn Marino 
2086d7f5d3SJohn Marino #include "gmp.h"
2186d7f5d3SJohn Marino #include "gmp-impl.h"
2286d7f5d3SJohn Marino #include "longlong.h"
2386d7f5d3SJohn Marino 
2486d7f5d3SJohn Marino 
2586d7f5d3SJohn Marino int
mpz_divisible_ui_p(mpz_srcptr a,unsigned long d)2686d7f5d3SJohn Marino mpz_divisible_ui_p (mpz_srcptr a, unsigned long d)
2786d7f5d3SJohn Marino {
2886d7f5d3SJohn Marino   mp_size_t  asize;
2986d7f5d3SJohn Marino   mp_ptr     ap;
3086d7f5d3SJohn Marino   unsigned   twos;
3186d7f5d3SJohn Marino 
3286d7f5d3SJohn Marino   asize = SIZ(a);
3386d7f5d3SJohn Marino   if (UNLIKELY (d == 0))
3486d7f5d3SJohn Marino     return (asize == 0);
3586d7f5d3SJohn Marino 
3686d7f5d3SJohn Marino   if (asize == 0)  /* 0 divisible by any d */
3786d7f5d3SJohn Marino     return 1;
3886d7f5d3SJohn Marino 
3986d7f5d3SJohn Marino   /* For nails don't try to be clever if d is bigger than a limb, just fake
4086d7f5d3SJohn Marino      up an mpz_t and go to the main mpz_divisible_p.  */
4186d7f5d3SJohn Marino   if (d > GMP_NUMB_MAX)
4286d7f5d3SJohn Marino     {
4386d7f5d3SJohn Marino       mp_limb_t  dlimbs[2];
4486d7f5d3SJohn Marino       mpz_t      dz;
4586d7f5d3SJohn Marino       ALLOC(dz) = 2;
4686d7f5d3SJohn Marino       PTR(dz) = dlimbs;
4786d7f5d3SJohn Marino       mpz_set_ui (dz, d);
4886d7f5d3SJohn Marino       return mpz_divisible_p (a, dz);
4986d7f5d3SJohn Marino     }
5086d7f5d3SJohn Marino 
5186d7f5d3SJohn Marino   ap = PTR(a);
5286d7f5d3SJohn Marino   asize = ABS(asize);  /* ignore sign of a */
5386d7f5d3SJohn Marino 
5486d7f5d3SJohn Marino   if (ABOVE_THRESHOLD (asize, BMOD_1_TO_MOD_1_THRESHOLD))
5586d7f5d3SJohn Marino     return mpn_mod_1 (ap, asize, (mp_limb_t) d) == 0;
5686d7f5d3SJohn Marino 
5786d7f5d3SJohn Marino   if (! (d & 1))
5886d7f5d3SJohn Marino     {
5986d7f5d3SJohn Marino       /* Strip low zero bits to get odd d required by modexact.  If d==e*2^n
6086d7f5d3SJohn Marino          and a is divisible by 2^n and by e, then it's divisible by d. */
6186d7f5d3SJohn Marino 
6286d7f5d3SJohn Marino       if ((ap[0] & LOW_ZEROS_MASK (d)) != 0)
6386d7f5d3SJohn Marino         return 0;
6486d7f5d3SJohn Marino 
6586d7f5d3SJohn Marino       count_trailing_zeros (twos, (mp_limb_t) d);
6686d7f5d3SJohn Marino       d >>= twos;
6786d7f5d3SJohn Marino     }
6886d7f5d3SJohn Marino 
6986d7f5d3SJohn Marino   return mpn_modexact_1_odd (ap, asize, (mp_limb_t) d) == 0;
7086d7f5d3SJohn Marino }
71