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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
|
#include <bit/bit.h>
#include <stdio.h>
#include <inttypes.h>
#include <assert.h>
#include <stdlib.h>
#include "unit.h"
static uint64_t vals[] = {
0UL, 1UL, 2UL, 32768UL, 65535UL, 65536UL, 726075912UL, 858993459UL,
1073741824UL, 1245250552UL, 1431655765UL, 1656977767UL, 2147483648UL,
2283114629UL, 2502548245UL, 4294967295UL, 708915120906848425UL,
1960191741125985428UL, 3689348814741910323UL, 5578377670650038654UL,
9223372036854775808UL, 10755112315580060033UL, 11163782031541429823UL,
13903686156871869732UL, 14237897302422917095UL, 14302190498657618739UL,
15766411510232741269UL, 15984546468465238145UL, 18446744073709551615UL
};
static void
test_ctz_clz(void)
{
header();
for (size_t i = 0; i < sizeof(vals) / sizeof(vals[0]); i++) {
if (vals[i] == 0)
continue;
uint64_t val64 = vals[i];
uint32_t val32 = (uint32_t) vals[i];
printf("bit_ctz_u64(%" PRIu64 ") => %d\n", val64,
bit_ctz_u64(val64));
printf("bit_clz_u64(%" PRIu64 ") => %d\n", val64,
bit_clz_u64(val64));
if (vals[i] > UINT32_MAX)
continue;
printf("bit_ctz_u32(%" PRIu32 ") => %d\n", val32,
bit_ctz_u32(val32));
printf("bit_clz_u32(%" PRIu32 ") => %d\n", val32,
bit_clz_u32(val32));
}
footer();
}
static void
test_count(void)
{
header();
for (size_t i = 0; i < sizeof(vals) / sizeof(vals[0]); i++) {
uint64_t val64 = vals[i];
uint32_t val32 = (uint32_t) vals[i];
printf("bit_count_u64(%" PRIu64 ") => %d\n", val64,
bit_count_u64(val64));
if (vals[i] > UINT32_MAX)
continue;
printf("bit_count_u32(%" PRIu32 ") => %d\n", val32,
bit_count_u32(val32));
}
footer();
}
static void
test_rotl_rotr_one(int rot)
{
for (size_t i = 0; i < sizeof(vals) / sizeof(vals[0]); i++) {
uint64_t val64 = vals[i];
uint32_t val32 = (uint32_t) vals[i];
printf("bit_rotl_u64(%" PRIu64 ", %d) => %" PRIu64 "\n",
val64, rot, bit_rotl_u64(val64, rot));
printf("bit_rotr_u64(%" PRIu64 ", %d) => %" PRIu64 "\n",
val64, rot, bit_rotr_u64(val64, rot));
if (vals[i] > UINT32_MAX || rot > 32)
continue;
printf("bit_rotl_u32(%" PRIu32 ", %d) => %" PRIu32 "\n",
val32, rot, bit_rotl_u32(val32, rot));
printf("bit_rotr_u32(%" PRIu32 ", %d) => %" PRIu32 "\n",
val32, rot, bit_rotr_u32(val32, rot));
}
}
static void
test_rotl_rotr(void)
{
header();
int rots[] = { 0, 1, 15, 16, 31, 32, 63, 64 };
for (unsigned r = 0; r < sizeof(rots) / sizeof(rots[0]); r++) {
test_rotl_rotr_one(rots[r]);
}
footer();
}
static void
test_bswap(void)
{
header();
for (size_t i = 0; i < sizeof(vals) / sizeof(vals[0]); i++) {
uint64_t val64 = vals[i];
uint32_t val32 = (uint32_t) vals[i];
printf("bswap_u64(%" PRIu64 ") => %" PRIu64 "\n", val64,
bswap_u64(val64));
if (vals[i] > UINT32_MAX)
continue;
printf("bswap_u32(%" PRIu32 ") => %" PRIu32 "\n", val32,
bswap_u32(val32));
}
footer();
}
static inline void
test_index_print(const int *start, const int *end)
{
for (const int *cur = start; cur < end; cur++) {
printf("%d ", *cur);
}
}
static void
test_index(void)
{
header();
int indexes[sizeof(int64_t) * CHAR_BIT + 1];
for (size_t i = 0; i < sizeof(vals) / sizeof(vals[0]); i++) {
uint64_t val64 = vals[i];
uint32_t val32 = (uint32_t) vals[i];
printf("bit_index_u64(%" PRIu64 ", *, -1) => ", val64);
test_index_print(indexes, bit_index_u64(val64, indexes, -1));
printf("\n");
if (vals[i] > UINT32_MAX)
continue;
printf("bit_index_u32(%" PRIu32 ", *, -1) => ", val32);
test_index_print(indexes, bit_index_u32(val32, indexes, -1));
printf("\n");
}
footer();
}
static void
test_bit_iter(void)
{
header();
struct bit_iterator it;
uint64_t *data = vals + 6;
size_t size = 10;
size_t pos = 0;
printf("Set: ");
bit_iterator_init(&it, data, size, true);
while ( (pos = bit_iterator_next(&it)) != SIZE_MAX) {
printf("%zu, ", pos);
fail_unless(bit_test(data, pos));
}
printf("\n");
printf("Clear: ");
bit_iterator_init(&it, data, size, false);
while ( (pos = bit_iterator_next(&it)) != SIZE_MAX) {
printf("%zu, ", pos);
fail_if(bit_test(data, pos));
}
printf("\n");
footer();
}
static void
test_bit_iter_empty(void)
{
header();
struct bit_iterator it;
bit_iterator_init(&it, NULL, 0, true);
fail_unless(bit_iterator_next(&it) == SIZE_MAX);
bit_iterator_init(&it, NULL, 0, false);
fail_unless(bit_iterator_next(&it) == SIZE_MAX);
footer();
}
int
main(void)
{
test_ctz_clz();
test_count();
test_rotl_rotr();
test_bswap();
test_index();
test_bit_iter();
test_bit_iter_empty();
}
|
