14a238c70SJohn Marino /* mpfr_extract -- bit-extraction function for the binary splitting algorithm
24a238c70SJohn Marino
3*ab6d115fSJohn Marino Copyright 2000, 2001, 2002, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 Free Software Foundation, Inc.
4*ab6d115fSJohn Marino Contributed by the AriC and Caramel projects, INRIA.
54a238c70SJohn Marino
64a238c70SJohn Marino This file is part of the GNU MPFR Library.
74a238c70SJohn Marino
84a238c70SJohn Marino The GNU MPFR Library is free software; you can redistribute it and/or modify
94a238c70SJohn Marino it under the terms of the GNU Lesser General Public License as published by
104a238c70SJohn Marino the Free Software Foundation; either version 3 of the License, or (at your
114a238c70SJohn Marino option) any later version.
124a238c70SJohn Marino
134a238c70SJohn Marino The GNU MPFR Library is distributed in the hope that it will be useful, but
144a238c70SJohn Marino WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
154a238c70SJohn Marino or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
164a238c70SJohn Marino License for more details.
174a238c70SJohn Marino
184a238c70SJohn Marino You should have received a copy of the GNU Lesser General Public License
194a238c70SJohn Marino along with the GNU MPFR Library; see the file COPYING.LESSER. If not, see
204a238c70SJohn Marino http://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc.,
214a238c70SJohn Marino 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */
224a238c70SJohn Marino
234a238c70SJohn Marino #include "mpfr-impl.h"
244a238c70SJohn Marino
254a238c70SJohn Marino /* given 0 <= |p| < 1, this function extracts limbs of p and puts them in y.
264a238c70SJohn Marino It is mainly designed for the "binary splitting" algorithm.
274a238c70SJohn Marino
284a238c70SJohn Marino More precisely, if B = 2^GMP_NUMB_BITS:
294a238c70SJohn Marino - for i=0, y = floor(p * B)
304a238c70SJohn Marino - for i>0, y = (p * B^(2^i)) mod B^(2^(i-1))
314a238c70SJohn Marino */
324a238c70SJohn Marino
334a238c70SJohn Marino void
mpfr_extract(mpz_ptr y,mpfr_srcptr p,unsigned int i)344a238c70SJohn Marino mpfr_extract (mpz_ptr y, mpfr_srcptr p, unsigned int i)
354a238c70SJohn Marino {
364a238c70SJohn Marino unsigned long two_i = 1UL << i;
374a238c70SJohn Marino unsigned long two_i_2 = i ? two_i / 2 : 1;
384a238c70SJohn Marino mp_size_t size_p = MPFR_LIMB_SIZE (p);
394a238c70SJohn Marino
404a238c70SJohn Marino /* as 0 <= |p| < 1, we don't have to care with infinities, NaN, ... */
414a238c70SJohn Marino MPFR_ASSERTD (!MPFR_IS_SINGULAR (p));
424a238c70SJohn Marino
434a238c70SJohn Marino _mpz_realloc (y, two_i_2);
444a238c70SJohn Marino if ((mpfr_uexp_t) size_p < two_i)
454a238c70SJohn Marino {
464a238c70SJohn Marino MPN_ZERO (PTR(y), two_i_2);
474a238c70SJohn Marino if ((mpfr_uexp_t) size_p >= two_i_2)
484a238c70SJohn Marino MPN_COPY (PTR(y) + two_i - size_p, MPFR_MANT(p), size_p - two_i_2);
494a238c70SJohn Marino }
504a238c70SJohn Marino else
514a238c70SJohn Marino MPN_COPY (PTR(y), MPFR_MANT(p) + size_p - two_i, two_i_2);
524a238c70SJohn Marino
534a238c70SJohn Marino MPN_NORMALIZE (PTR(y), two_i_2);
544a238c70SJohn Marino SIZ(y) = (MPFR_IS_NEG (p)) ? -two_i_2 : two_i_2;
554a238c70SJohn Marino }
56