-
Notifications
You must be signed in to change notification settings - Fork 45
Expand file tree
/
Copy pathliberasurecode_threaded_test.c
More file actions
609 lines (554 loc) · 18.7 KB
/
liberasurecode_threaded_test.c
File metadata and controls
609 lines (554 loc) · 18.7 KB
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
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
/*
* Copyright 2025 Tim Burke
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* Redistributions in binary form must reproduce the above copyright notice, this
* list of conditions and the following disclaimer in the documentation and/or
* other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY
* THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
* EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
* OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
#include <assert.h>
#include <fcntl.h>
#include <unistd.h>
#include "erasurecode.h"
#define NULL_BACKEND "null"
#define FLAT_XOR_HD_BACKEND "flat_xor_hd"
#define JERASURE_RS_VAND_BACKEND "jerasure_rs_vand"
#define JERASURE_RS_CAUCHY_BACKEND "jerasure_rs_cauchy"
#define ISA_L_RS_VAND_BACKEND "isa_l_rs_vand"
#define ISA_L_RS_VAND_INV_BACKEND "isa_l_rs_vand_inv"
#define ISA_L_RS_CAUCHY_BACKEND "isa_l_rs_cauchy"
#define SHSS_BACKEND "shss"
#define RS_VAND_BACKEND "liberasurecode_rs_vand"
#define LIBPHAZR_BACKEND "libphazr"
typedef void (*TEST_FUNC_WITH_ARGS)(const ec_backend_id_t, struct ec_args *);
struct testcase {
const char *description;
TEST_FUNC_WITH_ARGS function;
ec_backend_id_t be_id;
};
char *create_buffer(int size)
{
char *buf = malloc(size);
if (buf == NULL) {
return NULL;
}
int urand = open("/dev/urandom", O_RDONLY);
if (urand < 0 || read(urand, buf, size) != size) {
for(size_t i = 0; i < size; i++)
buf[i] = rand() % 256;
}
if (urand >= 0) {
close(urand);
}
return buf;
}
int *create_skips_array(struct ec_args *args, int skip)
{
int num = args->k + args->m;
size_t array_size = sizeof(int) * num;
int *buf = malloc(array_size);
if (buf == NULL) {
return NULL;
}
memset(buf, 0, array_size);
if (skip >= 0 && skip < num) {
buf[skip] = 1;
}
return buf;
}
static int create_frags_array(char ***array,
char **data,
char **parity,
struct ec_args *args,
int *skips)
{
// N.B. this function sets pointer reference to the ***array
// from **data and **parity so DO NOT free each value of
// the array independently because the data and parity will
// be expected to be cleanup via liberasurecode_encode_cleanup
int num_frags = 0;
int i = 0;
char **ptr = NULL;
*array = malloc((args->k + args->m) * sizeof(char *));
if (array == NULL) {
num_frags = -1;
goto out;
}
//add data frags
ptr = *array;
for (i = 0; i < args->k; i++) {
if (data[i] == NULL || skips[i] == 1)
{
continue;
}
*ptr++ = data[i];
num_frags++;
}
//add parity frags
for (i = 0; i < args->m; i++) {
if (parity[i] == NULL || skips[i + args->k] == 1) {
continue;
}
*ptr++ = parity[i];
num_frags++;
}
out:
return num_frags;
}
void* destroy_backend_in_thread(void* arg)
{
int *desc = arg;
int *rc = malloc(sizeof(int));
*rc = liberasurecode_instance_destroy(*desc);
assert(0 == *rc || -EBACKENDNOTAVAIL == *rc);
return rc;
}
static void test_multi_thread_destroy_backend(
ec_backend_id_t be_id,
struct ec_args *args)
{
pthread_t tid1, tid2;
int *rc1, *rc2;
int desc = liberasurecode_instance_create(be_id, args);
if (-EBACKENDNOTAVAIL == desc) {
fprintf(stderr, "Backend library not available!\n");
return;
}
assert(desc > 0);
pthread_create(&tid1, NULL, destroy_backend_in_thread, &desc);
pthread_create(&tid2, NULL, destroy_backend_in_thread, &desc);
pthread_join(tid1, (void *) &rc1);
pthread_join(tid2, (void *) &rc2);
/* The threads race; only one succeeds */
assert(*rc1 == 0 || *rc2 == 0);
/* The other fails with -EBACKENDNOTAVAIL */
assert(*rc1 == -EBACKENDNOTAVAIL || *rc2 == -EBACKENDNOTAVAIL);
free(rc1);
free(rc2);
}
struct create_state {
ec_backend_id_t be_id;
struct ec_args *args;
};
void* create_backend_in_thread(void* arg)
{
struct create_state *s = arg;
int *desc = malloc(sizeof(int));
*desc = liberasurecode_instance_create(s->be_id, s->args);
return desc;
}
static void test_multi_thread_create_backend(
ec_backend_id_t be_id,
struct ec_args *args)
{
pthread_t tid1, tid2;
int *desc1, *desc2;
struct create_state s = {
be_id,
args
};
if (!liberasurecode_backend_available(be_id)) {
fprintf(stderr, "Backend library not available!\n");
return;
}
pthread_create(&tid1, NULL, create_backend_in_thread, &s);
pthread_create(&tid2, NULL, create_backend_in_thread, &s);
pthread_join(tid1, (void *) &desc1);
pthread_join(tid2, (void *) &desc2);
assert(*desc1 > 0);
assert(*desc2 > 0);
assert(*desc1 != *desc2);
/**
* Each can be destroyed, showing that each was properly added to the
* registry */
assert(0 == liberasurecode_instance_destroy(*desc1));
assert(0 == liberasurecode_instance_destroy(*desc2));
free(desc1);
free(desc2);
}
struct encode_state {
int desc1;
int desc2;
int data_sz;
char *data;
};
void* encode_in_thread(void* arg)
{
struct encode_state *s = arg;
int *rc = malloc(sizeof(int));
char **encoded_data = NULL, **encoded_parity = NULL;
uint64_t encoded_fragment_len = 0;
*rc = liberasurecode_encode(s->desc1, s->data, s->data_sz,
&encoded_data, &encoded_parity, &encoded_fragment_len);
assert(0 == *rc || -EBACKENDNOTAVAIL == *rc);
if (*rc == 0) {
assert(liberasurecode_encode_cleanup(s->desc2, encoded_data, encoded_parity) == 0);
}
return rc;
}
static void test_multi_thread_encode_and_destroy_backend(
ec_backend_id_t be_id,
struct ec_args *args)
{
pthread_t tid1, tid2;
int *rc1, *rc2;
int desc = liberasurecode_instance_create(be_id, args);
if (-EBACKENDNOTAVAIL == desc) {
fprintf(stderr, "Backend library not available!\n");
return;
}
assert(desc > 0);
int orig_data_size = 1024 * 1024;
struct encode_state s = {
desc,
/* need a second descriptor so we can clean up
* even after first descriptor is destroyed */
liberasurecode_instance_create(be_id, args),
orig_data_size,
create_buffer(orig_data_size)
};
assert(s.data != NULL);
pthread_create(&tid2, NULL, encode_in_thread, &s);
pthread_create(&tid1, NULL, destroy_backend_in_thread, &desc);
pthread_join(tid1, (void *) &rc1);
pthread_join(tid2, (void *) &rc2);
/* The threads race, but destroy always succeeds */
assert(*rc1 == 0);
assert(liberasurecode_instance_destroy(s.desc2) == 0);
free(rc1);
free(rc2);
free(s.data);
}
struct decode_state {
int desc1;
int desc2;
char **available_fragments;
int num_fragments;
uint64_t fragment_len;
};
void* decode_in_thread(void* arg)
{
struct decode_state *s = arg;
int *rc = malloc(sizeof(int));
char *decoded_data = NULL;
uint64_t decoded_data_len = 0;
*rc = liberasurecode_decode(s->desc1, s->available_fragments,
s->num_fragments, s->fragment_len, 0, /* force_metadata_checks */
&decoded_data, &decoded_data_len);
assert(0 == *rc || -EBACKENDNOTAVAIL == *rc);
if (*rc == 0) {
assert(liberasurecode_decode_cleanup(s->desc2, decoded_data) == 0);
}
return rc;
}
static void test_multi_thread_decode_and_destroy_backend(
ec_backend_id_t be_id,
struct ec_args *args)
{
pthread_t tid1, tid2;
int *rc1, *rc2;
int desc = liberasurecode_instance_create(be_id, args);
if (-EBACKENDNOTAVAIL == desc) {
fprintf(stderr, "Backend library not available!\n");
return;
}
assert(desc > 0);
int orig_data_size = 1024 * 1024;
char *orig_data = create_buffer(orig_data_size);
assert(orig_data != NULL);
char **encoded_data = NULL, **encoded_parity = NULL;
uint64_t encoded_fragment_len = 0;
int rc = liberasurecode_encode(desc, orig_data, orig_data_size,
&encoded_data, &encoded_parity, &encoded_fragment_len);
assert(rc == 0);
/* Create available fragments array using the same method as existing tests */
char **available_fragments = NULL;
int *skip = create_skips_array(args, -1);
assert(skip != NULL);
int num_avail_frags = create_frags_array(&available_fragments, encoded_data,
encoded_parity, args, skip);
assert(num_avail_frags > 0);
struct decode_state s = {
desc,
/* need a second descriptor so we can clean up
* even after first descriptor is destroyed */
liberasurecode_instance_create(be_id, args),
available_fragments,
num_avail_frags,
encoded_fragment_len
};
assert(s.desc2 > 0);
pthread_create(&tid2, NULL, decode_in_thread, &s);
pthread_create(&tid1, NULL, destroy_backend_in_thread, &desc);
pthread_join(tid1, (void *) &rc1);
pthread_join(tid2, (void *) &rc2);
/* The threads race, but destroy always succeeds */
assert(*rc1 == 0);
liberasurecode_encode_cleanup(s.desc2, encoded_data, encoded_parity);
assert(liberasurecode_instance_destroy(s.desc2) == 0);
free(available_fragments);
free(skip);
free(rc1);
free(rc2);
free(orig_data);
}
struct reconstruct_state {
int desc1;
int desc2;
char **available_fragments;
int num_fragments;
uint64_t fragment_len;
int missing_idx;
char *out_fragment;
};
void* reconstruct_in_thread(void* arg)
{
struct reconstruct_state *s = arg;
int *rc = malloc(sizeof(int));
*rc = liberasurecode_reconstruct_fragment(s->desc1, s->available_fragments,
s->num_fragments, s->fragment_len, s->missing_idx, s->out_fragment);
assert(0 == *rc || -EBACKENDNOTAVAIL == *rc);
return rc;
}
static void test_multi_thread_reconstruct_and_destroy_backend(
ec_backend_id_t be_id,
struct ec_args *args)
{
pthread_t tid1, tid2;
int *rc1, *rc2;
int desc = liberasurecode_instance_create(be_id, args);
if (-EBACKENDNOTAVAIL == desc) {
fprintf(stderr, "Backend library not available!\n");
return;
}
assert(desc > 0);
int orig_data_size = 1024 * 1024;
char *orig_data = create_buffer(orig_data_size);
assert(orig_data != NULL);
char **encoded_data = NULL, **encoded_parity = NULL;
uint64_t encoded_fragment_len = 0;
int rc = liberasurecode_encode(desc, orig_data, orig_data_size,
&encoded_data, &encoded_parity, &encoded_fragment_len);
assert(rc == 0);
/* Create available fragments array with one missing fragment */
char **available_fragments = NULL;
int *skip = create_skips_array(args, -1);
assert(skip != NULL);
skip[0] = 1; /* skip first fragment */
int num_avail_frags = create_frags_array(&available_fragments, encoded_data,
encoded_parity, args, skip);
assert(num_avail_frags > 0);
/* Allocate output fragment buffer */
char *out_fragment = malloc(encoded_fragment_len);
assert(out_fragment != NULL);
struct reconstruct_state s = {
desc,
/* need a second descriptor so we can clean up
* even after first descriptor is destroyed */
liberasurecode_instance_create(be_id, args),
available_fragments,
num_avail_frags,
encoded_fragment_len,
0, /* missing fragment index */
out_fragment
};
assert(s.desc2 > 0);
pthread_create(&tid2, NULL, reconstruct_in_thread, &s);
pthread_create(&tid1, NULL, destroy_backend_in_thread, &desc);
pthread_join(tid1, (void *) &rc1);
pthread_join(tid2, (void *) &rc2);
/* The threads race, but destroy always succeeds */
assert(*rc1 == 0);
liberasurecode_encode_cleanup(s.desc2, encoded_data, encoded_parity);
assert(liberasurecode_instance_destroy(s.desc2) == 0);
free(available_fragments);
free(out_fragment);
free(skip);
free(rc1);
free(rc2);
free(orig_data);
}
struct fragments_needed_state {
int desc1;
int desc2;
int *fragments_to_reconstruct;
int *fragments_to_exclude;
int *fragments_needed;
};
void* fragments_needed_in_thread(void* arg)
{
struct fragments_needed_state *s = arg;
int *rc = malloc(sizeof(int));
*rc = liberasurecode_fragments_needed(s->desc1, s->fragments_to_reconstruct,
s->fragments_to_exclude, s->fragments_needed);
assert(0 == *rc || -EBACKENDNOTAVAIL == *rc);
return rc;
}
static void test_multi_thread_fragments_needed_and_destroy_backend(
ec_backend_id_t be_id,
struct ec_args *args)
{
pthread_t tid1, tid2;
int *rc1, *rc2;
int desc = liberasurecode_instance_create(be_id, args);
if (-EBACKENDNOTAVAIL == desc) {
fprintf(stderr, "Backend library not available!\n");
return;
}
assert(desc > 0);
int fragments_to_reconstruct[] = {0, -1};
int fragments_to_exclude[] = {-1};
int *fragments_needed = malloc(sizeof(int) * (args->k + args->m + 1));
assert(fragments_needed != NULL);
struct fragments_needed_state s = {
desc,
/* need a second descriptor so we can clean up
* even after first descriptor is destroyed */
liberasurecode_instance_create(be_id, args),
fragments_to_reconstruct,
fragments_to_exclude,
fragments_needed
};
assert(s.desc2 > 0);
pthread_create(&tid2, NULL, fragments_needed_in_thread, &s);
pthread_create(&tid1, NULL, destroy_backend_in_thread, &desc);
pthread_join(tid1, (void *) &rc1);
pthread_join(tid2, (void *) &rc2);
/* The threads race, but destroy always succeeds */
assert(*rc1 == 0);
assert(liberasurecode_instance_destroy(s.desc2) == 0);
free(fragments_needed);
free(rc1);
free(rc2);
}
struct get_fragment_size_state {
int desc1;
int desc2;
int data_len;
};
void* get_fragment_size_in_thread(void* arg)
{
struct get_fragment_size_state *s = arg;
int *rc = malloc(sizeof(int));
*rc = liberasurecode_get_fragment_size(s->desc1, s->data_len);
/* This function returns size on success or negative error code on failure */
assert(*rc > 0 || *rc == -EBACKENDNOTAVAIL);
return rc;
}
static void test_multi_thread_get_fragment_size_and_destroy_backend(
ec_backend_id_t be_id,
struct ec_args *args)
{
pthread_t tid1, tid2;
int *rc1, *rc2;
int desc = liberasurecode_instance_create(be_id, args);
if (-EBACKENDNOTAVAIL == desc) {
fprintf(stderr, "Backend library not available!\n");
return;
}
assert(desc > 0);
struct get_fragment_size_state s = {
desc,
/* need a second descriptor so we can clean up
* even after first descriptor is destroyed */
liberasurecode_instance_create(be_id, args),
1024 * 1024 /* data length */
};
assert(s.desc2 > 0);
pthread_create(&tid2, NULL, get_fragment_size_in_thread, &s);
pthread_create(&tid1, NULL, destroy_backend_in_thread, &desc);
pthread_join(tid1, (void *) &rc1);
pthread_join(tid2, (void *) &rc2);
/* The threads race, but destroy always succeeds */
assert(*rc1 == 0);
assert(liberasurecode_instance_destroy(s.desc2) == 0);
free(rc1);
free(rc2);
}
#define TEST(test, backend) {#test, test, backend}
#define TEST_SUITE(backend) \
TEST(test_multi_thread_destroy_backend, backend), \
TEST(test_multi_thread_create_backend, backend), \
TEST(test_multi_thread_encode_and_destroy_backend, backend), \
TEST(test_multi_thread_decode_and_destroy_backend, backend), \
TEST(test_multi_thread_reconstruct_and_destroy_backend, backend), \
TEST(test_multi_thread_fragments_needed_and_destroy_backend, backend), \
TEST(test_multi_thread_get_fragment_size_and_destroy_backend, backend)
struct testcase testcases[] = {
TEST_SUITE(EC_BACKEND_FLAT_XOR_HD),
TEST_SUITE(EC_BACKEND_LIBERASURECODE_RS_VAND),
TEST_SUITE(EC_BACKEND_JERASURE_RS_VAND),
TEST_SUITE(EC_BACKEND_JERASURE_RS_CAUCHY),
TEST_SUITE(EC_BACKEND_ISA_L_RS_VAND),
TEST_SUITE(EC_BACKEND_ISA_L_RS_CAUCHY),
TEST_SUITE(EC_BACKEND_ISA_L_RS_VAND_INV),
TEST_SUITE(EC_BACKEND_SHSS),
TEST_SUITE(EC_BACKEND_LIBPHAZR),
{ NULL, NULL, 0},
};
char * get_name_from_backend_id(ec_backend_id_t be) {
switch(be) {
case EC_BACKEND_NULL:
return NULL_BACKEND;
case EC_BACKEND_JERASURE_RS_VAND:
return JERASURE_RS_VAND_BACKEND;
case EC_BACKEND_JERASURE_RS_CAUCHY:
return JERASURE_RS_CAUCHY_BACKEND;
case EC_BACKEND_FLAT_XOR_HD:
return FLAT_XOR_HD_BACKEND;
case EC_BACKEND_ISA_L_RS_VAND:
return ISA_L_RS_VAND_BACKEND;
case EC_BACKEND_ISA_L_RS_VAND_INV:
return ISA_L_RS_VAND_INV_BACKEND;
case EC_BACKEND_ISA_L_RS_CAUCHY:
return ISA_L_RS_CAUCHY_BACKEND;
case EC_BACKEND_SHSS:
return SHSS_BACKEND;
case EC_BACKEND_LIBERASURECODE_RS_VAND:
return RS_VAND_BACKEND;
case EC_BACKEND_LIBPHAZR:
return LIBPHAZR_BACKEND;
default:
return "UNKNOWN";
}
}
struct ec_args args = {
.k = 10,
.m = 5,
.w = 16,
.hd = 4,
.ct = CHKSUM_NONE,
};
int main(int argc, char **argv)
{
int n;
setbuf(stdout, NULL);
for (n = 0; testcases[n].description != NULL; ++n) {
printf("%d - %s: %s ... ", n,
testcases[n].description,
get_name_from_backend_id(testcases[n].be_id));
if (!liberasurecode_backend_available(testcases[n].be_id)) {
printf("skip: backend not available\n");
} else {
testcases[n].function(testcases[n].be_id, &args);
printf("ok\n");
}
}
return 0;
}