diff options
Diffstat (limited to 'src/c/jerasure/Examples/liberation_01.c')
| -rw-r--r-- | src/c/jerasure/Examples/liberation_01.c | 192 |
1 files changed, 192 insertions, 0 deletions
diff --git a/src/c/jerasure/Examples/liberation_01.c b/src/c/jerasure/Examples/liberation_01.c new file mode 100644 index 0000000..86a03fe --- /dev/null +++ b/src/c/jerasure/Examples/liberation_01.c @@ -0,0 +1,192 @@ +/* * + * Copyright (c) 2014, James S. Plank and Kevin Greenan + * All rights reserved. + * + * Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure + * Coding Techniques + * + * Revision 2.0: Galois Field backend now links to GF-Complete + * + * 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. + * + * - Neither the name of the University of Tennessee nor the names of its + * contributors may be used to endorse or promote products derived + * from this software without specific prior written permission. + * + * 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. + */ + +/* Jerasure's authors: + + Revision 2.x - 2014: James S. Plank and Kevin M. Greenan. + Revision 1.2 - 2008: James S. Plank, Scott Simmerman and Catherine D. Schuman. + Revision 1.0 - 2007: James S. Plank. + */ + +#include <stdio.h> +#include <stdlib.h> +#include <string.h> +#include <stdlib.h> +#include <gf_rand.h> +#include "jerasure.h" +#include "liberation.h" + +#define talloc(type, num) (type *) malloc(sizeof(type)*(num)) + +static void usage(char *s) +{ + fprintf(stderr, "usage: liberation_01 k w seed - Liberation RAID-6 coding/decoding example in GF(2^w).\n"); + fprintf(stderr, " \n"); + fprintf(stderr, " w must be prime and k <= w. It sets up a Liberation bit-matrix\n"); + fprintf(stderr, " then it encodes k devices of w*%ld bytes using dumb bit-matrix scheduling.\n", sizeof(long)); + fprintf(stderr, " It decodes using smart bit-matrix scheduling.\n"); + fprintf(stderr, " \n"); + fprintf(stderr, "This demonstrates: liberation_coding_bitmatrix()\n"); + fprintf(stderr, " jerasure_smart_bitmatrix_to_schedule()\n"); + fprintf(stderr, " jerasure_dumb_bitmatrix_to_schedule()\n"); + fprintf(stderr, " jerasure_schedule_encode()\n"); + fprintf(stderr, " jerasure_schedule_decode_lazy()\n"); + fprintf(stderr, " jerasure_print_bitmatrix()\n"); + fprintf(stderr, " jerasure_get_stats()\n"); + if (s != NULL) fprintf(stderr, "%s\n", s); + exit(1); +} + +static void print_array(char **ptrs, int ndevices, int size, int packetsize, char *label) +{ + int i, j, x; + unsigned char *up; + + printf("<center><table border=3 cellpadding=3><tr><td></td>\n"); + + for (i = 0; i < ndevices; i++) printf("<td align=center>%s%x</td>\n", label, i); + printf("</tr>\n"); + printf("<td align=right><pre>"); + for (j = 0; j < size/packetsize; j++) printf("Packet %d\n", j); + printf("</pre></td>\n"); + for (i = 0; i < ndevices; i++) { + printf("<td><pre>"); + up = (unsigned char *) ptrs[i]; + for (j = 0; j < size/packetsize; j++) { + for (x = 0; x < packetsize; x++) { + if (x > 0 && x%4 == 0) printf(" "); + printf("%02x", up[j*packetsize+x]); + } + printf("\n"); + } + printf("</td>\n"); + } + printf("</tr></table></center>\n"); +} + +int main(int argc, char **argv) +{ + int k, w, i, m; + int *bitmatrix; + char **data, **coding; + int **dumb; + int *erasures, *erased; + double stats[3]; + uint32_t seed; + + if (argc != 4) usage("Wrong number of arguments"); + if (sscanf(argv[1], "%d", &k) == 0 || k <= 0) usage("Bad k"); + if (sscanf(argv[2], "%d", &w) == 0 || w <= 0 || w > 32) usage("Bad w"); + if (sscanf(argv[3], "%u", &seed) == 0) usage("Bad seed"); + m = 2; + if (w < k) usage("k is too big"); + for (i = 2; i*i <= w; i++) if (w%i == 0) usage("w isn't prime"); + + bitmatrix = liberation_coding_bitmatrix(k, w); + if (bitmatrix == NULL) { + usage("couldn't make coding matrix"); + } + + printf("<HTML><TITLE>liberation_01"); + for (i = 1; i < argc; i++) printf(" %s", argv[i]); + printf("</TITLE>\n"); + printf("<h3>liberation_01"); + for (i = 1; i < argc; i++) printf(" %s", argv[i]); + printf("</h3>\n"); + printf("<hr>\n"); + + printf("Coding Bit-Matrix:\n<pre>\n"); + jerasure_print_bitmatrix(bitmatrix, w*m, w*k, w); + printf("</pre><hr>\n"); + + dumb = jerasure_dumb_bitmatrix_to_schedule(k, m, w, bitmatrix); + + MOA_Seed(seed); + data = talloc(char *, k); + for (i = 0; i < k; i++) { + data[i] = talloc(char, sizeof(long)*w); + MOA_Fill_Random_Region(data[i], sizeof(long)*w); + } + + coding = talloc(char *, m); + for (i = 0; i < m; i++) { + coding[i] = talloc(char, sizeof(long)*w); + } + + jerasure_schedule_encode(k, m, w, dumb, data, coding, w*sizeof(long), sizeof(long)); + jerasure_get_stats(stats); + printf("Smart Encoding Complete: - %.0lf XOR'd bytes. State of the system:\n\n", stats[0]); + printf("<p>\n"); + print_array(data, k, sizeof(long)*w, sizeof(long), "D"); + printf("<p>\n"); + print_array(coding, m, sizeof(long)*w, sizeof(long), "C"); + printf("<hr>\n"); + + erasures = talloc(int, (m+1)); + erased = talloc(int, (k+m)); + for (i = 0; i < m+k; i++) erased[i] = 0; + for (i = 0; i < m; ) { + erasures[i] = MOA_Random_W(30,1)%(k+m); + if (erased[erasures[i]] == 0) { + erased[erasures[i]] = 1; + bzero((erasures[i] < k) ? data[erasures[i]] : coding[erasures[i]-k], sizeof(long)*w); + i++; + } + } + erasures[i] = -1; + + printf("Erased %d random devices:\n\n", m); + printf("<p>\n"); + print_array(data, k, sizeof(long)*w, sizeof(long), "D"); + printf("<p>\n"); + print_array(coding, m, sizeof(long)*w, sizeof(long), "C"); + printf("<hr>\n"); + + jerasure_schedule_decode_lazy(k, m, w, bitmatrix, erasures, data, coding, w*sizeof(long), sizeof(long), 1); + jerasure_get_stats(stats); + + printf("State of the system after decoding: %.0lf XOR'd bytes\n\n", stats[0]); + printf("<p>\n"); + print_array(data, k, sizeof(long)*w, sizeof(long), "D"); + printf("<p>\n"); + print_array(coding, m, sizeof(long)*w, sizeof(long), "C"); + printf("<hr>\n"); + + return 0; +} |