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
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
|
// NOTE: only intended for performance testing
#define PK_ARR_MOVE_IN_PLACE
#include "../pkarr.h"
struct some_complex_struct {
char uhh;
union {
uint8_t chr[8];
uint16_t shrt[4];
uint32_t in[2];
uint64_t lng;
};
char okay;
};
void
test_spinup(struct pk_arr *arr, struct pk_membucket **bkt)
{
memset(arr, 0, sizeof(struct pk_arr));
*bkt = pk_bucket_create("test", 1024 * 1024, false);
arr->bkt = *bkt;
}
void
test_teardown(struct pk_arr *arr, struct pk_membucket **bkt)
{
pk_bucket_destroy(*bkt);
*bkt = NULL;
arr->data = NULL;
}
bool
find_uint8(void *user_data, void *item)
{
return memcmp(user_data, item, sizeof(uint8_t)) == 0;
}
int main(int argc, char *argv[])
{
(void)argc;
(void)argv;
uint64_t i;
struct pk_arr arr = {0};
struct pk_membucket *bkt = {0};
struct some_complex_struct cmplx_strct = {0};
/* template
{
test_spinup(&arr, &bkt);
test_teardown(&arr, &bkt);
}
*/
// init via append, soft clear
{
test_spinup(&arr, &bkt);
arr.stride = sizeof(uint8_t);
arr.alignment = alignof(uint8_t);
uint8_t c = 255;
pk_arr_append(&arr, &c);
if (arr.bkt == NULL) exit(1);
if (arr.data == NULL) exit(1);
if (arr.reserved == 0) exit(1);
if (arr.next != 1) exit(1);
pk_arr_clear(&arr);
if (arr.bkt == NULL) exit(1);
if (arr.data == NULL) exit(1);
if (arr.reserved == 0) exit(1);
if (arr.next != 0) exit(1);
test_teardown(&arr, &bkt);
}
// movement
{
test_spinup(&arr, &bkt);
arr.stride = sizeof(uint64_t);
arr.alignment = alignof(uint64_t);
for (i = 0; i < 5; ++i) {
pk_arr_append(&arr, &i);
}
pk_arr_move_to_back(&arr, 2);
if (arr.bkt == NULL) exit(1);
if (arr.data == NULL) exit(1);
if (arr.reserved == 0) exit(1);
if (arr.next != 5) exit(1);
uint64_t *vals = (uint64_t *)arr.data;
if (0 != vals[0]) exit(1);
if (1 != vals[1]) exit(1);
if (3 != vals[2]) exit(1);
if (4 != vals[3]) exit(1);
if (2 != vals[4]) exit(1);
test_teardown(&arr, &bkt);
}
// complex movement
{
test_spinup(&arr, &bkt);
arr.stride = sizeof(struct some_complex_struct);
arr.alignment = alignof(struct some_complex_struct);
for (i = 0; i < 5; ++i) {
cmplx_strct.uhh = (char)i;
cmplx_strct.lng = (uint64_t)i;
cmplx_strct.okay = (char)i;
pk_arr_append(&arr, &cmplx_strct);
}
pk_arr_move_to_back(&arr, 2);
if (arr.bkt == NULL) exit(1);
if (arr.data == NULL) exit(1);
if (arr.reserved == 0) exit(1);
if (arr.next != 5) exit(1);
struct some_complex_struct *vals = (struct some_complex_struct*)arr.data;
if (0 != vals[0].lng) exit(1);
if (1 != vals[1].lng) exit(1);
if (3 != vals[2].lng) exit(1);
if (4 != vals[3].lng) exit(1);
if (2 != vals[4].lng) exit(1);
test_teardown(&arr, &bkt);
}
// resize (implicit reserve) + grow
{
test_spinup(&arr, &bkt);
arr.stride = sizeof(uint8_t);
arr.alignment = alignof(uint8_t);
pk_arr_resize(&arr, 17);
uint8_t *typed_buffer = (uint8_t *)arr.data;
if (arr.bkt == NULL) exit(1);
if (arr.data == NULL) exit(1);
if (arr.reserved != 17) exit(1);
if (arr.next != 17) exit(1);
for (i = 0; i < 17; ++i) {
typed_buffer[i] = (uint8_t)i;
}
uint8_t v = 17;
pk_arr_append(&arr, &v);
if (arr.bkt == NULL) exit(1);
if (arr.data == NULL) exit(1);
if (arr.reserved == 17) exit(1);
if (arr.next != 18) exit(1);
test_teardown(&arr, &bkt);
}
// remove_at back, middle, front
{
test_spinup(&arr, &bkt);
arr.stride = sizeof(uint64_t);
arr.alignment = alignof(uint64_t);
for (i = 0; i < 5; ++i) {
pk_arr_append(&arr, &i);
}
pk_arr_remove_at(&arr, 4); // back
if (arr.bkt == NULL) exit(1);
if (arr.data == NULL) exit(1);
if (arr.reserved == 0) exit(1);
if (arr.next != 4) exit(1);
uint64_t *vals = (uint64_t *)arr.data;
if (0 != vals[0]) exit(1);
if (1 != vals[1]) exit(1);
if (2 != vals[2]) exit(1);
if (3 != vals[3]) exit(1);
pk_arr_remove_at(&arr, 2); // middle
if (arr.bkt == NULL) exit(1);
if (arr.data == NULL) exit(1);
if (arr.reserved == 0) exit(1);
if (arr.next != 3) exit(1);
vals = (uint64_t *)arr.data;
if (0 != vals[0]) exit(1);
if (1 != vals[1]) exit(1);
if (3 != vals[2]) exit(1);
pk_arr_remove_at(&arr, 0); // front
if (arr.bkt == NULL) exit(1);
if (arr.data == NULL) exit(1);
if (arr.reserved == 0) exit(1);
if (arr.next != 2) exit(1);
vals = (uint64_t *)arr.data;
if (1 != vals[0]) exit(1);
if (3 != vals[1]) exit(1);
test_teardown(&arr, &bkt);
}
// init via append, soft clear
{
test_spinup(&arr, &bkt);
arr.stride = sizeof(uint8_t);
arr.alignment = alignof(uint8_t);
uint8_t c1 = 127;
uint8_t c2 = 128;
pk_arr_append(&arr, &c1);
i = pk_arr_find_first_index(&arr, &c1, find_uint8);
if (0 != i) exit(1);
i = pk_arr_find_first_index(&arr, &c2, find_uint8);
if (0xFFFFFFFF != i) exit(1);
test_teardown(&arr, &bkt);
}
return 0;
}
|
