summaryrefslogtreecommitdiff
path: root/test/liberasurecode_test.c
blob: 4094909285181a709a12e69d33189d1264a33bac (plain)
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
/* 
 * <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 void (*TEST_FUNC)(void);
struct testcase {
    const char *description;
    TEST_FUNC function;
    bool skip;
};

//TODO Make this a but more useful
char *create_buffer(int size)
{
    char *buf = malloc(size);
    memset(buf, 2, size);
    return buf;
}

static void test_liberasurecode_supported_backends(void)
{
    //EDL skipping for now since this function is not implemented.
}

static void test_create_and_destroy_backend(void)
{
    struct ec_args args = {
        .k = 10,
        .m = 4,
        .priv_args1.flat_xor_hd_args.hd = 3,
    };
    int desc = liberasurecode_instance_create("flat_xor_hd", &args);
    assert(desc >= 0);
    assert(liberasurecode_instance_destroy(desc) == 0);
}

static void test_simple_encode(void)
{
    struct ec_args args = {
        .k = 10,
        .m = 4,
        .priv_args1.flat_xor_hd_args.hd = 3,
    };
    int desc = liberasurecode_instance_create("flat_xor_hd", &args);
    char *encoded_data;
    char *parity;
    char *data = create_buffer(4096);
    int rc = liberasurecode_encode(desc, data, 4096, &encoded_data, &parity);
    assert(rc == 0);
    assert(liberasurecode_instance_destroy(desc) == 0);
    free(data);
}

struct testcase testcases[] = {
    {"liberasurecode_supported_backends",
     test_liberasurecode_supported_backends, true},
    {"create_and_destroy_backend", test_create_and_destroy_backend, false},
    {"simple_encode", test_simple_encode, true}, //EDL: Seg faulting at the moment so skip
    { NULL, NULL, false }
};

int main(int argc, char **argv)
{
    int exitcode = 0;
    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();
        fprintf(stdout, "ok %d - %s\n", ii + 1, testcases[ii].description);
        fflush(stdout);
    }

    return 0;
}