93 lines
3.1 KiB
C
93 lines
3.1 KiB
C
/* *
|
|
* 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 "jerasure.h"
|
|
|
|
#define talloc(type, num) (type *) malloc(sizeof(type)*(num))
|
|
|
|
static void usage(char *s)
|
|
{
|
|
fprintf(stderr, "usage: jerasure_01 r c w - creates and prints out a matrix in GF(2^w).\n\n");
|
|
fprintf(stderr, " Element i,j is equal to 2^(i*c+j)\n");
|
|
fprintf(stderr, " \n");
|
|
fprintf(stderr, "This demonstrates jerasure_print_matrix().\n");
|
|
if (s != NULL) fprintf(stderr, "%s\n", s);
|
|
exit(1);
|
|
}
|
|
|
|
int main(int argc, char **argv)
|
|
{
|
|
int r, c, w, i, n;
|
|
int *matrix;
|
|
|
|
if (argc != 4) usage(NULL);
|
|
if (sscanf(argv[1], "%d", &r) == 0 || r <= 0) usage("Bad r");
|
|
if (sscanf(argv[2], "%d", &c) == 0 || c <= 0) usage("Bad c");
|
|
if (sscanf(argv[3], "%d", &w) == 0 || w <= 0) usage("Bad w");
|
|
|
|
matrix = talloc(int, r*c);
|
|
|
|
n = 1;
|
|
for (i = 0; i < r*c; i++) {
|
|
matrix[i] = n;
|
|
n = galois_single_multiply(n, 2, w);
|
|
}
|
|
|
|
printf("<HTML><TITLE>jerasure_01");
|
|
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
|
printf("</TITLE>\n");
|
|
printf("<h3>jerasure_01");
|
|
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
|
printf("</h3>\n");
|
|
printf("<pre>\n");
|
|
|
|
jerasure_print_matrix(matrix, r, c, w);
|
|
return 0;
|
|
}
|
|
|