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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
/* mpfr_nbits_ulong -- number of significant bits in an unsigned long
mpfr_nbits_uj -- number of significant bits in an uintmax_t
Copyright 2018-2021 Free Software Foundation, Inc.
Contributed by the AriC and Caramba 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
https://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc.,
51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */
#define MPFR_NEED_LONGLONG_H /* for count_leading_zeros */
#define MPFR_NEED_INTMAX_H
#include "mpfr-impl.h"
/* count the number of significant bits of n, i.e.,
nbits(unsigned long) - count_leading_zeros (n) */
int
mpfr_nbits_ulong (unsigned long n)
{
int cnt;
MPFR_ASSERTD (n > 0);
#ifdef MPFR_LONG_WITHIN_LIMB
count_leading_zeros (cnt, (mp_limb_t) n);
cnt = GMP_NUMB_BITS - cnt;
#else
cnt = 0;
while (n >= 0x10000)
{
n >>= 16;
cnt += 16;
}
MPFR_ASSERTD (n <= 0xffff);
if (n >= 0x100)
{
n >>= 8;
cnt += 8;
}
MPFR_ASSERTD (n <= 0xff);
if (n >= 0x10)
{
n >>= 4;
cnt += 4;
}
MPFR_ASSERTD (n <= 0xf);
if (n >= 4)
{
n >>= 2;
cnt += 2;
}
MPFR_ASSERTD (n <= 3);
/* now n = 1, 2, or 3 */
cnt += 1 + (n >= 2);
#endif
MPFR_ASSERTD (cnt >= 0);
return cnt;
}
#ifdef _MPFR_H_HAVE_INTMAX_T
/* count the number of significant bits of n, i.e.,
nbits(uintmax_t) - count_leading_zeros (n) */
int
mpfr_nbits_uj (uintmax_t n)
{
int cnt;
MPFR_ASSERTD (n > 0);
cnt = 0;
while (n >= 0x10000)
{
n >>= 16;
cnt += 16;
}
MPFR_ASSERTD (n <= 0xffff);
if (n >= 0x100)
{
n >>= 8;
cnt += 8;
}
MPFR_ASSERTD (n <= 0xff);
if (n >= 0x10)
{
n >>= 4;
cnt += 4;
}
MPFR_ASSERTD (n <= 0xf);
if (n >= 4)
{
n >>= 2;
cnt += 2;
}
MPFR_ASSERTD (n <= 3);
/* now n = 1, 2, or 3 */
cnt += 1 + (n >= 2);
MPFR_ASSERTD (cnt >= 0);
return cnt;
}
#endif
|
