-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.c
394 lines (340 loc) · 10.4 KB
/
main.c
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
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
/**
* Tony Givargis
* Copyright (C), 2023
* University of California, Irvine
*
* CS 238P - Operating Systems
* main.c
*/
#include "term.h"
#include "kvdb.h"
#define SLEN(s) ( safe_strlen(s) + 1 )
#define TEST(f, m) \
do { \
uint64_t t = ref_time(); \
if (f()) { \
t = ref_time() - t; \
term_color(TERM_COLOR_RED); \
term_bold(); \
printf("\t [FAIL] "); \
term_reset(); \
printf("%20s %6.1fs\n", (m), 1e-6*t); \
} \
else { \
t = ref_time() - t; \
term_color(TERM_COLOR_GREEN); \
term_bold(); \
printf("\t [PASS] "); \
term_reset(); \
printf("%20s %6.1fs\n", (m), 1e-6*t); \
} \
} while (0)
static const char *PATHNAME;
static void
mk_object(char *key,
char *val,
uint64_t key_len,
uint64_t val_len,
uint64_t *key_len_,
uint64_t *val_len_,
uint64_t i,
char code) {
const uint64_t MIN_LEN = 16;
char key_[16], val_[16];
uint64_t j, h;
assert(MIN_LEN < key_len);
assert(MIN_LEN < val_len);
srand((int) i + 100);
h = ((uint64_t) rand() << 32) + (uint64_t) rand();
(*key_len_) = MIN_LEN + (h % (key_len - MIN_LEN));
(*val_len_) = MIN_LEN + (h % (val_len - MIN_LEN));
for (j = 0; j < (*key_len_); ++j) {
key[j] = (char) (h % 256);
}
for (j = 0; j < (*val_len_); ++j) {
val[j] = (char) (h % 256);
}
safe_sprintf(key_, MIN_LEN, "k%lu", (unsigned long) i);
safe_sprintf(val_, MIN_LEN, "%c%lu", code, (unsigned long) i);
memmove(key + (*key_len_) - MIN_LEN, key_, safe_strlen(key_));
memmove(val + (*val_len_) - MIN_LEN, val_, safe_strlen(val_));
}
static int
read_write(const uint64_t N, const uint64_t K, const uint64_t V) {
uint64_t i, j, key_len, val_len, val_len_;
void *key, *val, *val_;
struct kvdb *kvdb;
key = val = val_ = NULL;
if (!(kvdb = kvdb_open(PATHNAME))) {
TRACE(0);
return -1;
}
if (!(key = malloc(K)) || !(val = malloc(V)) || !(val_ = malloc(V))) {
kvdb_close(kvdb);
FREE(key);
FREE(val);
FREE(val_);
TRACE("out of memory");
return -1;
}
/* insert */
for (i = 0; i < N; ++i) {
mk_object(key, val, K, V, &key_len, &val_len, i, 'i');
val_len_ = V;
if (kvdb_insert(kvdb, key, key_len, val, val_len) ||
kvdb_lookup(kvdb, key, key_len, val_, &val_len_) ||
(val_len != val_len_) ||
memcmp(val, val_, val_len_) ||
((i + 1) != kvdb_size(kvdb)) ||
(0 != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
FREE(key);
FREE(val);
FREE(val_);
TRACE("software");
return -1;
}
}
/* lookup */
for (i = 0; i < N; ++i) {
j = rand() % N;
mk_object(key, val, K, V, &key_len, &val_len, j, 'i');
val_len_ = V;
if (kvdb_lookup(kvdb, key, key_len, val_, &val_len_) ||
(val_len != val_len_) ||
memcmp(val, val_, val_len_) ||
(N != kvdb_size(kvdb)) ||
(0 != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
FREE(key);
FREE(val);
FREE(val_);
TRACE("software");
return -1;
}
}
kvdb_close(kvdb);
FREE(key);
FREE(val);
FREE(val_);
return 0;
}
static int read_write_large(void) { return read_write(1234, 1234, 1234); }
static int read_write_small(void) { return read_write(1234, 123, 123); }
static int read_write_single(void) { return read_write(1, 23, 23); }
static int
heavy_rewrite(void) {
const char *const KEY = "KEY";
uint64_t i, n, val_len_;
char val[64], val_[64];
struct kvdb *kvdb;
n = 9876;
if (!(kvdb = kvdb_open(PATHNAME))) {
TRACE(0);
return -1;
}
for (i = 0; i < n; ++i) {
safe_sprintf(val, sizeof(val), "v%lu", (unsigned long) i);
val_len_ = sizeof(val_);
if (kvdb_update(kvdb, KEY, SLEN(KEY), val, SLEN(val)) ||
kvdb_lookup(kvdb, KEY, SLEN(KEY), val_, &val_len_) ||
(SLEN(val) != val_len_) ||
memcmp(val, val_, val_len_) ||
(1 != kvdb_size(kvdb)) ||
(i != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
TRACE("software");
return -1;
}
}
kvdb_close(kvdb);
return 0;
}
static int
basic_logic(void) {
const char *const KEY = "KEY";
const char *const VAL1 = "VAL";
const char *const VAL2 = "val2";
const char *const VAL3 = "val2VAL";
struct kvdb *kvdb;
uint64_t val_len;
char val[32];
if (!(kvdb = kvdb_open(PATHNAME))) {
TRACE(0);
return -1;
}
if ((0 != kvdb_size(kvdb)) || (0 != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
TRACE("software");
return -1;
}
/* invalid lookup */
val_len = 0;
if ((+1 != kvdb_lookup(kvdb, KEY, SLEN(KEY), 0, 0)) ||
(+1 != kvdb_lookup(kvdb, KEY, SLEN(KEY), 0, &val_len)) ||
(+1 != kvdb_lookup(kvdb, KEY, SLEN(KEY), val, &val_len)) ||
(0 != kvdb_size(kvdb)) ||
(0 != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
TRACE("software");
return -1;
}
/* invalid replace */
if ((+1 != kvdb_replace(kvdb, KEY, SLEN(KEY), VAL1, SLEN(VAL1))) ||
(0 != kvdb_size(kvdb)) ||
(0 != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
TRACE("software");
return -1;
}
/* insert, lookup, re-insert, lookup */
val_len = sizeof(val);
if (kvdb_insert(kvdb, KEY, SLEN(KEY), VAL1, SLEN(VAL1)) ||
kvdb_lookup(kvdb, KEY, SLEN(KEY), val, &val_len) ||
(SLEN(VAL1) != val_len) ||
memcmp(VAL1, val, val_len) ||
(+1 != kvdb_insert(kvdb, KEY, SLEN(KEY), VAL1, SLEN(VAL1))) ||
kvdb_lookup(kvdb, KEY, SLEN(KEY), val, &val_len) ||
(SLEN(VAL1) != val_len) ||
memcmp(VAL1, val, val_len) ||
(1 != kvdb_size(kvdb)) ||
(0 != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
TRACE("software");
return -1;
}
/* replace, lookup, re-insert, lookup */
val_len = sizeof(val);
if (kvdb_replace(kvdb, KEY, SLEN(KEY), VAL2, SLEN(VAL2)) ||
kvdb_lookup(kvdb, KEY, SLEN(KEY), val, &val_len) ||
(SLEN(VAL2) != val_len) ||
memcmp(VAL2, val, val_len) ||
(+1 != kvdb_insert(kvdb, KEY, SLEN(KEY), VAL2, SLEN(VAL2))) ||
kvdb_lookup(kvdb, KEY, SLEN(KEY), val, &val_len) ||
(SLEN(VAL2) != val_len) ||
memcmp(VAL2, val, val_len) ||
(1 != kvdb_size(kvdb)) ||
(1 != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
TRACE("software");
return -1;
}
/* update, lookup, re-insert, lookup */
val_len = sizeof(val);
if (kvdb_update(kvdb, KEY, SLEN(KEY), VAL3, SLEN(VAL3)) ||
kvdb_lookup(kvdb, KEY, SLEN(KEY), val, &val_len) ||
(SLEN(VAL3) != val_len) ||
memcmp(VAL3, val, val_len) ||
(+1 != kvdb_insert(kvdb, KEY, SLEN(KEY), VAL3, SLEN(VAL3))) ||
kvdb_lookup(kvdb, KEY, SLEN(KEY), val, &val_len) ||
(SLEN(VAL3) != val_len) ||
memcmp(VAL3, val, val_len) ||
(1 != kvdb_size(kvdb)) ||
(2 != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
TRACE("software");
return -1;
}
/* lookup */
val_len = sizeof(val);
if (kvdb_lookup(kvdb, KEY, SLEN(KEY), val, &val_len) ||
(SLEN(VAL3) != val_len) ||
memcmp(VAL3, val, val_len) ||
(1 != kvdb_size(kvdb)) ||
(2 != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
TRACE("software");
return -1;
}
/* remove */
val_len = sizeof(val);
if (kvdb_remove(kvdb, KEY, SLEN(KEY), val, &val_len) ||
(SLEN(VAL3) != val_len) ||
memcmp(VAL3, val, val_len) ||
(+1 != kvdb_lookup(kvdb, KEY, SLEN(KEY), val, &val_len)) ||
(0 != kvdb_size(kvdb)) ||
(3 != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
TRACE("software");
return -1;
}
kvdb_close(kvdb);
return 0;
}
static int test_store_restore_state(void) {
const char *const KEY = "KEY";
const char *const VAL = "VAL";
struct kvdb *kvdb;
uint64_t val_len;
char val[32];
if (!(kvdb = kvdb_open(PATHNAME))) {
TRACE(0);
return -1;
}
if ((0 != kvdb_size(kvdb)) || (0 != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
TRACE("software");
return -1;
}
/* insert, lookup */
val_len = sizeof(val);
if (kvdb_insert(kvdb, KEY, SLEN(KEY), VAL, SLEN(VAL)) ||
kvdb_lookup(kvdb, KEY, SLEN(KEY), val, &val_len) ||
(SLEN(VAL) != val_len) ||
memcmp(VAL, val, val_len) ||
(1 != kvdb_size(kvdb)) ||
(0 != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
TRACE("software");
return -1;
}
kvdb_close(kvdb);
if (!(kvdb = kvdb_open(PATHNAME))) {
TRACE(0);
return -1;
}
/* lookup */
val_len = sizeof(val);
if (kvdb_lookup(kvdb, KEY, SLEN(KEY), val, &val_len) ||
(SLEN(VAL) != val_len) ||
memcmp(VAL, val, val_len) ||
(1 != kvdb_size(kvdb)) ||
(0 != kvdb_waste(kvdb))) {
kvdb_close(kvdb);
TRACE("software");
return -1;
}
kvdb_close(kvdb);
return 0;
}
int
main(int argc, char *argv[]) {
if (2 != argc) {
printf("usage: %s block-device\n", argv[0]);
return -1;
}
/* initialize */
PATHNAME = argv[1];
term_init(0);
/* prelude */
term_bold();
term_color(TERM_COLOR_BLUE);
printf("---------- TEST BEG ----------\n");
term_reset();
/* test */
if (!RESTORE_FROM_FILE) {
TEST(basic_logic, "basic_logic");
TEST(heavy_rewrite, "heavy_rewrite");
TEST(read_write_single, "read_write_single");
TEST(read_write_small, "read_write_small");
TEST(read_write_large, "read_write_large");
} else {
TEST(test_store_restore_state, "test_store_restore_state");
}
/* postlude */
term_bold();
term_color(TERM_COLOR_BLUE);
printf("---------- TEST END ----------\n");
term_reset();
return 0;
}