174 lines
4.9 KiB
C
174 lines
4.9 KiB
C
/*
|
|
* <Copyright>
|
|
*
|
|
* 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.
|
|
*
|
|
* liberasurecode frontend API header
|
|
*
|
|
* vi: set noai tw=79 ts=4 sw=4:
|
|
*/
|
|
|
|
#include <assert.h>
|
|
#include <stdbool.h>
|
|
|
|
#include "erasurecode.h"
|
|
|
|
typedef int (*TEST_FUNC)(const char *, struct ec_args *);
|
|
|
|
struct testcase {
|
|
const char *description;
|
|
TEST_FUNC function;
|
|
void *arg1;
|
|
void *arg2;
|
|
bool skip;
|
|
};
|
|
|
|
//TODO Make this a but more useful
|
|
char *create_buffer(int size, int fill)
|
|
{
|
|
char *buf = malloc(size);
|
|
memset(buf, fill, size);
|
|
return buf;
|
|
}
|
|
|
|
static int test_liberasurecode_supported_backends(
|
|
const char *backend,
|
|
struct ec_args *args)
|
|
{
|
|
//EDL skipping for now since this function is not implemented.
|
|
}
|
|
|
|
static int test_create_and_destroy_backend(
|
|
const char *backend,
|
|
struct ec_args *args)
|
|
{
|
|
int desc = liberasurecode_instance_create(backend, args);
|
|
assert(desc > 0 || -EBACKENDNOTAVAIL == desc);
|
|
if (desc)
|
|
liberasurecode_instance_destroy(desc);
|
|
return 0;
|
|
}
|
|
|
|
static int test_simple_encode_decode(
|
|
const char *backend,
|
|
struct ec_args *args)
|
|
{
|
|
int rc = 0;
|
|
int desc = -1;
|
|
|
|
int orig_data_size = 1024 * 1024;
|
|
char *orig_data = NULL;
|
|
char **encoded_data = NULL, **encoded_parity = NULL;
|
|
uint64_t encoded_fragment_len = 0;
|
|
|
|
uint64_t decoded_data_len = 0;
|
|
char *decoded_data = NULL;
|
|
|
|
desc = liberasurecode_instance_create(backend, args);
|
|
assert(desc > 0 || -EBACKENDNOTAVAIL == desc);
|
|
|
|
orig_data = create_buffer(orig_data_size, 'x');
|
|
if (NULL == orig_data) {
|
|
rc = -ENOMEM;
|
|
goto out;
|
|
}
|
|
|
|
rc = liberasurecode_encode(desc, orig_data, orig_data_size,
|
|
&encoded_data, &encoded_parity, &encoded_fragment_len);
|
|
assert(0 == rc);
|
|
|
|
rc = liberasurecode_decode(desc, encoded_data,
|
|
10, encoded_fragment_len, decoded_data, &decoded_data_len);
|
|
assert(0 == rc);
|
|
assert(decoded_data_len == orig_data_size);
|
|
assert(memcmp(decoded_data, orig_data, orig_data_size) == 0);
|
|
|
|
if (desc)
|
|
liberasurecode_instance_destroy(desc);
|
|
|
|
free(orig_data);
|
|
|
|
out:
|
|
return rc;
|
|
}
|
|
|
|
struct ec_args flat_xor_hd_args = {
|
|
.k = 10,
|
|
.m = 6,
|
|
.priv_args1.flat_xor_hd_args.hd = 3,
|
|
};
|
|
|
|
struct ec_args jerasure_rs_vand_args = {
|
|
.k = 10,
|
|
.m = 4,
|
|
.w = 16,
|
|
};
|
|
|
|
struct testcase testcases[] = {
|
|
{"liberasurecode_supported_backends",
|
|
test_liberasurecode_supported_backends,
|
|
NULL, NULL,
|
|
.skip = true},
|
|
{"create_and_destroy_backend",
|
|
test_create_and_destroy_backend,
|
|
"flat_xor_hd", &flat_xor_hd_args,
|
|
.skip = false},
|
|
{"create_and_destroy_backend",
|
|
test_create_and_destroy_backend,
|
|
"jerasure_rs_vand", &jerasure_rs_vand_args,
|
|
.skip = false},
|
|
{"simple_encode_flat_xor_hd",
|
|
test_simple_encode_decode,
|
|
"flat_xor_hd", &flat_xor_hd_args,
|
|
.skip = true},
|
|
{"simple_encode_jerasure_rs_vand",
|
|
test_simple_encode_decode,
|
|
"jerasure_rs_vand", &jerasure_rs_vand_args,
|
|
.skip = true},
|
|
{ NULL, NULL, NULL, NULL, false },
|
|
};
|
|
|
|
int main(int argc, char **argv)
|
|
{
|
|
int ii = 0, num_cases = 0;
|
|
|
|
for (num_cases = 0; testcases[num_cases].description; num_cases++) {
|
|
/* Just counting */
|
|
}
|
|
|
|
printf("1..%d\n", num_cases);
|
|
|
|
for (ii = 0; testcases[ii].description != NULL; ++ii) {
|
|
fflush(stdout);
|
|
if (testcases[ii].skip) {
|
|
fprintf(stdout, "ok # SKIP %d - %s\n", ii + 1,
|
|
testcases[ii].description);
|
|
continue;
|
|
}
|
|
testcases[ii].function(testcases[ii].arg1, testcases[ii].arg2);
|
|
fprintf(stdout, "ok %d - %s\n", ii + 1, testcases[ii].description);
|
|
fflush(stdout);
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|