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
237
238
239
240
241
242
243
244
245
246
247
248
|
#define PK_IMPL_ITER
#define PK_IMPL_MEM
#define PK_IMPL_ARR
#include <cstring>
#include <utility>
#include "../pkarr.h"
// TODO might be able to define a "test" class that inherits from a given
// `pk_arr_t<T>` to make some of this testing more streamlined.
// Spinup in ctor, check bkt in dtor, log fn calls, etc.
void
test_spinup(struct pk_membucket **bkt)
{
*bkt = pk_mem_bucket_create("test", 1024 * 1024, PK_MEMBUCKET_FLAG_NONE);
}
void
test_teardown(struct pk_membucket **bkt)
{
pk_mem_bucket_destroy(*bkt);
*bkt = NULL;
}
int main(int argc, char *argv[])
{
(void)argc;
(void)argv;
struct pk_membucket *bkt = {};
uint8_t val1 = 69;
uint8_t val2 = 117;
/* template
{
test_spinup(&bkt);
test_teardown(&arr, &bkt);
}
*/
fprintf(stdout, "[%s] Begin\n\n", __FILE__);
fprintf(stdout, "[%s] Starting append test\n", __FILE__);
test_spinup(&bkt);
{
pk_arr_t<uint8_t> arr(bkt);
uint8_t c = 255;
pk_arr_append_t(&arr, c);
if (arr.bkt == NULL) exit(1);
if (arr.data == NULL) exit(1);
if (arr.reserved == 0) exit(1);
if (arr.stride != sizeof(uint8_t)) exit(1);
if (arr.alignment != alignof(uint8_t)) exit(1);
if (arr.next != 1) exit(1);
if (arr[0] != c) exit(1);
fprintf(stdout, "[%s] parameterized bkt ctor + operator[]\n", __FILE__);
pk_arr_reset(&arr);
}
if (bkt->alloc_count != 0) exit(1);
fprintf(stdout, "[%s] dtor called.\n", __FILE__);
fprintf(stdout, "[%s] Ending append test\n\n", __FILE__);
test_teardown(&bkt);
// copy ctor
fprintf(stdout, "[%s] Starting copy ctor test\n", __FILE__);
test_spinup(&bkt);
{
pk_arr_t<uint8_t> arr1(bkt);
pk_arr_append_t(&arr1, val1);
// copy
pk_arr_t<uint8_t> arr2{arr1};
if (arr1[0] != val1) exit(1);
if (arr2[0] != val1) exit(1);
pk_arr_reset(&arr1);
pk_arr_reset(&arr2);
}
if (bkt->alloc_count != 0) exit(1);
fprintf(stdout, "[%s] dtor called.\n", __FILE__);
fprintf(stdout, "[%s] Ending copy ctor test\n\n", __FILE__);
test_teardown(&bkt);
// move ctor
fprintf(stdout, "[%s] Starting move ctor test\n", __FILE__);
test_spinup(&bkt);
{
pk_arr_t<uint8_t> arr1(bkt);
pk_arr_append_t(&arr1, val1);
// move
pk_arr_t<uint8_t> arr2{std::move(arr1)};
// if (arr1[0] == val1) exit(1);
if (arr2[0] != val1) exit(1);
pk_arr_reset(&arr1);
pk_arr_reset(&arr2);
}
if (bkt->alloc_count != 0) exit(1);
fprintf(stdout, "[%s] dtor called.\n", __FILE__);
fprintf(stdout, "[%s] Ending move ctor test\n\n", __FILE__);
test_teardown(&bkt);
// copy assignment
fprintf(stdout, "[%s] Starting copy assignment test\n", __FILE__);
test_spinup(&bkt);
{
pk_arr_t<uint8_t> arr1(bkt);
pk_arr_append_t(&arr1, val1);
pk_arr_t<uint8_t> arr2(bkt);
pk_arr_append_t(&arr2, val2);
// copy
arr1 = arr2;
if (arr1[0] != val2) exit(1);
if (arr2[0] != val2) exit(1);
pk_arr_reset(&arr1);
pk_arr_reset(&arr2);
}
if (bkt->alloc_count != 0) exit(1);
fprintf(stdout, "[%s] dtor called.\n", __FILE__);
fprintf(stdout, "[%s] Ending copy assignment test\n\n", __FILE__);
test_teardown(&bkt);
// move assignment
fprintf(stdout, "[%s] Starting move assignment test\n", __FILE__);
test_spinup(&bkt);
{
pk_arr_t<uint8_t> arr1(bkt);
pk_arr_append_t(&arr1, val1);
pk_arr_t<uint8_t> arr2(bkt);
pk_arr_append_t(&arr2, val2);
// move
arr1 = std::move(arr2);
if (arr1[0] != val2) exit(1);
// if (arr2[0] != val1) exit(1);
pk_arr_reset(&arr1);
pk_arr_reset(&arr2);
}
if (bkt->alloc_count != 0) exit(1);
fprintf(stdout, "[%s] dtor called.\n", __FILE__);
fprintf(stdout, "[%s] Ending move assignment test\n\n", __FILE__);
test_teardown(&bkt);
test_spinup(&bkt);
fprintf(stdout, "[%s] Starting iter forward test\n", __FILE__);
{
bool res;
uint8_t u, u2;
pk_arr_t<uint8_t> arr(bkt);
for (u = 4; u > 0; --u) {
u2 = u - 1;
pk_arr_append_t(&arr, u2);
}
struct pk_iter_t<uint8_t> it;
res = pk_arr_iter_begin(&arr, &it);
if (res == false) exit(1);
if (it.id.arr.i != 0) exit(1);
if (it != 3) exit(1);
PK_LOGV_INF("iter.data: %p iter.val: %i\n", it.data, *(uint8_t*)it.data);
res = pk_arr_iter_increment(&arr, &it);
if (res == false) exit(1);
if (it.id.arr.i != 1) exit(1);
if (it != 2) exit(1);
PK_LOGV_INF("iter.data: %p iter.val: %i\n", it.data, *(uint8_t*)it.data);
res = pk_arr_iter_increment(&arr, &it);
if (res == false) exit(1);
if (it.id.arr.i != 2) exit(1);
if (it != 1) exit(1);
PK_LOGV_INF("iter.data: %p iter.val: %i\n", it.data, *(uint8_t*)it.data);
res = pk_arr_iter_increment(&arr, &it);
if (res == false) exit(1);
if (it.id.arr.i != 3) exit(1);
if (it != 0) exit(1);
PK_LOGV_INF("iter.data: %p iter.val: %i\n", it.data, *(uint8_t*)it.data);
res = pk_arr_iter_increment(&arr, &it);
if (res == true) exit(1);
}
fprintf(stdout, "[%s] Ending iter forward test\n\n", __FILE__);
test_teardown(&bkt);
test_spinup(&bkt);
fprintf(stdout, "[%s] Starting iter reverse test\n", __FILE__);
{
bool res;
uint8_t u, u2;
pk_arr_t<uint8_t> arr(bkt);
for (u = 4; u > 0; --u) {
u2 = u - 1;
pk_arr_append_t(&arr, u2);
}
struct pk_iter_t<uint8_t> it;
res = pk_arr_iter_end(&arr, &it);
if (res == false) exit(1);
if (it.id.arr.i != 3) exit(1);
if (it != 0) exit(1);
PK_LOGV_INF("iter.data: %p iter.val: %i\n", it.data, *(uint8_t*)it.data);
res = pk_arr_iter_decrement(&arr, &it);
if (res == false) exit(1);
if (it.id.arr.i != 2) exit(1);
if (it != 1) exit(1);
PK_LOGV_INF("iter.data: %p iter.val: %i\n", it.data, *(uint8_t*)it.data);
res = pk_arr_iter_decrement(&arr, &it);
if (res == false) exit(1);
if (it.id.arr.i != 1) exit(1);
if (it != 2) exit(1);
PK_LOGV_INF("iter.data: %p iter.val: %i\n", it.data, *(uint8_t*)it.data);
res = pk_arr_iter_decrement(&arr, &it);
if (res == false) exit(1);
if (it.id.arr.i != 0) exit(1);
if (it != 3) exit(1);
PK_LOGV_INF("iter.data: %p iter.val: %i\n", it.data, *(uint8_t*)it.data);
res = pk_arr_iter_decrement(&arr, &it);
if (res == true) exit(1);
}
fprintf(stdout, "[%s] Ending iter reverse test\n\n", __FILE__);
test_teardown(&bkt);
fprintf(stdout, "[%s] End\n", __FILE__);
return 0;
}
|
