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
|
/* mpfr_min_prec -- minimal size in bits to hold the mantissa
Copyright 2009, 2010 Free Software Foundation, Inc.
Contributed by the Arenaire and Caramel projects, INRIA.
This file is part of the GNU MPFR Library.
The GNU MPFR Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
The GNU MPFR 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 Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the GNU MPFR Library; see the file COPYING.LESSER. If not, see
http://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc.,
51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */
#include "mpfr-impl.h"
mpfr_prec_t
mpfr_min_prec (mpfr_srcptr x)
{
mp_limb_t *mx;
mpfr_prec_t px, res;
mp_size_t n;
int i;
if (MPFR_UNLIKELY (MPFR_IS_SINGULAR (x)))
return 0;
mx = MPFR_MANT (x);
px = MPFR_PREC (x);
res = 0;
/* Count full limbs set to zero */
for (n = 0; mx[n] == 0; n++)
{
res += GMP_NUMB_BITS;
}
i = 0;
/* mx[n] is now the first limb which is not null. Count number
* of null bits in mx[n], from the right */
while ((mx[n] & (MPFR_LIMB_ONE << i)) == 0)
i++;
res += i;
/* If we have trailing zero bits because the precision
* is not a multiple of GMP_NUMB_BITS, we must not count
* those. */
i = px % GMP_NUMB_BITS;
if (i != 0)
res -= GMP_NUMB_BITS - i;
return px - res;
}
|
