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
|
#include <stddef.h>
#include <limits.h>
#include <stdint.h>
#include <stdbool.h>
#include "test.h"
typedef uint32_t uint32;
#define SIZEOF_LONG 8
const uint8_t pg_leftmost_one_pos[256] = {
0, 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7
};
static inline int
pg_leftmost_one_pos32(uint32 word)
{
#ifdef HAVE__BUILTIN_CLZ
return 31 - __builtin_clz(word);
#elif defined(_MSC_VER)
unsigned long result;
bool non_zero;
non_zero = _BitScanReverse(&result, word);
return (int) result;
#else
int shift = 32 - 8;
while ((word >> shift) == 0)
shift -= 8;
return shift + pg_leftmost_one_pos[(word >> shift) & 255];
#endif /* HAVE__BUILTIN_CLZ */
}
static inline uint32
pg_ceil_log2_32(uint32 num)
{
if (num < 2)
return 0;
else
return pg_leftmost_one_pos32(num - 1) + 1;
}
static inline int pg_leftmost_one_pos64(uint64_t word)
{
int shift = 64 - 8;
while ((word >> shift) == 0) {
shift -= 8;
}
int pos = shift + pg_leftmost_one_pos[(word >> shift) & 255];
printf("======%u\n", pos);
return pos;
}
static inline int pg_ceil_log2_64(uint64_t num)
{
if (num < 2)
return 0;
else
return pg_leftmost_one_pos64(num - 1) + 1;
}
static int my_log2(long num)
{
if (num > LONG_MAX / 2)
num = LONG_MAX / 2;
#if SIZEOF_LONG < 8
return pg_ceil_log2_32(num);
#else
return pg_ceil_log2_64(num);
#endif
}
static int next_pow2_int(long num)
{
if (num > INT_MAX / 2)
num = INT_MAX / 2;
int log2 = my_log2(num);
return 1 << log2;
}
int main()
{
long test_values[] = {1, 2, 3, 536870912, LONG_MAX};
printf("Size of long: %zu SIZEOF_LONG: %zu \n", sizeof(long), SIZEOF_LONG);
for (int i = 0; i < sizeof(test_values) / sizeof(test_values[0]); ++i) {
printf("Input: %ld, next_pow2_int: %d\n", test_values[i], next_pow2_int(test_values[i]));
if (i == 0)
ASSERT(1, next_pow2_int(test_values[i]) );
else if (i == 1)
ASSERT(2, next_pow2_int(test_values[i]) );
else if (i == 2)
ASSERT(4, next_pow2_int(test_values[i]) );
else if (i == 3)
ASSERT(536870912, next_pow2_int(test_values[i]) );
else if (i == 4)
ASSERT(1073741824, next_pow2_int(test_values[i]) );
}
return 0;
}
|
