blob: 9f94898e0610e2d1552e4c9c4b0761b35cb48163 (
plain)
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
|
/* integer_length - find most significant bit in an unsigned integer.
Copyright (C) 2011-2015 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* Written by Bruno Haible <bruno@clisp.org>, 2011. */
#ifndef _INTEGER_LENGTH_H
#define _INTEGER_LENGTH_H
#ifdef __cplusplus
extern "C" {
#endif
/* These functions return the minimum number of bits required to represent
the given unsigned integer.
For non-zero values, this is the position of the most significant bit
that is set, plus one. For zero, it is 0. */
/* Returns the integer length of x.
The result is >= 0, <= sizeof (unsigned int) * CHAR_BIT. */
extern int integer_length (unsigned int x);
/* Returns the integer length of x.
The result is >= 0, <= sizeof (unsigned long) * CHAR_BIT. */
extern int integer_length_l (unsigned long x);
#if HAVE_UNSIGNED_LONG_LONG_INT
/* Returns the integer length of x.
The result is >= 0, <= sizeof (unsigned long long) * CHAR_BIT. */
extern int integer_length_ll (unsigned long long x);
#endif
#ifdef __cplusplus
}
#endif
#endif /* _INTEGER_LENGTH_H */
|
