James Plank
commit
08d7edc092
|
|
@ -1,19 +1,10 @@
|
|||
/* liberation.h
|
||||
* James S. Plank
|
||||
|
||||
Copyright (c) 2013, 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 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
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
|
||||
|
|
@ -44,13 +35,3 @@ 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.
|
||||
|
||||
|
||||
*/
|
||||
|
||||
#ifndef _LIBERATION
|
||||
|
||||
extern int *liberation_coding_bitmatrix(int k, int w);
|
||||
extern int *liber8tion_coding_bitmatrix(int k);
|
||||
extern int *blaum_roth_coding_bitmatrix(int k, int w);
|
||||
|
||||
#endif
|
||||
BIN
Examples/.swp
BIN
Examples/.swp
Binary file not shown.
|
|
@ -0,0 +1,89 @@
|
|||
# Jerasure AM file
|
||||
|
||||
INCLUDES=-I../
|
||||
AM_CFLAGS = -O3 $(SIMD_FLAGS) -fPIC $(INCLUDES)
|
||||
|
||||
bin_PROGRAMS = jerasure_01 \
|
||||
jerasure_02 \
|
||||
jerasure_03 \
|
||||
jerasure_04 \
|
||||
jerasure_05 \
|
||||
jerasure_06 \
|
||||
jerasure_07 \
|
||||
jerasure_08 \
|
||||
reed_sol_01 \
|
||||
reed_sol_02 \
|
||||
reed_sol_03 \
|
||||
reed_sol_04 \
|
||||
reed_sol_test_gf \
|
||||
reed_sol_time_gf \
|
||||
cauchy_01 \
|
||||
cauchy_02 \
|
||||
cauchy_03 \
|
||||
cauchy_04 \
|
||||
liberation_01 \
|
||||
encoder \
|
||||
decoder
|
||||
|
||||
jerasure_01_SOURCES = jerasure_01.c
|
||||
jerasure_01_LDADD = ../src/libJerasure.la
|
||||
|
||||
jerasure_02_SOURCES = jerasure_02.c
|
||||
jerasure_02_LDADD = ../src/libJerasure.la
|
||||
|
||||
jerasure_03_SOURCES = jerasure_03.c
|
||||
jerasure_03_LDADD = ../src/libJerasure.la
|
||||
|
||||
jerasure_04_SOURCES = jerasure_04.c
|
||||
jerasure_04_LDADD = ../src/libJerasure.la
|
||||
|
||||
jerasure_05_SOURCES = jerasure_05.c
|
||||
jerasure_05_LDADD = ../src/libJerasure.la
|
||||
|
||||
jerasure_06_SOURCES = jerasure_06.c
|
||||
jerasure_06_LDADD = ../src/libJerasure.la
|
||||
|
||||
jerasure_07_SOURCES = jerasure_07.c
|
||||
jerasure_07_LDADD = ../src/libJerasure.la
|
||||
|
||||
jerasure_08_SOURCES = jerasure_08.c
|
||||
jerasure_08_LDADD = ../src/libJerasure.la
|
||||
|
||||
reed_sol_01_SOURCES = reed_sol_01.c
|
||||
reed_sol_01_LDADD = ../src/libJerasure.la
|
||||
|
||||
reed_sol_02_SOURCES = reed_sol_02.c
|
||||
reed_sol_02_LDADD = ../src/libJerasure.la
|
||||
|
||||
reed_sol_03_SOURCES = reed_sol_03.c
|
||||
reed_sol_03_LDADD = ../src/libJerasure.la
|
||||
|
||||
reed_sol_04_SOURCES = reed_sol_04.c
|
||||
reed_sol_04_LDADD = ../src/libJerasure.la
|
||||
|
||||
reed_sol_test_gf_SOURCES = reed_sol_test_gf.c
|
||||
reed_sol_test_gf_LDADD = ../src/libJerasure.la
|
||||
|
||||
reed_sol_time_gf_SOURCES = reed_sol_time_gf.c
|
||||
reed_sol_time_gf_LDADD = ../src/libJerasure.la
|
||||
|
||||
cauchy_01_SOURCES = cauchy_01.c
|
||||
cauchy_01_LDADD = ../src/libJerasure.la
|
||||
|
||||
cauchy_02_SOURCES = cauchy_02.c
|
||||
cauchy_02_LDADD = ../src/libJerasure.la
|
||||
|
||||
cauchy_03_SOURCES = cauchy_03.c
|
||||
cauchy_03_LDADD = ../src/libJerasure.la
|
||||
|
||||
cauchy_04_SOURCES = cauchy_04.c
|
||||
cauchy_04_LDADD = ../src/libJerasure.la
|
||||
|
||||
liberation_01_SOURCES = liberation_01.c
|
||||
liberation_01_LDADD = ../src/libJerasure.la
|
||||
|
||||
encoder_SOURCES = encoder.c
|
||||
encoder_LDADD = ../src/libJerasure.la
|
||||
|
||||
decoder_SOURCES = decoder.c
|
||||
decoder_LDADD = ../src/libJerasure.la
|
||||
|
|
@ -0,0 +1,688 @@
|
|||
# Makefile.in generated by automake 1.11.3 from Makefile.am.
|
||||
# @configure_input@
|
||||
|
||||
# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
|
||||
# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
|
||||
# Foundation, Inc.
|
||||
# This Makefile.in is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# This program is distributed in the hope that it will be useful,
|
||||
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
|
||||
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
|
||||
# PARTICULAR PURPOSE.
|
||||
|
||||
@SET_MAKE@
|
||||
|
||||
# Jerasure AM file
|
||||
|
||||
VPATH = @srcdir@
|
||||
pkgdatadir = $(datadir)/@PACKAGE@
|
||||
pkgincludedir = $(includedir)/@PACKAGE@
|
||||
pkglibdir = $(libdir)/@PACKAGE@
|
||||
pkglibexecdir = $(libexecdir)/@PACKAGE@
|
||||
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
|
||||
install_sh_DATA = $(install_sh) -c -m 644
|
||||
install_sh_PROGRAM = $(install_sh) -c
|
||||
install_sh_SCRIPT = $(install_sh) -c
|
||||
INSTALL_HEADER = $(INSTALL_DATA)
|
||||
transform = $(program_transform_name)
|
||||
NORMAL_INSTALL = :
|
||||
PRE_INSTALL = :
|
||||
POST_INSTALL = :
|
||||
NORMAL_UNINSTALL = :
|
||||
PRE_UNINSTALL = :
|
||||
POST_UNINSTALL = :
|
||||
build_triplet = @build@
|
||||
host_triplet = @host@
|
||||
bin_PROGRAMS = jerasure_01$(EXEEXT) jerasure_02$(EXEEXT) \
|
||||
jerasure_03$(EXEEXT) jerasure_04$(EXEEXT) jerasure_05$(EXEEXT) \
|
||||
jerasure_06$(EXEEXT) jerasure_07$(EXEEXT) jerasure_08$(EXEEXT) \
|
||||
reed_sol_01$(EXEEXT) reed_sol_02$(EXEEXT) reed_sol_03$(EXEEXT) \
|
||||
reed_sol_04$(EXEEXT) reed_sol_test_gf$(EXEEXT) \
|
||||
reed_sol_time_gf$(EXEEXT) \
|
||||
cauchy_01$(EXEEXT) cauchy_02$(EXEEXT) cauchy_03$(EXEEXT) \
|
||||
cauchy_04$(EXEEXT) liberation_01$(EXEEXT) encoder$(EXEEXT) \
|
||||
decoder$(EXEEXT)
|
||||
subdir = Examples
|
||||
DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
|
||||
ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
|
||||
am__aclocal_m4_deps = $(top_srcdir)/m4/ax_check_compile_flag.m4 \
|
||||
$(top_srcdir)/m4/ax_ext.m4 \
|
||||
$(top_srcdir)/m4/ax_gcc_x86_avx_xgetbv.m4 \
|
||||
$(top_srcdir)/m4/ax_gcc_x86_cpuid.m4 \
|
||||
$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \
|
||||
$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \
|
||||
$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac
|
||||
am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
|
||||
$(ACLOCAL_M4)
|
||||
mkinstalldirs = $(install_sh) -d
|
||||
CONFIG_HEADER = $(top_builddir)/include/config.h
|
||||
CONFIG_CLEAN_FILES =
|
||||
CONFIG_CLEAN_VPATH_FILES =
|
||||
am__installdirs = "$(DESTDIR)$(bindir)"
|
||||
PROGRAMS = $(bin_PROGRAMS)
|
||||
am_cauchy_01_OBJECTS = cauchy_01.$(OBJEXT)
|
||||
cauchy_01_OBJECTS = $(am_cauchy_01_OBJECTS)
|
||||
cauchy_01_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_cauchy_02_OBJECTS = cauchy_02.$(OBJEXT)
|
||||
cauchy_02_OBJECTS = $(am_cauchy_02_OBJECTS)
|
||||
cauchy_02_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_cauchy_03_OBJECTS = cauchy_03.$(OBJEXT)
|
||||
cauchy_03_OBJECTS = $(am_cauchy_03_OBJECTS)
|
||||
cauchy_03_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_cauchy_04_OBJECTS = cauchy_04.$(OBJEXT)
|
||||
cauchy_04_OBJECTS = $(am_cauchy_04_OBJECTS)
|
||||
cauchy_04_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_decoder_OBJECTS = decoder.$(OBJEXT)
|
||||
decoder_OBJECTS = $(am_decoder_OBJECTS)
|
||||
decoder_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_encoder_OBJECTS = encoder.$(OBJEXT)
|
||||
encoder_OBJECTS = $(am_encoder_OBJECTS)
|
||||
encoder_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_jerasure_01_OBJECTS = jerasure_01.$(OBJEXT)
|
||||
jerasure_01_OBJECTS = $(am_jerasure_01_OBJECTS)
|
||||
jerasure_01_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_jerasure_02_OBJECTS = jerasure_02.$(OBJEXT)
|
||||
jerasure_02_OBJECTS = $(am_jerasure_02_OBJECTS)
|
||||
jerasure_02_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_jerasure_03_OBJECTS = jerasure_03.$(OBJEXT)
|
||||
jerasure_03_OBJECTS = $(am_jerasure_03_OBJECTS)
|
||||
jerasure_03_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_jerasure_04_OBJECTS = jerasure_04.$(OBJEXT)
|
||||
jerasure_04_OBJECTS = $(am_jerasure_04_OBJECTS)
|
||||
jerasure_04_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_jerasure_05_OBJECTS = jerasure_05.$(OBJEXT)
|
||||
jerasure_05_OBJECTS = $(am_jerasure_05_OBJECTS)
|
||||
jerasure_05_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_jerasure_06_OBJECTS = jerasure_06.$(OBJEXT)
|
||||
jerasure_06_OBJECTS = $(am_jerasure_06_OBJECTS)
|
||||
jerasure_06_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_jerasure_07_OBJECTS = jerasure_07.$(OBJEXT)
|
||||
jerasure_07_OBJECTS = $(am_jerasure_07_OBJECTS)
|
||||
jerasure_07_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_jerasure_08_OBJECTS = jerasure_08.$(OBJEXT)
|
||||
jerasure_08_OBJECTS = $(am_jerasure_08_OBJECTS)
|
||||
jerasure_08_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_liberation_01_OBJECTS = liberation_01.$(OBJEXT)
|
||||
liberation_01_OBJECTS = $(am_liberation_01_OBJECTS)
|
||||
liberation_01_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_reed_sol_01_OBJECTS = reed_sol_01.$(OBJEXT)
|
||||
reed_sol_01_OBJECTS = $(am_reed_sol_01_OBJECTS)
|
||||
reed_sol_01_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_reed_sol_02_OBJECTS = reed_sol_02.$(OBJEXT)
|
||||
reed_sol_02_OBJECTS = $(am_reed_sol_02_OBJECTS)
|
||||
reed_sol_02_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_reed_sol_03_OBJECTS = reed_sol_03.$(OBJEXT)
|
||||
reed_sol_03_OBJECTS = $(am_reed_sol_03_OBJECTS)
|
||||
reed_sol_03_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_reed_sol_04_OBJECTS = reed_sol_04.$(OBJEXT)
|
||||
reed_sol_04_OBJECTS = $(am_reed_sol_04_OBJECTS)
|
||||
reed_sol_04_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_reed_sol_test_gf_OBJECTS = reed_sol_test_gf.$(OBJEXT)
|
||||
reed_sol_test_gf_OBJECTS = $(am_reed_sol_test_gf_OBJECTS)
|
||||
reed_sol_test_gf_DEPENDENCIES = ../src/libJerasure.la
|
||||
am_reed_sol_time_gf_OBJECTS = reed_sol_time_gf.$(OBJEXT)
|
||||
reed_sol_time_gf_OBJECTS = $(am_reed_sol_time_gf_OBJECTS)
|
||||
reed_sol_time_gf_DEPENDENCIES = ../src/libJerasure.la
|
||||
DEFAULT_INCLUDES = -I.@am__isrc@ -I$(top_builddir)/include
|
||||
depcomp =
|
||||
am__depfiles_maybe =
|
||||
COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
|
||||
$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
|
||||
LTCOMPILE = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
|
||||
--mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
|
||||
$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
|
||||
CCLD = $(CC)
|
||||
LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
|
||||
--mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) \
|
||||
$(LDFLAGS) -o $@
|
||||
SOURCES = $(cauchy_01_SOURCES) $(cauchy_02_SOURCES) \
|
||||
$(cauchy_03_SOURCES) $(cauchy_04_SOURCES) $(decoder_SOURCES) \
|
||||
$(encoder_SOURCES) $(jerasure_01_SOURCES) \
|
||||
$(jerasure_02_SOURCES) $(jerasure_03_SOURCES) \
|
||||
$(jerasure_04_SOURCES) $(jerasure_05_SOURCES) \
|
||||
$(jerasure_06_SOURCES) $(jerasure_07_SOURCES) \
|
||||
$(jerasure_08_SOURCES) $(liberation_01_SOURCES) \
|
||||
$(reed_sol_01_SOURCES) $(reed_sol_02_SOURCES) \
|
||||
$(reed_sol_03_SOURCES) $(reed_sol_04_SOURCES) \
|
||||
$(reed_sol_test_gf_SOURCES) \
|
||||
$(reed_sol_time_gf_SOURCES)
|
||||
DIST_SOURCES = $(cauchy_01_SOURCES) $(cauchy_02_SOURCES) \
|
||||
$(cauchy_03_SOURCES) $(cauchy_04_SOURCES) $(decoder_SOURCES) \
|
||||
$(encoder_SOURCES) $(jerasure_01_SOURCES) \
|
||||
$(jerasure_02_SOURCES) $(jerasure_03_SOURCES) \
|
||||
$(jerasure_04_SOURCES) $(jerasure_05_SOURCES) \
|
||||
$(jerasure_06_SOURCES) $(jerasure_07_SOURCES) \
|
||||
$(jerasure_08_SOURCES) $(liberation_01_SOURCES) \
|
||||
$(reed_sol_01_SOURCES) $(reed_sol_02_SOURCES) \
|
||||
$(reed_sol_03_SOURCES) $(reed_sol_04_SOURCES) \
|
||||
$(reed_sol_test_gf_SOURCES) \
|
||||
$(reed_sol_time_gf_SOURCES)
|
||||
ETAGS = etags
|
||||
CTAGS = ctags
|
||||
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
|
||||
ACLOCAL = @ACLOCAL@
|
||||
AMTAR = @AMTAR@
|
||||
AR = @AR@
|
||||
AUTOCONF = @AUTOCONF@
|
||||
AUTOHEADER = @AUTOHEADER@
|
||||
AUTOMAKE = @AUTOMAKE@
|
||||
AWK = @AWK@
|
||||
CC = @CC@
|
||||
CFLAGS = @CFLAGS@
|
||||
CPP = @CPP@
|
||||
CPPFLAGS = @CPPFLAGS@
|
||||
CYGPATH_W = @CYGPATH_W@
|
||||
DEFS = @DEFS@
|
||||
DLLTOOL = @DLLTOOL@
|
||||
DSYMUTIL = @DSYMUTIL@
|
||||
DUMPBIN = @DUMPBIN@
|
||||
ECHO_C = @ECHO_C@
|
||||
ECHO_N = @ECHO_N@
|
||||
ECHO_T = @ECHO_T@
|
||||
EGREP = @EGREP@
|
||||
EXEEXT = @EXEEXT@
|
||||
FGREP = @FGREP@
|
||||
GREP = @GREP@
|
||||
INSTALL = @INSTALL@
|
||||
INSTALL_DATA = @INSTALL_DATA@
|
||||
INSTALL_PROGRAM = @INSTALL_PROGRAM@
|
||||
INSTALL_SCRIPT = @INSTALL_SCRIPT@
|
||||
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
|
||||
LD = @LD@
|
||||
LDFLAGS = @LDFLAGS@
|
||||
LIBOBJS = @LIBOBJS@
|
||||
LIBS = @LIBS@
|
||||
LIBTOOL = @LIBTOOL@
|
||||
LIPO = @LIPO@
|
||||
LN_S = @LN_S@
|
||||
LTLIBOBJS = @LTLIBOBJS@
|
||||
MAKEINFO = @MAKEINFO@
|
||||
MANIFEST_TOOL = @MANIFEST_TOOL@
|
||||
MKDIR_P = @MKDIR_P@
|
||||
NM = @NM@
|
||||
NMEDIT = @NMEDIT@
|
||||
OBJDUMP = @OBJDUMP@
|
||||
OBJEXT = @OBJEXT@
|
||||
OTOOL = @OTOOL@
|
||||
OTOOL64 = @OTOOL64@
|
||||
PACKAGE = @PACKAGE@
|
||||
PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
|
||||
PACKAGE_NAME = @PACKAGE_NAME@
|
||||
PACKAGE_STRING = @PACKAGE_STRING@
|
||||
PACKAGE_TARNAME = @PACKAGE_TARNAME@
|
||||
PACKAGE_URL = @PACKAGE_URL@
|
||||
PACKAGE_VERSION = @PACKAGE_VERSION@
|
||||
PATH_SEPARATOR = @PATH_SEPARATOR@
|
||||
RANLIB = @RANLIB@
|
||||
SED = @SED@
|
||||
SET_MAKE = @SET_MAKE@
|
||||
SHELL = @SHELL@
|
||||
SIMD_FLAGS = @SIMD_FLAGS@
|
||||
STRIP = @STRIP@
|
||||
VERSION = @VERSION@
|
||||
abs_builddir = @abs_builddir@
|
||||
abs_srcdir = @abs_srcdir@
|
||||
abs_top_builddir = @abs_top_builddir@
|
||||
abs_top_srcdir = @abs_top_srcdir@
|
||||
ac_ct_AR = @ac_ct_AR@
|
||||
ac_ct_CC = @ac_ct_CC@
|
||||
ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
|
||||
am__leading_dot = @am__leading_dot@
|
||||
am__tar = @am__tar@
|
||||
am__untar = @am__untar@
|
||||
bindir = @bindir@
|
||||
build = @build@
|
||||
build_alias = @build_alias@
|
||||
build_cpu = @build_cpu@
|
||||
build_os = @build_os@
|
||||
build_vendor = @build_vendor@
|
||||
builddir = @builddir@
|
||||
datadir = @datadir@
|
||||
datarootdir = @datarootdir@
|
||||
docdir = @docdir@
|
||||
dvidir = @dvidir@
|
||||
exec_prefix = @exec_prefix@
|
||||
host = @host@
|
||||
host_alias = @host_alias@
|
||||
host_cpu = @host_cpu@
|
||||
host_os = @host_os@
|
||||
host_vendor = @host_vendor@
|
||||
htmldir = @htmldir@
|
||||
includedir = @includedir@
|
||||
infodir = @infodir@
|
||||
install_sh = @install_sh@
|
||||
libdir = @libdir@
|
||||
libexecdir = @libexecdir@
|
||||
localedir = @localedir@
|
||||
localstatedir = @localstatedir@
|
||||
mandir = @mandir@
|
||||
mkdir_p = @mkdir_p@
|
||||
oldincludedir = @oldincludedir@
|
||||
pdfdir = @pdfdir@
|
||||
prefix = @prefix@
|
||||
program_transform_name = @program_transform_name@
|
||||
psdir = @psdir@
|
||||
sbindir = @sbindir@
|
||||
sharedstatedir = @sharedstatedir@
|
||||
srcdir = @srcdir@
|
||||
sysconfdir = @sysconfdir@
|
||||
target_alias = @target_alias@
|
||||
top_build_prefix = @top_build_prefix@
|
||||
top_builddir = @top_builddir@
|
||||
top_srcdir = @top_srcdir@
|
||||
INCLUDES = -I../
|
||||
AM_CFLAGS = -O3 $(SIMD_FLAGS) -fPIC $(INCLUDES)
|
||||
jerasure_01_SOURCES = jerasure_01.c
|
||||
jerasure_01_LDADD = ../src/libJerasure.la
|
||||
jerasure_02_SOURCES = jerasure_02.c
|
||||
jerasure_02_LDADD = ../src/libJerasure.la
|
||||
jerasure_03_SOURCES = jerasure_03.c
|
||||
jerasure_03_LDADD = ../src/libJerasure.la
|
||||
jerasure_04_SOURCES = jerasure_04.c
|
||||
jerasure_04_LDADD = ../src/libJerasure.la
|
||||
jerasure_05_SOURCES = jerasure_05.c
|
||||
jerasure_05_LDADD = ../src/libJerasure.la
|
||||
jerasure_06_SOURCES = jerasure_06.c
|
||||
jerasure_06_LDADD = ../src/libJerasure.la
|
||||
jerasure_07_SOURCES = jerasure_07.c
|
||||
jerasure_07_LDADD = ../src/libJerasure.la
|
||||
jerasure_08_SOURCES = jerasure_08.c
|
||||
jerasure_08_LDADD = ../src/libJerasure.la
|
||||
reed_sol_01_SOURCES = reed_sol_01.c
|
||||
reed_sol_01_LDADD = ../src/libJerasure.la
|
||||
reed_sol_02_SOURCES = reed_sol_02.c
|
||||
reed_sol_02_LDADD = ../src/libJerasure.la
|
||||
reed_sol_03_SOURCES = reed_sol_03.c
|
||||
reed_sol_03_LDADD = ../src/libJerasure.la
|
||||
reed_sol_04_SOURCES = reed_sol_04.c
|
||||
reed_sol_04_LDADD = ../src/libJerasure.la
|
||||
reed_sol_test_gf_SOURCES = reed_sol_test_gf.c
|
||||
reed_sol_test_gf_LDADD = ../src/libJerasure.la
|
||||
reed_sol_time_gf_SOURCES = reed_sol_time_gf.c
|
||||
reed_sol_time_gf_LDADD = ../src/libJerasure.la
|
||||
cauchy_01_SOURCES = cauchy_01.c
|
||||
cauchy_01_LDADD = ../src/libJerasure.la
|
||||
cauchy_02_SOURCES = cauchy_02.c
|
||||
cauchy_02_LDADD = ../src/libJerasure.la
|
||||
cauchy_03_SOURCES = cauchy_03.c
|
||||
cauchy_03_LDADD = ../src/libJerasure.la
|
||||
cauchy_04_SOURCES = cauchy_04.c
|
||||
cauchy_04_LDADD = ../src/libJerasure.la
|
||||
liberation_01_SOURCES = liberation_01.c
|
||||
liberation_01_LDADD = ../src/libJerasure.la
|
||||
encoder_SOURCES = encoder.c
|
||||
encoder_LDADD = ../src/libJerasure.la
|
||||
decoder_SOURCES = decoder.c
|
||||
decoder_LDADD = ../src/libJerasure.la
|
||||
all: all-am
|
||||
|
||||
.SUFFIXES:
|
||||
.SUFFIXES: .c .lo .o .obj
|
||||
$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps)
|
||||
@for dep in $?; do \
|
||||
case '$(am__configure_deps)' in \
|
||||
*$$dep*) \
|
||||
( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \
|
||||
&& { if test -f $@; then exit 0; else break; fi; }; \
|
||||
exit 1;; \
|
||||
esac; \
|
||||
done; \
|
||||
echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps Examples/Makefile'; \
|
||||
$(am__cd) $(top_srcdir) && \
|
||||
$(AUTOMAKE) --gnu --ignore-deps Examples/Makefile
|
||||
.PRECIOUS: Makefile
|
||||
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
|
||||
@case '$?' in \
|
||||
*config.status*) \
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
|
||||
*) \
|
||||
echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
|
||||
cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
|
||||
esac;
|
||||
|
||||
$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
|
||||
|
||||
$(top_srcdir)/configure: $(am__configure_deps)
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
|
||||
$(ACLOCAL_M4): $(am__aclocal_m4_deps)
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
|
||||
$(am__aclocal_m4_deps):
|
||||
install-binPROGRAMS: $(bin_PROGRAMS)
|
||||
@$(NORMAL_INSTALL)
|
||||
test -z "$(bindir)" || $(MKDIR_P) "$(DESTDIR)$(bindir)"
|
||||
@list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \
|
||||
for p in $$list; do echo "$$p $$p"; done | \
|
||||
sed 's/$(EXEEXT)$$//' | \
|
||||
while read p p1; do if test -f $$p || test -f $$p1; \
|
||||
then echo "$$p"; echo "$$p"; else :; fi; \
|
||||
done | \
|
||||
sed -e 'p;s,.*/,,;n;h' -e 's|.*|.|' \
|
||||
-e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \
|
||||
sed 'N;N;N;s,\n, ,g' | \
|
||||
$(AWK) 'BEGIN { files["."] = ""; dirs["."] = 1 } \
|
||||
{ d=$$3; if (dirs[d] != 1) { print "d", d; dirs[d] = 1 } \
|
||||
if ($$2 == $$4) files[d] = files[d] " " $$1; \
|
||||
else { print "f", $$3 "/" $$4, $$1; } } \
|
||||
END { for (d in files) print "f", d, files[d] }' | \
|
||||
while read type dir files; do \
|
||||
if test "$$dir" = .; then dir=; else dir=/$$dir; fi; \
|
||||
test -z "$$files" || { \
|
||||
echo " $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'"; \
|
||||
$(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files "$(DESTDIR)$(bindir)$$dir" || exit $$?; \
|
||||
} \
|
||||
; done
|
||||
|
||||
uninstall-binPROGRAMS:
|
||||
@$(NORMAL_UNINSTALL)
|
||||
@list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \
|
||||
files=`for p in $$list; do echo "$$p"; done | \
|
||||
sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \
|
||||
-e 's/$$/$(EXEEXT)/' `; \
|
||||
test -n "$$list" || exit 0; \
|
||||
echo " ( cd '$(DESTDIR)$(bindir)' && rm -f" $$files ")"; \
|
||||
cd "$(DESTDIR)$(bindir)" && rm -f $$files
|
||||
|
||||
clean-binPROGRAMS:
|
||||
@list='$(bin_PROGRAMS)'; test -n "$$list" || exit 0; \
|
||||
echo " rm -f" $$list; \
|
||||
rm -f $$list || exit $$?; \
|
||||
test -n "$(EXEEXT)" || exit 0; \
|
||||
list=`for p in $$list; do echo "$$p"; done | sed 's/$(EXEEXT)$$//'`; \
|
||||
echo " rm -f" $$list; \
|
||||
rm -f $$list
|
||||
cauchy_01$(EXEEXT): $(cauchy_01_OBJECTS) $(cauchy_01_DEPENDENCIES) $(EXTRA_cauchy_01_DEPENDENCIES)
|
||||
@rm -f cauchy_01$(EXEEXT)
|
||||
$(LINK) $(cauchy_01_OBJECTS) $(cauchy_01_LDADD) $(LIBS)
|
||||
cauchy_02$(EXEEXT): $(cauchy_02_OBJECTS) $(cauchy_02_DEPENDENCIES) $(EXTRA_cauchy_02_DEPENDENCIES)
|
||||
@rm -f cauchy_02$(EXEEXT)
|
||||
$(LINK) $(cauchy_02_OBJECTS) $(cauchy_02_LDADD) $(LIBS)
|
||||
cauchy_03$(EXEEXT): $(cauchy_03_OBJECTS) $(cauchy_03_DEPENDENCIES) $(EXTRA_cauchy_03_DEPENDENCIES)
|
||||
@rm -f cauchy_03$(EXEEXT)
|
||||
$(LINK) $(cauchy_03_OBJECTS) $(cauchy_03_LDADD) $(LIBS)
|
||||
cauchy_04$(EXEEXT): $(cauchy_04_OBJECTS) $(cauchy_04_DEPENDENCIES) $(EXTRA_cauchy_04_DEPENDENCIES)
|
||||
@rm -f cauchy_04$(EXEEXT)
|
||||
$(LINK) $(cauchy_04_OBJECTS) $(cauchy_04_LDADD) $(LIBS)
|
||||
decoder$(EXEEXT): $(decoder_OBJECTS) $(decoder_DEPENDENCIES) $(EXTRA_decoder_DEPENDENCIES)
|
||||
@rm -f decoder$(EXEEXT)
|
||||
$(LINK) $(decoder_OBJECTS) $(decoder_LDADD) $(LIBS)
|
||||
encoder$(EXEEXT): $(encoder_OBJECTS) $(encoder_DEPENDENCIES) $(EXTRA_encoder_DEPENDENCIES)
|
||||
@rm -f encoder$(EXEEXT)
|
||||
$(LINK) $(encoder_OBJECTS) $(encoder_LDADD) $(LIBS)
|
||||
jerasure_01$(EXEEXT): $(jerasure_01_OBJECTS) $(jerasure_01_DEPENDENCIES) $(EXTRA_jerasure_01_DEPENDENCIES)
|
||||
@rm -f jerasure_01$(EXEEXT)
|
||||
$(LINK) $(jerasure_01_OBJECTS) $(jerasure_01_LDADD) $(LIBS)
|
||||
jerasure_02$(EXEEXT): $(jerasure_02_OBJECTS) $(jerasure_02_DEPENDENCIES) $(EXTRA_jerasure_02_DEPENDENCIES)
|
||||
@rm -f jerasure_02$(EXEEXT)
|
||||
$(LINK) $(jerasure_02_OBJECTS) $(jerasure_02_LDADD) $(LIBS)
|
||||
jerasure_03$(EXEEXT): $(jerasure_03_OBJECTS) $(jerasure_03_DEPENDENCIES) $(EXTRA_jerasure_03_DEPENDENCIES)
|
||||
@rm -f jerasure_03$(EXEEXT)
|
||||
$(LINK) $(jerasure_03_OBJECTS) $(jerasure_03_LDADD) $(LIBS)
|
||||
jerasure_04$(EXEEXT): $(jerasure_04_OBJECTS) $(jerasure_04_DEPENDENCIES) $(EXTRA_jerasure_04_DEPENDENCIES)
|
||||
@rm -f jerasure_04$(EXEEXT)
|
||||
$(LINK) $(jerasure_04_OBJECTS) $(jerasure_04_LDADD) $(LIBS)
|
||||
jerasure_05$(EXEEXT): $(jerasure_05_OBJECTS) $(jerasure_05_DEPENDENCIES) $(EXTRA_jerasure_05_DEPENDENCIES)
|
||||
@rm -f jerasure_05$(EXEEXT)
|
||||
$(LINK) $(jerasure_05_OBJECTS) $(jerasure_05_LDADD) $(LIBS)
|
||||
jerasure_06$(EXEEXT): $(jerasure_06_OBJECTS) $(jerasure_06_DEPENDENCIES) $(EXTRA_jerasure_06_DEPENDENCIES)
|
||||
@rm -f jerasure_06$(EXEEXT)
|
||||
$(LINK) $(jerasure_06_OBJECTS) $(jerasure_06_LDADD) $(LIBS)
|
||||
jerasure_07$(EXEEXT): $(jerasure_07_OBJECTS) $(jerasure_07_DEPENDENCIES) $(EXTRA_jerasure_07_DEPENDENCIES)
|
||||
@rm -f jerasure_07$(EXEEXT)
|
||||
$(LINK) $(jerasure_07_OBJECTS) $(jerasure_07_LDADD) $(LIBS)
|
||||
jerasure_08$(EXEEXT): $(jerasure_08_OBJECTS) $(jerasure_08_DEPENDENCIES) $(EXTRA_jerasure_08_DEPENDENCIES)
|
||||
@rm -f jerasure_08$(EXEEXT)
|
||||
$(LINK) $(jerasure_08_OBJECTS) $(jerasure_08_LDADD) $(LIBS)
|
||||
liberation_01$(EXEEXT): $(liberation_01_OBJECTS) $(liberation_01_DEPENDENCIES) $(EXTRA_liberation_01_DEPENDENCIES)
|
||||
@rm -f liberation_01$(EXEEXT)
|
||||
$(LINK) $(liberation_01_OBJECTS) $(liberation_01_LDADD) $(LIBS)
|
||||
reed_sol_01$(EXEEXT): $(reed_sol_01_OBJECTS) $(reed_sol_01_DEPENDENCIES) $(EXTRA_reed_sol_01_DEPENDENCIES)
|
||||
@rm -f reed_sol_01$(EXEEXT)
|
||||
$(LINK) $(reed_sol_01_OBJECTS) $(reed_sol_01_LDADD) $(LIBS)
|
||||
reed_sol_02$(EXEEXT): $(reed_sol_02_OBJECTS) $(reed_sol_02_DEPENDENCIES) $(EXTRA_reed_sol_02_DEPENDENCIES)
|
||||
@rm -f reed_sol_02$(EXEEXT)
|
||||
$(LINK) $(reed_sol_02_OBJECTS) $(reed_sol_02_LDADD) $(LIBS)
|
||||
reed_sol_03$(EXEEXT): $(reed_sol_03_OBJECTS) $(reed_sol_03_DEPENDENCIES) $(EXTRA_reed_sol_03_DEPENDENCIES)
|
||||
@rm -f reed_sol_03$(EXEEXT)
|
||||
$(LINK) $(reed_sol_03_OBJECTS) $(reed_sol_03_LDADD) $(LIBS)
|
||||
reed_sol_04$(EXEEXT): $(reed_sol_04_OBJECTS) $(reed_sol_04_DEPENDENCIES) $(EXTRA_reed_sol_04_DEPENDENCIES)
|
||||
@rm -f reed_sol_04$(EXEEXT)
|
||||
$(LINK) $(reed_sol_04_OBJECTS) $(reed_sol_04_LDADD) $(LIBS)
|
||||
reed_sol_test_gf$(EXEEXT): $(reed_sol_test_gf_OBJECTS) $(reed_sol_test_gf_DEPENDENCIES) $(EXTRA_reed_sol_test_gf_DEPENDENCIES)
|
||||
@rm -f reed_sol_test_gf$(EXEEXT)
|
||||
$(LINK) $(reed_sol_test_gf_OBJECTS) $(reed_sol_test_gf_LDADD) $(LIBS)
|
||||
reed_sol_time_gf$(EXEEXT): $(reed_sol_time_gf_OBJECTS) $(reed_sol_time_gf_DEPENDENCIES) $(EXTRA_reed_sol_time_gf_DEPENDENCIES)
|
||||
@rm -f reed_sol_time_gf$(EXEEXT)
|
||||
$(LINK) $(reed_sol_time_gf_OBJECTS) $(reed_sol_time_gf_LDADD) $(LIBS)
|
||||
|
||||
mostlyclean-compile:
|
||||
-rm -f *.$(OBJEXT)
|
||||
|
||||
distclean-compile:
|
||||
-rm -f *.tab.c
|
||||
|
||||
.c.o:
|
||||
$(COMPILE) -c $<
|
||||
|
||||
.c.obj:
|
||||
$(COMPILE) -c `$(CYGPATH_W) '$<'`
|
||||
|
||||
.c.lo:
|
||||
$(LTCOMPILE) -c -o $@ $<
|
||||
|
||||
mostlyclean-libtool:
|
||||
-rm -f *.lo
|
||||
|
||||
clean-libtool:
|
||||
-rm -rf .libs _libs
|
||||
|
||||
ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
|
||||
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
|
||||
unique=`for i in $$list; do \
|
||||
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||
done | \
|
||||
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
|
||||
END { if (nonempty) { for (i in files) print i; }; }'`; \
|
||||
mkid -fID $$unique
|
||||
tags: TAGS
|
||||
|
||||
TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
|
||||
$(TAGS_FILES) $(LISP)
|
||||
set x; \
|
||||
here=`pwd`; \
|
||||
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
|
||||
unique=`for i in $$list; do \
|
||||
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||
done | \
|
||||
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
|
||||
END { if (nonempty) { for (i in files) print i; }; }'`; \
|
||||
shift; \
|
||||
if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \
|
||||
test -n "$$unique" || unique=$$empty_fix; \
|
||||
if test $$# -gt 0; then \
|
||||
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
|
||||
"$$@" $$unique; \
|
||||
else \
|
||||
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
|
||||
$$unique; \
|
||||
fi; \
|
||||
fi
|
||||
ctags: CTAGS
|
||||
CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
|
||||
$(TAGS_FILES) $(LISP)
|
||||
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
|
||||
unique=`for i in $$list; do \
|
||||
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||
done | \
|
||||
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
|
||||
END { if (nonempty) { for (i in files) print i; }; }'`; \
|
||||
test -z "$(CTAGS_ARGS)$$unique" \
|
||||
|| $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
|
||||
$$unique
|
||||
|
||||
GTAGS:
|
||||
here=`$(am__cd) $(top_builddir) && pwd` \
|
||||
&& $(am__cd) $(top_srcdir) \
|
||||
&& gtags -i $(GTAGS_ARGS) "$$here"
|
||||
|
||||
distclean-tags:
|
||||
-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
|
||||
|
||||
distdir: $(DISTFILES)
|
||||
@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
|
||||
topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
|
||||
list='$(DISTFILES)'; \
|
||||
dist_files=`for file in $$list; do echo $$file; done | \
|
||||
sed -e "s|^$$srcdirstrip/||;t" \
|
||||
-e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
|
||||
case $$dist_files in \
|
||||
*/*) $(MKDIR_P) `echo "$$dist_files" | \
|
||||
sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
|
||||
sort -u` ;; \
|
||||
esac; \
|
||||
for file in $$dist_files; do \
|
||||
if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
|
||||
if test -d $$d/$$file; then \
|
||||
dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
|
||||
if test -d "$(distdir)/$$file"; then \
|
||||
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
|
||||
fi; \
|
||||
if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
|
||||
cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
|
||||
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
|
||||
fi; \
|
||||
cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
|
||||
else \
|
||||
test -f "$(distdir)/$$file" \
|
||||
|| cp -p $$d/$$file "$(distdir)/$$file" \
|
||||
|| exit 1; \
|
||||
fi; \
|
||||
done
|
||||
check-am: all-am
|
||||
check: check-am
|
||||
all-am: Makefile $(PROGRAMS)
|
||||
installdirs:
|
||||
for dir in "$(DESTDIR)$(bindir)"; do \
|
||||
test -z "$$dir" || $(MKDIR_P) "$$dir"; \
|
||||
done
|
||||
install: install-am
|
||||
install-exec: install-exec-am
|
||||
install-data: install-data-am
|
||||
uninstall: uninstall-am
|
||||
|
||||
install-am: all-am
|
||||
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
|
||||
|
||||
installcheck: installcheck-am
|
||||
install-strip:
|
||||
if test -z '$(STRIP)'; then \
|
||||
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
|
||||
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
|
||||
install; \
|
||||
else \
|
||||
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
|
||||
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
|
||||
"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
|
||||
fi
|
||||
mostlyclean-generic:
|
||||
|
||||
clean-generic:
|
||||
|
||||
distclean-generic:
|
||||
-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
|
||||
-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
|
||||
|
||||
maintainer-clean-generic:
|
||||
@echo "This command is intended for maintainers to use"
|
||||
@echo "it deletes files that may require special tools to rebuild."
|
||||
clean: clean-am
|
||||
|
||||
clean-am: clean-binPROGRAMS clean-generic clean-libtool mostlyclean-am
|
||||
|
||||
distclean: distclean-am
|
||||
-rm -f Makefile
|
||||
distclean-am: clean-am distclean-compile distclean-generic \
|
||||
distclean-tags
|
||||
|
||||
dvi: dvi-am
|
||||
|
||||
dvi-am:
|
||||
|
||||
html: html-am
|
||||
|
||||
html-am:
|
||||
|
||||
info: info-am
|
||||
|
||||
info-am:
|
||||
|
||||
install-data-am:
|
||||
|
||||
install-dvi: install-dvi-am
|
||||
|
||||
install-dvi-am:
|
||||
|
||||
install-exec-am: install-binPROGRAMS
|
||||
|
||||
install-html: install-html-am
|
||||
|
||||
install-html-am:
|
||||
|
||||
install-info: install-info-am
|
||||
|
||||
install-info-am:
|
||||
|
||||
install-man:
|
||||
|
||||
install-pdf: install-pdf-am
|
||||
|
||||
install-pdf-am:
|
||||
|
||||
install-ps: install-ps-am
|
||||
|
||||
install-ps-am:
|
||||
|
||||
installcheck-am:
|
||||
|
||||
maintainer-clean: maintainer-clean-am
|
||||
-rm -f Makefile
|
||||
maintainer-clean-am: distclean-am maintainer-clean-generic
|
||||
|
||||
mostlyclean: mostlyclean-am
|
||||
|
||||
mostlyclean-am: mostlyclean-compile mostlyclean-generic \
|
||||
mostlyclean-libtool
|
||||
|
||||
pdf: pdf-am
|
||||
|
||||
pdf-am:
|
||||
|
||||
ps: ps-am
|
||||
|
||||
ps-am:
|
||||
|
||||
uninstall-am: uninstall-binPROGRAMS
|
||||
|
||||
.MAKE: install-am install-strip
|
||||
|
||||
.PHONY: CTAGS GTAGS all all-am check check-am clean clean-binPROGRAMS \
|
||||
clean-generic clean-libtool ctags distclean distclean-compile \
|
||||
distclean-generic distclean-libtool distclean-tags distdir dvi \
|
||||
dvi-am html html-am info info-am install install-am \
|
||||
install-binPROGRAMS install-data install-data-am install-dvi \
|
||||
install-dvi-am install-exec install-exec-am install-html \
|
||||
install-html-am install-info install-info-am install-man \
|
||||
install-pdf install-pdf-am install-ps install-ps-am \
|
||||
install-strip installcheck installcheck-am installdirs \
|
||||
maintainer-clean maintainer-clean-generic mostlyclean \
|
||||
mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
|
||||
pdf pdf-am ps ps-am tags uninstall uninstall-am \
|
||||
uninstall-binPROGRAMS
|
||||
|
||||
|
||||
# Tell versions [3.59,3.63) of GNU make to not export all variables.
|
||||
# Otherwise a system limit (for SysV at least) may be exceeded.
|
||||
.NOEXPORT:
|
||||
|
|
@ -1,51 +1,51 @@
|
|||
/* Examples/cauchy_01.c
|
||||
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
/* *
|
||||
* 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 <stdint.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include "jerasure.h"
|
||||
|
|
@ -55,36 +55,56 @@ POSSIBILITY OF SUCH DAMAGE.
|
|||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: cauchy_01 n w - Prints the number of ones in the bitmatrix representation of n in GF(2^w).\n");
|
||||
fprintf(stderr, "usage: cauchy_01 n w - Converts the value n to a bitmatrix using GF(2^w).\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " It also prints out the bit-matrix and confirms that the number of ones is correct.\n");
|
||||
fprintf(stderr, " It prints the bitmatrix, and reports on the numberof ones.\n");
|
||||
fprintf(stderr, " Use 0x to input n in hexadecimal.\n");
|
||||
fprintf(stderr, " W must be <= 32.\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, "This demonstrates: cauchy_n_ones()\n");
|
||||
fprintf(stderr, " jerasure_matrix_to_bitmatrix()\n");
|
||||
fprintf(stderr, " jerasure_print_bitmatrix()\n");
|
||||
if (s != NULL) fprintf(stderr, "%s\n", s);
|
||||
if (s != NULL) fprintf(stderr, "\n%s\n", s);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
int n, i, no, w;
|
||||
uint32_t n;
|
||||
int i, no, w;
|
||||
int *bitmatrix;
|
||||
|
||||
if (argc != 3) usage(NULL);
|
||||
if (sscanf(argv[1], "%d", &n) == 0 || n <= 0) usage("Bad n");
|
||||
if (sscanf(argv[1], "0x%x", &n) == 0) {
|
||||
if (sscanf(argv[1], "%d", &n) == 0) usage("Bad n");
|
||||
}
|
||||
if (sscanf(argv[2], "%d", &w) == 0 || w <= 0 || w > 32) usage("Bad w");
|
||||
if (w < 30 && n >= (1 << w)) usage("n is too big");
|
||||
if (w == 31) {
|
||||
if (n & 0x80000000L) usage("Bad n/w combination (n not between 0 and 2^w-1)\n");
|
||||
} else if (w < 31) {
|
||||
if (n >= (1 << w)) usage("Bad n/w combination (n not between 0 and 2^w-1)\n");
|
||||
}
|
||||
|
||||
bitmatrix = jerasure_matrix_to_bitmatrix(1, 1, w, &n);
|
||||
printf("<HTML><title>cauchy_01 %u %d</title>\n", w, n);
|
||||
printf("<HTML><h3>cauchy_01 %u %d</h3>\n", w, n);
|
||||
printf("<pre>\n");
|
||||
if (w == 32) {
|
||||
printf("Converted the value 0x%x to the following bitmatrix:\n\n", n);
|
||||
} else {
|
||||
printf("Converted the value %d (0x%x) to the following bitmatrix:\n\n", n, n);
|
||||
}
|
||||
jerasure_print_bitmatrix(bitmatrix, w, w, w);
|
||||
printf("\n");
|
||||
|
||||
no = 0;
|
||||
for (i = 0; i < w*w; i++) no += bitmatrix[i];
|
||||
if (no != cauchy_n_ones(n, w)) {
|
||||
fprintf(stderr, "Jerasure error: # ones in the bitmatrix (%d) doesn't match cauchy_n_ones() (%d).\n",
|
||||
no, cauchy_n_ones(n, w));
|
||||
exit(1);
|
||||
}
|
||||
|
||||
printf("# Ones: %d\n", cauchy_n_ones(n, w));
|
||||
printf("\n");
|
||||
printf("Bitmatrix has %d ones\n", no);
|
||||
printf("\n");
|
||||
jerasure_print_bitmatrix(bitmatrix, w, w, w);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,57 +1,54 @@
|
|||
/* Examples/cauchy_02.c
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
/* *
|
||||
* 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
|
||||
*/
|
||||
|
||||
/*
|
||||
revised by S. Simmerman
|
||||
2/25/08
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdint.h>
|
||||
#include <string.h>
|
||||
#include <gf_rand.h>
|
||||
#include "jerasure.h"
|
||||
#include "cauchy.h"
|
||||
|
||||
|
|
@ -59,79 +56,76 @@ POSSIBILITY OF SUCH DAMAGE.
|
|||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: cauchy_02 k m w - Scheduled CRS coding example with the original matrix in GF(2^w).\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " k+m must be <= 2^w. It sets up a Cauchy distribution matrix using the original\n");
|
||||
fprintf(stderr, " Cauchy Distribution matrix construction algorithm, then it encodes\n");
|
||||
fprintf(stderr, " k devices of w*%d bytes using smart bit-matrix scheduling.\n", sizeof(long));
|
||||
fprintf(stderr, " It decodes using bit-matrix scheduling as well.\n");
|
||||
fprintf(stderr, "usage: cauchy_02 k m w seed - CRS coding example using Bloemer's original matrix.\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, "k+m must be <= 2^w\n");
|
||||
fprintf(stderr, "This sets up a generator matrix (G^T) in GF(2^w) whose last m rows are\n");
|
||||
fprintf(stderr, "created from a Cauchy matrix, using the original definition from [Bloemer95].\n");
|
||||
fprintf(stderr, "It converts this matrix to a bitmatrix, and then it encodes w packets from\n");
|
||||
fprintf(stderr, "each of k disks (simulated) onto w packets on each of m disks. Packets are \n");
|
||||
fprintf(stderr, "simply longs. Then, it deletes m random disks, and decodes. \n");
|
||||
fprintf(stderr, "\n");
|
||||
fprintf(stderr, "The encoding and decoding are done twice, first, with jerasure_bitmatrix_encode()\n");
|
||||
fprintf(stderr, "and jerasure_bitmatrix_decode(), and second using 'smart' scheduling with\n");
|
||||
fprintf(stderr, "jerasure_schedule_encode() and jerasure_schedule_decode_lazy().\n");
|
||||
|
||||
fprintf(stderr, "\n");
|
||||
fprintf(stderr, "This demonstrates: cauchy_original_coding_matrix()\n");
|
||||
fprintf(stderr, " cauchy_xy_coding_matrix()\n");
|
||||
fprintf(stderr, " jerasure_bitmatrix_encode()\n");
|
||||
fprintf(stderr, " jerasure_bitmatrix_decode()\n");
|
||||
fprintf(stderr, " cauchy_n_ones()\n");
|
||||
fprintf(stderr, " jerasure_smart_bitmatrix_to_schedule()\n");
|
||||
fprintf(stderr, " jerasure_schedule_encode()\n");
|
||||
fprintf(stderr, " jerasure_schedule_decode_lazy()\n");
|
||||
fprintf(stderr, " jerasure_print_matrix()\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_data_and_coding(int k, int m, int w, int psize,
|
||||
char **data, char **coding)
|
||||
static print_array(char **ptrs, int ndevices, int size, int packetsize, char *label)
|
||||
{
|
||||
int i, j, x, n, sp;
|
||||
long l;
|
||||
int i, j, x;
|
||||
unsigned char *up;
|
||||
|
||||
if(k > m) n = k;
|
||||
else n = m;
|
||||
sp = psize * 2 + (psize/4) + 12;
|
||||
|
||||
printf("%-*sCoding\n", sp, "Data");
|
||||
for(i = 0; i < n; i++) {
|
||||
for (j = 0; j < w; j++) {
|
||||
if(i < k) {
|
||||
|
||||
if(j==0) printf("D%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, data[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
printf(" ");
|
||||
}
|
||||
else printf("%*s", sp, "");
|
||||
if(i < m) {
|
||||
if(j==0) printf("C%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, coding[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
}
|
||||
|
||||
printf("\n");
|
||||
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)
|
||||
{
|
||||
long l;
|
||||
int k, w, i, j, m;
|
||||
int *matrix, *bitmatrix, *m2, *x, *y;
|
||||
char **data, **coding, **ptrs;
|
||||
int **smart;
|
||||
int *matrix, *bitmatrix, **schedule;
|
||||
char **data, **coding, **ptrs, **dcopy, **ccopy;
|
||||
int no;
|
||||
int *erasures, *erased;
|
||||
double stats[3];
|
||||
double mstats[3], sstats[3];
|
||||
uint32_t seed;
|
||||
|
||||
if (argc != 4) usage(NULL);
|
||||
if (argc != 5) usage(NULL);
|
||||
if (sscanf(argv[1], "%d", &k) == 0 || k <= 0) usage("Bad k");
|
||||
if (sscanf(argv[2], "%d", &m) == 0 || m <= 0) usage("Bad m");
|
||||
if (sscanf(argv[3], "%d", &w) == 0 || w <= 0 || w > 32) usage("Bad w");
|
||||
if (sscanf(argv[4], "%d", &seed) == 0) usage("Bad seed");
|
||||
if (w < 30 && (k+m) > (1 << w)) usage("k + m is too big");
|
||||
|
||||
matrix = cauchy_original_coding_matrix(k, m, w);
|
||||
|
|
@ -139,42 +133,90 @@ int main(int argc, char **argv)
|
|||
usage("couldn't make coding matrix");
|
||||
}
|
||||
|
||||
/* Print out header information to the output file. */
|
||||
printf("<HTML>\n");
|
||||
printf("<TITLE>Jerasure Example Output: cauchy_02 %d %d %d %d</TITLE>\n", k, m, w, seed);
|
||||
printf("<h2>Jerasure Example Output: cauchy_02 %d %d %d %d</h3>\n", k, m, w, seed);
|
||||
|
||||
printf("<hr>\n");
|
||||
printf("Parameters:\n");
|
||||
printf("<UL><LI> Number of data disks <i>(k)</i>: %d\n", k);
|
||||
printf("<LI> Number of coding disks <i>(m)</i>: %d\n", m);
|
||||
printf("<LI> Word size of the Galois Field: <i>(w)</i>: %d\n", w);
|
||||
printf("<LI> Seed for the random number generator: %d\n", seed);
|
||||
printf("<LI> Number of bytes stored per disk: %ld\n", sizeof(long)*w);
|
||||
printf("<LI> Number of packets stored per disk: %d\n", w);
|
||||
printf("<LI> Number of bytes per packet: %ld\n", sizeof(long));
|
||||
printf("</UL>\n");
|
||||
|
||||
/* Print out the matrix and the bitmatrix */
|
||||
printf("<hr>\n");
|
||||
printf("Here is the matrix, which was created with <b>cauchy_original_coding_matrix()</b>.\n");
|
||||
printf("This is not the best matrix to use, but we include it to show an example\n");
|
||||
printf("of <b>cauchy_original_coding_matrix()</b>. For the best matrix and encoding/decoding\n");
|
||||
printf("methodology, see <b>cauchy_04.</b><p><pre>\n");
|
||||
|
||||
jerasure_print_matrix(matrix, m, k, w);
|
||||
printf("</pre>\n");
|
||||
|
||||
bitmatrix = jerasure_matrix_to_bitmatrix(k, m, w, matrix);
|
||||
|
||||
no = 0;
|
||||
for (i = 0; i < k*m; i++) {
|
||||
no += cauchy_n_ones(matrix[i], w);
|
||||
}
|
||||
printf("Matrix has %d ones\n\n", no);
|
||||
jerasure_print_matrix(matrix, m, k, w);
|
||||
printf("\n", no);
|
||||
bitmatrix = jerasure_matrix_to_bitmatrix(k, m, w, matrix);
|
||||
|
||||
smart = jerasure_smart_bitmatrix_to_schedule(k, m, w, bitmatrix);
|
||||
printf("The bitmatrix, which has %d one%s:<p><pre>\n", no, (no == 1) ? "" : "s");
|
||||
jerasure_print_bitmatrix(bitmatrix, m*w, k*w, w);
|
||||
printf("</pre>\n");
|
||||
printf("<hr>\n");
|
||||
MOA_Seed(seed);
|
||||
|
||||
srand48(0);
|
||||
data = talloc(char *, k);
|
||||
dcopy = talloc(char *, k);
|
||||
for (i = 0; i < k; i++) {
|
||||
data[i] = talloc(char, sizeof(long)*w);
|
||||
for (j = 0; j < w; j++) {
|
||||
l = lrand48();
|
||||
memcpy(data[i]+j*sizeof(long), &l, sizeof(long));
|
||||
dcopy[i] = talloc(char, sizeof(long)*w);
|
||||
MOA_Fill_Random_Region(data[i], sizeof(long)*w);
|
||||
memcpy(dcopy[i], data[i], sizeof(long)*w);
|
||||
}
|
||||
|
||||
printf("Here are the packets on the data disks:<p>\n");
|
||||
print_array(data, k, sizeof(long)*w, sizeof(long), "D");
|
||||
|
||||
coding = talloc(char *, m);
|
||||
ccopy = talloc(char *, m);
|
||||
for (i = 0; i < m; i++) {
|
||||
coding[i] = talloc(char, sizeof(long)*w);
|
||||
ccopy[i] = talloc(char, sizeof(long)*w);
|
||||
}
|
||||
|
||||
jerasure_bitmatrix_encode(k, m, w, bitmatrix, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(mstats);
|
||||
|
||||
schedule = jerasure_smart_bitmatrix_to_schedule(k, m, w, bitmatrix);
|
||||
jerasure_schedule_encode(k, m, w, schedule, data, ccopy, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(sstats);
|
||||
|
||||
printf("<p>Encoding with jerasure_bitmatrix_encode() - Bytes XOR'd: %.0lf.<br>\n", mstats[0]);
|
||||
printf("Encoding with jerasure_schedule_encode() - Bytes XOR'd: %.0lf.<br>\n", sstats[0]);
|
||||
|
||||
for (i = 0; i < m; i++) {
|
||||
if (memcmp(coding[i], ccopy[i], sizeof(long)*w) != 0) {
|
||||
printf("Problem: the two encodings don't match on disk C%x\n", i);
|
||||
exit(0);
|
||||
}
|
||||
}
|
||||
|
||||
coding = talloc(char *, m);
|
||||
for (i = 0; i < m; i++) {
|
||||
coding[i] = talloc(char, sizeof(long)*w);
|
||||
}
|
||||
|
||||
jerasure_schedule_encode(k, m, w, smart, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(stats);
|
||||
printf("Smart Encoding Complete: - %.0lf XOR'd bytes\n\n", stats[0]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
printf("Here are the packets on the coding disks.<br>\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] = lrand48()%(k+m);
|
||||
erasures[i] = MOA_Random_W(31, 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);
|
||||
|
|
@ -182,29 +224,47 @@ int main(int argc, char **argv)
|
|||
}
|
||||
}
|
||||
erasures[i] = -1;
|
||||
printf("Erasures on the following devices:");
|
||||
for (i = 0; erasures[i] != -1; i++) {
|
||||
printf(" %c%x", ((erasures[i] < k) ? 'D' : 'C'), (erasures[i] < k ? erasures[i] : erasures[i]-k));
|
||||
}
|
||||
printf("<br>\nHere is the state of the system:\n<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");
|
||||
|
||||
printf("Erased %d random devices:\n\n", m);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
|
||||
jerasure_schedule_decode_lazy(k, m, w, bitmatrix, erasures, data, coding, w*sizeof(long), sizeof(long), 1);
|
||||
jerasure_get_stats(stats);
|
||||
jerasure_bitmatrix_decode(k, m, w, bitmatrix, 0, erasures, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(mstats);
|
||||
|
||||
printf("State of the system after decoding: %.0lf XOR'd bytes\n\n", stats[0]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
|
||||
x = talloc(int, m);
|
||||
y = talloc(int, k);
|
||||
if (x == NULL || y == NULL) { perror("malloc"); exit(1); }
|
||||
for (i = 0; i < m; i++) x[i] = i;
|
||||
for (i = 0; i < k; i++) y[i] = m+i;
|
||||
m2 = cauchy_xy_coding_matrix(k, m, w, x, y);
|
||||
if (memcmp(matrix, m2, sizeof(int)*k*m) != 0) {
|
||||
printf("Error -- the matrices made by original and xy don't match\n");
|
||||
exit(1);
|
||||
} else {
|
||||
printf("Generated the identical matrix using cauchy_xy_coding_matrix()\n");
|
||||
printf("<p>Decoded with jerasure_bitmatrix_decode - Bytes XOR'd: %.0lf.<br>\n", mstats[0]);
|
||||
|
||||
for (i = 0; i < k; i++) if (memcmp(data[i], dcopy[i], sizeof(long)*w) != 0) {
|
||||
printf("ERROR: D%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
for (i = 0; i < m; i++) if (memcmp(coding[i], ccopy[i], sizeof(long)*w) != 0) {
|
||||
printf("ERROR: C%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
|
||||
for (i = 0; erasures[i] != -1; i++) {
|
||||
bzero((erasures[i] < k) ? data[erasures[i]] : coding[erasures[i]-k], sizeof(long)*w);
|
||||
}
|
||||
|
||||
return 0;
|
||||
jerasure_schedule_decode_lazy(k, m, w, bitmatrix, erasures, data, coding, w*sizeof(long), sizeof(long), 1);
|
||||
jerasure_get_stats(sstats);
|
||||
|
||||
printf("jerasure_schedule_decode_lazy - Bytes XOR'd: %.0lf.<br>\n", sstats[0]);
|
||||
|
||||
for (i = 0; i < k; i++) if (memcmp(data[i], dcopy[i], sizeof(long)*w) != 0) {
|
||||
printf("ERROR: D%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
for (i = 0; i < m; i++) if (memcmp(coding[i], ccopy[i], sizeof(long)*w) != 0) {
|
||||
printf("ERROR: C%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
|
||||
printf("Here is the state of the system:\n<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");
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,59 +1,54 @@
|
|||
/* Examples/cauchy_03.c
|
||||
* James S. Plank
|
||||
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
/* *
|
||||
* 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
|
||||
*/
|
||||
|
||||
/*
|
||||
revised by S. Simmerman
|
||||
2/25/08
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdint.h>
|
||||
#include <string.h>
|
||||
#include <gf_rand.h>
|
||||
#include "jerasure.h"
|
||||
#include "cauchy.h"
|
||||
|
||||
|
|
@ -61,128 +56,185 @@ POSSIBILITY OF SUCH DAMAGE.
|
|||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: cauchy_03 k m w - Scheduled CRS coding example with improved matrix in GF(2^w).\n");
|
||||
fprintf(stderr, "usage: cauchy_03 k m w seed - CRS coding example improving the matrix.\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " k+m must be <= 2^w. It sets up a Cauchy distribution matrix using the original\n");
|
||||
fprintf(stderr, " Cauchy Distribution matrix construction algorithm, then improves it\n");
|
||||
fprintf(stderr, " with cauchy_improve_coding_matrix(). Then it does the same encoding and\n");
|
||||
fprintf(stderr, " decoding as cauchy_02.\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, "This demonstrates: cauchy_original_coding_matrix()\n");
|
||||
fprintf(stderr, "k+m must be <= 2^w\n");
|
||||
fprintf(stderr, "This sets up a generator matrix (G^T) in GF(2^w) whose last m rows are\n");
|
||||
fprintf(stderr, "created from a Cauchy matrix, using the original definition from [Bloemer95].\n");
|
||||
fprintf(stderr, "This is done with cauchy_xy_coding_matrix().\n");
|
||||
fprintf(stderr, "\n");
|
||||
fprintf(stderr, "It then it improves the matrix, which yields a different bitmatrix that is\n");
|
||||
fprintf(stderr, "MDS like the original bitmatrix, but it will yield a bitmatrix with fewer ones.\n");
|
||||
fprintf(stderr, "Then, it encodes w packets from each of k disks (simulated) onto w packets on\n");
|
||||
fprintf(stderr, "on each of m disks. Packets are longs. Then, it deletes m random disks, and decodes.\n");
|
||||
fprintf(stderr, "\n");
|
||||
fprintf(stderr, "The encoding and decoding are done twice, first, with jerasure_bitmatrix_encode()\n");
|
||||
fprintf(stderr, "and jerasure_bitmatrix_decode(), and second using 'smart' scheduling with\n");
|
||||
fprintf(stderr, "jerasure_schedule_encode() and jerasure_schedule_decode_lazy().\n");
|
||||
|
||||
fprintf(stderr, "\n");
|
||||
fprintf(stderr, "This demonstrates: cauchy_xy_coding_matrix()\n");
|
||||
fprintf(stderr, " cauchy_improve_coding_matrix()\n");
|
||||
fprintf(stderr, " jerasure_bitmatrix_encode()\n");
|
||||
fprintf(stderr, " jerasure_bitmatrix_decode()\n");
|
||||
fprintf(stderr, " cauchy_n_ones()\n");
|
||||
fprintf(stderr, " jerasure_smart_bitmatrix_to_schedule()\n");
|
||||
fprintf(stderr, " jerasure_schedule_encode()\n");
|
||||
fprintf(stderr, " jerasure_schedule_decode_lazy()\n");
|
||||
fprintf(stderr, " jerasure_print_matrix()\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_data_and_coding(int k, int m, int w, int psize,
|
||||
char **data, char **coding)
|
||||
static print_array(char **ptrs, int ndevices, int size, int packetsize, char *label)
|
||||
{
|
||||
int i, j, x, n, sp;
|
||||
long l;
|
||||
int i, j, x;
|
||||
unsigned char *up;
|
||||
|
||||
if(k > m) n = k;
|
||||
else n = m;
|
||||
sp = psize * 2 + (psize/4) + 12;
|
||||
|
||||
printf("%-*sCoding\n", sp, "Data");
|
||||
for(i = 0; i < n; i++) {
|
||||
for (j = 0; j < w; j++) {
|
||||
if(i < k) {
|
||||
|
||||
if(j==0) printf("D%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, data[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
printf(" ");
|
||||
}
|
||||
else printf("%*s", sp, "");
|
||||
if(i < m) {
|
||||
if(j==0) printf("C%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, coding[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
}
|
||||
|
||||
printf("\n");
|
||||
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)
|
||||
{
|
||||
long l;
|
||||
int k, w, i, j, m;
|
||||
int *matrix, *bitmatrix, *m2, *x, *y;
|
||||
char **data, **coding, **ptrs;
|
||||
int **smart;
|
||||
int *matrix, *bitmatrix, **schedule;
|
||||
char **data, **coding, **ptrs, **dcopy, **ccopy;
|
||||
int no;
|
||||
int *erasures, *erased;
|
||||
double stats[3];
|
||||
double mstats[3], sstats[3];
|
||||
uint32_t seed;
|
||||
int *X, *Y;
|
||||
|
||||
if (argc != 4) usage(NULL);
|
||||
if (argc != 5) usage(NULL);
|
||||
if (sscanf(argv[1], "%d", &k) == 0 || k <= 0) usage("Bad k");
|
||||
if (sscanf(argv[2], "%d", &m) == 0 || m <= 0) usage("Bad m");
|
||||
if (sscanf(argv[3], "%d", &w) == 0 || w <= 0 || w > 32) usage("Bad w");
|
||||
if (sscanf(argv[4], "%d", &seed) == 0) usage("Bad seed");
|
||||
if (w < 30 && (k+m) > (1 << w)) usage("k + m is too big");
|
||||
|
||||
matrix = cauchy_original_coding_matrix(k, m, w);
|
||||
X = talloc(int, m);
|
||||
Y = talloc(int, k);
|
||||
for (i = 0; i < m; i++) X[i] = i;
|
||||
for (i = 0; i < k; i++) Y[i] = m+i;
|
||||
|
||||
matrix = cauchy_xy_coding_matrix(k, m, w, X, Y);
|
||||
if (matrix == NULL) {
|
||||
usage("couldn't make coding matrix");
|
||||
}
|
||||
|
||||
no = 0;
|
||||
for (i = 0; i < k*m; i++) {
|
||||
no += cauchy_n_ones(matrix[i], w);
|
||||
}
|
||||
printf("The Original Matrix has %d ones\n", no);
|
||||
cauchy_improve_coding_matrix(k, m, w, matrix);
|
||||
no = 0;
|
||||
for (i = 0; i < k*m; i++) {
|
||||
no += cauchy_n_ones(matrix[i], w);
|
||||
}
|
||||
printf("The Improved Matrix has %d ones\n\n", no);
|
||||
/* Print out header information to the output file. */
|
||||
printf("<HTML>\n");
|
||||
printf("<TITLE>Jerasure Example Output: cauchy_03 %d %d %d %d</TITLE>\n", k, m, w, seed);
|
||||
printf("<h2>Jerasure Example Output: cauchy_03 %d %d %d %d</h3>\n", k, m, w, seed);
|
||||
|
||||
printf("<hr>\n");
|
||||
printf("Parameters:\n");
|
||||
printf("<UL><LI> Number of data disks <i>(k)</i>: %d\n", k);
|
||||
printf("<LI> Number of coding disks <i>(m)</i>: %d\n", m);
|
||||
printf("<LI> Word size of the Galois Field: <i>(w)</i>: %d\n", w);
|
||||
printf("<LI> Seed for the random number generator: %d\n", seed);
|
||||
printf("<LI> Number of bytes stored per disk: %ld\n", sizeof(long)*w);
|
||||
printf("<LI> Number of packets stored per disk: %d\n", w);
|
||||
printf("<LI> Number of bytes per packet: %ld\n", sizeof(long));
|
||||
printf("</UL>\n");
|
||||
|
||||
/* Print out the matrix and the bitmatrix */
|
||||
printf("<hr>\n");
|
||||
printf("Here is the matrix, which was created with <b>cauchy_xy_coding_matrix()</b>.\n");
|
||||
|
||||
printf("<pre>\n");
|
||||
jerasure_print_matrix(matrix, m, k, w);
|
||||
printf("\n", no);
|
||||
printf("</pre>\n");
|
||||
|
||||
cauchy_improve_coding_matrix(k, m, w, matrix);
|
||||
|
||||
printf("<hr>\n");
|
||||
printf("Here is the matrix improved with <b>cauchy_improve_coding_matrix()</b>.\n");
|
||||
|
||||
printf("<pre>\n");
|
||||
jerasure_print_matrix(matrix, m, k, w);
|
||||
printf("</pre>\n");
|
||||
|
||||
bitmatrix = jerasure_matrix_to_bitmatrix(k, m, w, matrix);
|
||||
|
||||
smart = jerasure_smart_bitmatrix_to_schedule(k, m, w, bitmatrix);
|
||||
no = 0;
|
||||
for (i = 0; i < k*m; i++) {
|
||||
no += cauchy_n_ones(matrix[i], w);
|
||||
}
|
||||
|
||||
printf("The bitmatrix, which has %d one%s:<p><pre>\n", no, (no == 1) ? "" : "s");
|
||||
jerasure_print_bitmatrix(bitmatrix, m*w, k*w, w);
|
||||
printf("</pre>\n");
|
||||
printf("<hr>\n");
|
||||
|
||||
MOA_Seed(seed);
|
||||
|
||||
srand48(0);
|
||||
data = talloc(char *, k);
|
||||
dcopy = talloc(char *, k);
|
||||
for (i = 0; i < k; i++) {
|
||||
data[i] = talloc(char, sizeof(long)*w);
|
||||
for (j = 0; j < w; j++) {
|
||||
l = lrand48();
|
||||
memcpy(data[i]+j*sizeof(long), &l, sizeof(long));
|
||||
dcopy[i] = talloc(char, sizeof(long)*w);
|
||||
MOA_Fill_Random_Region(data[i], sizeof(long)*w);
|
||||
memcpy(dcopy[i], data[i], sizeof(long)*w);
|
||||
}
|
||||
|
||||
printf("Here are the packets on the data disks:<p>\n");
|
||||
print_array(data, k, sizeof(long)*w, sizeof(long), "D");
|
||||
|
||||
coding = talloc(char *, m);
|
||||
ccopy = talloc(char *, m);
|
||||
for (i = 0; i < m; i++) {
|
||||
coding[i] = talloc(char, sizeof(long)*w);
|
||||
ccopy[i] = talloc(char, sizeof(long)*w);
|
||||
}
|
||||
|
||||
jerasure_bitmatrix_encode(k, m, w, bitmatrix, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(mstats);
|
||||
|
||||
schedule = jerasure_smart_bitmatrix_to_schedule(k, m, w, bitmatrix);
|
||||
jerasure_schedule_encode(k, m, w, schedule, data, ccopy, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(sstats);
|
||||
|
||||
printf("<p>Encoding with jerasure_bitmatrix_encode() - Bytes XOR'd: %.0lf.<br>\n", mstats[0]);
|
||||
printf("Encoding with jerasure_schedule_encode() - Bytes XOR'd: %.0lf.<br>\n", sstats[0]);
|
||||
|
||||
for (i = 0; i < m; i++) {
|
||||
if (memcmp(coding[i], ccopy[i], sizeof(long)*w) != 0) {
|
||||
printf("Problem: the two encodings don't match on disk C%x\n", i);
|
||||
exit(0);
|
||||
}
|
||||
}
|
||||
|
||||
coding = talloc(char *, m);
|
||||
for (i = 0; i < m; i++) {
|
||||
coding[i] = talloc(char, sizeof(long)*w);
|
||||
}
|
||||
|
||||
jerasure_schedule_encode(k, m, w, smart, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(stats);
|
||||
printf("Smart Encoding Complete: - %.0lf XOR'd bytes\n\n", stats[0]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
printf("Here are the packets on the coding disks.<br>\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] = lrand48()%(k+m);
|
||||
erasures[i] = MOA_Random_W(31, 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);
|
||||
|
|
@ -190,15 +242,47 @@ int main(int argc, char **argv)
|
|||
}
|
||||
}
|
||||
erasures[i] = -1;
|
||||
printf("Erasures on the following devices:");
|
||||
for (i = 0; erasures[i] != -1; i++) {
|
||||
printf(" %c%x", ((erasures[i] < k) ? 'D' : 'C'), (erasures[i] < k ? erasures[i] : erasures[i]-k));
|
||||
}
|
||||
printf("<br>\nHere is the state of the system:\n<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_bitmatrix_decode(k, m, w, bitmatrix, 0, erasures, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(mstats);
|
||||
|
||||
printf("<p>Decoded with jerasure_bitmatrix_decode - Bytes XOR'd: %.0lf.<br>\n", mstats[0]);
|
||||
|
||||
for (i = 0; i < k; i++) if (memcmp(data[i], dcopy[i], sizeof(long)*w) != 0) {
|
||||
printf("ERROR: D%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
for (i = 0; i < m; i++) if (memcmp(coding[i], ccopy[i], sizeof(long)*w) != 0) {
|
||||
printf("ERROR: C%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
|
||||
for (i = 0; erasures[i] != -1; i++) {
|
||||
bzero((erasures[i] < k) ? data[erasures[i]] : coding[erasures[i]-k], sizeof(long)*w);
|
||||
}
|
||||
|
||||
printf("Erased %d random devices:\n\n", m);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
|
||||
jerasure_schedule_decode_lazy(k, m, w, bitmatrix, erasures, data, coding, w*sizeof(long), sizeof(long), 1);
|
||||
jerasure_get_stats(stats);
|
||||
jerasure_get_stats(sstats);
|
||||
|
||||
printf("State of the system after decoding: %.0lf XOR'd bytes\n\n", stats[0]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
printf("jerasure_schedule_decode_lazy - Bytes XOR'd: %.0lf.<br>\n", sstats[0]);
|
||||
|
||||
return 0;
|
||||
for (i = 0; i < k; i++) if (memcmp(data[i], dcopy[i], sizeof(long)*w) != 0) {
|
||||
printf("ERROR: D%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
for (i = 0; i < m; i++) if (memcmp(coding[i], ccopy[i], sizeof(long)*w) != 0) {
|
||||
printf("ERROR: C%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
|
||||
printf("Here is the state of the system:\n<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");
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,60 +1,54 @@
|
|||
/* Examples/cauchy_04.c
|
||||
* James S. Plank
|
||||
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
|
||||
/* *
|
||||
* 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.
|
||||
*/
|
||||
|
||||
/*
|
||||
revised by S. Simmerman
|
||||
2/25/08
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdint.h>
|
||||
#include <string.h>
|
||||
#include <gf_rand.h>
|
||||
#include "jerasure.h"
|
||||
#include "cauchy.h"
|
||||
|
||||
|
|
@ -62,78 +56,77 @@ POSSIBILITY OF SUCH DAMAGE.
|
|||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: cauchy_04 k m w - Scheduled CRS coding example with a good matrix in GF(2^w).\n");
|
||||
fprintf(stderr, "usage: cauchy_04 k m w seed - CRS coding example improving the matrix.\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " k+m must be <= 2^w. It sets up a Cauchy distribution matrix using \n");
|
||||
fprintf(stderr, " cauchy_good_coding_matrix(), then it encodes\n");
|
||||
fprintf(stderr, " k devices of w*%d bytes using smart bit-matrix scheduling.\n", sizeof(long));
|
||||
fprintf(stderr, " It decodes using bit-matrix scheduling as well.\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, "This demonstrates: cauchy_original_coding_matrix()\n");
|
||||
fprintf(stderr, "k+m must be <= 2^w\n");
|
||||
fprintf(stderr, "This sets up a generator matrix (G^T) in GF(2^w) whose last m rows are\n");
|
||||
fprintf(stderr, "a 'good' matrix, created with cauchy_good_general_coding_matrix().\n");
|
||||
fprintf(stderr, "It converts this matrix to a bitmatrix.\n");
|
||||
fprintf(stderr, "\n");
|
||||
fprintf(stderr, "Then, it encodes w packets from each of k disks (simulated) onto w packets on\n");
|
||||
fprintf(stderr, "on each of m disks. Packets are longs. Then, it deletes m random disks, and decodes.\n");
|
||||
fprintf(stderr, "\n");
|
||||
fprintf(stderr, "The encoding and decoding are done twice, first, with jerasure_bitmatrix_encode()\n");
|
||||
fprintf(stderr, "and jerasure_bitmatrix_decode(), and second using 'smart' scheduling with\n");
|
||||
fprintf(stderr, "jerasure_schedule_encode() and jerasure_schedule_decode_lazy().\n");
|
||||
|
||||
fprintf(stderr, "\n");
|
||||
fprintf(stderr, "This demonstrates: cauchy_good_general_coding_matrix()\n");
|
||||
fprintf(stderr, " jerasure_bitmatrix_encode()\n");
|
||||
fprintf(stderr, " jerasure_bitmatrix_decode()\n");
|
||||
fprintf(stderr, " cauchy_n_ones()\n");
|
||||
fprintf(stderr, " jerasure_smart_bitmatrix_to_schedule()\n");
|
||||
fprintf(stderr, " jerasure_schedule_encode()\n");
|
||||
fprintf(stderr, " jerasure_schedule_decode_lazy()\n");
|
||||
fprintf(stderr, " jerasure_print_matrix()\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_data_and_coding(int k, int m, int w, int psize,
|
||||
char **data, char **coding)
|
||||
static print_array(char **ptrs, int ndevices, int size, int packetsize, char *label)
|
||||
{
|
||||
int i, j, x, n, sp;
|
||||
long l;
|
||||
int i, j, x;
|
||||
unsigned char *up;
|
||||
|
||||
if(k > m) n = k;
|
||||
else n = m;
|
||||
sp = psize * 2 + (psize/4) + 12;
|
||||
|
||||
printf("%-*sCoding\n", sp, "Data");
|
||||
for(i = 0; i < n; i++) {
|
||||
for (j = 0; j < w; j++) {
|
||||
if(i < k) {
|
||||
|
||||
if(j==0) printf("D%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, data[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
printf(" ");
|
||||
}
|
||||
else printf("%*s", sp, "");
|
||||
if(i < m) {
|
||||
if(j==0) printf("C%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, coding[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
}
|
||||
|
||||
printf("\n");
|
||||
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)
|
||||
{
|
||||
long l;
|
||||
int k, w, i, j, m;
|
||||
int *matrix, *bitmatrix;
|
||||
char **data, **coding, **ptrs;
|
||||
int **smart;
|
||||
int *matrix, *bitmatrix, **schedule;
|
||||
char **data, **coding, **ptrs, **dcopy, **ccopy;
|
||||
int no;
|
||||
int *erasures, *erased;
|
||||
double stats[3];
|
||||
double mstats[3], sstats[3];
|
||||
uint32_t seed;
|
||||
|
||||
if (argc != 4) usage(NULL);
|
||||
if (argc != 5) usage(NULL);
|
||||
if (sscanf(argv[1], "%d", &k) == 0 || k <= 0) usage("Bad k");
|
||||
if (sscanf(argv[2], "%d", &m) == 0 || m <= 0) usage("Bad m");
|
||||
if (sscanf(argv[3], "%d", &w) == 0 || w <= 0 || w > 32) usage("Bad w");
|
||||
if (sscanf(argv[4], "%d", &seed) == 0) usage("Bad seed");
|
||||
if (w < 30 && (k+m) > (1 << w)) usage("k + m is too big");
|
||||
|
||||
matrix = cauchy_good_general_coding_matrix(k, m, w);
|
||||
|
|
@ -141,42 +134,89 @@ int main(int argc, char **argv)
|
|||
usage("couldn't make coding matrix");
|
||||
}
|
||||
|
||||
/* Print out header information to the output file. */
|
||||
printf("<HTML>\n");
|
||||
printf("<TITLE>Jerasure Example Output: cauchy_04 %d %d %d %d</TITLE>\n", k, m, w, seed);
|
||||
printf("<h2>Jerasure Example Output: cauchy_04 %d %d %d %d</h3>\n", k, m, w, seed);
|
||||
|
||||
printf("<hr>\n");
|
||||
printf("Parameters:\n");
|
||||
printf("<UL><LI> Number of data disks <i>(k)</i>: %d\n", k);
|
||||
printf("<LI> Number of coding disks <i>(m)</i>: %d\n", m);
|
||||
printf("<LI> Word size of the Galois Field: <i>(w)</i>: %d\n", w);
|
||||
printf("<LI> Seed for the random number generator: %d\n", seed);
|
||||
printf("<LI> Number of bytes stored per disk: %ld\n", sizeof(long)*w);
|
||||
printf("<LI> Number of packets stored per disk: %d\n", w);
|
||||
printf("<LI> Number of bytes per packet: %ld\n", sizeof(long));
|
||||
printf("</UL>\n");
|
||||
|
||||
/* Print out the matrix and the bitmatrix */
|
||||
printf("<hr>\n");
|
||||
printf("Here is the matrix, which was created with <b>cauchy_xy_coding_matrix()</b>.\n");
|
||||
|
||||
printf("<pre>\n");
|
||||
jerasure_print_matrix(matrix, m, k, w);
|
||||
printf("</pre>\n");
|
||||
|
||||
bitmatrix = jerasure_matrix_to_bitmatrix(k, m, w, matrix);
|
||||
|
||||
no = 0;
|
||||
for (i = 0; i < k*m; i++) {
|
||||
no += cauchy_n_ones(matrix[i], w);
|
||||
}
|
||||
printf("Matrix has %d ones\n\n", no);
|
||||
jerasure_print_matrix(matrix, m, k, w);
|
||||
printf("\n");
|
||||
bitmatrix = jerasure_matrix_to_bitmatrix(k, m, w, matrix);
|
||||
|
||||
smart = jerasure_smart_bitmatrix_to_schedule(k, m, w, bitmatrix);
|
||||
printf("The bitmatrix, which has %d one%s:<p><pre>\n", no, (no == 1) ? "" : "s");
|
||||
jerasure_print_bitmatrix(bitmatrix, m*w, k*w, w);
|
||||
printf("</pre>\n");
|
||||
printf("<hr>\n");
|
||||
|
||||
MOA_Seed(seed);
|
||||
|
||||
srand48(0);
|
||||
data = talloc(char *, k);
|
||||
dcopy = talloc(char *, k);
|
||||
for (i = 0; i < k; i++) {
|
||||
data[i] = talloc(char, sizeof(long)*w);
|
||||
for (j = 0; j < w; j++) {
|
||||
l = lrand48();
|
||||
memcpy(data[i]+j*sizeof(long), &l, sizeof(long));
|
||||
dcopy[i] = talloc(char, sizeof(long)*w);
|
||||
MOA_Fill_Random_Region(data[i], sizeof(long)*w);
|
||||
memcpy(dcopy[i], data[i], sizeof(long)*w);
|
||||
}
|
||||
|
||||
printf("Here are the packets on the data disks:<p>\n");
|
||||
print_array(data, k, sizeof(long)*w, sizeof(long), "D");
|
||||
|
||||
coding = talloc(char *, m);
|
||||
ccopy = talloc(char *, m);
|
||||
for (i = 0; i < m; i++) {
|
||||
coding[i] = talloc(char, sizeof(long)*w);
|
||||
ccopy[i] = talloc(char, sizeof(long)*w);
|
||||
}
|
||||
|
||||
jerasure_bitmatrix_encode(k, m, w, bitmatrix, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(mstats);
|
||||
|
||||
schedule = jerasure_smart_bitmatrix_to_schedule(k, m, w, bitmatrix);
|
||||
jerasure_schedule_encode(k, m, w, schedule, data, ccopy, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(sstats);
|
||||
|
||||
printf("<p>Encoding with jerasure_bitmatrix_encode() - Bytes XOR'd: %.0lf.<br>\n", mstats[0]);
|
||||
printf("Encoding with jerasure_schedule_encode() - Bytes XOR'd: %.0lf.<br>\n", sstats[0]);
|
||||
|
||||
for (i = 0; i < m; i++) {
|
||||
if (memcmp(coding[i], ccopy[i], sizeof(long)*w) != 0) {
|
||||
printf("Problem: the two encodings don't match on disk C%x\n", i);
|
||||
exit(0);
|
||||
}
|
||||
}
|
||||
|
||||
coding = talloc(char *, m);
|
||||
for (i = 0; i < m; i++) {
|
||||
coding[i] = talloc(char, sizeof(long)*w);
|
||||
}
|
||||
|
||||
jerasure_schedule_encode(k, m, w, smart, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(stats);
|
||||
printf("Smart Encoding Complete: - %.0lf XOR'd bytes\n\n", stats[0]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
printf("Here are the packets on the coding disks.<br>\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] = lrand48()%(k+m);
|
||||
erasures[i] = MOA_Random_W(31, 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);
|
||||
|
|
@ -184,15 +224,47 @@ int main(int argc, char **argv)
|
|||
}
|
||||
}
|
||||
erasures[i] = -1;
|
||||
printf("Erasures on the following devices:");
|
||||
for (i = 0; erasures[i] != -1; i++) {
|
||||
printf(" %c%x", ((erasures[i] < k) ? 'D' : 'C'), (erasures[i] < k ? erasures[i] : erasures[i]-k));
|
||||
}
|
||||
printf("<br>\nHere is the state of the system:\n<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_bitmatrix_decode(k, m, w, bitmatrix, 0, erasures, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(mstats);
|
||||
|
||||
printf("<p>Decoded with jerasure_bitmatrix_decode - Bytes XOR'd: %.0lf.<br>\n", mstats[0]);
|
||||
|
||||
for (i = 0; i < k; i++) if (memcmp(data[i], dcopy[i], sizeof(long)*w) != 0) {
|
||||
printf("ERROR: D%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
for (i = 0; i < m; i++) if (memcmp(coding[i], ccopy[i], sizeof(long)*w) != 0) {
|
||||
printf("ERROR: C%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
|
||||
for (i = 0; erasures[i] != -1; i++) {
|
||||
bzero((erasures[i] < k) ? data[erasures[i]] : coding[erasures[i]-k], sizeof(long)*w);
|
||||
}
|
||||
|
||||
printf("Erased %d random pieces of data/coding:\n\n", m);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
|
||||
jerasure_schedule_decode_lazy(k, m, w, bitmatrix, erasures, data, coding, w*sizeof(long), sizeof(long), 1);
|
||||
jerasure_get_stats(stats);
|
||||
jerasure_get_stats(sstats);
|
||||
|
||||
printf("State of the system after decoding: %.0lf XOR'd bytes\n\n", stats[0]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
|
||||
return 0;
|
||||
printf("jerasure_schedule_decode_lazy - Bytes XOR'd: %.0lf.<br>\n", sstats[0]);
|
||||
|
||||
for (i = 0; i < k; i++) if (memcmp(data[i], dcopy[i], sizeof(long)*w) != 0) {
|
||||
printf("ERROR: D%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
for (i = 0; i < m; i++) if (memcmp(coding[i], ccopy[i], sizeof(long)*w) != 0) {
|
||||
printf("ERROR: C%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
|
||||
printf("Here is the state of the system:\n<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");
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,51 +1,48 @@
|
|||
/* Examples/decoder.c
|
||||
* Catherine D. Schuman, James S. Plank
|
||||
/* *
|
||||
* 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 - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
/* Jerasure's authors:
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
|
||||
*/
|
||||
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.
|
||||
*/
|
||||
|
||||
/*
|
||||
This program takes as input an inputfile, k, m, a coding
|
||||
|
|
@ -99,7 +96,7 @@ int main (int argc, char **argv) {
|
|||
|
||||
/* Parameters */
|
||||
int k, m, w, packetsize, buffersize;
|
||||
enum Coding_Technique tech;
|
||||
int tech;
|
||||
char *c_tech;
|
||||
|
||||
int i, j; // loop control variables
|
||||
|
|
@ -157,7 +154,7 @@ int main (int argc, char **argv) {
|
|||
} else {
|
||||
extension = strdup("");
|
||||
}
|
||||
fname = (char *)malloc(sizeof(char*)*(100+strlen(argv[1])+10));
|
||||
fname = (char *)malloc(sizeof(char*)*(100+strlen(argv[1])+20));
|
||||
|
||||
/* Read in parameters from metadata file */
|
||||
sprintf(fname, "%s/Coding/%s_meta.txt", curdir, cs1);
|
||||
|
|
@ -167,7 +164,7 @@ int main (int argc, char **argv) {
|
|||
fprintf(stderr, "Error: no metadata file %s\n", fname);
|
||||
exit(1);
|
||||
}
|
||||
temp = (char *)malloc(sizeof(char)*(strlen(argv[1])+10));
|
||||
temp = (char *)malloc(sizeof(char)*(strlen(argv[1])+20));
|
||||
fscanf(fp, "%s", temp);
|
||||
|
||||
if (fscanf(fp, "%d", &origsize) != 1) {
|
||||
|
|
@ -178,7 +175,7 @@ int main (int argc, char **argv) {
|
|||
fprintf(stderr, "Parameters are not correct\n");
|
||||
exit(0);
|
||||
}
|
||||
c_tech = (char *)malloc(sizeof(char)*(strlen(argv[1])+10));
|
||||
c_tech = (char *)malloc(sizeof(char)*(strlen(argv[1])+20));
|
||||
fscanf(fp, "%s", c_tech);
|
||||
fscanf(fp, "%d", &tech);
|
||||
method = tech;
|
||||
|
|
@ -383,8 +380,8 @@ int main (int argc, char **argv) {
|
|||
tsec /= 1000000.0;
|
||||
tsec += t2.tv_sec;
|
||||
tsec -= t1.tv_sec;
|
||||
printf("Decoding (MB/sec): %0.10f\n", (origsize/1024/1024)/totalsec);
|
||||
printf("De_Total (MB/sec): %0.10f\n\n", (origsize/1024/1024)/tsec);
|
||||
printf("Decoding (MB/sec): %0.10f\n", (((double) origsize)/1024.0/1024.0)/totalsec);
|
||||
printf("De_Total (MB/sec): %0.10f\n\n", (((double) origsize)/1024.0/1024.0)/tsec);
|
||||
}
|
||||
|
||||
void ctrl_bs_handler(int dummy) {
|
||||
|
|
|
|||
|
|
@ -1,50 +1,47 @@
|
|||
/* Examples/encoder.c
|
||||
* Catherine D. Schuman, James S. Plank
|
||||
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
/* *
|
||||
* 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.
|
||||
*/
|
||||
|
||||
/*
|
||||
|
|
@ -56,8 +53,8 @@ the original file and m of the files are encoded based on
|
|||
the given coding technique. The format of the created files
|
||||
is the file name with "_k#" or "_m#" and then the extension.
|
||||
(For example, inputfile test.txt would yield file "test_k1.txt".)
|
||||
*/
|
||||
|
||||
*/
|
||||
#include <sys/time.h>
|
||||
#include <sys/stat.h>
|
||||
#include <string.h>
|
||||
|
|
@ -65,9 +62,9 @@ is the file name with "_k#" or "_m#" and then the extension.
|
|||
#include <stdlib.h>
|
||||
#include <errno.h>
|
||||
#include <signal.h>
|
||||
#include <gf_rand.h>
|
||||
#include "jerasure.h"
|
||||
#include "reed_sol.h"
|
||||
#include "galois.h"
|
||||
#include "cauchy.h"
|
||||
#include "liberation.h"
|
||||
|
||||
|
|
@ -91,9 +88,7 @@ int jfread(void *ptr, int size, int nmembers, FILE *stream)
|
|||
int *li, i;
|
||||
if (stream != NULL) return fread(ptr, size, nmembers, stream);
|
||||
|
||||
nd = size/sizeof(int);
|
||||
li = (int *) ptr;
|
||||
for (i = 0; i < nd; i++) li[i] = mrand48();
|
||||
MOA_Fill_Random_Region(ptr, size);
|
||||
return size;
|
||||
}
|
||||
|
||||
|
|
@ -152,8 +147,11 @@ int main (int argc, char **argv) {
|
|||
|
||||
/* Error check Arguments*/
|
||||
if (argc != 8) {
|
||||
fprintf(stderr, "usage: inputfile k m coding_technique w (packetsize) (buffersize)\n");
|
||||
fprintf(stderr, "usage: inputfile k m coding_technique w packetsize buffersize\n");
|
||||
fprintf(stderr, "\nChoose one of the following coding techniques: \nreed_sol_van, \nreed_sol_r6_op, \ncauchy_orig, \ncauchy_good, \nliberation, \nblaum_roth, \nliber8tion");
|
||||
fprintf(stderr, "\n\nPacketsize is ignored for the reed_sol's");
|
||||
fprintf(stderr, "\nBuffersize of 0 means the buffersize is chosen automatically.\n");
|
||||
fprintf(stderr, "\nIf you just want to test speed, use an inputfile of \"-number\" where number is the size of the fake file you want to test.\n\n");
|
||||
exit(0);
|
||||
}
|
||||
/* Conversion of parameters and error checking */
|
||||
|
|
@ -191,16 +189,16 @@ int main (int argc, char **argv) {
|
|||
|
||||
/* Determine proper buffersize by finding the closest valid buffersize to the input value */
|
||||
if (buffersize != 0) {
|
||||
if (packetsize != 0 && buffersize%(sizeof(int)*w*k*packetsize) != 0) {
|
||||
if (packetsize != 0 && buffersize%(sizeof(long)*w*k*packetsize) != 0) {
|
||||
up = buffersize;
|
||||
down = buffersize;
|
||||
while (up%(sizeof(int)*w*k*packetsize) != 0 && (down%(sizeof(int)*w*k*packetsize) != 0)) {
|
||||
while (up%(sizeof(long)*w*k*packetsize) != 0 && (down%(sizeof(long)*w*k*packetsize) != 0)) {
|
||||
up++;
|
||||
if (down == 0) {
|
||||
down--;
|
||||
}
|
||||
}
|
||||
if (up%(sizeof(int)*w*k*packetsize) == 0) {
|
||||
if (up%(sizeof(long)*w*k*packetsize) == 0) {
|
||||
buffersize = up;
|
||||
}
|
||||
else {
|
||||
|
|
@ -209,14 +207,14 @@ int main (int argc, char **argv) {
|
|||
}
|
||||
}
|
||||
}
|
||||
else if (packetsize == 0 && buffersize%(sizeof(int)*w*k) != 0) {
|
||||
else if (packetsize == 0 && buffersize%(sizeof(long)*w*k) != 0) {
|
||||
up = buffersize;
|
||||
down = buffersize;
|
||||
while (up%(sizeof(int)*w*k) != 0 && down%(sizeof(int)*w*k) != 0) {
|
||||
while (up%(sizeof(long)*w*k) != 0 && down%(sizeof(long)*w*k) != 0) {
|
||||
up++;
|
||||
down--;
|
||||
}
|
||||
if (up%(sizeof(int)*w*k) == 0) {
|
||||
if (up%(sizeof(long)*w*k) == 0) {
|
||||
buffersize = up;
|
||||
}
|
||||
else {
|
||||
|
|
@ -275,8 +273,8 @@ int main (int argc, char **argv) {
|
|||
fprintf(stderr, "Must include packetsize.\n");
|
||||
exit(0);
|
||||
}
|
||||
if ((packetsize%(sizeof(int))) != 0) {
|
||||
fprintf(stderr, "packetsize must be a multiple of sizeof(int)\n");
|
||||
if ((packetsize%(sizeof(long))) != 0) {
|
||||
fprintf(stderr, "packetsize must be a multiple of sizeof(long)\n");
|
||||
exit(0);
|
||||
}
|
||||
tech = Liberation;
|
||||
|
|
@ -294,8 +292,8 @@ int main (int argc, char **argv) {
|
|||
fprintf(stderr, "Must include packetsize.\n");
|
||||
exit(0);
|
||||
}
|
||||
if ((packetsize%(sizeof(int))) != 0) {
|
||||
fprintf(stderr, "packetsize must be a multiple of sizeof(int)\n");
|
||||
if ((packetsize%(sizeof(long))) != 0) {
|
||||
fprintf(stderr, "packetsize must be a multiple of sizeof(long)\n");
|
||||
exit(0);
|
||||
}
|
||||
tech = Blaum_Roth;
|
||||
|
|
@ -356,21 +354,21 @@ int main (int argc, char **argv) {
|
|||
exit(1);
|
||||
}
|
||||
fp = NULL;
|
||||
srand48(time(0));
|
||||
MOA_Seed(time(0));
|
||||
}
|
||||
|
||||
newsize = size;
|
||||
|
||||
/* Find new size by determining next closest multiple */
|
||||
if (packetsize != 0) {
|
||||
if (size%(k*w*packetsize*sizeof(int)) != 0) {
|
||||
while (newsize%(k*w*packetsize*sizeof(int)) != 0)
|
||||
if (size%(k*w*packetsize*sizeof(long)) != 0) {
|
||||
while (newsize%(k*w*packetsize*sizeof(long)) != 0)
|
||||
newsize++;
|
||||
}
|
||||
}
|
||||
else {
|
||||
if (size%(k*w*sizeof(int)) != 0) {
|
||||
while (newsize%(k*w*sizeof(int)) != 0)
|
||||
if (size%(k*w*sizeof(long)) != 0) {
|
||||
while (newsize%(k*w*sizeof(long)) != 0)
|
||||
newsize++;
|
||||
}
|
||||
}
|
||||
|
|
@ -475,6 +473,7 @@ int main (int argc, char **argv) {
|
|||
tsec += t4.tv_sec;
|
||||
tsec -= t3.tv_sec;
|
||||
totalsec += tsec;
|
||||
|
||||
|
||||
|
||||
/* Read in data until finished */
|
||||
|
|
@ -499,13 +498,12 @@ int main (int argc, char **argv) {
|
|||
}
|
||||
}
|
||||
|
||||
|
||||
/* Set pointers to point to file data */
|
||||
for (i = 0; i < k; i++) {
|
||||
data[i] = block+(i*blocksize);
|
||||
}
|
||||
|
||||
gettimeofday(&t3, &tz);
|
||||
gettimeofday(&t3, &tz);
|
||||
/* Encode according to coding method */
|
||||
switch(tech) {
|
||||
case No_Coding:
|
||||
|
|
@ -605,8 +603,8 @@ int main (int argc, char **argv) {
|
|||
tsec /= 1000000.0;
|
||||
tsec += t2.tv_sec;
|
||||
tsec -= t1.tv_sec;
|
||||
printf("Encoding (MB/sec): %0.10f\n", (size/1024/1024)/totalsec);
|
||||
printf("En_Total (MB/sec): %0.10f\n", (size/1024/1024)/tsec);
|
||||
printf("Encoding (MB/sec): %0.10f\n", (((double) size)/1024.0/1024.0)/totalsec);
|
||||
printf("En_Total (MB/sec): %0.10f\n", (((double) size)/1024.0/1024.0)/tsec);
|
||||
}
|
||||
|
||||
/* is_prime returns 1 if number if prime, 0 if not prime */
|
||||
|
|
|
|||
|
|
@ -1,52 +1,48 @@
|
|||
/* Examples/jerasure_01.c
|
||||
* James S. Plank
|
||||
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
|
||||
/* *
|
||||
* 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>
|
||||
|
|
@ -82,6 +78,14 @@ int main(int argc, char **argv)
|
|||
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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,48 +1,47 @@
|
|||
/* Examples/jerasure_02.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 - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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>
|
||||
|
|
@ -80,6 +79,15 @@ int main(int argc, char **argv)
|
|||
}
|
||||
|
||||
bitmatrix = jerasure_matrix_to_bitmatrix(c, r, w, matrix);
|
||||
|
||||
printf("<HTML><TITLE>jerasure_02");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</TITLE>\n");
|
||||
printf("<h3>jerasure_02");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</h3>\n");
|
||||
printf("<pre>\n");
|
||||
|
||||
jerasure_print_bitmatrix(bitmatrix, r*w, c*w, w);
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,50 +1,48 @@
|
|||
/* Examples/jerasure_03.c
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
|
||||
/* *
|
||||
* 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>
|
||||
|
|
@ -57,7 +55,7 @@ usage(char *s)
|
|||
{
|
||||
fprintf(stderr, "usage: jerasure_03 k w - Creates a kxk Cauchy matrix in GF(2^w). \n\n");
|
||||
fprintf(stderr, " k must be < 2^w. Element i,j is 1/(i+(2^w-j-1)). (If that is\n");
|
||||
fprintf(stderr, " 1/0, then it sets it to zero). \n");
|
||||
fprintf(stderr, " If that is 1/0, then it sets it to zero). \n");
|
||||
fprintf(stderr, " It then tests whether that matrix is invertible.\n");
|
||||
fprintf(stderr, " If it is invertible, then it prints out the inverse.\n");
|
||||
fprintf(stderr, " Finally, it prints the product of the matrix and its inverse.\n");
|
||||
|
|
@ -94,6 +92,14 @@ int main(int argc, char **argv)
|
|||
}
|
||||
}
|
||||
|
||||
printf("<HTML><TITLE>jerasure_03");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</TITLE>\n");
|
||||
printf("<h3>jerasure_03");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</h3>\n");
|
||||
printf("<pre>\n");
|
||||
|
||||
printf("The Cauchy Matrix:\n");
|
||||
jerasure_print_matrix(matrix, k, k, w);
|
||||
memcpy(matrix_copy, matrix, sizeof(int)*k*k);
|
||||
|
|
|
|||
|
|
@ -1,50 +1,49 @@
|
|||
/* Examples/jerasure_04.c
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
|
||||
/* *
|
||||
* 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>
|
||||
|
|
@ -92,6 +91,14 @@ int main(int argc, char **argv)
|
|||
}
|
||||
bitmatrix = jerasure_matrix_to_bitmatrix(k, k, w, matrix);
|
||||
|
||||
printf("<HTML><TITLE>jerasure_04");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</TITLE>\n");
|
||||
printf("<h3>jerasure_04");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</h3>\n");
|
||||
printf("<pre>\n");
|
||||
|
||||
printf("The Cauchy Bit-Matrix:\n");
|
||||
jerasure_print_bitmatrix(bitmatrix, k*w, k*w, w);
|
||||
memcpy(bitmatrix_copy, bitmatrix, sizeof(int)*k*w*k*w);
|
||||
|
|
|
|||
|
|
@ -1,68 +1,65 @@
|
|||
/* Examples/jerasure_05.c
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
/* *
|
||||
* 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.
|
||||
*/
|
||||
|
||||
|
||||
/*
|
||||
revised by S. Simmerman
|
||||
2/25/08
|
||||
*/
|
||||
/* 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 <stdint.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <gf_rand.h>
|
||||
#include "jerasure.h"
|
||||
|
||||
#define talloc(type, num) (type *) malloc(sizeof(type)*(num))
|
||||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: jerasure_05 k m w size - Does a simple Reed-Solomon coding example in GF(2^w).\n");
|
||||
fprintf(stderr, "usage: jerasure_05 k m w size seed - Does a simple Reed-Solomon coding example in GF(2^w).\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " k+m must be <= 2^w. w can be 8, 16 or 32.\n");
|
||||
fprintf(stderr, " It sets up a Cauchy distribution matrix and encodes\n");
|
||||
fprintf(stderr, " k devices of size bytes with it. Then it decodes.\n", sizeof(long));
|
||||
fprintf(stderr, " It sets up a Cauchy generator matrix and encodes\n");
|
||||
fprintf(stderr, " k devices of size bytes with it. Then it decodes.\n");
|
||||
fprintf(stderr, " After that, it decodes device 0 by using jerasure_make_decoding_matrix()\n");
|
||||
fprintf(stderr, " and jerasure_matrix_dotprod().\n");
|
||||
fprintf(stderr, " \n");
|
||||
|
|
@ -122,15 +119,16 @@ int main(int argc, char **argv)
|
|||
char **data, **coding;
|
||||
int *erasures, *erased;
|
||||
int *decoding_matrix, *dm_ids;
|
||||
uint32_t seed;
|
||||
|
||||
if (argc != 5) usage(NULL);
|
||||
if (argc != 6) usage(NULL);
|
||||
if (sscanf(argv[1], "%d", &k) == 0 || k <= 0) usage("Bad k");
|
||||
if (sscanf(argv[2], "%d", &m) == 0 || m <= 0) usage("Bad m");
|
||||
if (sscanf(argv[3], "%d", &w) == 0 || (w != 8 && w != 16 && w != 32))
|
||||
usage("Bad w");
|
||||
if (sscanf(argv[3], "%d", &w) == 0 || (w != 8 && w != 16 && w != 32)) usage("Bad w");
|
||||
if (w < 32 && k + m > (1 << w)) usage("k + m must be <= 2 ^ w");
|
||||
if (sscanf(argv[4], "%d", &size) == 0 || size % sizeof(long) != 0)
|
||||
usage("size must be multiple of sizeof(long)");
|
||||
if (sscanf(argv[5], "%d", &seed) == 0) usage("Bad seed");
|
||||
|
||||
matrix = talloc(int, m*k);
|
||||
for (i = 0; i < m; i++) {
|
||||
|
|
@ -139,18 +137,23 @@ int main(int argc, char **argv)
|
|||
}
|
||||
}
|
||||
|
||||
printf("The Coding Matrix (the last m rows of the Distribution Matrix):\n\n");
|
||||
printf("<HTML><TITLE>jerasure_05");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</TITLE>\n");
|
||||
printf("<h3>jerasure_05");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</h3>\n");
|
||||
printf("<pre>\n");
|
||||
|
||||
printf("The Coding Matrix (the last m rows of the Generator Matrix G^T):\n\n");
|
||||
jerasure_print_matrix(matrix, m, k, w);
|
||||
printf("\n");
|
||||
|
||||
srand48(0);
|
||||
MOA_Seed(seed);
|
||||
data = talloc(char *, k);
|
||||
for (i = 0; i < k; i++) {
|
||||
data[i] = talloc(char, size);
|
||||
for(j = 0; j < size; j+=sizeof(long)) {
|
||||
l = lrand48();
|
||||
memcpy(data[i] + j, &l, sizeof(long));
|
||||
}
|
||||
MOA_Fill_Random_Region(data[i], size);
|
||||
}
|
||||
|
||||
coding = talloc(char *, m);
|
||||
|
|
@ -168,7 +171,7 @@ int main(int argc, char **argv)
|
|||
for (i = 0; i < m+k; i++) erased[i] = 0;
|
||||
l = 0;
|
||||
for (i = 0; i < m; ) {
|
||||
erasures[i] = lrand48()%(k+m);
|
||||
erasures[i] = (MOA_Random_W(w, 1))%(k+m);
|
||||
if (erased[erasures[i]] == 0) {
|
||||
erased[erasures[i]] = 1;
|
||||
|
||||
|
|
|
|||
|
|
@ -1,68 +1,65 @@
|
|||
/* Examples/jerasure_06.c
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
|
||||
/* *
|
||||
* 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.
|
||||
*/
|
||||
|
||||
/*
|
||||
revised by S. Simmerman
|
||||
2/25/08
|
||||
*/
|
||||
|
||||
/* 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 <stdint.h>
|
||||
#include <string.h>
|
||||
#include <gf_rand.h>
|
||||
#include "jerasure.h"
|
||||
|
||||
#define talloc(type, num) (type *) malloc(sizeof(type)*(num))
|
||||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: jerasure_06 k m w packetsize\n");
|
||||
fprintf(stderr, "usage: jerasure_06 k m w packetsize seed\n");
|
||||
fprintf(stderr, "Does a simple Cauchy Reed-Solomon coding example in GF(2^w).\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " k+m must be < 2^w. Packetsize must be a multiple of sizeof(long)\n");
|
||||
fprintf(stderr, " It sets up a Cauchy distribution matrix and encodes k devices of w*packetsize bytes.\n");
|
||||
fprintf(stderr, " It sets up a Cauchy generator matrix and encodes k devices of w*packetsize bytes.\n");
|
||||
fprintf(stderr, " After that, it decodes device 0 by using jerasure_make_decoding_bitmatrix()\n");
|
||||
fprintf(stderr, " and jerasure_bitmatrix_dotprod().\n");
|
||||
fprintf(stderr, " \n");
|
||||
|
|
@ -75,43 +72,31 @@ usage(char *s)
|
|||
exit(1);
|
||||
}
|
||||
|
||||
static void print_data_and_coding(int k, int m, int w, int psize,
|
||||
char **data, char **coding)
|
||||
static print_array(char **ptrs, int ndevices, int size, int packetsize, char *label)
|
||||
{
|
||||
int i, j, x, n, sp;
|
||||
long l;
|
||||
int i, j, x;
|
||||
unsigned char *up;
|
||||
|
||||
if(k > m) n = k;
|
||||
else n = m;
|
||||
sp = psize * 2 + (psize/4) + 12;
|
||||
printf("<center><table border=3 cellpadding=3><tr><td></td>\n");
|
||||
|
||||
printf("%-*sCoding\n", sp, "Data");
|
||||
for(i = 0; i < n; i++) {
|
||||
for (j = 0; j < w; j++) {
|
||||
if(i < k) {
|
||||
|
||||
if(j==0) printf("D%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, data[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
printf(" ");
|
||||
}
|
||||
else printf("%*s", sp, "");
|
||||
if(i < m) {
|
||||
if(j==0) printf("C%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, coding[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
}
|
||||
|
||||
printf("\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)
|
||||
|
|
@ -122,15 +107,18 @@ int main(int argc, char **argv)
|
|||
char **data, **coding;
|
||||
int *erasures, *erased;
|
||||
int *decoding_matrix, *dm_ids;
|
||||
uint32_t seed;
|
||||
|
||||
if (argc != 5) usage(NULL);
|
||||
if (argc != 6) usage(NULL);
|
||||
if (sscanf(argv[1], "%d", &k) == 0 || k <= 0) usage("Bad k");
|
||||
if (sscanf(argv[2], "%d", &m) == 0 || m <= 0) usage("Bad m");
|
||||
if (sscanf(argv[3], "%d", &w) == 0 || w <= 0 || w > 32) usage("Bad w");
|
||||
if (w < 30 && (k+m) > (1 << w)) usage("k + m is too big");
|
||||
if (sscanf(argv[4], "%d", &psize) == 0 || psize <= 0) usage("Bad packetsize");
|
||||
if(psize%sizeof(long) != 0) usage("Packetsize must be multiple of sizeof(long)");
|
||||
if (sscanf(argv[5], "%d", &seed) == 0) usage("Bad seed");
|
||||
|
||||
MOA_Seed(seed);
|
||||
matrix = talloc(int, m*k);
|
||||
for (i = 0; i < m; i++) {
|
||||
for (j = 0; j < k; j++) {
|
||||
|
|
@ -139,21 +127,22 @@ int main(int argc, char **argv)
|
|||
}
|
||||
bitmatrix = jerasure_matrix_to_bitmatrix(k, m, w, matrix);
|
||||
|
||||
printf("Last (m * w) rows of the Binary Distribution Matrix:\n\n");
|
||||
jerasure_print_bitmatrix(bitmatrix, w*m, w*k, w);
|
||||
printf("\n");
|
||||
printf("<HTML><TITLE>jerasure_06");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</TITLE>\n");
|
||||
printf("<h3>jerasure_06");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</h3>\n");
|
||||
|
||||
printf("<hr>\n");
|
||||
printf("Last (m * w) rows of the Generator Matrix: (G^T):\n<pre>\n");
|
||||
jerasure_print_bitmatrix(bitmatrix, w*m, w*k, w);
|
||||
printf("</pre><hr>\n");
|
||||
|
||||
srand48(0);
|
||||
data = talloc(char *, k);
|
||||
for (i = 0; i < k; i++) {
|
||||
data[i] = talloc(char, psize*w);
|
||||
for (j = 0; j < w; j++) {
|
||||
for(x = 0; x < psize; x += 4) {
|
||||
l = lrand48();
|
||||
memcpy(data[i]+j*psize+x, &l, sizeof(long));
|
||||
}
|
||||
|
||||
}
|
||||
MOA_Fill_Random_Region(data[i], psize*w);
|
||||
}
|
||||
|
||||
coding = talloc(char *, m);
|
||||
|
|
@ -163,14 +152,18 @@ int main(int argc, char **argv)
|
|||
|
||||
jerasure_bitmatrix_encode(k, m, w, bitmatrix, data, coding, w*psize, psize);
|
||||
|
||||
printf("Encoding Complete:\n\n");
|
||||
print_data_and_coding(k, m, w, psize, data, coding);
|
||||
printf("Encoding Complete - Here is the state of the system\n\n");
|
||||
printf("<p>\n");
|
||||
print_array(data, k, psize*w, psize, "D");
|
||||
printf("<p>\n");
|
||||
print_array(coding, m, psize*w, psize, "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] = lrand48()%(k+m);
|
||||
erasures[i] = MOA_Random_W(w, 1)%(k+m);
|
||||
if (erased[erasures[i]] == 0) {
|
||||
erased[erasures[i]] = 1;
|
||||
bzero((erasures[i] < k) ? data[erasures[i]] : coding[erasures[i]-k], psize*w);
|
||||
|
|
@ -179,42 +172,63 @@ int main(int argc, char **argv)
|
|||
}
|
||||
erasures[i] = -1;
|
||||
|
||||
printf("Erased %d random devices:\n\n", m);
|
||||
print_data_and_coding(k, m, w, psize, data, coding);
|
||||
|
||||
printf("Erased %d random devices:", m);
|
||||
for (i = 0; erasures[i] != -1; i++) {
|
||||
printf(" %c%x", ((erasures[i] < k) ? 'D' : 'C'), (erasures[i] < k ? erasures[i] : erasures[i]-k));
|
||||
}
|
||||
printf(". Here is the state of the system:\n");
|
||||
|
||||
printf("<p>\n");
|
||||
print_array(data, k, psize*w, psize, "D");
|
||||
printf("<p>\n");
|
||||
print_array(coding, m, psize*w, psize, "C");
|
||||
printf("<hr>\n");
|
||||
|
||||
i = jerasure_bitmatrix_decode(k, m, w, bitmatrix, 0, erasures, data, coding,
|
||||
w*psize, psize);
|
||||
|
||||
printf("State of the system after decoding:\n\n");
|
||||
print_data_and_coding(k, m, w, psize, data, coding);
|
||||
|
||||
printf("Here is the state of the system after decoding:\n\n");
|
||||
printf("<p>\n");
|
||||
print_array(data, k, psize*w, psize, "D");
|
||||
printf("<p>\n");
|
||||
print_array(coding, m, psize*w, psize, "C");
|
||||
printf("<hr>\n");
|
||||
|
||||
decoding_matrix = talloc(int, k*k*w*w);
|
||||
dm_ids = talloc(int, k);
|
||||
|
||||
for (i = 0; i < m; i++) erased[i] = 1;
|
||||
x = (m < k) ? m : k;
|
||||
|
||||
for (i = 0; i < x; i++) erased[i] = 1;
|
||||
for (; i < k+m; i++) erased[i] = 0;
|
||||
|
||||
jerasure_make_decoding_bitmatrix(k, m, w, bitmatrix, erased, decoding_matrix, dm_ids);
|
||||
|
||||
printf("Suppose we erase the first %d devices. Here is the decoding matrix:\n\n", m);
|
||||
printf("Suppose we erase the first %d devices. Here is the decoding matrix:\n<pre>\n", x);
|
||||
jerasure_print_bitmatrix(decoding_matrix, k*w, k*w, w);
|
||||
printf("\n");
|
||||
printf("And dm_ids:\n\n");
|
||||
printf("</pre>\n");
|
||||
printf("And dm_ids:\n<pre>\n");
|
||||
jerasure_print_matrix(dm_ids, 1, k, w);
|
||||
printf("</pre><hr>\n");
|
||||
|
||||
//memcpy(&l, data[0], sizeof(long));
|
||||
//printf("\nThe value of device #%d, word 0 is: %lx\n", 0, l);
|
||||
bzero(data[0], w*psize);
|
||||
jerasure_bitmatrix_dotprod(k, w, decoding_matrix, dm_ids, 0, data, coding, w*psize, psize);
|
||||
for (i = 0; i < x; i++) bzero(data[i], w*psize);
|
||||
|
||||
printf("\nAfter calling jerasure_matrix_dotprod, we calculate the value of device #0, packet 0 to be:\n");
|
||||
printf("\nD0 p0 :");
|
||||
for(i = 0; i < psize; i +=sizeof(long)) {
|
||||
memcpy(&l, data[0]+i, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
printf("\n\n");
|
||||
//memcpy(&l, data[0], sizeof(long));
|
||||
printf("Here is the state of the system after the erasures:\n\n");
|
||||
printf("<p>\n");
|
||||
print_array(data, k, psize*w, psize, "D");
|
||||
printf("<p>\n");
|
||||
print_array(coding, m, psize*w, psize, "C");
|
||||
printf("<hr>\n");
|
||||
|
||||
for (i = 0; i < x; i++) {
|
||||
jerasure_bitmatrix_dotprod(k, w, decoding_matrix+i*(k*w*w), dm_ids, i, data, coding, w*psize, psize);
|
||||
}
|
||||
|
||||
printf("Here is the state of the system after calling <b>jerasure_bitmatrix_dotprod()</b> %d time%s with the decoding matrix:\n\n", x, (x == 1) ? "" : "s");
|
||||
printf("<p>\n");
|
||||
print_array(data, k, psize*w, psize, "D");
|
||||
printf("<p>\n");
|
||||
print_array(coding, m, psize*w, psize, "C");
|
||||
printf("<hr>\n");
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,67 +1,64 @@
|
|||
/* Examples/jerasure_07.c
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
/* *
|
||||
* 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.
|
||||
*/
|
||||
|
||||
|
||||
/*
|
||||
revised by S. Simmerman
|
||||
2/25/08
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <stdint.h>
|
||||
#include <gf_rand.h>
|
||||
#include "jerasure.h"
|
||||
|
||||
#define talloc(type, num) (type *) malloc(sizeof(type)*(num))
|
||||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: jerasure_07 k m w - Scheduled Cauchy Reed-Solomon coding example in GF(2^w).\n");
|
||||
fprintf(stderr, "usage: jerasure_07 k m w seed - Scheduled Cauchy Reed-Solomon coding example in GF(2^w).\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " k+m must be <= 2^w. It sets up a Cauchy distribution matrix and encodes\n");
|
||||
fprintf(stderr, " k sets of w*%d bytes. It uses bit-matrix scheduling, both smart and dumb.\n", sizeof(long));
|
||||
fprintf(stderr, " k+m must be <= 2^w. It sets up a Cauchy generator matrix and encodes\n");
|
||||
fprintf(stderr, " k sets of w*%ld bytes. It uses bit-matrix scheduling, both smart and dumb.\n", sizeof(long));
|
||||
fprintf(stderr, " It decodes using bit-matrix scheduling, then shows an example of\n");
|
||||
fprintf(stderr, " using jerasure_do_scheduled_operations().\n");
|
||||
fprintf(stderr, " \n");
|
||||
|
|
@ -75,43 +72,31 @@ usage(char *s)
|
|||
exit(1);
|
||||
}
|
||||
|
||||
static void print_data_and_coding(int k, int m, int w, int psize,
|
||||
char **data, char **coding)
|
||||
static print_array(char **ptrs, int ndevices, int size, int packetsize, char *label)
|
||||
{
|
||||
int i, j, x, n, sp;
|
||||
long l;
|
||||
int i, j, x;
|
||||
unsigned char *up;
|
||||
|
||||
if(k > m) n = k;
|
||||
else n = m;
|
||||
sp = psize * 2 + (psize/4) + 12;
|
||||
printf("<center><table border=3 cellpadding=3><tr><td></td>\n");
|
||||
|
||||
printf("%-*sCoding\n", sp, "Data");
|
||||
for(i = 0; i < n; i++) {
|
||||
for (j = 0; j < w; j++) {
|
||||
if(i < k) {
|
||||
|
||||
if(j==0) printf("D%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, data[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
printf(" ");
|
||||
}
|
||||
else printf("%*s", sp, "");
|
||||
if(i < m) {
|
||||
if(j==0) printf("C%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, coding[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
}
|
||||
|
||||
printf("\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)
|
||||
|
|
@ -123,11 +108,13 @@ int main(int argc, char **argv)
|
|||
int **smart, **dumb;
|
||||
int *erasures, *erased;
|
||||
double stats[3];
|
||||
uint32_t seed;
|
||||
|
||||
if (argc != 4) usage(NULL);
|
||||
if (argc != 5) usage("Wrong number of arguments");
|
||||
if (sscanf(argv[1], "%d", &k) == 0 || k <= 0) usage("Bad k");
|
||||
if (sscanf(argv[2], "%d", &m) == 0 || m <= 0) usage("Bad m");
|
||||
if (sscanf(argv[3], "%d", &w) == 0 || w <= 0 || w > 32) usage("Bad m");
|
||||
if (sscanf(argv[3], "%d", &w) == 0 || w <= 0 || w > 32) usage("Bad w");
|
||||
if (sscanf(argv[4], "%d", &seed) == 0) usage("Bad seed");
|
||||
if (w < 30 && (k+m) > (1 << w)) usage("k + m is too big");
|
||||
|
||||
matrix = talloc(int, m*k);
|
||||
|
|
@ -138,21 +125,26 @@ int main(int argc, char **argv)
|
|||
}
|
||||
bitmatrix = jerasure_matrix_to_bitmatrix(k, m, w, matrix);
|
||||
|
||||
printf("Last m rows of the Binary Distribution Matrix:\n\n");
|
||||
printf("<HTML><TITLE>jerasure_07");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</TITLE>\n");
|
||||
printf("<h3>jerasure_07");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</h3>\n");
|
||||
printf("<hr>\n");
|
||||
|
||||
printf("Last m*w rows of the generator matrix (G^T):\n<pre>\n");
|
||||
jerasure_print_bitmatrix(bitmatrix, w*m, w*k, w);
|
||||
printf("\n");
|
||||
printf("</pre><hr>\n");
|
||||
|
||||
dumb = jerasure_dumb_bitmatrix_to_schedule(k, m, w, bitmatrix);
|
||||
smart = jerasure_smart_bitmatrix_to_schedule(k, m, w, bitmatrix);
|
||||
|
||||
srand48(0);
|
||||
MOA_Seed(seed);
|
||||
data = talloc(char *, k);
|
||||
for (i = 0; i < k; i++) {
|
||||
data[i] = talloc(char, sizeof(long)*w);
|
||||
for (j = 0; j < w; j++) {
|
||||
l = lrand48();
|
||||
memcpy(data[i]+j*sizeof(long), &l, sizeof(long));
|
||||
}
|
||||
MOA_Fill_Random_Region(data[i], sizeof(long)*w);
|
||||
}
|
||||
|
||||
coding = talloc(char *, m);
|
||||
|
|
@ -162,19 +154,27 @@ int main(int argc, char **argv)
|
|||
|
||||
jerasure_schedule_encode(k, m, w, dumb, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(stats);
|
||||
printf("Dumb Encoding Complete: - %.0lf XOR'd bytes\n\n", stats[0]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
printf("Dumb 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");
|
||||
|
||||
jerasure_schedule_encode(k, m, w, smart, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(stats);
|
||||
printf("Smart Encoding Complete: - %.0lf XOR'd bytes\n\n", stats[0]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
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] = lrand48()%(k+m);
|
||||
erasures[i] = MOA_Random_W(w, 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);
|
||||
|
|
@ -184,23 +184,41 @@ int main(int argc, char **argv)
|
|||
erasures[i] = -1;
|
||||
|
||||
printf("Erased %d random devices:\n\n", m);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
|
||||
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]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
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");
|
||||
|
||||
ptrs = talloc(char *, (k+m));
|
||||
for (i = 0; i < k; i++) ptrs[i] = data[i];
|
||||
for (i = 0; i < m; i++) ptrs[k+i] = coding[i];
|
||||
|
||||
for (j = 0; j < m; j++) bzero(coding[j], sizeof(long)*w);
|
||||
printf("State of the system after erasing the coding devices:\n");
|
||||
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_do_scheduled_operations(ptrs, smart, sizeof(long));
|
||||
printf("State of the system after deleting the coding devices and\n");
|
||||
printf("using jerasure_do_scheduled_operations(): %.0lf XOR'd bytes\n\n", stats[0]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
printf("And using <b>jerasure_do_scheduled_operations()</b>: %.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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,68 +1,64 @@
|
|||
/* Examples/jerasure_08.c
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
|
||||
/* *
|
||||
* 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.
|
||||
*/
|
||||
|
||||
|
||||
/*
|
||||
revised by S. Simmerman
|
||||
2/25/08
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdint.h>
|
||||
#include <gf_rand.h>
|
||||
#include "jerasure.h"
|
||||
|
||||
#define talloc(type, num) (type *) malloc(sizeof(type)*(num))
|
||||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: jerasure_08 k w - Example schedule cache usage with RAID-6\n");
|
||||
fprintf(stderr, "usage: jerasure_08 k w seed - Example schedule cache usage with RAID-6\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " m=2. k+m must be <= 2^w. It sets up a RAID-6 distribution matrix and encodes\n");
|
||||
fprintf(stderr, " k sets of w*%d bytes. It creates a schedule cache for decoding.\n", sizeof(long));
|
||||
fprintf(stderr, " m=2. k+m must be <= 2^w. It sets up a RAID-6 generator matrix and encodes\n");
|
||||
fprintf(stderr, " k sets of w*%ld bytes. It creates a schedule cache for decoding.\n", sizeof(long));
|
||||
fprintf(stderr, " It demonstrates using the schedule cache for both encoding and decoding.\n");
|
||||
fprintf(stderr, " Then it demonstrates using jerasure_do_parity() to re-encode the first.\n");
|
||||
fprintf(stderr, " coding device\n");
|
||||
|
|
@ -79,44 +75,31 @@ usage(char *s)
|
|||
exit(1);
|
||||
}
|
||||
|
||||
|
||||
static void print_data_and_coding(int k, int m, int w, int psize,
|
||||
char **data, char **coding)
|
||||
static print_array(char **ptrs, int ndevices, int size, int packetsize, char *label)
|
||||
{
|
||||
int i, j, x, n, sp;
|
||||
long l;
|
||||
int i, j, x;
|
||||
unsigned char *up;
|
||||
|
||||
if(k > m) n = k;
|
||||
else n = m;
|
||||
sp = psize * 2 + (psize/4) + 12;
|
||||
printf("<center><table border=3 cellpadding=3><tr><td></td>\n");
|
||||
|
||||
printf("%-*sCoding\n", sp, "Data");
|
||||
for(i = 0; i < n; i++) {
|
||||
for (j = 0; j < w; j++) {
|
||||
if(i < k) {
|
||||
|
||||
if(j==0) printf("D%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, data[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
printf(" ");
|
||||
}
|
||||
else printf("%*s", sp, "");
|
||||
if(i < m) {
|
||||
if(j==0) printf("C%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, coding[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
}
|
||||
|
||||
printf("\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)
|
||||
|
|
@ -128,13 +111,17 @@ int main(int argc, char **argv)
|
|||
int **smart, ***cache;
|
||||
int *erasures, *erased;
|
||||
double stats[3];
|
||||
uint32_t seed;
|
||||
|
||||
if (argc != 3) usage(NULL);
|
||||
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 m");
|
||||
if (sscanf(argv[3], "%d", &seed) == 0) usage("Bad seed");
|
||||
m = 2;
|
||||
if (w < 30 && (k+m) > (1 << w)) usage("k + m is too big");
|
||||
|
||||
MOA_Seed(seed);
|
||||
|
||||
matrix = talloc(int, m*k);
|
||||
for (j = 0; j < k; j++) matrix[j] = 1;
|
||||
i = 1;
|
||||
|
|
@ -147,14 +134,10 @@ int main(int argc, char **argv)
|
|||
smart = jerasure_smart_bitmatrix_to_schedule(k, m, w, bitmatrix);
|
||||
cache = jerasure_generate_schedule_cache(k, m, w, bitmatrix, 1);
|
||||
|
||||
srand48(0);
|
||||
data = talloc(char *, k);
|
||||
for (i = 0; i < k; i++) {
|
||||
data[i] = talloc(char, sizeof(long)*w);
|
||||
for (j = 0; j < w; j++) {
|
||||
l = lrand48();
|
||||
memcpy(data[i]+j*sizeof(long), &l, sizeof(long));
|
||||
}
|
||||
MOA_Fill_Random_Region(data[i], sizeof(long)*w);
|
||||
}
|
||||
|
||||
coding = talloc(char *, m);
|
||||
|
|
@ -164,8 +147,21 @@ int main(int argc, char **argv)
|
|||
|
||||
jerasure_schedule_encode(k, m, w, smart, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(stats);
|
||||
printf("Encoding Complete: - %.0lf XOR'd bytes\n\n", stats[0]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
|
||||
printf("<HTML><TITLE>jerasure_08");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</TITLE>\n");
|
||||
printf("<h3>jerasure_08");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</h3>\n");
|
||||
printf("<hr>\n");
|
||||
|
||||
printf("Encoding Complete: - %.0lf XOR'd bytes. Here is the state of the system:\n<p>\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));
|
||||
erasures[0] = k;
|
||||
|
|
@ -176,12 +172,16 @@ int main(int argc, char **argv)
|
|||
jerasure_schedule_decode_cache(k, m, w, cache, erasures, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(stats);
|
||||
printf("Encoding Using the Schedule Cache: - %.0lf XOR'd bytes\n\n", stats[0]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
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");
|
||||
|
||||
erased = talloc(int, (k+m));
|
||||
for (i = 0; i < m+k; i++) erased[i] = 0;
|
||||
for (i = 0; i < m; ) {
|
||||
erasures[i] = lrand48()%(k+m);
|
||||
erasures[i] = MOA_Random_W(w, 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);
|
||||
|
|
@ -191,24 +191,43 @@ int main(int argc, char **argv)
|
|||
erasures[i] = -1;
|
||||
|
||||
printf("Erased %d random devices:\n\n", m);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
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_cache(k, m, w, cache, erasures, data, coding, w*sizeof(long), sizeof(long));
|
||||
jerasure_get_stats(stats);
|
||||
|
||||
printf("State of the system after decoding: %.0lf XOR'd bytes\n\n", stats[0]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
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");
|
||||
|
||||
bzero(coding[0], sizeof(long)*w);
|
||||
printf("Erased the first coding device:\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_do_parity(k, data, coding[0], sizeof(long)*w);
|
||||
printf("State of the system after deleting coding device 0 and using\n");
|
||||
printf("jerasure_do_parity to re-encode it:\n\n");
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
printf("State of the system after using\n");
|
||||
printf("<b>jerasure_do_parity()</b> to re-encode it:\n\n");
|
||||
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_free_schedule(smart);
|
||||
jerasure_free_schedule_cache(k, m, cache);
|
||||
|
||||
printf("Smart schedule and cache freed\n\n");
|
||||
printf("Smart schedule and cache freed.\n\n");
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,58 +1,54 @@
|
|||
/* Examples/liberation_01.c
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
|
||||
/* *
|
||||
* 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.
|
||||
*/
|
||||
|
||||
|
||||
/*
|
||||
revised by S. Simmerman
|
||||
2/25/08
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
#include <gf_rand.h>
|
||||
#include "jerasure.h"
|
||||
#include "liberation.h"
|
||||
|
||||
|
|
@ -60,10 +56,10 @@ POSSIBILITY OF SUCH DAMAGE.
|
|||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: liberation_01 k w - Liberation RAID-6 coding/decoding example in GF(2^w).\n");
|
||||
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*%d bytes using dumb bit-matrix scheduling.\n", sizeof(long));
|
||||
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");
|
||||
|
|
@ -77,44 +73,31 @@ usage(char *s)
|
|||
exit(1);
|
||||
}
|
||||
|
||||
|
||||
static void print_data_and_coding(int k, int m, int w, int psize,
|
||||
char **data, char **coding)
|
||||
static print_array(char **ptrs, int ndevices, int size, int packetsize, char *label)
|
||||
{
|
||||
int i, j, x, n, sp;
|
||||
long l;
|
||||
int i, j, x;
|
||||
unsigned char *up;
|
||||
|
||||
if(k > m) n = k;
|
||||
else n = m;
|
||||
sp = psize * 2 + (psize/4) + 12;
|
||||
printf("<center><table border=3 cellpadding=3><tr><td></td>\n");
|
||||
|
||||
printf("%-*sCoding\n", sp, "Data");
|
||||
for(i = 0; i < n; i++) {
|
||||
for (j = 0; j < w; j++) {
|
||||
if(i < k) {
|
||||
|
||||
if(j==0) printf("D%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, data[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
printf(" ");
|
||||
}
|
||||
else printf("%*s", sp, "");
|
||||
if(i < m) {
|
||||
if(j==0) printf("C%-2d p%-2d:", i,j);
|
||||
else printf(" p%-2d:", j);
|
||||
for(x = 0; x < psize; x +=4) {
|
||||
memcpy(&l, coding[i]+j*psize+x, sizeof(long));
|
||||
printf(" %08lx", l);
|
||||
}
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
}
|
||||
|
||||
printf("\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)
|
||||
|
|
@ -126,32 +109,40 @@ int main(int argc, char **argv)
|
|||
int **dumb;
|
||||
int *erasures, *erased;
|
||||
double stats[3];
|
||||
uint32_t seed;
|
||||
|
||||
if (argc != 3) usage(NULL);
|
||||
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("Coding Bit-Matrix:\n\n");
|
||||
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("\n");
|
||||
printf("</pre><hr>\n");
|
||||
|
||||
dumb = jerasure_dumb_bitmatrix_to_schedule(k, m, w, bitmatrix);
|
||||
|
||||
srand48(0);
|
||||
MOA_Seed(seed);
|
||||
data = talloc(char *, k);
|
||||
for (i = 0; i < k; i++) {
|
||||
data[i] = talloc(char, sizeof(long)*w);
|
||||
for (j = 0; j < w; j++) {
|
||||
l = lrand48();
|
||||
memcpy(data[i]+j*sizeof(long), &l, sizeof(long));
|
||||
}
|
||||
MOA_Fill_Random_Region(data[i], sizeof(long)*w);
|
||||
}
|
||||
|
||||
coding = talloc(char *, m);
|
||||
|
|
@ -161,14 +152,18 @@ int main(int argc, char **argv)
|
|||
|
||||
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\n\n", stats[0]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
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] = lrand48()%(k+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);
|
||||
|
|
@ -178,13 +173,21 @@ int main(int argc, char **argv)
|
|||
erasures[i] = -1;
|
||||
|
||||
printf("Erased %d random devices:\n\n", m);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
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]);
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -42,7 +42,10 @@
|
|||
# WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
||||
# POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
|
||||
PREFIX=/usr/local
|
||||
BINDIR=${PREFIX}/bin
|
||||
LIBDIR=${PREFIX}/lib
|
||||
INCDIR=${PREFIX}/include
|
||||
CC = gcc
|
||||
CFLAGS = -O2 -I$(HOME)/include
|
||||
|
||||
|
|
@ -58,6 +61,9 @@ ALL = jerasure_01 \
|
|||
reed_sol_02 \
|
||||
reed_sol_03 \
|
||||
reed_sol_04 \
|
||||
reed_sol_test_gf \
|
||||
reed_sol_time_gf \
|
||||
reed_sol_hard_time_gf \
|
||||
cauchy_01 \
|
||||
cauchy_02 \
|
||||
cauchy_03 \
|
||||
|
|
@ -106,81 +112,92 @@ galois.h: ../galois.h
|
|||
galois.c: ../galois.c
|
||||
rm -f galois.c ; cp ../galois.c . ; chmod 0444 galois.c
|
||||
|
||||
galois.o: galois.h
|
||||
jerasure.o: jerasure.h galois.h
|
||||
|
||||
jerasure_01.o: galois.h jerasure.h
|
||||
jerasure_01: jerasure_01.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_01 jerasure_01.o jerasure.o galois.o
|
||||
$(CC) $(CFLAGS) -o jerasure_01 jerasure_01.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
jerasure_02.o: galois.h jerasure.h
|
||||
jerasure_02: jerasure_02.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_02 jerasure_02.o jerasure.o galois.o
|
||||
$(CC) $(CFLAGS) -o jerasure_02 jerasure_02.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
jerasure_03.o: galois.h jerasure.h
|
||||
jerasure_03: jerasure_03.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_03 jerasure_03.o jerasure.o galois.o
|
||||
jerasure_03: jerasure_03.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_03 jerasure_03.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
jerasure_04.o: galois.h jerasure.h
|
||||
jerasure_04: jerasure_04.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_04 jerasure_04.o jerasure.o galois.o
|
||||
jerasure_04: jerasure_04.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_04 jerasure_04.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
jerasure_05.o: galois.h jerasure.h
|
||||
jerasure_05: jerasure_05.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_05 jerasure_05.o jerasure.o galois.o
|
||||
jerasure_05: jerasure_05.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_05 jerasure_05.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
jerasure_06.o: galois.h jerasure.h
|
||||
jerasure_06: jerasure_06.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_06 jerasure_06.o jerasure.o galois.o
|
||||
jerasure_06: jerasure_06.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_06 jerasure_06.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
jerasure_07.o: galois.h jerasure.h
|
||||
jerasure_07: jerasure_07.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_07 jerasure_07.o jerasure.o galois.o
|
||||
jerasure_07: jerasure_07.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_07 jerasure_07.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
jerasure_08.o: galois.h jerasure.h
|
||||
jerasure_08: jerasure_08.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_08 jerasure_08.o jerasure.o galois.o
|
||||
jerasure_08: jerasure_08.o galois.o jerasure.o
|
||||
$(CC) $(CFLAGS) -o jerasure_08 jerasure_08.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
reed_sol_01.o: galois.h reed_sol.h jerasure.h
|
||||
reed_sol_01: reed_sol_01.o galois.o jerasure.o reed_sol.o
|
||||
$(CC) $(CFLAGS) -o reed_sol_01 reed_sol_01.o reed_sol.o jerasure.o galois.o
|
||||
reed_sol_01: reed_sol_01.o galois.o jerasure.o reed_sol.o
|
||||
$(CC) $(CFLAGS) -o reed_sol_01 reed_sol_01.o reed_sol.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
reed_sol_02.o: galois.h reed_sol.h jerasure.h
|
||||
reed_sol_02: reed_sol_02.o galois.o jerasure.o reed_sol.o
|
||||
$(CC) $(CFLAGS) -o reed_sol_02 reed_sol_02.o reed_sol.o jerasure.o galois.o
|
||||
reed_sol_02: reed_sol_02.o galois.o jerasure.o reed_sol.o
|
||||
$(CC) $(CFLAGS) -o reed_sol_02 reed_sol_02.o reed_sol.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
reed_sol_03.o: galois.h reed_sol.h jerasure.h
|
||||
reed_sol_03: reed_sol_03.o galois.o jerasure.o reed_sol.o
|
||||
$(CC) $(CFLAGS) -o reed_sol_03 reed_sol_03.o reed_sol.o jerasure.o galois.o
|
||||
reed_sol_03: reed_sol_03.o galois.o jerasure.o reed_sol.o
|
||||
$(CC) $(CFLAGS) -o reed_sol_03 reed_sol_03.o reed_sol.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
reed_sol_04.o: galois.h reed_sol.h jerasure.h
|
||||
reed_sol_04: reed_sol_04.o galois.o jerasure.o reed_sol.o
|
||||
$(CC) $(CFLAGS) -o reed_sol_04 reed_sol_04.o reed_sol.o jerasure.o galois.o
|
||||
reed_sol_04: reed_sol_04.o galois.o jerasure.o reed_sol.o
|
||||
$(CC) $(CFLAGS) -o reed_sol_04 reed_sol_04.o reed_sol.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
cauchy_01.o: galois.h cauchy.h jerasure.h
|
||||
cauchy_01: cauchy_01.o galois.o jerasure.o cauchy.o
|
||||
$(CC) $(CFLAGS) -o cauchy_01 cauchy_01.o cauchy.o jerasure.o galois.o
|
||||
cauchy_01: cauchy_01.o galois.o jerasure.o cauchy.o
|
||||
$(CC) $(CFLAGS) -o cauchy_01 cauchy_01.o cauchy.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
cauchy_02.o: galois.h cauchy.h jerasure.h
|
||||
cauchy_02: cauchy_02.o galois.o jerasure.o cauchy.o
|
||||
$(CC) $(CFLAGS) -o cauchy_02 cauchy_02.o cauchy.o jerasure.o galois.o
|
||||
cauchy_02: cauchy_02.o galois.o jerasure.o cauchy.o
|
||||
$(CC) $(CFLAGS) -o cauchy_02 cauchy_02.o cauchy.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
cauchy_03.o: galois.h cauchy.h jerasure.h
|
||||
cauchy_03: cauchy_03.o galois.o jerasure.o cauchy.o
|
||||
$(CC) $(CFLAGS) -o cauchy_03 cauchy_03.o cauchy.o jerasure.o galois.o
|
||||
cauchy_03: cauchy_03.o galois.o jerasure.o cauchy.o
|
||||
$(CC) $(CFLAGS) -o cauchy_03 cauchy_03.o cauchy.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
cauchy_04.o: galois.h cauchy.h jerasure.h
|
||||
cauchy_04: cauchy_04.o galois.o jerasure.o cauchy.o
|
||||
$(CC) $(CFLAGS) -o cauchy_04 cauchy_04.o cauchy.o jerasure.o galois.o
|
||||
cauchy_04: cauchy_04.o galois.o jerasure.o cauchy.o
|
||||
$(CC) $(CFLAGS) -o cauchy_04 cauchy_04.o cauchy.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
liberation_01.o: galois.h liberation.h jerasure.h
|
||||
liberation_01: liberation_01.o galois.o jerasure.o liberation.o
|
||||
$(CC) $(CFLAGS) -o liberation_01 liberation_01.o liberation.o jerasure.o galois.o
|
||||
liberation_01: liberation_01.o galois.o jerasure.o liberation.o
|
||||
$(CC) $(CFLAGS) -o liberation_01 liberation_01.o liberation.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
encoder.o: galois.h liberation.h jerasure.h reed_sol.h cauchy.h
|
||||
encoder: encoder.o galois.o jerasure.o liberation.o reed_sol.o cauchy.o
|
||||
$(CC) $(CFLAGS) -o encoder encoder.o liberation.o jerasure.o galois.o reed_sol.o cauchy.o
|
||||
encoder: encoder.o galois.o jerasure.o liberation.o reed_sol.o cauchy.o
|
||||
$(CC) $(CFLAGS) -o encoder encoder.o liberation.o jerasure.o galois.o reed_sol.o cauchy.o -lgf_complete
|
||||
|
||||
decoder.o: galois.h liberation.h jerasure.h reed_sol.h cauchy.h
|
||||
decoder: decoder.o galois.o jerasure.o liberation.o reed_sol.o cauchy.o
|
||||
$(CC) $(CFLAGS) -o decoder decoder.o liberation.o jerasure.o galois.o reed_sol.o cauchy.o
|
||||
decoder: decoder.o galois.o jerasure.o liberation.o reed_sol.o cauchy.o
|
||||
$(CC) $(CFLAGS) -o decoder decoder.o liberation.o jerasure.o galois.o reed_sol.o cauchy.o -lgf_complete
|
||||
|
||||
reed_sol_test_gf.o: galois.h reed_sol.h jerasure.h
|
||||
reed_sol_test_gf: reed_sol_test_gf.o galois.o jerasure.o reed_sol.o
|
||||
$(CC) $(CFLAGS) -o reed_sol_test_gf reed_sol_test_gf.o reed_sol.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
reed_sol_time_gf.o: galois.h reed_sol.h jerasure.h
|
||||
reed_sol_time_gf: reed_sol_time_gf.o galois.o jerasure.o reed_sol.o
|
||||
$(CC) $(CFLAGS) -o reed_sol_time_gf reed_sol_time_gf.o reed_sol.o jerasure.o galois.o -lgf_complete
|
||||
|
||||
reed_sol_hard_time_gf.o: galois.h reed_sol.h jerasure.h
|
||||
reed_sol_hard_time_gf: reed_sol_hard_time_gf.o galois.o jerasure.o reed_sol.o
|
||||
$(CC) $(CFLAGS) -o reed_sol_hard_time_gf reed_sol_hard_time_gf.o reed_sol.o jerasure.o galois.o -lgf_complete
|
||||
|
|
@ -1,58 +1,54 @@
|
|||
/* Examples/reed_sol_01.c
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
|
||||
/* *
|
||||
* 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.
|
||||
*/
|
||||
|
||||
|
||||
/*
|
||||
revised by S. Simmerman
|
||||
2/25/08
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdint.h>
|
||||
#include <string.h>
|
||||
#include <gf_rand.h>
|
||||
#include "jerasure.h"
|
||||
#include "reed_sol.h"
|
||||
|
||||
|
|
@ -60,11 +56,11 @@ POSSIBILITY OF SUCH DAMAGE.
|
|||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: reed_sol_01 k m w - Does a simple Reed-Solomon coding example in GF(2^w).\n");
|
||||
fprintf(stderr, "usage: reed_sol_01 k m w seed - Does a simple Reed-Solomon coding example in GF(2^w).\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " w must be 8, 16 or 32. k+m must be <= 2^w. It sets up a classic\n");
|
||||
fprintf(stderr, " Vandermonde-based distribution matrix and encodes k devices of\n");
|
||||
fprintf(stderr, " %d bytes each with it. Then it decodes.\n", sizeof(long));
|
||||
fprintf(stderr, "w must be 8, 16 or 32. k+m must be <= 2^w. It sets up a classic\n");
|
||||
fprintf(stderr, "Vandermonde-based generator matrix and encodes k devices of\n");
|
||||
fprintf(stderr, "%ld bytes each with it. Then it decodes.\n", sizeof(long));
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, "This demonstrates: jerasure_matrix_encode()\n");
|
||||
fprintf(stderr, " jerasure_matrix_decode()\n");
|
||||
|
|
@ -117,36 +113,53 @@ int main(int argc, char **argv)
|
|||
long l;
|
||||
int k, w, i, j, m;
|
||||
int *matrix;
|
||||
char **data, **coding;
|
||||
char **data, **coding, **dcopy, **ccopy;
|
||||
unsigned char uc;
|
||||
int *erasures, *erased;
|
||||
int *decoding_matrix, *dm_ids;
|
||||
uint32_t seed;
|
||||
|
||||
if (argc != 4) usage(NULL);
|
||||
if (argc != 5) usage(NULL);
|
||||
if (sscanf(argv[1], "%d", &k) == 0 || k <= 0) usage("Bad k");
|
||||
if (sscanf(argv[2], "%d", &m) == 0 || m <= 0) usage("Bad m");
|
||||
if (sscanf(argv[3], "%d", &w) == 0 || (w != 8 && w != 16 && w != 32)) usage("Bad w");
|
||||
if (sscanf(argv[4], "%u", &seed) == 0) usage("Bad seed");
|
||||
if (w <= 16 && k + m > (1 << w)) usage("k + m is too big");
|
||||
|
||||
matrix = reed_sol_vandermonde_coding_matrix(k, m, w);
|
||||
|
||||
printf("Last m rows of the Distribution Matrix:\n\n");
|
||||
printf("<HTML><TITLE>reed_sol_01 %d %d %d %d</title>\n", k, m, w, seed);
|
||||
printf("<h3>reed_sol_01 %d %d %d %d</h3>\n", k, m, w, seed);
|
||||
printf("<pre>\n");
|
||||
printf("Last m rows of the generator Matrix (G^T):\n\n");
|
||||
jerasure_print_matrix(matrix, m, k, w);
|
||||
printf("\n");
|
||||
|
||||
srand48(0);
|
||||
MOA_Seed(seed);
|
||||
data = talloc(char *, k);
|
||||
dcopy = talloc(char *, k);
|
||||
for (i = 0; i < k; i++) {
|
||||
data[i] = talloc(char, sizeof(long));
|
||||
l = lrand48();
|
||||
memcpy(data[i], &l, sizeof(long));
|
||||
dcopy[i] = talloc(char, sizeof(long));
|
||||
for (j = 0; j < sizeof(long); j++) {
|
||||
uc = MOA_Random_W(8, 1);
|
||||
data[i][j] = (char) uc;
|
||||
}
|
||||
memcpy(dcopy[i], data[i], sizeof(long));
|
||||
}
|
||||
|
||||
coding = talloc(char *, m);
|
||||
ccopy = talloc(char *, m);
|
||||
for (i = 0; i < m; i++) {
|
||||
coding[i] = talloc(char, sizeof(long));
|
||||
ccopy[i] = talloc(char, sizeof(long));
|
||||
}
|
||||
|
||||
jerasure_matrix_encode(k, m, w, matrix, data, coding, sizeof(long));
|
||||
|
||||
for (i = 0; i < m; i++) {
|
||||
memcpy(ccopy[i], coding[i], sizeof(long));
|
||||
}
|
||||
|
||||
printf("Encoding Complete:\n\n");
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
|
|
@ -156,7 +169,7 @@ int main(int argc, char **argv)
|
|||
for (i = 0; i < m+k; i++) erased[i] = 0;
|
||||
l = 0;
|
||||
for (i = 0; i < m; ) {
|
||||
erasures[i] = lrand48()%(k+m);
|
||||
erasures[i] = MOA_Random_W(31, 0)%(k+m);
|
||||
if (erased[erasures[i]] == 0) {
|
||||
erased[erasures[i]] = 1;
|
||||
memcpy((erasures[i] < k) ? data[erasures[i]] : coding[erasures[i]-k], &l, sizeof(long));
|
||||
|
|
@ -173,5 +186,12 @@ int main(int argc, char **argv)
|
|||
printf("State of the system after decoding:\n\n");
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
|
||||
for (i = 0; i < k; i++) if (memcmp(data[i], dcopy[i], sizeof(long)) != 0) {
|
||||
printf("ERROR: D%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
for (i = 0; i < m; i++) if (memcmp(coding[i], ccopy[i], sizeof(long)) != 0) {
|
||||
printf("ERROR: C%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,49 +1,49 @@
|
|||
/* Examples/reed_sol_02.c
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
|
||||
/* *
|
||||
* 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>
|
||||
|
|
@ -57,7 +57,7 @@ usage(char *s)
|
|||
fprintf(stderr, "usage: reed_sol_02 k m w - Vandermonde matrices in GF(2^w).\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " k+m must be <= 2^w. This simply prints out the \n");
|
||||
fprintf(stderr, " Vandermonde matrix in GF(2^w), and then the distribution\n");
|
||||
fprintf(stderr, " Vandermonde matrix in GF(2^w), and then the generator\n");
|
||||
fprintf(stderr, " matrix that is constructed from it. See [Plank-Ding-05] for\n");
|
||||
fprintf(stderr, " information on how this construction proceeds\n");
|
||||
fprintf(stderr, " \n");
|
||||
|
|
@ -82,12 +82,16 @@ int main(int argc, char **argv)
|
|||
if (w <= 30 && k + m > (1 << w)) usage("k + m is too big");
|
||||
|
||||
matrix = reed_sol_extended_vandermonde_matrix(k+m, k, w);
|
||||
|
||||
printf("<HTML><TITLE>reed_sol_02 %d %d %d</title>\n", k, m, w);
|
||||
printf("<h3>reed_sol_02 %d %d %d</h3>\n", k, m, w);
|
||||
printf("<pre>\n");
|
||||
printf("Extended Vandermonde Matrix:\n\n");
|
||||
jerasure_print_matrix(matrix, k+m, k, w);
|
||||
printf("\n");
|
||||
|
||||
matrix = reed_sol_big_vandermonde_distribution_matrix(k+m, k, w);
|
||||
printf("Vandermonde Distribution Matrix:\n\n");
|
||||
printf("Vandermonde Generator Matrix (G^T):\n\n");
|
||||
jerasure_print_matrix(matrix, k+m, k, w);
|
||||
printf("\n");
|
||||
|
||||
|
|
|
|||
|
|
@ -1,58 +1,53 @@
|
|||
/* Examples/reed_sol_03.c
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
|
||||
/* *
|
||||
* 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.
|
||||
*/
|
||||
|
||||
/*
|
||||
revised by S. Simmerman
|
||||
2/25/08
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <gf_rand.h>
|
||||
#include "jerasure.h"
|
||||
#include "reed_sol.h"
|
||||
|
||||
|
|
@ -60,11 +55,11 @@ POSSIBILITY OF SUCH DAMAGE.
|
|||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: reed_sol_03 k w - Does a simple RAID-6 coding example in GF(2^w).\n");
|
||||
fprintf(stderr, "usage: reed_sol_03 k w seed - Does a simple RAID-6 coding example in GF(2^w).\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " w must be 8, 16 or 32. k+2 must be <= 2^w. It sets up a classic\n");
|
||||
fprintf(stderr, " RAID-6 coding matrix based on Anvin's optimization and encodes\n");
|
||||
fprintf(stderr, " %d-byte devices with it. Then it decodes.\n", sizeof(long));
|
||||
fprintf(stderr, " %ld-byte devices with it. Then it decodes.\n", sizeof(long));
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, "This demonstrates: reed_sol_r6_encode()\n");
|
||||
fprintf(stderr, " reed_sol_r6_coding_matrix()\n");
|
||||
|
|
@ -116,38 +111,55 @@ static void print_data_and_coding(int k, int m, int w, int size,
|
|||
int main(int argc, char **argv)
|
||||
{
|
||||
long l;
|
||||
unsigned char uc;
|
||||
int k, w, i, j, m;
|
||||
int *matrix;
|
||||
char **data, **coding;
|
||||
char **data, **coding, **dcopy, **ccopy;
|
||||
int *erasures, *erased;
|
||||
int *decoding_matrix, *dm_ids;
|
||||
uint32_t seed;
|
||||
|
||||
if (argc != 3) usage(NULL);
|
||||
if (argc != 4) usage(NULL);
|
||||
if (sscanf(argv[1], "%d", &k) == 0 || k <= 0) usage("Bad k");
|
||||
if (sscanf(argv[2], "%d", &w) == 0 || (w != 8 && w != 16 && w != 32)) usage("Bad w");
|
||||
if (sscanf(argv[3], "%d", &seed) == 0) usage("Bad seed");
|
||||
m = 2;
|
||||
if (w <= 16 && k + m > (1 << w)) usage("k + m is too big");
|
||||
|
||||
MOA_Seed(seed);
|
||||
matrix = reed_sol_r6_coding_matrix(k, w);
|
||||
|
||||
printf("Last 2 rows of the Distribution Matrix:\n\n");
|
||||
printf("<HTML><TITLE>reed_sol_03 %d %d %d</title>\n", k, w, seed);
|
||||
printf("<h3>reed_sol_03 %d %d %d</h3>\n", k, w, seed);
|
||||
printf("<pre>\n");
|
||||
|
||||
printf("Last 2 rows of the Generator Matrix:\n\n");
|
||||
jerasure_print_matrix(matrix, m, k, w);
|
||||
printf("\n");
|
||||
|
||||
srand48(0);
|
||||
data = talloc(char *, k);
|
||||
dcopy = talloc(char *, k);
|
||||
for (i = 0; i < k; i++) {
|
||||
data[i] = talloc(char, sizeof(long));
|
||||
l = lrand48();
|
||||
memcpy(data[i], &l, sizeof(long));
|
||||
dcopy[i] = talloc(char, sizeof(long));
|
||||
for (j = 0; j < sizeof(long); j++) {
|
||||
uc = MOA_Random_W(8, 1) %256;
|
||||
data[i][j] = (char) uc;
|
||||
}
|
||||
memcpy(dcopy[i], data[i], sizeof(long));
|
||||
}
|
||||
|
||||
coding = talloc(char *, m);
|
||||
ccopy = talloc(char *, m);
|
||||
for (i = 0; i < m; i++) {
|
||||
coding[i] = talloc(char, sizeof(long));
|
||||
ccopy[i] = talloc(char, sizeof(long));
|
||||
}
|
||||
|
||||
reed_sol_r6_encode(k, w, data, coding, sizeof(long));
|
||||
for (i = 0; i < m; i++) {
|
||||
memcpy(ccopy[i], coding[i], sizeof(long));
|
||||
}
|
||||
|
||||
printf("Encoding Complete:\n\n");
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
|
|
@ -157,7 +169,7 @@ int main(int argc, char **argv)
|
|||
for (i = 0; i < m+k; i++) erased[i] = 0;
|
||||
l = 0;
|
||||
for (i = 0; i < m; ) {
|
||||
erasures[i] = lrand48()%(k+m);
|
||||
erasures[i] = ((unsigned int) MOA_Random_W(w, 1))%(k+m);
|
||||
if (erased[erasures[i]] == 0) {
|
||||
erased[erasures[i]] = 1;
|
||||
memcpy((erasures[i] < k) ? data[erasures[i]] : coding[erasures[i]-k], &l, sizeof(long));
|
||||
|
|
@ -174,5 +186,12 @@ int main(int argc, char **argv)
|
|||
printf("State of the system after decoding:\n\n");
|
||||
print_data_and_coding(k, m, w, sizeof(long), data, coding);
|
||||
|
||||
for (i = 0; i < k; i++) if (memcmp(data[i], dcopy[i], sizeof(long)) != 0) {
|
||||
printf("ERROR: D%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
for (i = 0; i < m; i++) if (memcmp(coding[i], ccopy[i], sizeof(long)) != 0) {
|
||||
printf("ERROR: C%x after decoding does not match its state before decoding!<br>\n", i);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,54 +1,54 @@
|
|||
/* Examples/reed_sol_04.c
|
||||
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
/* *
|
||||
* 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 <stdint.h>
|
||||
#include <string.h>
|
||||
#include <gf_rand.h>
|
||||
#include "jerasure.h"
|
||||
#include "reed_sol.h"
|
||||
|
||||
|
|
@ -56,7 +56,7 @@ POSSIBILITY OF SUCH DAMAGE.
|
|||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: reed_sol_04 w - Shows reed_sol_galois_wXX_region_multby_2\n");
|
||||
fprintf(stderr, "usage: reed_sol_04 w seed - Shows reed_sol_galois_wXX_region_multby_2\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " w must be 8, 16 or 32. Sets up an array of 4 random words in\n");
|
||||
fprintf(stderr, " GF(2^w) and multiplies them by two. \n");
|
||||
|
|
@ -73,18 +73,24 @@ int main(int argc, char **argv)
|
|||
unsigned char *x, *y;
|
||||
unsigned short *xs, *ys;
|
||||
unsigned int *xi, *yi;
|
||||
uint32_t seed;
|
||||
int *a32, *copy;
|
||||
int i;
|
||||
int w;
|
||||
|
||||
if (argc != 2) usage(NULL);
|
||||
if (argc != 3) usage(NULL);
|
||||
if (sscanf(argv[1], "%d", &w) == 0 || (w != 8 && w != 16 && w != 32)) usage("Bad w");
|
||||
if (sscanf(argv[2], "%d", &seed) == 0) usage("Bad seed");
|
||||
|
||||
srand48(time(0));
|
||||
printf("<HTML><TITLE>reed_sol_04 %d %d</title>\n", w, seed);
|
||||
printf("<h3>reed_sol_04 %d %d</h3>\n", w, seed);
|
||||
printf("<pre>\n");
|
||||
|
||||
MOA_Seed(seed);
|
||||
a32 = talloc(int, 4);
|
||||
copy = talloc(int, 4);
|
||||
y = (unsigned char *) a32;
|
||||
for (i = 0; i < 4*sizeof(int); i++) y[i] = lrand48()%255;
|
||||
for (i = 0; i < 4*sizeof(int); i++) y[i] = MOA_Random_W(8, 1);
|
||||
memcpy(copy, a32, sizeof(int)*4);
|
||||
|
||||
if (w == 8) {
|
||||
|
|
|
|||
|
|
@ -0,0 +1,189 @@
|
|||
/* *
|
||||
* 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 <gf_complete.h>
|
||||
#include <gf_method.h>
|
||||
#include <stdint.h>
|
||||
#include "jerasure.h"
|
||||
#include "reed_sol.h"
|
||||
|
||||
#define BUFSIZE 4096
|
||||
|
||||
static void *malloc16(int size) {
|
||||
void *mem = malloc(size+16+sizeof(void*));
|
||||
void **ptr = (void**)((long)(mem+16+sizeof(void*)) & ~(15));
|
||||
ptr[-1] = mem;
|
||||
return ptr;
|
||||
}
|
||||
|
||||
static void free16(void *ptr) {
|
||||
free(((void**)ptr)[-1]);
|
||||
}
|
||||
|
||||
#define talloc(type, num) (type *) malloc16(sizeof(type)*(num))
|
||||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: reed_sol_test_gf k m w seed [additional GF args]- Tests Reed-Solomon in GF(2^w).\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " w must be 8, 16 or 32. k+m must be <= 2^w.\n");
|
||||
fprintf(stderr, " See the README for information on the additional GF args.\n");
|
||||
fprintf(stderr, " Set up a Vandermonde-based distribution matrix and encodes k devices of\n");
|
||||
fprintf(stderr, " %d bytes each with it. Then it decodes.\n", BUFSIZE);
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, "This tests: jerasure_matrix_encode()\n");
|
||||
fprintf(stderr, " jerasure_matrix_decode()\n");
|
||||
fprintf(stderr, " jerasure_print_matrix()\n");
|
||||
fprintf(stderr, " galois_change_technique()\n");
|
||||
fprintf(stderr, " reed_sol_vandermonde_coding_matrix()\n");
|
||||
if (s != NULL) fprintf(stderr, "%s\n", s);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
gf_t* get_gf(int w, int argc, char **argv, int starting)
|
||||
{
|
||||
gf_t *gf = (gf_t*)malloc(sizeof(gf_t));
|
||||
if (create_gf_from_argv(gf, w, argc, argv, starting) == 0) {
|
||||
free(gf);
|
||||
gf = NULL;
|
||||
}
|
||||
return gf;
|
||||
}
|
||||
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
long l;
|
||||
int k, w, i, j, m;
|
||||
int *matrix;
|
||||
char **data, **coding, **old_values;
|
||||
int *erasures, *erased;
|
||||
int *decoding_matrix, *dm_ids;
|
||||
gf_t *gf = NULL;
|
||||
uint32_t seed;
|
||||
|
||||
if (argc < 6) usage(NULL);
|
||||
if (sscanf(argv[1], "%d", &k) == 0 || k <= 0) usage("Bad k");
|
||||
if (sscanf(argv[2], "%d", &m) == 0 || m <= 0) usage("Bad m");
|
||||
if (sscanf(argv[3], "%d", &w) == 0 || (w != 8 && w != 16 && w != 32)) usage("Bad w");
|
||||
if (sscanf(argv[4], "%d", &seed) == 0) usage("Bad seed");
|
||||
if (w <= 16 && k + m > (1 << w)) usage("k + m is too big");
|
||||
|
||||
MOA_Seed(seed);
|
||||
|
||||
gf = get_gf(w, argc, argv, 5);
|
||||
|
||||
if (gf == NULL) {
|
||||
usage("Invalid arguments given for GF!\n");
|
||||
}
|
||||
|
||||
galois_change_technique(gf, w);
|
||||
|
||||
matrix = reed_sol_vandermonde_coding_matrix(k, m, w);
|
||||
|
||||
printf("<HTML><TITLE>reed_sol_test_gf");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</TITLE>\n");
|
||||
printf("<h3>reed_sol_test_gf");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</h3>\n");
|
||||
printf("<pre>\n");
|
||||
|
||||
printf("Last m rows of the generator matrix (G^T):\n\n");
|
||||
jerasure_print_matrix(matrix, m, k, w);
|
||||
printf("\n");
|
||||
|
||||
data = talloc(char *, k);
|
||||
for (i = 0; i < k; i++) {
|
||||
data[i] = talloc(char, BUFSIZE);
|
||||
MOA_Fill_Random_Region(data[i], BUFSIZE);
|
||||
}
|
||||
|
||||
coding = talloc(char *, m);
|
||||
old_values = talloc(char *, m);
|
||||
for (i = 0; i < m; i++) {
|
||||
coding[i] = talloc(char, BUFSIZE);
|
||||
old_values[i] = talloc(char, BUFSIZE);
|
||||
}
|
||||
|
||||
jerasure_matrix_encode(k, m, w, matrix, data, coding, BUFSIZE);
|
||||
|
||||
erasures = talloc(int, (m+1));
|
||||
erased = talloc(int, (k+m));
|
||||
for (i = 0; i < m+k; i++) erased[i] = 0;
|
||||
l = 0;
|
||||
for (i = 0; i < m; ) {
|
||||
erasures[i] = ((unsigned int)MOA_Random_W(w,1))%(k+m);
|
||||
if (erased[erasures[i]] == 0) {
|
||||
erased[erasures[i]] = 1;
|
||||
memcpy(old_values[i], (erasures[i] < k) ? data[erasures[i]] : coding[erasures[i]-k], BUFSIZE);
|
||||
bzero((erasures[i] < k) ? data[erasures[i]] : coding[erasures[i]-k], BUFSIZE);
|
||||
i++;
|
||||
}
|
||||
}
|
||||
erasures[i] = -1;
|
||||
|
||||
i = jerasure_matrix_decode(k, m, w, matrix, 1, erasures, data, coding, BUFSIZE);
|
||||
|
||||
for (i = 0; i < m; i++) {
|
||||
if (erasures[i] < k) {
|
||||
if (memcmp(data[erasures[i]], old_values[i], BUFSIZE)) {
|
||||
fprintf(stderr, "Decoding failed for %d!\n", erasures[i]);
|
||||
exit(1);
|
||||
}
|
||||
} else {
|
||||
if (memcmp(coding[erasures[i]-k], old_values[i], BUFSIZE)) {
|
||||
fprintf(stderr, "Decoding failed for %d!\n", erasures[i]);
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
printf("Encoding and decoding were both successful.\n");
|
||||
return 0;
|
||||
}
|
||||
|
|
@ -0,0 +1,222 @@
|
|||
/* *
|
||||
* 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 <gf_complete.h>
|
||||
#include <gf_rand.h>
|
||||
#include <gf_method.h>
|
||||
#include <stdint.h>
|
||||
#include "jerasure.h"
|
||||
#include "reed_sol.h"
|
||||
|
||||
static void *malloc16(int size) {
|
||||
void *mem = malloc(size+16+sizeof(void*));
|
||||
void **ptr = (void**)((long)(mem+16+sizeof(void*)) & ~(15));
|
||||
ptr[-1] = mem;
|
||||
return ptr;
|
||||
}
|
||||
|
||||
static void free16(void *ptr) {
|
||||
free(((void**)ptr)[-1]);
|
||||
}
|
||||
|
||||
#define talloc(type, num) (type *) malloc16(sizeof(type)*(num))
|
||||
|
||||
void
|
||||
timer_start (double *t)
|
||||
{
|
||||
struct timeval tv;
|
||||
|
||||
gettimeofday (&tv, NULL);
|
||||
*t = (double)tv.tv_sec + (double)tv.tv_usec * 1e-6;
|
||||
}
|
||||
|
||||
double
|
||||
timer_split (const double *t)
|
||||
{
|
||||
struct timeval tv;
|
||||
double cur_t;
|
||||
|
||||
gettimeofday (&tv, NULL);
|
||||
cur_t = (double)tv.tv_sec + (double)tv.tv_usec * 1e-6;
|
||||
return (cur_t - *t);
|
||||
}
|
||||
|
||||
usage(char *s)
|
||||
{
|
||||
fprintf(stderr, "usage: reed_sol_time_gf k m w seed iterations bufsize (additional GF args) - Test and time Reed-Solomon in a particular GF(2^w).\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, " w must be 8, 16 or 32. k+m must be <= 2^w.\n");
|
||||
fprintf(stderr, " See the README for information on the additional GF args.\n");
|
||||
fprintf(stderr, " Set up a Vandermonde-based distribution matrix and encodes k devices of\n");
|
||||
fprintf(stderr, " bufsize bytes each with it. Then it decodes.\n");
|
||||
fprintf(stderr, " \n");
|
||||
fprintf(stderr, "This tests: jerasure_matrix_encode()\n");
|
||||
fprintf(stderr, " jerasure_matrix_decode()\n");
|
||||
fprintf(stderr, " jerasure_print_matrix()\n");
|
||||
fprintf(stderr, " galois_change_technique()\n");
|
||||
fprintf(stderr, " reed_sol_vandermonde_coding_matrix()\n");
|
||||
if (s != NULL) fprintf(stderr, "%s\n", s);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
gf_t* get_gf(int w, int argc, char **argv, int starting)
|
||||
{
|
||||
gf_t *gf = (gf_t*)malloc(sizeof(gf_t));
|
||||
if (create_gf_from_argv(gf, w, argc, argv, starting) == 0) {
|
||||
free(gf);
|
||||
gf = NULL;
|
||||
}
|
||||
return gf;
|
||||
}
|
||||
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
long l;
|
||||
int k, w, i, j, m, iterations, bufsize;
|
||||
int *matrix;
|
||||
char **data, **coding, **old_values;
|
||||
int *erasures, *erased;
|
||||
int *decoding_matrix, *dm_ids;
|
||||
uint32_t seed;
|
||||
double t = 0, total_time = 0;
|
||||
gf_t *gf = NULL;
|
||||
|
||||
if (argc < 8) usage(NULL);
|
||||
if (sscanf(argv[1], "%d", &k) == 0 || k <= 0) usage("Bad k");
|
||||
if (sscanf(argv[2], "%d", &m) == 0 || m <= 0) usage("Bad m");
|
||||
if (sscanf(argv[3], "%d", &w) == 0 || (w != 8 && w != 16 && w != 32)) usage("Bad w");
|
||||
if (sscanf(argv[4], "%d", &seed) == 0) usage("Bad seed");
|
||||
if (sscanf(argv[5], "%d", &iterations) == 0) usage("Bad iterations");
|
||||
if (sscanf(argv[6], "%d", &bufsize) == 0) usage("Bad bufsize");
|
||||
if (w <= 16 && k + m > (1 << w)) usage("k + m is too big");
|
||||
|
||||
MOA_Seed(seed);
|
||||
|
||||
gf = get_gf(w, argc, argv, 7);
|
||||
|
||||
if (gf == NULL) {
|
||||
usage("Invalid arguments given for GF!\n");
|
||||
}
|
||||
|
||||
galois_change_technique(gf, w);
|
||||
|
||||
matrix = reed_sol_vandermonde_coding_matrix(k, m, w);
|
||||
|
||||
printf("<HTML><TITLE>reed_sol_time_gf");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</TITLE>\n");
|
||||
printf("<h3>reed_sol_time_gf");
|
||||
for (i = 1; i < argc; i++) printf(" %s", argv[i]);
|
||||
printf("</h3>\n");
|
||||
printf("<pre>\n");
|
||||
|
||||
printf("Last m rows of the generator matrix (G^T):\n\n");
|
||||
jerasure_print_matrix(matrix, m, k, w);
|
||||
printf("\n");
|
||||
|
||||
data = talloc(char *, k);
|
||||
for (i = 0; i < k; i++) {
|
||||
data[i] = talloc(char, bufsize);
|
||||
MOA_Fill_Random_Region(data[i], bufsize);
|
||||
}
|
||||
|
||||
coding = talloc(char *, m);
|
||||
old_values = talloc(char *, m);
|
||||
for (i = 0; i < m; i++) {
|
||||
coding[i] = talloc(char, bufsize);
|
||||
old_values[i] = talloc(char, bufsize);
|
||||
}
|
||||
|
||||
for (i = 0; i < iterations; i++) {
|
||||
timer_start(&t);
|
||||
jerasure_matrix_encode(k, m, w, matrix, data, coding, bufsize);
|
||||
total_time += timer_split(&t);
|
||||
}
|
||||
|
||||
printf("Encode throughput for %d iterations: %.2f MB/s (%.2f sec)\n", iterations, (double)(k*iterations*bufsize/1024/1024) / total_time, total_time);
|
||||
|
||||
erasures = talloc(int, (m+1));
|
||||
erased = talloc(int, (k+m));
|
||||
for (i = 0; i < m+k; i++) erased[i] = 0;
|
||||
l = 0;
|
||||
for (i = 0; i < m; ) {
|
||||
erasures[i] = ((unsigned int)MOA_Random_W(w, 1))%(k+m);
|
||||
if (erased[erasures[i]] == 0) {
|
||||
erased[erasures[i]] = 1;
|
||||
memcpy(old_values[i], (erasures[i] < k) ? data[erasures[i]] : coding[erasures[i]-k], bufsize);
|
||||
bzero((erasures[i] < k) ? data[erasures[i]] : coding[erasures[i]-k], bufsize);
|
||||
i++;
|
||||
}
|
||||
}
|
||||
erasures[i] = -1;
|
||||
|
||||
for (i = 0; i < iterations; i++) {
|
||||
timer_start(&t);
|
||||
jerasure_matrix_decode(k, m, w, matrix, 1, erasures, data, coding, bufsize);
|
||||
total_time += timer_split(&t);
|
||||
}
|
||||
|
||||
printf("Decode throughput for %d iterations: %.2f MB/s (%.2f sec)\n", iterations, (double)(k*iterations*bufsize/1024/1024) / total_time, total_time);
|
||||
|
||||
for (i = 0; i < m; i++) {
|
||||
if (erasures[i] < k) {
|
||||
if (memcmp(data[erasures[i]], old_values[i], bufsize)) {
|
||||
fprintf(stderr, "Decoding failed for %d!\n", erasures[i]);
|
||||
exit(1);
|
||||
}
|
||||
} else {
|
||||
if (memcmp(coding[erasures[i]-k], old_values[i], bufsize)) {
|
||||
fprintf(stderr, "Decoding failed for %d!\n", erasures[i]);
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
@ -0,0 +1,94 @@
|
|||
#
|
||||
#
|
||||
# Copyright (c) 2013, 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.
|
||||
#
|
||||
GF_COMPLETE_DIR=/usr/local/bin
|
||||
GF_METHODS=${GF_COMPLETE_DIR}/gf_methods
|
||||
k=12
|
||||
m=3
|
||||
seed=1370
|
||||
|
||||
# Test all w=8
|
||||
${GF_METHODS} 8 -B -L | awk -F: '{ if ($1 == "w=8") print $2; }' |
|
||||
while read method; do
|
||||
echo "Testing ${k} ${m} 8 $seed ${method}"
|
||||
./reed_sol_test_gf ${k} ${m} 8 $seed ${method} | tail -n 1
|
||||
if [[ $? != "0" ]]; then
|
||||
echo "Failed test for ${k} ${m} 8 $seed ${method}"
|
||||
exit 1
|
||||
fi
|
||||
done
|
||||
|
||||
if [[ $? == "1" ]]; then
|
||||
exit 1
|
||||
fi
|
||||
|
||||
|
||||
# Test all w=16
|
||||
${GF_METHODS} 16 -B -L | awk -F: '{ if ($1 == "w=16") print $2; }' |
|
||||
while read method; do
|
||||
echo "Testing ${k} ${m} 16 $seed ${method}"
|
||||
./reed_sol_test_gf ${k} ${m} 16 $seed ${method} | tail -n 1
|
||||
if [[ $? != "0" ]]; then
|
||||
echo "Failed test for ${k} ${m} 16 $seed ${method}"
|
||||
exit 1
|
||||
fi
|
||||
done
|
||||
|
||||
|
||||
if [[ $? == "1" ]]; then
|
||||
exit 1
|
||||
fi
|
||||
|
||||
# Test all w=32
|
||||
${GF_METHODS} 32 -B -L | awk -F: '{ if ($1 == "w=32") print $2; }' |
|
||||
while read method; do
|
||||
echo "Testing ${k} ${m} 32 $seed ${method}"
|
||||
./reed_sol_test_gf ${k} ${m} 32 $seed ${method} | tail -n 1
|
||||
if [[ $? != "0" ]]; then
|
||||
echo "Failed test for ${k} ${m} 32 $seed ${method}"
|
||||
exit 1
|
||||
fi
|
||||
done
|
||||
|
||||
|
||||
if [[ $? == "1" ]]; then
|
||||
exit 1
|
||||
fi
|
||||
|
||||
echo "Passed all tests!"
|
||||
|
|
@ -0,0 +1,64 @@
|
|||
#
|
||||
#
|
||||
# Copyright (c) 2013, 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.
|
||||
#
|
||||
GF_COMPLETE_DIR=/usr/local/bin
|
||||
GF_METHODS=${GF_COMPLETE_DIR}/gf_methods
|
||||
ITERATIONS=128
|
||||
BUFSIZE=65536
|
||||
k=12
|
||||
m=3
|
||||
seed=1370
|
||||
|
||||
for w in 8 16 32 ; do
|
||||
${GF_METHODS} $w -B -L | awk -F: '{ if ($1 == "w='$w'") print $2; }' |
|
||||
while read method; do
|
||||
echo "Testing ${k} ${m} ${w} ${seed} ${ITERATIONS} ${BUFSIZE} ${method}"
|
||||
./reed_sol_time_gf ${k} ${m} ${w} ${seed} ${ITERATIONS} ${BUFSIZE} ${method} | tail -n 2
|
||||
if [[ $? != "0" ]]; then
|
||||
echo "Failed test for ${k} ${m} ${w} ${seed} ${ITERATIONS} ${BUFSIZE} ${method}"
|
||||
exit 1
|
||||
fi
|
||||
done
|
||||
|
||||
if [[ $? == "1" ]]; then
|
||||
exit 1
|
||||
fi
|
||||
done
|
||||
|
||||
echo "Passed all tests!"
|
||||
|
|
@ -0,0 +1,370 @@
|
|||
Installation Instructions
|
||||
*************************
|
||||
|
||||
Copyright (C) 1994-1996, 1999-2002, 2004-2011 Free Software Foundation,
|
||||
Inc.
|
||||
|
||||
Copying and distribution of this file, with or without modification,
|
||||
are permitted in any medium without royalty provided the copyright
|
||||
notice and this notice are preserved. This file is offered as-is,
|
||||
without warranty of any kind.
|
||||
|
||||
Basic Installation
|
||||
==================
|
||||
|
||||
Briefly, the shell commands `./configure; make; make install' should
|
||||
configure, build, and install this package. The following
|
||||
more-detailed instructions are generic; see the `README' file for
|
||||
instructions specific to this package. Some packages provide this
|
||||
`INSTALL' file but do not implement all of the features documented
|
||||
below. The lack of an optional feature in a given package is not
|
||||
necessarily a bug. More recommendations for GNU packages can be found
|
||||
in *note Makefile Conventions: (standards)Makefile Conventions.
|
||||
|
||||
The `configure' shell script attempts to guess correct values for
|
||||
various system-dependent variables used during compilation. It uses
|
||||
those values to create a `Makefile' in each directory of the package.
|
||||
It may also create one or more `.h' files containing system-dependent
|
||||
definitions. Finally, it creates a shell script `config.status' that
|
||||
you can run in the future to recreate the current configuration, and a
|
||||
file `config.log' containing compiler output (useful mainly for
|
||||
debugging `configure').
|
||||
|
||||
It can also use an optional file (typically called `config.cache'
|
||||
and enabled with `--cache-file=config.cache' or simply `-C') that saves
|
||||
the results of its tests to speed up reconfiguring. Caching is
|
||||
disabled by default to prevent problems with accidental use of stale
|
||||
cache files.
|
||||
|
||||
If you need to do unusual things to compile the package, please try
|
||||
to figure out how `configure' could check whether to do them, and mail
|
||||
diffs or instructions to the address given in the `README' so they can
|
||||
be considered for the next release. If you are using the cache, and at
|
||||
some point `config.cache' contains results you don't want to keep, you
|
||||
may remove or edit it.
|
||||
|
||||
The file `configure.ac' (or `configure.in') is used to create
|
||||
`configure' by a program called `autoconf'. You need `configure.ac' if
|
||||
you want to change it or regenerate `configure' using a newer version
|
||||
of `autoconf'.
|
||||
|
||||
The simplest way to compile this package is:
|
||||
|
||||
1. `cd' to the directory containing the package's source code and type
|
||||
`./configure' to configure the package for your system.
|
||||
|
||||
Running `configure' might take a while. While running, it prints
|
||||
some messages telling which features it is checking for.
|
||||
|
||||
2. Type `make' to compile the package.
|
||||
|
||||
3. Optionally, type `make check' to run any self-tests that come with
|
||||
the package, generally using the just-built uninstalled binaries.
|
||||
|
||||
4. Type `make install' to install the programs and any data files and
|
||||
documentation. When installing into a prefix owned by root, it is
|
||||
recommended that the package be configured and built as a regular
|
||||
user, and only the `make install' phase executed with root
|
||||
privileges.
|
||||
|
||||
5. Optionally, type `make installcheck' to repeat any self-tests, but
|
||||
this time using the binaries in their final installed location.
|
||||
This target does not install anything. Running this target as a
|
||||
regular user, particularly if the prior `make install' required
|
||||
root privileges, verifies that the installation completed
|
||||
correctly.
|
||||
|
||||
6. You can remove the program binaries and object files from the
|
||||
source code directory by typing `make clean'. To also remove the
|
||||
files that `configure' created (so you can compile the package for
|
||||
a different kind of computer), type `make distclean'. There is
|
||||
also a `make maintainer-clean' target, but that is intended mainly
|
||||
for the package's developers. If you use it, you may have to get
|
||||
all sorts of other programs in order to regenerate files that came
|
||||
with the distribution.
|
||||
|
||||
7. Often, you can also type `make uninstall' to remove the installed
|
||||
files again. In practice, not all packages have tested that
|
||||
uninstallation works correctly, even though it is required by the
|
||||
GNU Coding Standards.
|
||||
|
||||
8. Some packages, particularly those that use Automake, provide `make
|
||||
distcheck', which can by used by developers to test that all other
|
||||
targets like `make install' and `make uninstall' work correctly.
|
||||
This target is generally not run by end users.
|
||||
|
||||
Compilers and Options
|
||||
=====================
|
||||
|
||||
Some systems require unusual options for compilation or linking that
|
||||
the `configure' script does not know about. Run `./configure --help'
|
||||
for details on some of the pertinent environment variables.
|
||||
|
||||
You can give `configure' initial values for configuration parameters
|
||||
by setting variables in the command line or in the environment. Here
|
||||
is an example:
|
||||
|
||||
./configure CC=c99 CFLAGS=-g LIBS=-lposix
|
||||
|
||||
*Note Defining Variables::, for more details.
|
||||
|
||||
Compiling For Multiple Architectures
|
||||
====================================
|
||||
|
||||
You can compile the package for more than one kind of computer at the
|
||||
same time, by placing the object files for each architecture in their
|
||||
own directory. To do this, you can use GNU `make'. `cd' to the
|
||||
directory where you want the object files and executables to go and run
|
||||
the `configure' script. `configure' automatically checks for the
|
||||
source code in the directory that `configure' is in and in `..'. This
|
||||
is known as a "VPATH" build.
|
||||
|
||||
With a non-GNU `make', it is safer to compile the package for one
|
||||
architecture at a time in the source code directory. After you have
|
||||
installed the package for one architecture, use `make distclean' before
|
||||
reconfiguring for another architecture.
|
||||
|
||||
On MacOS X 10.5 and later systems, you can create libraries and
|
||||
executables that work on multiple system types--known as "fat" or
|
||||
"universal" binaries--by specifying multiple `-arch' options to the
|
||||
compiler but only a single `-arch' option to the preprocessor. Like
|
||||
this:
|
||||
|
||||
./configure CC="gcc -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
|
||||
CXX="g++ -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
|
||||
CPP="gcc -E" CXXCPP="g++ -E"
|
||||
|
||||
This is not guaranteed to produce working output in all cases, you
|
||||
may have to build one architecture at a time and combine the results
|
||||
using the `lipo' tool if you have problems.
|
||||
|
||||
Installation Names
|
||||
==================
|
||||
|
||||
By default, `make install' installs the package's commands under
|
||||
`/usr/local/bin', include files under `/usr/local/include', etc. You
|
||||
can specify an installation prefix other than `/usr/local' by giving
|
||||
`configure' the option `--prefix=PREFIX', where PREFIX must be an
|
||||
absolute file name.
|
||||
|
||||
You can specify separate installation prefixes for
|
||||
architecture-specific files and architecture-independent files. If you
|
||||
pass the option `--exec-prefix=PREFIX' to `configure', the package uses
|
||||
PREFIX as the prefix for installing programs and libraries.
|
||||
Documentation and other data files still use the regular prefix.
|
||||
|
||||
In addition, if you use an unusual directory layout you can give
|
||||
options like `--bindir=DIR' to specify different values for particular
|
||||
kinds of files. Run `configure --help' for a list of the directories
|
||||
you can set and what kinds of files go in them. In general, the
|
||||
default for these options is expressed in terms of `${prefix}', so that
|
||||
specifying just `--prefix' will affect all of the other directory
|
||||
specifications that were not explicitly provided.
|
||||
|
||||
The most portable way to affect installation locations is to pass the
|
||||
correct locations to `configure'; however, many packages provide one or
|
||||
both of the following shortcuts of passing variable assignments to the
|
||||
`make install' command line to change installation locations without
|
||||
having to reconfigure or recompile.
|
||||
|
||||
The first method involves providing an override variable for each
|
||||
affected directory. For example, `make install
|
||||
prefix=/alternate/directory' will choose an alternate location for all
|
||||
directory configuration variables that were expressed in terms of
|
||||
`${prefix}'. Any directories that were specified during `configure',
|
||||
but not in terms of `${prefix}', must each be overridden at install
|
||||
time for the entire installation to be relocated. The approach of
|
||||
makefile variable overrides for each directory variable is required by
|
||||
the GNU Coding Standards, and ideally causes no recompilation.
|
||||
However, some platforms have known limitations with the semantics of
|
||||
shared libraries that end up requiring recompilation when using this
|
||||
method, particularly noticeable in packages that use GNU Libtool.
|
||||
|
||||
The second method involves providing the `DESTDIR' variable. For
|
||||
example, `make install DESTDIR=/alternate/directory' will prepend
|
||||
`/alternate/directory' before all installation names. The approach of
|
||||
`DESTDIR' overrides is not required by the GNU Coding Standards, and
|
||||
does not work on platforms that have drive letters. On the other hand,
|
||||
it does better at avoiding recompilation issues, and works well even
|
||||
when some directory options were not specified in terms of `${prefix}'
|
||||
at `configure' time.
|
||||
|
||||
Optional Features
|
||||
=================
|
||||
|
||||
If the package supports it, you can cause programs to be installed
|
||||
with an extra prefix or suffix on their names by giving `configure' the
|
||||
option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.
|
||||
|
||||
Some packages pay attention to `--enable-FEATURE' options to
|
||||
`configure', where FEATURE indicates an optional part of the package.
|
||||
They may also pay attention to `--with-PACKAGE' options, where PACKAGE
|
||||
is something like `gnu-as' or `x' (for the X Window System). The
|
||||
`README' should mention any `--enable-' and `--with-' options that the
|
||||
package recognizes.
|
||||
|
||||
For packages that use the X Window System, `configure' can usually
|
||||
find the X include and library files automatically, but if it doesn't,
|
||||
you can use the `configure' options `--x-includes=DIR' and
|
||||
`--x-libraries=DIR' to specify their locations.
|
||||
|
||||
Some packages offer the ability to configure how verbose the
|
||||
execution of `make' will be. For these packages, running `./configure
|
||||
--enable-silent-rules' sets the default to minimal output, which can be
|
||||
overridden with `make V=1'; while running `./configure
|
||||
--disable-silent-rules' sets the default to verbose, which can be
|
||||
overridden with `make V=0'.
|
||||
|
||||
Particular systems
|
||||
==================
|
||||
|
||||
On HP-UX, the default C compiler is not ANSI C compatible. If GNU
|
||||
CC is not installed, it is recommended to use the following options in
|
||||
order to use an ANSI C compiler:
|
||||
|
||||
./configure CC="cc -Ae -D_XOPEN_SOURCE=500"
|
||||
|
||||
and if that doesn't work, install pre-built binaries of GCC for HP-UX.
|
||||
|
||||
HP-UX `make' updates targets which have the same time stamps as
|
||||
their prerequisites, which makes it generally unusable when shipped
|
||||
generated files such as `configure' are involved. Use GNU `make'
|
||||
instead.
|
||||
|
||||
On OSF/1 a.k.a. Tru64, some versions of the default C compiler cannot
|
||||
parse its `<wchar.h>' header file. The option `-nodtk' can be used as
|
||||
a workaround. If GNU CC is not installed, it is therefore recommended
|
||||
to try
|
||||
|
||||
./configure CC="cc"
|
||||
|
||||
and if that doesn't work, try
|
||||
|
||||
./configure CC="cc -nodtk"
|
||||
|
||||
On Solaris, don't put `/usr/ucb' early in your `PATH'. This
|
||||
directory contains several dysfunctional programs; working variants of
|
||||
these programs are available in `/usr/bin'. So, if you need `/usr/ucb'
|
||||
in your `PATH', put it _after_ `/usr/bin'.
|
||||
|
||||
On Haiku, software installed for all users goes in `/boot/common',
|
||||
not `/usr/local'. It is recommended to use the following options:
|
||||
|
||||
./configure --prefix=/boot/common
|
||||
|
||||
Specifying the System Type
|
||||
==========================
|
||||
|
||||
There may be some features `configure' cannot figure out
|
||||
automatically, but needs to determine by the type of machine the package
|
||||
will run on. Usually, assuming the package is built to be run on the
|
||||
_same_ architectures, `configure' can figure that out, but if it prints
|
||||
a message saying it cannot guess the machine type, give it the
|
||||
`--build=TYPE' option. TYPE can either be a short name for the system
|
||||
type, such as `sun4', or a canonical name which has the form:
|
||||
|
||||
CPU-COMPANY-SYSTEM
|
||||
|
||||
where SYSTEM can have one of these forms:
|
||||
|
||||
OS
|
||||
KERNEL-OS
|
||||
|
||||
See the file `config.sub' for the possible values of each field. If
|
||||
`config.sub' isn't included in this package, then this package doesn't
|
||||
need to know the machine type.
|
||||
|
||||
If you are _building_ compiler tools for cross-compiling, you should
|
||||
use the option `--target=TYPE' to select the type of system they will
|
||||
produce code for.
|
||||
|
||||
If you want to _use_ a cross compiler, that generates code for a
|
||||
platform different from the build platform, you should specify the
|
||||
"host" platform (i.e., that on which the generated programs will
|
||||
eventually be run) with `--host=TYPE'.
|
||||
|
||||
Sharing Defaults
|
||||
================
|
||||
|
||||
If you want to set default values for `configure' scripts to share,
|
||||
you can create a site shell script called `config.site' that gives
|
||||
default values for variables like `CC', `cache_file', and `prefix'.
|
||||
`configure' looks for `PREFIX/share/config.site' if it exists, then
|
||||
`PREFIX/etc/config.site' if it exists. Or, you can set the
|
||||
`CONFIG_SITE' environment variable to the location of the site script.
|
||||
A warning: not all `configure' scripts look for a site script.
|
||||
|
||||
Defining Variables
|
||||
==================
|
||||
|
||||
Variables not defined in a site shell script can be set in the
|
||||
environment passed to `configure'. However, some packages may run
|
||||
configure again during the build, and the customized values of these
|
||||
variables may be lost. In order to avoid this problem, you should set
|
||||
them in the `configure' command line, using `VAR=value'. For example:
|
||||
|
||||
./configure CC=/usr/local2/bin/gcc
|
||||
|
||||
causes the specified `gcc' to be used as the C compiler (unless it is
|
||||
overridden in the site shell script).
|
||||
|
||||
Unfortunately, this technique does not work for `CONFIG_SHELL' due to
|
||||
an Autoconf bug. Until the bug is fixed you can use this workaround:
|
||||
|
||||
CONFIG_SHELL=/bin/bash /bin/bash ./configure CONFIG_SHELL=/bin/bash
|
||||
|
||||
`configure' Invocation
|
||||
======================
|
||||
|
||||
`configure' recognizes the following options to control how it
|
||||
operates.
|
||||
|
||||
`--help'
|
||||
`-h'
|
||||
Print a summary of all of the options to `configure', and exit.
|
||||
|
||||
`--help=short'
|
||||
`--help=recursive'
|
||||
Print a summary of the options unique to this package's
|
||||
`configure', and exit. The `short' variant lists options used
|
||||
only in the top level, while the `recursive' variant lists options
|
||||
also present in any nested packages.
|
||||
|
||||
`--version'
|
||||
`-V'
|
||||
Print the version of Autoconf used to generate the `configure'
|
||||
script, and exit.
|
||||
|
||||
`--cache-file=FILE'
|
||||
Enable the cache: use and save the results of the tests in FILE,
|
||||
traditionally `config.cache'. FILE defaults to `/dev/null' to
|
||||
disable caching.
|
||||
|
||||
`--config-cache'
|
||||
`-C'
|
||||
Alias for `--cache-file=config.cache'.
|
||||
|
||||
`--quiet'
|
||||
`--silent'
|
||||
`-q'
|
||||
Do not print messages saying which checks are being made. To
|
||||
suppress all normal output, redirect it to `/dev/null' (any error
|
||||
messages will still be shown).
|
||||
|
||||
`--srcdir=DIR'
|
||||
Look for the package's source code in directory DIR. Usually
|
||||
`configure' can determine that directory automatically.
|
||||
|
||||
`--prefix=DIR'
|
||||
Use DIR as the installation prefix. *note Installation Names::
|
||||
for more details, including other options available for fine-tuning
|
||||
the installation locations.
|
||||
|
||||
`--no-create'
|
||||
`-n'
|
||||
Run the configure checks, but stop before creating any output
|
||||
files.
|
||||
|
||||
`configure' also accepts some other, not widely useful, options. Run
|
||||
`configure --help' for more details.
|
||||
|
||||
|
|
@ -1,6 +1,11 @@
|
|||
Copyright (c) 2011, James S. Plank
|
||||
|
||||
Copyright (c) 2013, 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:
|
||||
|
|
|
|||
|
|
@ -0,0 +1,6 @@
|
|||
# Jerasure AM file
|
||||
|
||||
SUBDIRS = src Examples
|
||||
|
||||
ACLOCAL_AMFLAGS = -I m4
|
||||
|
||||
|
|
@ -0,0 +1,745 @@
|
|||
# Makefile.in generated by automake 1.11.3 from Makefile.am.
|
||||
# @configure_input@
|
||||
|
||||
# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
|
||||
# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
|
||||
# Foundation, Inc.
|
||||
# This Makefile.in is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# This program is distributed in the hope that it will be useful,
|
||||
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
|
||||
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
|
||||
# PARTICULAR PURPOSE.
|
||||
|
||||
@SET_MAKE@
|
||||
|
||||
# Jerasure AM file
|
||||
VPATH = @srcdir@
|
||||
pkgdatadir = $(datadir)/@PACKAGE@
|
||||
pkgincludedir = $(includedir)/@PACKAGE@
|
||||
pkglibdir = $(libdir)/@PACKAGE@
|
||||
pkglibexecdir = $(libexecdir)/@PACKAGE@
|
||||
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
|
||||
install_sh_DATA = $(install_sh) -c -m 644
|
||||
install_sh_PROGRAM = $(install_sh) -c
|
||||
install_sh_SCRIPT = $(install_sh) -c
|
||||
INSTALL_HEADER = $(INSTALL_DATA)
|
||||
transform = $(program_transform_name)
|
||||
NORMAL_INSTALL = :
|
||||
PRE_INSTALL = :
|
||||
POST_INSTALL = :
|
||||
NORMAL_UNINSTALL = :
|
||||
PRE_UNINSTALL = :
|
||||
POST_UNINSTALL = :
|
||||
build_triplet = @build@
|
||||
host_triplet = @host@
|
||||
subdir = .
|
||||
DIST_COMMON = README $(am__configure_deps) $(srcdir)/Makefile.am \
|
||||
$(srcdir)/Makefile.in $(top_srcdir)/configure \
|
||||
$(top_srcdir)/include/config.h.in AUTHORS COPYING ChangeLog \
|
||||
INSTALL NEWS config.guess config.sub install-sh ltmain.sh \
|
||||
missing
|
||||
ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
|
||||
am__aclocal_m4_deps = $(top_srcdir)/m4/ax_check_compile_flag.m4 \
|
||||
$(top_srcdir)/m4/ax_ext.m4 \
|
||||
$(top_srcdir)/m4/ax_gcc_x86_avx_xgetbv.m4 \
|
||||
$(top_srcdir)/m4/ax_gcc_x86_cpuid.m4 \
|
||||
$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \
|
||||
$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \
|
||||
$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac
|
||||
am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
|
||||
$(ACLOCAL_M4)
|
||||
am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \
|
||||
configure.lineno config.status.lineno
|
||||
mkinstalldirs = $(install_sh) -d
|
||||
CONFIG_HEADER = $(top_builddir)/include/config.h
|
||||
CONFIG_CLEAN_FILES =
|
||||
CONFIG_CLEAN_VPATH_FILES =
|
||||
depcomp =
|
||||
am__depfiles_maybe =
|
||||
SOURCES =
|
||||
DIST_SOURCES =
|
||||
RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
|
||||
html-recursive info-recursive install-data-recursive \
|
||||
install-dvi-recursive install-exec-recursive \
|
||||
install-html-recursive install-info-recursive \
|
||||
install-pdf-recursive install-ps-recursive install-recursive \
|
||||
installcheck-recursive installdirs-recursive pdf-recursive \
|
||||
ps-recursive uninstall-recursive
|
||||
RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \
|
||||
distclean-recursive maintainer-clean-recursive
|
||||
AM_RECURSIVE_TARGETS = $(RECURSIVE_TARGETS:-recursive=) \
|
||||
$(RECURSIVE_CLEAN_TARGETS:-recursive=) tags TAGS ctags CTAGS \
|
||||
distdir dist dist-all distcheck
|
||||
ETAGS = etags
|
||||
CTAGS = ctags
|
||||
DIST_SUBDIRS = $(SUBDIRS)
|
||||
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
|
||||
distdir = $(PACKAGE)-$(VERSION)
|
||||
top_distdir = $(distdir)
|
||||
am__remove_distdir = \
|
||||
if test -d "$(distdir)"; then \
|
||||
find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \
|
||||
&& rm -rf "$(distdir)" \
|
||||
|| { sleep 5 && rm -rf "$(distdir)"; }; \
|
||||
else :; fi
|
||||
am__relativize = \
|
||||
dir0=`pwd`; \
|
||||
sed_first='s,^\([^/]*\)/.*$$,\1,'; \
|
||||
sed_rest='s,^[^/]*/*,,'; \
|
||||
sed_last='s,^.*/\([^/]*\)$$,\1,'; \
|
||||
sed_butlast='s,/*[^/]*$$,,'; \
|
||||
while test -n "$$dir1"; do \
|
||||
first=`echo "$$dir1" | sed -e "$$sed_first"`; \
|
||||
if test "$$first" != "."; then \
|
||||
if test "$$first" = ".."; then \
|
||||
dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \
|
||||
dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \
|
||||
else \
|
||||
first2=`echo "$$dir2" | sed -e "$$sed_first"`; \
|
||||
if test "$$first2" = "$$first"; then \
|
||||
dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \
|
||||
else \
|
||||
dir2="../$$dir2"; \
|
||||
fi; \
|
||||
dir0="$$dir0"/"$$first"; \
|
||||
fi; \
|
||||
fi; \
|
||||
dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \
|
||||
done; \
|
||||
reldir="$$dir2"
|
||||
DIST_ARCHIVES = $(distdir).tar.gz
|
||||
GZIP_ENV = --best
|
||||
distuninstallcheck_listfiles = find . -type f -print
|
||||
am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \
|
||||
| sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$'
|
||||
distcleancheck_listfiles = find . -type f -print
|
||||
ACLOCAL = @ACLOCAL@
|
||||
AMTAR = @AMTAR@
|
||||
AR = @AR@
|
||||
AUTOCONF = @AUTOCONF@
|
||||
AUTOHEADER = @AUTOHEADER@
|
||||
AUTOMAKE = @AUTOMAKE@
|
||||
AWK = @AWK@
|
||||
CC = @CC@
|
||||
CFLAGS = @CFLAGS@
|
||||
CPP = @CPP@
|
||||
CPPFLAGS = @CPPFLAGS@
|
||||
CYGPATH_W = @CYGPATH_W@
|
||||
DEFS = @DEFS@
|
||||
DLLTOOL = @DLLTOOL@
|
||||
DSYMUTIL = @DSYMUTIL@
|
||||
DUMPBIN = @DUMPBIN@
|
||||
ECHO_C = @ECHO_C@
|
||||
ECHO_N = @ECHO_N@
|
||||
ECHO_T = @ECHO_T@
|
||||
EGREP = @EGREP@
|
||||
EXEEXT = @EXEEXT@
|
||||
FGREP = @FGREP@
|
||||
GREP = @GREP@
|
||||
INSTALL = @INSTALL@
|
||||
INSTALL_DATA = @INSTALL_DATA@
|
||||
INSTALL_PROGRAM = @INSTALL_PROGRAM@
|
||||
INSTALL_SCRIPT = @INSTALL_SCRIPT@
|
||||
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
|
||||
LD = @LD@
|
||||
LDFLAGS = @LDFLAGS@
|
||||
LIBOBJS = @LIBOBJS@
|
||||
LIBS = @LIBS@
|
||||
LIBTOOL = @LIBTOOL@
|
||||
LIPO = @LIPO@
|
||||
LN_S = @LN_S@
|
||||
LTLIBOBJS = @LTLIBOBJS@
|
||||
MAKEINFO = @MAKEINFO@
|
||||
MANIFEST_TOOL = @MANIFEST_TOOL@
|
||||
MKDIR_P = @MKDIR_P@
|
||||
NM = @NM@
|
||||
NMEDIT = @NMEDIT@
|
||||
OBJDUMP = @OBJDUMP@
|
||||
OBJEXT = @OBJEXT@
|
||||
OTOOL = @OTOOL@
|
||||
OTOOL64 = @OTOOL64@
|
||||
PACKAGE = @PACKAGE@
|
||||
PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
|
||||
PACKAGE_NAME = @PACKAGE_NAME@
|
||||
PACKAGE_STRING = @PACKAGE_STRING@
|
||||
PACKAGE_TARNAME = @PACKAGE_TARNAME@
|
||||
PACKAGE_URL = @PACKAGE_URL@
|
||||
PACKAGE_VERSION = @PACKAGE_VERSION@
|
||||
PATH_SEPARATOR = @PATH_SEPARATOR@
|
||||
RANLIB = @RANLIB@
|
||||
SED = @SED@
|
||||
SET_MAKE = @SET_MAKE@
|
||||
SHELL = @SHELL@
|
||||
SIMD_FLAGS = @SIMD_FLAGS@
|
||||
STRIP = @STRIP@
|
||||
VERSION = @VERSION@
|
||||
abs_builddir = @abs_builddir@
|
||||
abs_srcdir = @abs_srcdir@
|
||||
abs_top_builddir = @abs_top_builddir@
|
||||
abs_top_srcdir = @abs_top_srcdir@
|
||||
ac_ct_AR = @ac_ct_AR@
|
||||
ac_ct_CC = @ac_ct_CC@
|
||||
ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
|
||||
am__leading_dot = @am__leading_dot@
|
||||
am__tar = @am__tar@
|
||||
am__untar = @am__untar@
|
||||
bindir = @bindir@
|
||||
build = @build@
|
||||
build_alias = @build_alias@
|
||||
build_cpu = @build_cpu@
|
||||
build_os = @build_os@
|
||||
build_vendor = @build_vendor@
|
||||
builddir = @builddir@
|
||||
datadir = @datadir@
|
||||
datarootdir = @datarootdir@
|
||||
docdir = @docdir@
|
||||
dvidir = @dvidir@
|
||||
exec_prefix = @exec_prefix@
|
||||
host = @host@
|
||||
host_alias = @host_alias@
|
||||
host_cpu = @host_cpu@
|
||||
host_os = @host_os@
|
||||
host_vendor = @host_vendor@
|
||||
htmldir = @htmldir@
|
||||
includedir = @includedir@
|
||||
infodir = @infodir@
|
||||
install_sh = @install_sh@
|
||||
libdir = @libdir@
|
||||
libexecdir = @libexecdir@
|
||||
localedir = @localedir@
|
||||
localstatedir = @localstatedir@
|
||||
mandir = @mandir@
|
||||
mkdir_p = @mkdir_p@
|
||||
oldincludedir = @oldincludedir@
|
||||
pdfdir = @pdfdir@
|
||||
prefix = @prefix@
|
||||
program_transform_name = @program_transform_name@
|
||||
psdir = @psdir@
|
||||
sbindir = @sbindir@
|
||||
sharedstatedir = @sharedstatedir@
|
||||
srcdir = @srcdir@
|
||||
sysconfdir = @sysconfdir@
|
||||
target_alias = @target_alias@
|
||||
top_build_prefix = @top_build_prefix@
|
||||
top_builddir = @top_builddir@
|
||||
top_srcdir = @top_srcdir@
|
||||
SUBDIRS = src Examples
|
||||
ACLOCAL_AMFLAGS = -I m4
|
||||
all: all-recursive
|
||||
|
||||
.SUFFIXES:
|
||||
am--refresh: Makefile
|
||||
@:
|
||||
$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps)
|
||||
@for dep in $?; do \
|
||||
case '$(am__configure_deps)' in \
|
||||
*$$dep*) \
|
||||
echo ' cd $(srcdir) && $(AUTOMAKE) --gnu --ignore-deps'; \
|
||||
$(am__cd) $(srcdir) && $(AUTOMAKE) --gnu --ignore-deps \
|
||||
&& exit 0; \
|
||||
exit 1;; \
|
||||
esac; \
|
||||
done; \
|
||||
echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps Makefile'; \
|
||||
$(am__cd) $(top_srcdir) && \
|
||||
$(AUTOMAKE) --gnu --ignore-deps Makefile
|
||||
.PRECIOUS: Makefile
|
||||
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
|
||||
@case '$?' in \
|
||||
*config.status*) \
|
||||
echo ' $(SHELL) ./config.status'; \
|
||||
$(SHELL) ./config.status;; \
|
||||
*) \
|
||||
echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \
|
||||
cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \
|
||||
esac;
|
||||
|
||||
$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
|
||||
$(SHELL) ./config.status --recheck
|
||||
|
||||
$(top_srcdir)/configure: $(am__configure_deps)
|
||||
$(am__cd) $(srcdir) && $(AUTOCONF)
|
||||
$(ACLOCAL_M4): $(am__aclocal_m4_deps)
|
||||
$(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS)
|
||||
$(am__aclocal_m4_deps):
|
||||
|
||||
include/config.h: include/stamp-h1
|
||||
@if test ! -f $@; then rm -f include/stamp-h1; else :; fi
|
||||
@if test ! -f $@; then $(MAKE) $(AM_MAKEFLAGS) include/stamp-h1; else :; fi
|
||||
|
||||
include/stamp-h1: $(top_srcdir)/include/config.h.in $(top_builddir)/config.status
|
||||
@rm -f include/stamp-h1
|
||||
cd $(top_builddir) && $(SHELL) ./config.status include/config.h
|
||||
$(top_srcdir)/include/config.h.in: $(am__configure_deps)
|
||||
($(am__cd) $(top_srcdir) && $(AUTOHEADER))
|
||||
rm -f include/stamp-h1
|
||||
touch $@
|
||||
|
||||
distclean-hdr:
|
||||
-rm -f include/config.h include/stamp-h1
|
||||
|
||||
mostlyclean-libtool:
|
||||
-rm -f *.lo
|
||||
|
||||
clean-libtool:
|
||||
-rm -rf .libs _libs
|
||||
|
||||
distclean-libtool:
|
||||
-rm -f libtool config.lt
|
||||
|
||||
# This directory's subdirectories are mostly independent; you can cd
|
||||
# into them and run `make' without going through this Makefile.
|
||||
# To change the values of `make' variables: instead of editing Makefiles,
|
||||
# (1) if the variable is set in `config.status', edit `config.status'
|
||||
# (which will cause the Makefiles to be regenerated when you run `make');
|
||||
# (2) otherwise, pass the desired values on the `make' command line.
|
||||
$(RECURSIVE_TARGETS):
|
||||
@fail= failcom='exit 1'; \
|
||||
for f in x $$MAKEFLAGS; do \
|
||||
case $$f in \
|
||||
*=* | --[!k]*);; \
|
||||
*k*) failcom='fail=yes';; \
|
||||
esac; \
|
||||
done; \
|
||||
dot_seen=no; \
|
||||
target=`echo $@ | sed s/-recursive//`; \
|
||||
list='$(SUBDIRS)'; for subdir in $$list; do \
|
||||
echo "Making $$target in $$subdir"; \
|
||||
if test "$$subdir" = "."; then \
|
||||
dot_seen=yes; \
|
||||
local_target="$$target-am"; \
|
||||
else \
|
||||
local_target="$$target"; \
|
||||
fi; \
|
||||
($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
|
||||
|| eval $$failcom; \
|
||||
done; \
|
||||
if test "$$dot_seen" = "no"; then \
|
||||
$(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
|
||||
fi; test -z "$$fail"
|
||||
|
||||
$(RECURSIVE_CLEAN_TARGETS):
|
||||
@fail= failcom='exit 1'; \
|
||||
for f in x $$MAKEFLAGS; do \
|
||||
case $$f in \
|
||||
*=* | --[!k]*);; \
|
||||
*k*) failcom='fail=yes';; \
|
||||
esac; \
|
||||
done; \
|
||||
dot_seen=no; \
|
||||
case "$@" in \
|
||||
distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
|
||||
*) list='$(SUBDIRS)' ;; \
|
||||
esac; \
|
||||
rev=''; for subdir in $$list; do \
|
||||
if test "$$subdir" = "."; then :; else \
|
||||
rev="$$subdir $$rev"; \
|
||||
fi; \
|
||||
done; \
|
||||
rev="$$rev ."; \
|
||||
target=`echo $@ | sed s/-recursive//`; \
|
||||
for subdir in $$rev; do \
|
||||
echo "Making $$target in $$subdir"; \
|
||||
if test "$$subdir" = "."; then \
|
||||
local_target="$$target-am"; \
|
||||
else \
|
||||
local_target="$$target"; \
|
||||
fi; \
|
||||
($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
|
||||
|| eval $$failcom; \
|
||||
done && test -z "$$fail"
|
||||
tags-recursive:
|
||||
list='$(SUBDIRS)'; for subdir in $$list; do \
|
||||
test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
|
||||
done
|
||||
ctags-recursive:
|
||||
list='$(SUBDIRS)'; for subdir in $$list; do \
|
||||
test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
|
||||
done
|
||||
|
||||
ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
|
||||
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
|
||||
unique=`for i in $$list; do \
|
||||
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||
done | \
|
||||
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
|
||||
END { if (nonempty) { for (i in files) print i; }; }'`; \
|
||||
mkid -fID $$unique
|
||||
tags: TAGS
|
||||
|
||||
TAGS: tags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
|
||||
$(TAGS_FILES) $(LISP)
|
||||
set x; \
|
||||
here=`pwd`; \
|
||||
if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \
|
||||
include_option=--etags-include; \
|
||||
empty_fix=.; \
|
||||
else \
|
||||
include_option=--include; \
|
||||
empty_fix=; \
|
||||
fi; \
|
||||
list='$(SUBDIRS)'; for subdir in $$list; do \
|
||||
if test "$$subdir" = .; then :; else \
|
||||
test ! -f $$subdir/TAGS || \
|
||||
set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \
|
||||
fi; \
|
||||
done; \
|
||||
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
|
||||
unique=`for i in $$list; do \
|
||||
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||
done | \
|
||||
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
|
||||
END { if (nonempty) { for (i in files) print i; }; }'`; \
|
||||
shift; \
|
||||
if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \
|
||||
test -n "$$unique" || unique=$$empty_fix; \
|
||||
if test $$# -gt 0; then \
|
||||
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
|
||||
"$$@" $$unique; \
|
||||
else \
|
||||
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
|
||||
$$unique; \
|
||||
fi; \
|
||||
fi
|
||||
ctags: CTAGS
|
||||
CTAGS: ctags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
|
||||
$(TAGS_FILES) $(LISP)
|
||||
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
|
||||
unique=`for i in $$list; do \
|
||||
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||
done | \
|
||||
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
|
||||
END { if (nonempty) { for (i in files) print i; }; }'`; \
|
||||
test -z "$(CTAGS_ARGS)$$unique" \
|
||||
|| $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
|
||||
$$unique
|
||||
|
||||
GTAGS:
|
||||
here=`$(am__cd) $(top_builddir) && pwd` \
|
||||
&& $(am__cd) $(top_srcdir) \
|
||||
&& gtags -i $(GTAGS_ARGS) "$$here"
|
||||
|
||||
distclean-tags:
|
||||
-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
|
||||
|
||||
distdir: $(DISTFILES)
|
||||
$(am__remove_distdir)
|
||||
test -d "$(distdir)" || mkdir "$(distdir)"
|
||||
@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
|
||||
topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
|
||||
list='$(DISTFILES)'; \
|
||||
dist_files=`for file in $$list; do echo $$file; done | \
|
||||
sed -e "s|^$$srcdirstrip/||;t" \
|
||||
-e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
|
||||
case $$dist_files in \
|
||||
*/*) $(MKDIR_P) `echo "$$dist_files" | \
|
||||
sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
|
||||
sort -u` ;; \
|
||||
esac; \
|
||||
for file in $$dist_files; do \
|
||||
if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
|
||||
if test -d $$d/$$file; then \
|
||||
dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
|
||||
if test -d "$(distdir)/$$file"; then \
|
||||
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
|
||||
fi; \
|
||||
if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
|
||||
cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
|
||||
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
|
||||
fi; \
|
||||
cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
|
||||
else \
|
||||
test -f "$(distdir)/$$file" \
|
||||
|| cp -p $$d/$$file "$(distdir)/$$file" \
|
||||
|| exit 1; \
|
||||
fi; \
|
||||
done
|
||||
@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
|
||||
if test "$$subdir" = .; then :; else \
|
||||
test -d "$(distdir)/$$subdir" \
|
||||
|| $(MKDIR_P) "$(distdir)/$$subdir" \
|
||||
|| exit 1; \
|
||||
fi; \
|
||||
done
|
||||
@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
|
||||
if test "$$subdir" = .; then :; else \
|
||||
dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
|
||||
$(am__relativize); \
|
||||
new_distdir=$$reldir; \
|
||||
dir1=$$subdir; dir2="$(top_distdir)"; \
|
||||
$(am__relativize); \
|
||||
new_top_distdir=$$reldir; \
|
||||
echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \
|
||||
echo " am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \
|
||||
($(am__cd) $$subdir && \
|
||||
$(MAKE) $(AM_MAKEFLAGS) \
|
||||
top_distdir="$$new_top_distdir" \
|
||||
distdir="$$new_distdir" \
|
||||
am__remove_distdir=: \
|
||||
am__skip_length_check=: \
|
||||
am__skip_mode_fix=: \
|
||||
distdir) \
|
||||
|| exit 1; \
|
||||
fi; \
|
||||
done
|
||||
-test -n "$(am__skip_mode_fix)" \
|
||||
|| find "$(distdir)" -type d ! -perm -755 \
|
||||
-exec chmod u+rwx,go+rx {} \; -o \
|
||||
! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \
|
||||
! -type d ! -perm -400 -exec chmod a+r {} \; -o \
|
||||
! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \
|
||||
|| chmod -R a+r "$(distdir)"
|
||||
dist-gzip: distdir
|
||||
tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
|
||||
$(am__remove_distdir)
|
||||
|
||||
dist-bzip2: distdir
|
||||
tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2
|
||||
$(am__remove_distdir)
|
||||
|
||||
dist-lzip: distdir
|
||||
tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz
|
||||
$(am__remove_distdir)
|
||||
|
||||
dist-lzma: distdir
|
||||
tardir=$(distdir) && $(am__tar) | lzma -9 -c >$(distdir).tar.lzma
|
||||
$(am__remove_distdir)
|
||||
|
||||
dist-xz: distdir
|
||||
tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz
|
||||
$(am__remove_distdir)
|
||||
|
||||
dist-tarZ: distdir
|
||||
tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z
|
||||
$(am__remove_distdir)
|
||||
|
||||
dist-shar: distdir
|
||||
shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz
|
||||
$(am__remove_distdir)
|
||||
|
||||
dist-zip: distdir
|
||||
-rm -f $(distdir).zip
|
||||
zip -rq $(distdir).zip $(distdir)
|
||||
$(am__remove_distdir)
|
||||
|
||||
dist dist-all: distdir
|
||||
tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
|
||||
$(am__remove_distdir)
|
||||
|
||||
# This target untars the dist file and tries a VPATH configuration. Then
|
||||
# it guarantees that the distribution is self-contained by making another
|
||||
# tarfile.
|
||||
distcheck: dist
|
||||
case '$(DIST_ARCHIVES)' in \
|
||||
*.tar.gz*) \
|
||||
GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\
|
||||
*.tar.bz2*) \
|
||||
bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\
|
||||
*.tar.lzma*) \
|
||||
lzma -dc $(distdir).tar.lzma | $(am__untar) ;;\
|
||||
*.tar.lz*) \
|
||||
lzip -dc $(distdir).tar.lz | $(am__untar) ;;\
|
||||
*.tar.xz*) \
|
||||
xz -dc $(distdir).tar.xz | $(am__untar) ;;\
|
||||
*.tar.Z*) \
|
||||
uncompress -c $(distdir).tar.Z | $(am__untar) ;;\
|
||||
*.shar.gz*) \
|
||||
GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\
|
||||
*.zip*) \
|
||||
unzip $(distdir).zip ;;\
|
||||
esac
|
||||
chmod -R a-w $(distdir); chmod a+w $(distdir)
|
||||
mkdir $(distdir)/_build
|
||||
mkdir $(distdir)/_inst
|
||||
chmod a-w $(distdir)
|
||||
test -d $(distdir)/_build || exit 0; \
|
||||
dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \
|
||||
&& dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \
|
||||
&& am__cwd=`pwd` \
|
||||
&& $(am__cd) $(distdir)/_build \
|
||||
&& ../configure --srcdir=.. --prefix="$$dc_install_base" \
|
||||
$(AM_DISTCHECK_CONFIGURE_FLAGS) \
|
||||
$(DISTCHECK_CONFIGURE_FLAGS) \
|
||||
&& $(MAKE) $(AM_MAKEFLAGS) \
|
||||
&& $(MAKE) $(AM_MAKEFLAGS) dvi \
|
||||
&& $(MAKE) $(AM_MAKEFLAGS) check \
|
||||
&& $(MAKE) $(AM_MAKEFLAGS) install \
|
||||
&& $(MAKE) $(AM_MAKEFLAGS) installcheck \
|
||||
&& $(MAKE) $(AM_MAKEFLAGS) uninstall \
|
||||
&& $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \
|
||||
distuninstallcheck \
|
||||
&& chmod -R a-w "$$dc_install_base" \
|
||||
&& ({ \
|
||||
(cd ../.. && umask 077 && mkdir "$$dc_destdir") \
|
||||
&& $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \
|
||||
&& $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \
|
||||
&& $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \
|
||||
distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \
|
||||
} || { rm -rf "$$dc_destdir"; exit 1; }) \
|
||||
&& rm -rf "$$dc_destdir" \
|
||||
&& $(MAKE) $(AM_MAKEFLAGS) dist \
|
||||
&& rm -rf $(DIST_ARCHIVES) \
|
||||
&& $(MAKE) $(AM_MAKEFLAGS) distcleancheck \
|
||||
&& cd "$$am__cwd" \
|
||||
|| exit 1
|
||||
$(am__remove_distdir)
|
||||
@(echo "$(distdir) archives ready for distribution: "; \
|
||||
list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \
|
||||
sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x'
|
||||
distuninstallcheck:
|
||||
@test -n '$(distuninstallcheck_dir)' || { \
|
||||
echo 'ERROR: trying to run $@ with an empty' \
|
||||
'$$(distuninstallcheck_dir)' >&2; \
|
||||
exit 1; \
|
||||
}; \
|
||||
$(am__cd) '$(distuninstallcheck_dir)' || { \
|
||||
echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \
|
||||
exit 1; \
|
||||
}; \
|
||||
test `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \
|
||||
|| { echo "ERROR: files left after uninstall:" ; \
|
||||
if test -n "$(DESTDIR)"; then \
|
||||
echo " (check DESTDIR support)"; \
|
||||
fi ; \
|
||||
$(distuninstallcheck_listfiles) ; \
|
||||
exit 1; } >&2
|
||||
distcleancheck: distclean
|
||||
@if test '$(srcdir)' = . ; then \
|
||||
echo "ERROR: distcleancheck can only run from a VPATH build" ; \
|
||||
exit 1 ; \
|
||||
fi
|
||||
@test `$(distcleancheck_listfiles) | wc -l` -eq 0 \
|
||||
|| { echo "ERROR: files left in build directory after distclean:" ; \
|
||||
$(distcleancheck_listfiles) ; \
|
||||
exit 1; } >&2
|
||||
check-am: all-am
|
||||
check: check-recursive
|
||||
all-am: Makefile
|
||||
installdirs: installdirs-recursive
|
||||
installdirs-am:
|
||||
install: install-recursive
|
||||
install-exec: install-exec-recursive
|
||||
install-data: install-data-recursive
|
||||
uninstall: uninstall-recursive
|
||||
|
||||
install-am: all-am
|
||||
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
|
||||
|
||||
installcheck: installcheck-recursive
|
||||
install-strip:
|
||||
if test -z '$(STRIP)'; then \
|
||||
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
|
||||
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
|
||||
install; \
|
||||
else \
|
||||
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
|
||||
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
|
||||
"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
|
||||
fi
|
||||
mostlyclean-generic:
|
||||
|
||||
clean-generic:
|
||||
|
||||
distclean-generic:
|
||||
-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
|
||||
-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
|
||||
|
||||
maintainer-clean-generic:
|
||||
@echo "This command is intended for maintainers to use"
|
||||
@echo "it deletes files that may require special tools to rebuild."
|
||||
clean: clean-recursive
|
||||
|
||||
clean-am: clean-generic clean-libtool mostlyclean-am
|
||||
|
||||
distclean: distclean-recursive
|
||||
-rm -f $(am__CONFIG_DISTCLEAN_FILES)
|
||||
-rm -f Makefile
|
||||
distclean-am: clean-am distclean-generic distclean-hdr \
|
||||
distclean-libtool distclean-tags
|
||||
|
||||
dvi: dvi-recursive
|
||||
|
||||
dvi-am:
|
||||
|
||||
html: html-recursive
|
||||
|
||||
html-am:
|
||||
|
||||
info: info-recursive
|
||||
|
||||
info-am:
|
||||
|
||||
install-data-am:
|
||||
|
||||
install-dvi: install-dvi-recursive
|
||||
|
||||
install-dvi-am:
|
||||
|
||||
install-exec-am:
|
||||
|
||||
install-html: install-html-recursive
|
||||
|
||||
install-html-am:
|
||||
|
||||
install-info: install-info-recursive
|
||||
|
||||
install-info-am:
|
||||
|
||||
install-man:
|
||||
|
||||
install-pdf: install-pdf-recursive
|
||||
|
||||
install-pdf-am:
|
||||
|
||||
install-ps: install-ps-recursive
|
||||
|
||||
install-ps-am:
|
||||
|
||||
installcheck-am:
|
||||
|
||||
maintainer-clean: maintainer-clean-recursive
|
||||
-rm -f $(am__CONFIG_DISTCLEAN_FILES)
|
||||
-rm -rf $(top_srcdir)/autom4te.cache
|
||||
-rm -f Makefile
|
||||
maintainer-clean-am: distclean-am maintainer-clean-generic
|
||||
|
||||
mostlyclean: mostlyclean-recursive
|
||||
|
||||
mostlyclean-am: mostlyclean-generic mostlyclean-libtool
|
||||
|
||||
pdf: pdf-recursive
|
||||
|
||||
pdf-am:
|
||||
|
||||
ps: ps-recursive
|
||||
|
||||
ps-am:
|
||||
|
||||
uninstall-am:
|
||||
|
||||
.MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) ctags-recursive \
|
||||
install-am install-strip tags-recursive
|
||||
|
||||
.PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
|
||||
all all-am am--refresh check check-am clean clean-generic \
|
||||
clean-libtool ctags ctags-recursive dist dist-all dist-bzip2 \
|
||||
dist-gzip dist-lzip dist-lzma dist-shar dist-tarZ dist-xz \
|
||||
dist-zip distcheck distclean distclean-generic distclean-hdr \
|
||||
distclean-libtool distclean-tags distcleancheck distdir \
|
||||
distuninstallcheck dvi dvi-am html html-am info info-am \
|
||||
install install-am install-data install-data-am install-dvi \
|
||||
install-dvi-am install-exec install-exec-am install-html \
|
||||
install-html-am install-info install-info-am install-man \
|
||||
install-pdf install-pdf-am install-ps install-ps-am \
|
||||
install-strip installcheck installcheck-am installdirs \
|
||||
installdirs-am maintainer-clean maintainer-clean-generic \
|
||||
mostlyclean mostlyclean-generic mostlyclean-libtool pdf pdf-am \
|
||||
ps ps-am tags tags-recursive uninstall uninstall-am
|
||||
|
||||
|
||||
# Tell versions [3.59,3.63) of GNU make to not export all variables.
|
||||
# Otherwise a system limit (for SysV at least) may be exceeded.
|
||||
.NOEXPORT:
|
||||
|
|
@ -0,0 +1,243 @@
|
|||
This reflects time_all_gfs_argv_init.sh run on a MacBook Air with 4 GB of memory and a 1.7 GHz Intel Core i5
|
||||
|
||||
#uname -a
|
||||
11.4.2 Darwin Kernel Version 11.4.2: Thu Aug 23 16:25:48 PDT 2012; root:xnu-1699.32.7~1/RELEASE_X86_64 x86_64
|
||||
|
||||
<Arguments to reed_sol_time_gf> <Throughput MB/s>
|
||||
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-r_SSE_- 2813.34
|
||||
_12_3_8_128_65536_-m_COMPOSITE_2_-_-r_ALTMAP_- 2808.39
|
||||
_12_3_8_128_65536_- 2797.62
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_- 2793.14
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-r_SSE_-d_EUCLID_- 2779.97
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-d_EUCLID_- 2776.50
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-d_MATRIX_- 2762.82
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-r_SSE_-d_MATRIX_- 2711.49
|
||||
_12_3_16_128_65536_-m_COMPOSITE_2_-_-r_ALTMAP_- 2700.11
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_ALTMAP_- 2367.78
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_SSE_-r_ALTMAP_-d_MATRIX_- 2365.21
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_ALTMAP_-d_EUCLID_- 2364.95
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_SSE_-r_ALTMAP_- 2356.81
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_SSE_-r_ALTMAP_-d_EUCLID_- 2319.16
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_ALTMAP_-d_MATRIX_- 2307.02
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_SSE_-d_EUCLID_- 1879.46
|
||||
_12_3_16_128_65536_- 1877.06
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-d_MATRIX_- 1868.61
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_- 1864.30
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_SSE_-d_MATRIX_- 1861.95
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-d_EUCLID_- 1854.40
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_SSE_- 1850.96
|
||||
_12_3_32_128_65536_-m_COMPOSITE_2_-_-r_ALTMAP_- 1828.50
|
||||
_12_3_8_128_65536_-m_TABLE_-r_CAUCHY_- 1534.09
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-r_CAUCHY_-d_MATRIX_- 1531.78
|
||||
_12_3_8_128_65536_-m_LOG_ZERO_EXT_-r_CAUCHY_-d_EUCLID_- 1526.97
|
||||
_12_3_8_128_65536_-m_TABLE_-r_CAUCHY_-d_EUCLID_- 1527.21
|
||||
_12_3_8_128_65536_-m_LOG_-r_CAUCHY_- 1524.65
|
||||
_12_3_8_128_65536_-m_SHIFT_-r_CAUCHY_-d_MATRIX_- 1525.47
|
||||
_12_3_8_128_65536_-m_BYTWO_b_-r_CAUCHY_-d_EUCLID_- 1525.53
|
||||
_12_3_8_128_65536_-m_LOG_ZERO_EXT_-r_CAUCHY_- 1522.80
|
||||
_12_3_8_128_65536_-m_LOG_ZERO_-r_CAUCHY_-d_EUCLID_- 1522.57
|
||||
_12_3_8_128_65536_-m_BYTWO_p_-r_CAUCHY_-d_EUCLID_- 1519.20
|
||||
_12_3_8_128_65536_-m_BYTWO_p_-r_CAUCHY_-d_MATRIX_- 1517.28
|
||||
_12_3_8_128_65536_-m_LOG_-r_CAUCHY_-d_MATRIX_- 1515.57
|
||||
_12_3_8_128_65536_-m_TABLE_-r_CAUCHY_-d_MATRIX_- 1516.30
|
||||
_12_3_8_128_65536_-m_LOG_ZERO_-r_CAUCHY_- 1516.35
|
||||
_12_3_8_128_65536_-m_LOG_ZERO_-r_CAUCHY_-d_MATRIX_- 1515.13
|
||||
_12_3_8_128_65536_-m_SHIFT_-r_CAUCHY_-d_EUCLID_- 1513.07
|
||||
_12_3_8_128_65536_-m_LOG_ZERO_EXT_-r_CAUCHY_-d_MATRIX_- 1512.42
|
||||
_12_3_8_128_65536_-m_LOG_-r_CAUCHY_-d_EUCLID_- 1510.87
|
||||
_12_3_8_128_65536_-m_BYTWO_p_-r_CAUCHY_- 1511.34
|
||||
_12_3_8_128_65536_-m_BYTWO_b_-r_CAUCHY_- 1508.70
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-r_CAUCHY_- 1508.28
|
||||
_12_3_8_128_65536_-m_SHIFT_-r_CAUCHY_- 1504.25
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-r_CAUCHY_-d_EUCLID_- 1499.62
|
||||
_12_3_8_128_65536_-m_BYTWO_b_-r_CAUCHY_-d_MATRIX_- 1488.90
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_SSE_- 1337.74
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_SSE_-d_EUCLID_- 1334.65
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_SSE_-d_MATRIX_- 1326.72
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-d_MATRIX_- 1325.45
|
||||
_12_3_32_128_65536_- 1325.80
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-d_EUCLID_- 1325.00
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_- 1300.37
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_ALTMAP_-d_MATRIX_- 1196.01
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_ALTMAP_- 1196.97
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_ALTMAP_-d_EUCLID_- 1193.25
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_SSE_-r_ALTMAP_- 1191.37
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_SSE_-r_ALTMAP_-d_EUCLID_- 1188.98
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_SSE_-r_ALTMAP_-d_MATRIX_- 1187.58
|
||||
_12_3_8_128_65536_-m_TABLE_-r_DOUBLE_- 1015.70
|
||||
_12_3_8_128_65536_-m_TABLE_-r_DOUBLE_-d_EUCLID_- 999.25
|
||||
_12_3_8_128_65536_-m_TABLE_-r_DOUBLE_-d_MATRIX_- 996.35
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_CAUCHY_-d_EUCLID_- 971.19
|
||||
_12_3_16_128_65536_-m_LOG_-r_CAUCHY_-d_MATRIX_- 972.08
|
||||
_12_3_16_128_65536_-m_LOG_ZERO_-r_CAUCHY_- 967.87
|
||||
_12_3_16_128_65536_-m_LOG_ZERO_-r_CAUCHY_-d_EUCLID_- 965.51
|
||||
_12_3_16_128_65536_-m_SPLIT_16_8_-r_CAUCHY_-d_MATRIX_- 965.75
|
||||
_12_3_16_128_65536_-m_LOG_ZERO_-r_CAUCHY_-d_MATRIX_- 965.41
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_CAUCHY_- 966.20
|
||||
_12_3_16_128_65536_-m_SPLIT_16_8_-r_CAUCHY_-d_EUCLID_- 964.21
|
||||
_12_3_16_128_65536_-m_LOG_-r_CAUCHY_- 962.11
|
||||
_12_3_16_128_65536_-m_SPLIT_8_8_-r_CAUCHY_-d_MATRIX_- 959.53
|
||||
_12_3_16_128_65536_-m_LOG_-r_CAUCHY_-d_EUCLID_- 959.75
|
||||
_12_3_16_128_65536_-m_SPLIT_16_8_-r_CAUCHY_- 958.98
|
||||
_12_3_16_128_65536_-m_BYTWO_p_-r_CAUCHY_-d_MATRIX_- 957.03
|
||||
_12_3_16_128_65536_-m_BYTWO_b_-r_CAUCHY_-d_MATRIX_- 955.82
|
||||
_12_3_16_128_65536_-m_GROUP_4_4_-r_CAUCHY_-d_EUCLID_- 956.46
|
||||
_12_3_16_128_65536_-m_GROUP_4_4_-r_CAUCHY_- 955.41
|
||||
_12_3_16_128_65536_-m_GROUP_4_4_-r_CAUCHY_-d_MATRIX_- 955.45
|
||||
_12_3_16_128_65536_-m_SPLIT_8_8_-r_CAUCHY_-d_EUCLID_- 955.93
|
||||
_12_3_16_128_65536_-m_BYTWO_p_-r_CAUCHY_-d_EUCLID_- 952.43
|
||||
_12_3_16_128_65536_-m_BYTWO_b_-r_CAUCHY_-d_EUCLID_- 951.90
|
||||
_12_3_16_128_65536_-m_BYTWO_p_-r_CAUCHY_- 945.16
|
||||
_12_3_16_128_65536_-m_BYTWO_b_-r_CAUCHY_- 945.30
|
||||
_12_3_16_128_65536_-m_SHIFT_-r_CAUCHY_- 944.22
|
||||
_12_3_16_128_65536_-m_SHIFT_-r_CAUCHY_-d_MATRIX_- 939.66
|
||||
_12_3_16_128_65536_-m_SHIFT_-r_CAUCHY_-d_EUCLID_- 934.56
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_CAUCHY_-d_MATRIX_- 917.26
|
||||
_12_3_16_128_65536_-m_SPLIT_8_8_-r_CAUCHY_- 831.63
|
||||
_12_3_16_128_65536_-m_SPLIT_16_8_- 621.13
|
||||
_12_3_16_128_65536_-m_SPLIT_16_8_-d_MATRIX_- 619.98
|
||||
_12_3_16_128_65536_-m_SPLIT_8_8_- 614.67
|
||||
_12_3_16_128_65536_-m_SPLIT_16_8_-d_EUCLID_- 603.05
|
||||
_12_3_16_128_65536_-m_SPLIT_8_8_-d_MATRIX_- 553.45
|
||||
_12_3_16_128_65536_-m_SPLIT_8_8_-d_EUCLID_- 543.90
|
||||
_12_3_8_128_65536_-m_BYTWO_b_-d_EUCLID_- 522.34
|
||||
_12_3_8_128_65536_-m_BYTWO_b_-r_SSE_- 520.97
|
||||
_12_3_8_128_65536_-m_BYTWO_b_-r_SSE_-d_MATRIX_- 520.49
|
||||
_12_3_8_128_65536_-m_BYTWO_b_-d_MATRIX_- 518.74
|
||||
_12_3_8_128_65536_-m_BYTWO_b_-r_SSE_-d_EUCLID_- 518.95
|
||||
_12_3_8_128_65536_-m_BYTWO_b_- 519.19
|
||||
_12_3_16_128_65536_-m_LOG_-d_MATRIX_- 485.44
|
||||
_12_3_16_128_65536_-m_LOG_- 483.58
|
||||
_12_3_16_128_65536_-m_LOG_-d_EUCLID_- 480.18
|
||||
_12_3_16_128_65536_-m_LOG_ZERO_-d_EUCLID_- 441.75
|
||||
_12_3_16_128_65536_-m_LOG_ZERO_-d_MATRIX_- 427.39
|
||||
_12_3_16_128_65536_-m_LOG_ZERO_- 419.07
|
||||
_12_3_32_128_65536_-m_SPLIT_8_8_-d_EUCLID_- 415.80
|
||||
_12_3_32_128_65536_-m_SPLIT_8_8_- 415.31
|
||||
_12_3_32_128_65536_-m_SPLIT_32_8_-d_EUCLID_- 416.06
|
||||
_12_3_32_128_65536_-m_BYTWO_p_-r_CAUCHY_-d_EUCLID_- 415.84
|
||||
_12_3_8_128_65536_-m_BYTWO_p_-d_MATRIX_- 416.50
|
||||
_12_3_8_128_65536_-m_BYTWO_p_- 416.57
|
||||
_12_3_32_128_65536_-m_SPLIT_32_8_- 416.36
|
||||
_12_3_8_128_65536_-m_BYTWO_p_-r_SSE_- 414.77
|
||||
_12_3_8_128_65536_-m_BYTWO_p_-r_SSE_-d_EUCLID_- 414.64
|
||||
_12_3_32_128_65536_-m_BYTWO_b_-r_CAUCHY_-d_EUCLID_- 415.14
|
||||
_12_3_32_128_65536_-m_BYTWO_b_-r_CAUCHY_- 413.58
|
||||
_12_3_32_128_65536_-m_GROUP_4_8_-r_CAUCHY_-d_EUCLID_- 413.55
|
||||
_12_3_32_128_65536_-m_SPLIT_8_8_-r_CAUCHY_-d_EUCLID_- 413.76
|
||||
_12_3_32_128_65536_-m_SPLIT_32_8_-d_MATRIX_- 413.83
|
||||
_12_3_32_128_65536_-m_BYTWO_p_-r_CAUCHY_-d_MATRIX_- 412.09
|
||||
_12_3_32_128_65536_-m_SPLIT_32_16_-r_CAUCHY_- 413.06
|
||||
_12_3_32_128_65536_-m_GROUP_4_4_-r_CAUCHY_-d_EUCLID_- 413.62
|
||||
_12_3_32_128_65536_-m_SPLIT_8_8_-r_CAUCHY_-d_MATRIX_- 411.67
|
||||
_12_3_32_128_65536_-m_GROUP_4_4_-r_CAUCHY_- 412.35
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_CAUCHY_-d_MATRIX_- 412.30
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_CAUCHY_-d_EUCLID_- 411.08
|
||||
_12_3_32_128_65536_-m_BYTWO_p_-r_CAUCHY_- 411.89
|
||||
_12_3_32_128_65536_-m_SPLIT_8_8_-r_CAUCHY_- 412.23
|
||||
_12_3_8_128_65536_-m_BYTWO_p_-r_SSE_-d_MATRIX_- 413.10
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_CAUCHY_- 411.24
|
||||
_12_3_32_128_65536_-m_SPLIT_32_16_-r_CAUCHY_-d_EUCLID_- 411.23
|
||||
_12_3_32_128_65536_-m_SPLIT_32_16_-r_CAUCHY_-d_MATRIX_- 411.49
|
||||
_12_3_32_128_65536_-m_GROUP_4_4_-r_CAUCHY_-d_MATRIX_- 410.80
|
||||
_12_3_32_128_65536_-m_SPLIT_32_8_-r_CAUCHY_-d_EUCLID_- 409.80
|
||||
_12_3_32_128_65536_-m_SPLIT_32_8_-r_CAUCHY_- 408.72
|
||||
_12_3_32_128_65536_-m_SPLIT_32_8_-r_CAUCHY_-d_MATRIX_- 409.51
|
||||
_12_3_32_128_65536_-m_GROUP_4_8_-r_CAUCHY_- 409.34
|
||||
_12_3_8_128_65536_-m_BYTWO_p_-d_EUCLID_- 405.75
|
||||
_12_3_32_128_65536_-m_BYTWO_b_-r_CAUCHY_-d_MATRIX_- 406.53
|
||||
_12_3_32_128_65536_-m_SPLIT_8_8_-d_MATRIX_- 405.91
|
||||
_12_3_32_128_65536_-m_SHIFT_-r_CAUCHY_- 403.98
|
||||
_12_3_32_128_65536_-m_SHIFT_-r_CAUCHY_-d_EUCLID_- 404.79
|
||||
_12_3_32_128_65536_-m_SHIFT_-r_CAUCHY_-d_MATRIX_- 401.29
|
||||
_12_3_8_128_65536_-m_TABLE_-r_DOUBLE_-r_LAZY_-d_EUCLID_- 384.38
|
||||
_12_3_8_128_65536_-m_TABLE_-r_DOUBLE_-r_LAZY_- 381.47
|
||||
_12_3_8_128_65536_-m_TABLE_-r_DOUBLE_-r_LAZY_-d_MATRIX_- 381.49
|
||||
_12_3_32_128_65536_-m_GROUP_4_8_-r_CAUCHY_-d_MATRIX_- 374.88
|
||||
_12_3_8_128_65536_-m_LOG_ZERO_-d_MATRIX_- 349.17
|
||||
_12_3_8_128_65536_-m_LOG_ZERO_- 349.34
|
||||
_12_3_8_128_65536_-m_LOG_ZERO_EXT_-d_MATRIX_- 349.43
|
||||
_12_3_8_128_65536_-m_LOG_ZERO_-d_EUCLID_- 349.61
|
||||
_12_3_8_128_65536_-m_LOG_ZERO_EXT_- 349.71
|
||||
_12_3_8_128_65536_-m_TABLE_-d_EUCLID_- 343.28
|
||||
_12_3_8_128_65536_-m_LOG_ZERO_EXT_-d_EUCLID_- 341.73
|
||||
_12_3_8_128_65536_-m_TABLE_-d_MATRIX_- 329.42
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_NOSSE_- 327.32
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_NOSSE_-d_EUCLID_- 318.34
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_NOSSE_-d_MATRIX_- 317.40
|
||||
_12_3_8_128_65536_-m_TABLE_- 316.84
|
||||
_12_3_32_128_65536_-m_COMPOSITE_2_-_- 301.69
|
||||
_12_3_8_128_65536_-m_LOG_-d_MATRIX_- 281.59
|
||||
_12_3_8_128_65536_-m_LOG_-d_EUCLID_- 281.28
|
||||
_12_3_8_128_65536_-m_LOG_- 279.75
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_NOSSE_-r_ALTMAP_- 275.37
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_NOSSE_-r_ALTMAP_-d_EUCLID_- 276.07
|
||||
_12_3_16_128_65536_-m_SPLIT_16_4_-r_NOSSE_-r_ALTMAP_-d_MATRIX_- 269.77
|
||||
_12_3_8_128_65536_-m_BYTWO_b_-r_NOSSE_-d_MATRIX_- 257.86
|
||||
_12_3_8_128_65536_-m_BYTWO_b_-r_NOSSE_-d_EUCLID_- 256.55
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-r_NOSSE_-d_EUCLID_- 236.07
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-r_NOSSE_-d_MATRIX_- 236.76
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-r_NOSSE_- 236.71
|
||||
_12_3_16_128_65536_-m_BYTWO_b_-d_EUCLID_- 217.68
|
||||
_12_3_16_128_65536_-m_BYTWO_b_- 217.87
|
||||
_12_3_16_128_65536_-m_BYTWO_b_-r_SSE_- 217.10
|
||||
_12_3_16_128_65536_-m_BYTWO_b_-r_SSE_-d_MATRIX_- 216.91
|
||||
_12_3_16_128_65536_-m_BYTWO_b_-r_SSE_-d_EUCLID_- 217.27
|
||||
_12_3_16_128_65536_-m_BYTWO_b_-d_MATRIX_- 215.01
|
||||
_12_3_8_128_65536_-m_BYTWO_p_-r_NOSSE_- 206.00
|
||||
_12_3_8_128_65536_-m_BYTWO_p_-r_NOSSE_-d_MATRIX_- 205.66
|
||||
_12_3_8_128_65536_-m_BYTWO_p_-r_NOSSE_-d_EUCLID_- 204.44
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_NOSSE_-d_MATRIX_- 199.64
|
||||
_12_3_32_128_65536_-m_SPLIT_32_4_-r_NOSSE_-d_EUCLID_- 198.20
|
||||
_12_3_16_128_65536_-m_COMPOSITE_2_-_- 182.98
|
||||
_12_3_16_128_65536_-m_BYTWO_p_-r_SSE_- 183.34
|
||||
_12_3_16_128_65536_-m_BYTWO_p_-r_SSE_-d_EUCLID_- 182.87
|
||||
_12_3_16_128_65536_-m_BYTWO_p_-d_EUCLID_- 183.57
|
||||
_12_3_16_128_65536_-m_BYTWO_p_-d_MATRIX_- 183.95
|
||||
_12_3_16_128_65536_-m_BYTWO_p_-r_SSE_-d_MATRIX_- 179.94
|
||||
_12_3_16_128_65536_-m_GROUP_4_4_- 166.90
|
||||
_12_3_32_128_65536_-m_SPLIT_32_16_- 167.55
|
||||
_12_3_32_128_65536_-m_SPLIT_32_16_-d_MATRIX_- 167.51
|
||||
_12_3_32_128_65536_-m_SPLIT_32_16_-d_EUCLID_- 167.70
|
||||
_12_3_16_128_65536_-m_GROUP_4_4_-d_EUCLID_- 166.56
|
||||
_12_3_16_128_65536_-m_GROUP_4_4_-d_MATRIX_- 167.07
|
||||
_12_3_16_128_65536_-m_BYTWO_b_-r_NOSSE_-d_EUCLID_- 110.64
|
||||
_12_3_16_128_65536_-m_BYTWO_b_-r_NOSSE_- 110.76
|
||||
_12_3_16_128_65536_-m_BYTWO_b_-r_NOSSE_-d_MATRIX_- 111.17
|
||||
_12_3_16_128_65536_-m_BYTWO_p_-r_NOSSE_- 100.39
|
||||
_12_3_16_128_65536_-m_BYTWO_p_-r_NOSSE_-d_EUCLID_- 100.27
|
||||
_12_3_16_128_65536_-m_BYTWO_p_-r_NOSSE_-d_MATRIX_- 100.18
|
||||
_12_3_32_128_65536_-m_BYTWO_b_-r_SSE_- 96.85
|
||||
_12_3_32_128_65536_-m_BYTWO_b_-d_MATRIX_- 97.76
|
||||
_12_3_32_128_65536_-m_BYTWO_b_-r_SSE_-d_EUCLID_- 97.69
|
||||
_12_3_32_128_65536_-m_BYTWO_b_-r_SSE_-d_MATRIX_- 97.48
|
||||
_12_3_32_128_65536_-m_BYTWO_b_-d_EUCLID_- 97.42
|
||||
_12_3_32_128_65536_-m_BYTWO_b_- 97.54
|
||||
_12_3_32_128_65536_-m_BYTWO_p_- 86.61
|
||||
_12_3_32_128_65536_-m_BYTWO_p_-d_MATRIX_- 86.81
|
||||
_12_3_32_128_65536_-m_BYTWO_p_-r_SSE_-d_MATRIX_- 86.31
|
||||
_12_3_32_128_65536_-m_BYTWO_p_-d_EUCLID_- 86.70
|
||||
_12_3_32_128_65536_-m_BYTWO_p_-r_SSE_- 86.69
|
||||
_12_3_32_128_65536_-m_BYTWO_p_-r_SSE_-d_EUCLID_- 86.80
|
||||
_12_3_8_128_65536_-m_COMPOSITE_2_-_- 76.58
|
||||
_12_3_32_128_65536_-m_GROUP_4_8_-d_EUCLID_- 57.06
|
||||
_12_3_32_128_65536_-m_GROUP_4_8_-d_MATRIX_- 57.08
|
||||
_12_3_32_128_65536_-m_GROUP_4_4_-d_EUCLID_- 56.59
|
||||
_12_3_32_128_65536_-m_GROUP_4_4_-d_MATRIX_- 56.91
|
||||
_12_3_32_128_65536_-m_GROUP_4_8_- 54.68
|
||||
_12_3_32_128_65536_-m_BYTWO_b_-r_NOSSE_-d_EUCLID_- 50.64
|
||||
_12_3_32_128_65536_-m_BYTWO_b_-r_NOSSE_-d_MATRIX_- 50.55
|
||||
_12_3_32_128_65536_-m_BYTWO_b_-r_NOSSE_- 50.75
|
||||
_12_3_32_128_65536_-m_BYTWO_p_-r_NOSSE_-d_EUCLID_- 49.50
|
||||
_12_3_32_128_65536_-m_BYTWO_p_-r_NOSSE_- 49.14
|
||||
_12_3_32_128_65536_-m_BYTWO_p_-r_NOSSE_-d_MATRIX_- 47.39
|
||||
_12_3_8_128_65536_-m_SHIFT_-d_EUCLID_- 14.08
|
||||
_12_3_8_128_65536_-m_SHIFT_-d_MATRIX_- 14.39
|
||||
_12_3_8_128_65536_-m_SHIFT_- 14.48
|
||||
_12_3_16_128_65536_-m_SHIFT_-d_EUCLID_- 12.75
|
||||
_12_3_16_128_65536_-m_SHIFT_-d_MATRIX_- 12.74
|
||||
_12_3_16_128_65536_-m_SHIFT_- 12.77
|
||||
_12_3_32_128_65536_-m_SHIFT_-d_MATRIX_- 12.51
|
||||
_12_3_32_128_65536_-m_SHIFT_-d_EUCLID_- 12.50
|
||||
_12_3_32_128_65536_-m_SHIFT_- 12.46
|
||||
|
|
@ -0,0 +1,177 @@
|
|||
This is revision 2.0 of Jerasure. This is pretty much Jerasure 1.2 without the
|
||||
original Galois Field backend. Version 2.0 links directly to GF-Complete, which
|
||||
is more flexible than the original, and *much* faster, because it leverages SIMD
|
||||
instructions.
|
||||
|
||||
External Documentation:
|
||||
|
||||
See technical report CS-08-627 for a description of the main interfaces (Version 1.2)
|
||||
|
||||
See https://bitbucket.org/jimplank/gf-complete for GF-Complete.
|
||||
|
||||
NOTE: You must have GF-Complete installed in order to use Jerasure 2.0.
|
||||
|
||||
Custom usage of GF-Complete is explained in this file (see below).
|
||||
|
||||
There are two directories of source code:
|
||||
|
||||
The src directory contains the jerasure code.
|
||||
The Examples directory contains the example programs.
|
||||
|
||||
The makefile assumes that Examples is a subdirectory of the home directory.
|
||||
|
||||
Installing:
|
||||
|
||||
1.) Install GF-Complete
|
||||
|
||||
2.) ./configure
|
||||
|
||||
3.) make
|
||||
|
||||
4.) make install
|
||||
|
||||
This will install the examples under PREFIX/bin, the library under PREFIX/lib
|
||||
and the header files under PREFIX/include
|
||||
|
||||
See individual source files to determine what the examples do.
|
||||
|
||||
Inclusion of GF-Complete:
|
||||
|
||||
As long as GF-Complete is installed, Jerasure 2.0 can be used just as previous
|
||||
versions. There is no need to define custom Galois Fields. Jerasure will
|
||||
determine the default field to use, if one is not specified.
|
||||
|
||||
If you would like to explore a using a different Galois Field implementation,
|
||||
you can dynamically set the backend GF for a given word-size (w).
|
||||
|
||||
The new galois.c and galois.h export the following functions to be used by applications
|
||||
for dynamically setting the back-end GF:
|
||||
|
||||
1.) galois_change_technique
|
||||
|
||||
Function signature:
|
||||
|
||||
void galois_change_technique(gf_t *gf, int w);
|
||||
|
||||
This is the recommended way for you to change techniques.
|
||||
|
||||
This function will take a pointer to a Galois field structure and set it as the
|
||||
current backend for all operations in GF(2^w). Note that you must specify 'w'
|
||||
here, since the internal GF structure is mostly opaque to Jerasure. Be sure to
|
||||
change the technique with the correct structure and word-size.
|
||||
|
||||
There are a few ways to get a pointer to a gf_t structure: GF-Complete gives three
|
||||
primitives for this -- create_gf_from_argv(), gf_init_easy() and gf_init_hard().
|
||||
Please read the documentation on GF-Complete for how these work. By far, the
|
||||
most powerful and easy is create_gf_from_argv(), which parses an argv-style
|
||||
string. Otherwise, the most flexible is gf_init_hard().
|
||||
|
||||
In galois.c/galois.h, we have defined galois_init_field(), which is pretty much
|
||||
identical to gf_init_hard(), except it performs memory allocation with malloc(),
|
||||
and galois_init_composite_field(), which facilitates creating composite fields.
|
||||
|
||||
These are described below, but once again, we recommend using create_gf_from_argv()
|
||||
or gf_init_hard() if you want to change your Galois field.
|
||||
|
||||
2.) galois_init_field
|
||||
|
||||
Function signature:
|
||||
|
||||
gf_t* galois_init_field(int w,
|
||||
int mult_type,
|
||||
int region_type,
|
||||
int divide_type,
|
||||
uint64_t prim_poly,
|
||||
int arg1,
|
||||
int arg2);
|
||||
|
||||
This is a helper function that will initialize a Galois field. See the GF-Complete
|
||||
documentation for more info on what the arguments mean. Here is a brief description
|
||||
of the arguments:
|
||||
|
||||
mult_type can be any *one* of the following:
|
||||
|
||||
GF_MULT_DEFAULT
|
||||
GF_MULT_SHIFT
|
||||
GF_MULT_CARRY_FREE
|
||||
GF_MULT_GROUP
|
||||
GF_MULT_BYTWO_p
|
||||
GF_MULT_BYTWO_b
|
||||
GF_MULT_TABLE
|
||||
GF_MULT_LOG_TABLE
|
||||
GF_MULT_LOG_ZERO
|
||||
GF_MULT_LOG_ZERO_EXT
|
||||
GF_MULT_SPLIT_TABLE
|
||||
|
||||
region_type can be a combination of the following (some combinations will not
|
||||
be valid):
|
||||
|
||||
GF_REGION_DEFAULT
|
||||
GF_REGION_DOUBLE_TABLE
|
||||
GF_REGION_QUAD_TABLE
|
||||
GF_REGION_LAZY
|
||||
GF_REGION_SSE
|
||||
GF_REGION_NOSSE
|
||||
GF_REGION_ALTMAP
|
||||
GF_REGION_CAUCHY
|
||||
|
||||
divide_type can be one of the following:
|
||||
|
||||
GF_DIVIDE_DEFAULT
|
||||
GF_DIVIDE_MATRIX
|
||||
GF_DIVIDE_EUCLID
|
||||
|
||||
prim_poly is the field-defining primitive polynomial
|
||||
|
||||
arg1 and arg2 are special arguments usually used for defining SPLIT and GROUP
|
||||
operations
|
||||
|
||||
3.) galois_init_composite_field
|
||||
|
||||
Function signature:
|
||||
|
||||
gf_t* galois_init_composite_field(int w,
|
||||
int region_type,
|
||||
int divide_type,
|
||||
int degree,
|
||||
gf_t* base_gf);
|
||||
|
||||
This is a helper function designed to make creating Composite fields easier. All you
|
||||
need to do is hand it w, region mult type, divide type, degree and a pointer to a base
|
||||
field. Note that the base_gf must have degree w/degree in order for this to work.
|
||||
For example, if we create a GF using:
|
||||
|
||||
galois_init_composite_field(32, GF_REGION_DEFAULT, GF_DIVIDE_DEFAULT, 2, base_gf);
|
||||
|
||||
Then base_gf must have w=16.
|
||||
|
||||
For more information on how to change the backing fields for Jerasure, please refer to
|
||||
|
||||
1.) Examples/reed_sol_test_gf.c: Runs basic tests for Reed-Solomon given args
|
||||
for a backing GF (uses create_gf_from_argv to get gf_t pointer)
|
||||
|
||||
2.) Examples/reed_sol_time_gf.c: Runs more thorough timing and validation tests
|
||||
for a backing GF (uses create_gf_from_argv to get gf_t pointer)
|
||||
|
||||
Performance:
|
||||
|
||||
There are two performance-based test scripts: time_all_gfs_argv_init.sh and
|
||||
time_all_gfs_hard_init.sh. Both scripts run the same tests, but initialize the
|
||||
underlying GF fields in different ways (*argv* uses reed_sol_time_gf and *hard*
|
||||
uses reed_sol_hard_time_gf.c).
|
||||
|
||||
You can run 'time_all_gfs_argv_init.sh' to time *all* possible GF
|
||||
implementations on your computer. This script requires the 'gf_methods'
|
||||
utility from GF-Complete to be in your PATH.
|
||||
|
||||
time_all_gfs_argv_init.sh was run on a MacBook Air and the distilled numbers
|
||||
are given in ./PERF.txt. The results are sorted by encoding throughput. The
|
||||
format of each entry reflects the arguments given to reed_sol_time_gf. For example,
|
||||
the test run of
|
||||
|
||||
'Examples/reed_sol_time_gf 12 3 8 128 65536 -m SPLIT 8 4 -r SSE'
|
||||
|
||||
is recorded as this in PERF.txt:
|
||||
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-r_SSE_- 2813.34
|
||||
|
||||
|
|
@ -1,12 +1,177 @@
|
|||
This is revision 1.2A of Jerasure. It is basically equivalent to revision 1.2
|
||||
except it is released under the New BSD license.
|
||||
This is revision 2.0 of Jerasure. This is pretty much Jerasure 1.2 without the
|
||||
original Galois Field backend. Version 2.0 links directly to GF-Complete, which
|
||||
is more flexible than the original, and *much* faster, because it leverages SIMD
|
||||
instructions.
|
||||
|
||||
See technical report CS-08-627 for a description of the code.
|
||||
External Documentation:
|
||||
|
||||
There are two directories:
|
||||
See technical report CS-08-627 for a description of the main interfaces (Version 1.2)
|
||||
|
||||
The home directory contains the jerasure code.
|
||||
See https://bitbucket.org/jimplank/gf-complete for GF-Complete.
|
||||
|
||||
NOTE: You must have GF-Complete installed in order to use Jerasure 2.0.
|
||||
|
||||
Custom usage of GF-Complete is explained in this file (see below).
|
||||
|
||||
There are two directories of source code:
|
||||
|
||||
The src directory contains the jerasure code.
|
||||
The Examples directory contains the example programs.
|
||||
|
||||
The makefile assumes that Examples is a subdirectory of the home directory.
|
||||
|
||||
Installing:
|
||||
|
||||
1.) Install GF-Complete
|
||||
|
||||
2.) ./configure
|
||||
|
||||
3.) make
|
||||
|
||||
4.) make install
|
||||
|
||||
This will install the examples under PREFIX/bin, the library under PREFIX/lib
|
||||
and the header files under PREFIX/include
|
||||
|
||||
See individual source files to determine what the examples do.
|
||||
|
||||
Inclusion of GF-Complete:
|
||||
|
||||
As long as GF-Complete is installed, Jerasure 2.0 can be used just as previous
|
||||
versions. There is no need to define custom Galois Fields. Jerasure will
|
||||
determine the default field to use, if one is not specified.
|
||||
|
||||
If you would like to explore a using a different Galois Field implementation,
|
||||
you can dynamically set the backend GF for a given word-size (w).
|
||||
|
||||
The new galois.c and galois.h export the following functions to be used by applications
|
||||
for dynamically setting the back-end GF:
|
||||
|
||||
1.) galois_change_technique
|
||||
|
||||
Function signature:
|
||||
|
||||
void galois_change_technique(gf_t *gf, int w);
|
||||
|
||||
This is the recommended way for you to change techniques.
|
||||
|
||||
This function will take a pointer to a Galois field structure and set it as the
|
||||
current backend for all operations in GF(2^w). Note that you must specify 'w'
|
||||
here, since the internal GF structure is mostly opaque to Jerasure. Be sure to
|
||||
change the technique with the correct structure and word-size.
|
||||
|
||||
There are a few ways to get a pointer to a gf_t structure: GF-Complete gives three
|
||||
primitives for this -- create_gf_from_argv(), gf_init_easy() and gf_init_hard().
|
||||
Please read the documentation on GF-Complete for how these work. By far, the
|
||||
most powerful and easy is create_gf_from_argv(), which parses an argv-style
|
||||
string. Otherwise, the most flexible is gf_init_hard().
|
||||
|
||||
In galois.c/galois.h, we have defined galois_init_field(), which is pretty much
|
||||
identical to gf_init_hard(), except it performs memory allocation with malloc(),
|
||||
and galois_init_composite_field(), which facilitates creating composite fields.
|
||||
|
||||
These are described below, but once again, we recommend using create_gf_from_argv()
|
||||
or gf_init_hard() if you want to change your Galois field.
|
||||
|
||||
2.) galois_init_field
|
||||
|
||||
Function signature:
|
||||
|
||||
gf_t* galois_init_field(int w,
|
||||
int mult_type,
|
||||
int region_type,
|
||||
int divide_type,
|
||||
uint64_t prim_poly,
|
||||
int arg1,
|
||||
int arg2);
|
||||
|
||||
This is a helper function that will initialize a Galois field. See the GF-Complete
|
||||
documentation for more info on what the arguments mean. Here is a brief description
|
||||
of the arguments:
|
||||
|
||||
mult_type can be any *one* of the following:
|
||||
|
||||
GF_MULT_DEFAULT
|
||||
GF_MULT_SHIFT
|
||||
GF_MULT_CARRY_FREE
|
||||
GF_MULT_GROUP
|
||||
GF_MULT_BYTWO_p
|
||||
GF_MULT_BYTWO_b
|
||||
GF_MULT_TABLE
|
||||
GF_MULT_LOG_TABLE
|
||||
GF_MULT_LOG_ZERO
|
||||
GF_MULT_LOG_ZERO_EXT
|
||||
GF_MULT_SPLIT_TABLE
|
||||
|
||||
region_type can be a combination of the following (some combinations will not
|
||||
be valid):
|
||||
|
||||
GF_REGION_DEFAULT
|
||||
GF_REGION_DOUBLE_TABLE
|
||||
GF_REGION_QUAD_TABLE
|
||||
GF_REGION_LAZY
|
||||
GF_REGION_SSE
|
||||
GF_REGION_NOSSE
|
||||
GF_REGION_ALTMAP
|
||||
GF_REGION_CAUCHY
|
||||
|
||||
divide_type can be one of the following:
|
||||
|
||||
GF_DIVIDE_DEFAULT
|
||||
GF_DIVIDE_MATRIX
|
||||
GF_DIVIDE_EUCLID
|
||||
|
||||
prim_poly is the field-defining primitive polynomial
|
||||
|
||||
arg1 and arg2 are special arguments usually used for defining SPLIT and GROUP
|
||||
operations
|
||||
|
||||
3.) galois_init_composite_field
|
||||
|
||||
Function signature:
|
||||
|
||||
gf_t* galois_init_composite_field(int w,
|
||||
int region_type,
|
||||
int divide_type,
|
||||
int degree,
|
||||
gf_t* base_gf);
|
||||
|
||||
This is a helper function designed to make creating Composite fields easier. All you
|
||||
need to do is hand it w, region mult type, divide type, degree and a pointer to a base
|
||||
field. Note that the base_gf must have degree w/degree in order for this to work.
|
||||
For example, if we create a GF using:
|
||||
|
||||
galois_init_composite_field(32, GF_REGION_DEFAULT, GF_DIVIDE_DEFAULT, 2, base_gf);
|
||||
|
||||
Then base_gf must have w=16.
|
||||
|
||||
For more information on how to change the backing fields for Jerasure, please refer to
|
||||
|
||||
1.) Examples/reed_sol_test_gf.c: Runs basic tests for Reed-Solomon given args
|
||||
for a backing GF (uses create_gf_from_argv to get gf_t pointer)
|
||||
|
||||
2.) Examples/reed_sol_time_gf.c: Runs more thorough timing and validation tests
|
||||
for a backing GF (uses create_gf_from_argv to get gf_t pointer)
|
||||
|
||||
Performance:
|
||||
|
||||
There are two performance-based test scripts: time_all_gfs_argv_init.sh and
|
||||
time_all_gfs_hard_init.sh. Both scripts run the same tests, but initialize the
|
||||
underlying GF fields in different ways (*argv* uses reed_sol_time_gf and *hard*
|
||||
uses reed_sol_hard_time_gf.c).
|
||||
|
||||
You can run 'time_all_gfs_argv_init.sh' to time *all* possible GF
|
||||
implementations on your computer. This script requires the 'gf_methods'
|
||||
utility from GF-Complete to be in your PATH.
|
||||
|
||||
time_all_gfs_argv_init.sh was run on a MacBook Air and the distilled numbers
|
||||
are given in ./PERF.txt. The results are sorted by encoding throughput. The
|
||||
format of each entry reflects the arguments given to reed_sol_time_gf. For example,
|
||||
the test run of
|
||||
|
||||
'Examples/reed_sol_time_gf 12 3 8 128 65536 -m SPLIT 8 4 -r SSE'
|
||||
|
||||
is recorded as this in PERF.txt:
|
||||
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-r_SSE_- 2813.34
|
||||
|
||||
|
|
|
|||
|
|
@ -1,12 +1,177 @@
|
|||
This is revision 1.2A of Jerasure. It is basically equivalent to revision 1.2
|
||||
except it is released under the New BSD license.
|
||||
This is revision 2.0 of Jerasure. This is pretty much Jerasure 1.2 without the
|
||||
original Galois Field backend. Version 2.0 links directly to GF-Complete, which
|
||||
is more flexible than the original, and *much* faster, because it leverages SIMD
|
||||
instructions.
|
||||
|
||||
See technical report CS-08-627 for a description of the code.
|
||||
External Documentation:
|
||||
|
||||
There are two directories:
|
||||
See technical report CS-08-627 for a description of the main interfaces (Version 1.2)
|
||||
|
||||
The home directory contains the jerasure code.
|
||||
See https://bitbucket.org/jimplank/gf-complete for GF-Complete.
|
||||
|
||||
NOTE: You must have GF-Complete installed in order to use Jerasure 2.0.
|
||||
|
||||
Custom usage of GF-Complete is explained in this file (see below).
|
||||
|
||||
There are two directories of source code:
|
||||
|
||||
The src directory contains the jerasure code.
|
||||
The Examples directory contains the example programs.
|
||||
|
||||
The makefile assumes that Examples is a subdirectory of the home directory.
|
||||
|
||||
Installing:
|
||||
|
||||
1.) Install GF-Complete
|
||||
|
||||
2.) ./configure
|
||||
|
||||
3.) make
|
||||
|
||||
4.) make install
|
||||
|
||||
This will install the examples under PREFIX/bin, the library under PREFIX/lib
|
||||
and the header files under PREFIX/include
|
||||
|
||||
See individual source files to determine what the examples do.
|
||||
|
||||
Inclusion of GF-Complete:
|
||||
|
||||
As long as GF-Complete is installed, Jerasure 2.0 can be used just as previous
|
||||
versions. There is no need to define custom Galois Fields. Jerasure will
|
||||
determine the default field to use, if one is not specified.
|
||||
|
||||
If you would like to explore a using a different Galois Field implementation,
|
||||
you can dynamically set the backend GF for a given word-size (w).
|
||||
|
||||
The new galois.c and galois.h export the following functions to be used by applications
|
||||
for dynamically setting the back-end GF:
|
||||
|
||||
1.) galois_change_technique
|
||||
|
||||
Function signature:
|
||||
|
||||
void galois_change_technique(gf_t *gf, int w);
|
||||
|
||||
This is the recommended way for you to change techniques.
|
||||
|
||||
This function will take a pointer to a Galois field structure and set it as the
|
||||
current backend for all operations in GF(2^w). Note that you must specify 'w'
|
||||
here, since the internal GF structure is mostly opaque to Jerasure. Be sure to
|
||||
change the technique with the correct structure and word-size.
|
||||
|
||||
There are a few ways to get a pointer to a gf_t structure: GF-Complete gives three
|
||||
primitives for this -- create_gf_from_argv(), gf_init_easy() and gf_init_hard().
|
||||
Please read the documentation on GF-Complete for how these work. By far, the
|
||||
most powerful and easy is create_gf_from_argv(), which parses an argv-style
|
||||
string. Otherwise, the most flexible is gf_init_hard().
|
||||
|
||||
In galois.c/galois.h, we have defined galois_init_field(), which is pretty much
|
||||
identical to gf_init_hard(), except it performs memory allocation with malloc(),
|
||||
and galois_init_composite_field(), which facilitates creating composite fields.
|
||||
|
||||
These are described below, but once again, we recommend using create_gf_from_argv()
|
||||
or gf_init_hard() if you want to change your Galois field.
|
||||
|
||||
2.) galois_init_field
|
||||
|
||||
Function signature:
|
||||
|
||||
gf_t* galois_init_field(int w,
|
||||
int mult_type,
|
||||
int region_type,
|
||||
int divide_type,
|
||||
uint64_t prim_poly,
|
||||
int arg1,
|
||||
int arg2);
|
||||
|
||||
This is a helper function that will initialize a Galois field. See the GF-Complete
|
||||
documentation for more info on what the arguments mean. Here is a brief description
|
||||
of the arguments:
|
||||
|
||||
mult_type can be any *one* of the following:
|
||||
|
||||
GF_MULT_DEFAULT
|
||||
GF_MULT_SHIFT
|
||||
GF_MULT_CARRY_FREE
|
||||
GF_MULT_GROUP
|
||||
GF_MULT_BYTWO_p
|
||||
GF_MULT_BYTWO_b
|
||||
GF_MULT_TABLE
|
||||
GF_MULT_LOG_TABLE
|
||||
GF_MULT_LOG_ZERO
|
||||
GF_MULT_LOG_ZERO_EXT
|
||||
GF_MULT_SPLIT_TABLE
|
||||
|
||||
region_type can be a combination of the following (some combinations will not
|
||||
be valid):
|
||||
|
||||
GF_REGION_DEFAULT
|
||||
GF_REGION_DOUBLE_TABLE
|
||||
GF_REGION_QUAD_TABLE
|
||||
GF_REGION_LAZY
|
||||
GF_REGION_SSE
|
||||
GF_REGION_NOSSE
|
||||
GF_REGION_ALTMAP
|
||||
GF_REGION_CAUCHY
|
||||
|
||||
divide_type can be one of the following:
|
||||
|
||||
GF_DIVIDE_DEFAULT
|
||||
GF_DIVIDE_MATRIX
|
||||
GF_DIVIDE_EUCLID
|
||||
|
||||
prim_poly is the field-defining primitive polynomial
|
||||
|
||||
arg1 and arg2 are special arguments usually used for defining SPLIT and GROUP
|
||||
operations
|
||||
|
||||
3.) galois_init_composite_field
|
||||
|
||||
Function signature:
|
||||
|
||||
gf_t* galois_init_composite_field(int w,
|
||||
int region_type,
|
||||
int divide_type,
|
||||
int degree,
|
||||
gf_t* base_gf);
|
||||
|
||||
This is a helper function designed to make creating Composite fields easier. All you
|
||||
need to do is hand it w, region mult type, divide type, degree and a pointer to a base
|
||||
field. Note that the base_gf must have degree w/degree in order for this to work.
|
||||
For example, if we create a GF using:
|
||||
|
||||
galois_init_composite_field(32, GF_REGION_DEFAULT, GF_DIVIDE_DEFAULT, 2, base_gf);
|
||||
|
||||
Then base_gf must have w=16.
|
||||
|
||||
For more information on how to change the backing fields for Jerasure, please refer to
|
||||
|
||||
1.) Examples/reed_sol_test_gf.c: Runs basic tests for Reed-Solomon given args
|
||||
for a backing GF (uses create_gf_from_argv to get gf_t pointer)
|
||||
|
||||
2.) Examples/reed_sol_time_gf.c: Runs more thorough timing and validation tests
|
||||
for a backing GF (uses create_gf_from_argv to get gf_t pointer)
|
||||
|
||||
Performance:
|
||||
|
||||
There are two performance-based test scripts: time_all_gfs_argv_init.sh and
|
||||
time_all_gfs_hard_init.sh. Both scripts run the same tests, but initialize the
|
||||
underlying GF fields in different ways (*argv* uses reed_sol_time_gf and *hard*
|
||||
uses reed_sol_hard_time_gf.c).
|
||||
|
||||
You can run 'time_all_gfs_argv_init.sh' to time *all* possible GF
|
||||
implementations on your computer. This script requires the 'gf_methods'
|
||||
utility from GF-Complete to be in your PATH.
|
||||
|
||||
time_all_gfs_argv_init.sh was run on a MacBook Air and the distilled numbers
|
||||
are given in ./PERF.txt. The results are sorted by encoding throughput. The
|
||||
format of each entry reflects the arguments given to reed_sol_time_gf. For example,
|
||||
the test run of
|
||||
|
||||
'Examples/reed_sol_time_gf 12 3 8 128 65536 -m SPLIT 8 4 -r SSE'
|
||||
|
||||
is recorded as this in PERF.txt:
|
||||
|
||||
_12_3_8_128_65536_-m_SPLIT_8_4_-r_SSE_- 2813.34
|
||||
|
||||
|
|
|
|||
|
|
@ -0,0 +1,662 @@
|
|||
# generated automatically by aclocal 1.11.3 -*- Autoconf -*-
|
||||
|
||||
# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
|
||||
# 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software Foundation,
|
||||
# Inc.
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# This program is distributed in the hope that it will be useful,
|
||||
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
|
||||
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
|
||||
# PARTICULAR PURPOSE.
|
||||
|
||||
m4_ifndef([AC_AUTOCONF_VERSION],
|
||||
[m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
|
||||
m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.68],,
|
||||
[m4_warning([this file was generated for autoconf 2.68.
|
||||
You have another version of autoconf. It may work, but is not guaranteed to.
|
||||
If you have problems, you may need to regenerate the build system entirely.
|
||||
To do so, use the procedure documented by the package, typically `autoreconf'.])])
|
||||
|
||||
# Copyright (C) 2002, 2003, 2005, 2006, 2007, 2008, 2011 Free Software
|
||||
# Foundation, Inc.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 1
|
||||
|
||||
# AM_AUTOMAKE_VERSION(VERSION)
|
||||
# ----------------------------
|
||||
# Automake X.Y traces this macro to ensure aclocal.m4 has been
|
||||
# generated from the m4 files accompanying Automake X.Y.
|
||||
# (This private macro should not be called outside this file.)
|
||||
AC_DEFUN([AM_AUTOMAKE_VERSION],
|
||||
[am__api_version='1.11'
|
||||
dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to
|
||||
dnl require some minimum version. Point them to the right macro.
|
||||
m4_if([$1], [1.11.3], [],
|
||||
[AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl
|
||||
])
|
||||
|
||||
# _AM_AUTOCONF_VERSION(VERSION)
|
||||
# -----------------------------
|
||||
# aclocal traces this macro to find the Autoconf version.
|
||||
# This is a private macro too. Using m4_define simplifies
|
||||
# the logic in aclocal, which can simply ignore this definition.
|
||||
m4_define([_AM_AUTOCONF_VERSION], [])
|
||||
|
||||
# AM_SET_CURRENT_AUTOMAKE_VERSION
|
||||
# -------------------------------
|
||||
# Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced.
|
||||
# This function is AC_REQUIREd by AM_INIT_AUTOMAKE.
|
||||
AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION],
|
||||
[AM_AUTOMAKE_VERSION([1.11.3])dnl
|
||||
m4_ifndef([AC_AUTOCONF_VERSION],
|
||||
[m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
|
||||
_AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))])
|
||||
|
||||
# AM_AUX_DIR_EXPAND -*- Autoconf -*-
|
||||
|
||||
# Copyright (C) 2001, 2003, 2005, 2011 Free Software Foundation, Inc.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 1
|
||||
|
||||
# For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets
|
||||
# $ac_aux_dir to `$srcdir/foo'. In other projects, it is set to
|
||||
# `$srcdir', `$srcdir/..', or `$srcdir/../..'.
|
||||
#
|
||||
# Of course, Automake must honor this variable whenever it calls a
|
||||
# tool from the auxiliary directory. The problem is that $srcdir (and
|
||||
# therefore $ac_aux_dir as well) can be either absolute or relative,
|
||||
# depending on how configure is run. This is pretty annoying, since
|
||||
# it makes $ac_aux_dir quite unusable in subdirectories: in the top
|
||||
# source directory, any form will work fine, but in subdirectories a
|
||||
# relative path needs to be adjusted first.
|
||||
#
|
||||
# $ac_aux_dir/missing
|
||||
# fails when called from a subdirectory if $ac_aux_dir is relative
|
||||
# $top_srcdir/$ac_aux_dir/missing
|
||||
# fails if $ac_aux_dir is absolute,
|
||||
# fails when called from a subdirectory in a VPATH build with
|
||||
# a relative $ac_aux_dir
|
||||
#
|
||||
# The reason of the latter failure is that $top_srcdir and $ac_aux_dir
|
||||
# are both prefixed by $srcdir. In an in-source build this is usually
|
||||
# harmless because $srcdir is `.', but things will broke when you
|
||||
# start a VPATH build or use an absolute $srcdir.
|
||||
#
|
||||
# So we could use something similar to $top_srcdir/$ac_aux_dir/missing,
|
||||
# iff we strip the leading $srcdir from $ac_aux_dir. That would be:
|
||||
# am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"`
|
||||
# and then we would define $MISSING as
|
||||
# MISSING="\${SHELL} $am_aux_dir/missing"
|
||||
# This will work as long as MISSING is not called from configure, because
|
||||
# unfortunately $(top_srcdir) has no meaning in configure.
|
||||
# However there are other variables, like CC, which are often used in
|
||||
# configure, and could therefore not use this "fixed" $ac_aux_dir.
|
||||
#
|
||||
# Another solution, used here, is to always expand $ac_aux_dir to an
|
||||
# absolute PATH. The drawback is that using absolute paths prevent a
|
||||
# configured tree to be moved without reconfiguration.
|
||||
|
||||
AC_DEFUN([AM_AUX_DIR_EXPAND],
|
||||
[dnl Rely on autoconf to set up CDPATH properly.
|
||||
AC_PREREQ([2.50])dnl
|
||||
# expand $ac_aux_dir to an absolute path
|
||||
am_aux_dir=`cd $ac_aux_dir && pwd`
|
||||
])
|
||||
|
||||
# AM_CONDITIONAL -*- Autoconf -*-
|
||||
|
||||
# Copyright (C) 1997, 2000, 2001, 2003, 2004, 2005, 2006, 2008
|
||||
# Free Software Foundation, Inc.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 9
|
||||
|
||||
# AM_CONDITIONAL(NAME, SHELL-CONDITION)
|
||||
# -------------------------------------
|
||||
# Define a conditional.
|
||||
AC_DEFUN([AM_CONDITIONAL],
|
||||
[AC_PREREQ(2.52)dnl
|
||||
ifelse([$1], [TRUE], [AC_FATAL([$0: invalid condition: $1])],
|
||||
[$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl
|
||||
AC_SUBST([$1_TRUE])dnl
|
||||
AC_SUBST([$1_FALSE])dnl
|
||||
_AM_SUBST_NOTMAKE([$1_TRUE])dnl
|
||||
_AM_SUBST_NOTMAKE([$1_FALSE])dnl
|
||||
m4_define([_AM_COND_VALUE_$1], [$2])dnl
|
||||
if $2; then
|
||||
$1_TRUE=
|
||||
$1_FALSE='#'
|
||||
else
|
||||
$1_TRUE='#'
|
||||
$1_FALSE=
|
||||
fi
|
||||
AC_CONFIG_COMMANDS_PRE(
|
||||
[if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then
|
||||
AC_MSG_ERROR([[conditional "$1" was never defined.
|
||||
Usually this means the macro was only invoked conditionally.]])
|
||||
fi])])
|
||||
|
||||
# Do all the work for Automake. -*- Autoconf -*-
|
||||
|
||||
# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
|
||||
# 2005, 2006, 2008, 2009 Free Software Foundation, Inc.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 16
|
||||
|
||||
# This macro actually does too much. Some checks are only needed if
|
||||
# your package does certain things. But this isn't really a big deal.
|
||||
|
||||
# AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE])
|
||||
# AM_INIT_AUTOMAKE([OPTIONS])
|
||||
# -----------------------------------------------
|
||||
# The call with PACKAGE and VERSION arguments is the old style
|
||||
# call (pre autoconf-2.50), which is being phased out. PACKAGE
|
||||
# and VERSION should now be passed to AC_INIT and removed from
|
||||
# the call to AM_INIT_AUTOMAKE.
|
||||
# We support both call styles for the transition. After
|
||||
# the next Automake release, Autoconf can make the AC_INIT
|
||||
# arguments mandatory, and then we can depend on a new Autoconf
|
||||
# release and drop the old call support.
|
||||
AC_DEFUN([AM_INIT_AUTOMAKE],
|
||||
[AC_PREREQ([2.62])dnl
|
||||
dnl Autoconf wants to disallow AM_ names. We explicitly allow
|
||||
dnl the ones we care about.
|
||||
m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl
|
||||
AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl
|
||||
AC_REQUIRE([AC_PROG_INSTALL])dnl
|
||||
if test "`cd $srcdir && pwd`" != "`pwd`"; then
|
||||
# Use -I$(srcdir) only when $(srcdir) != ., so that make's output
|
||||
# is not polluted with repeated "-I."
|
||||
AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl
|
||||
# test to see if srcdir already configured
|
||||
if test -f $srcdir/config.status; then
|
||||
AC_MSG_ERROR([source directory already configured; run "make distclean" there first])
|
||||
fi
|
||||
fi
|
||||
|
||||
# test whether we have cygpath
|
||||
if test -z "$CYGPATH_W"; then
|
||||
if (cygpath --version) >/dev/null 2>/dev/null; then
|
||||
CYGPATH_W='cygpath -w'
|
||||
else
|
||||
CYGPATH_W=echo
|
||||
fi
|
||||
fi
|
||||
AC_SUBST([CYGPATH_W])
|
||||
|
||||
# Define the identity of the package.
|
||||
dnl Distinguish between old-style and new-style calls.
|
||||
m4_ifval([$2],
|
||||
[m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl
|
||||
AC_SUBST([PACKAGE], [$1])dnl
|
||||
AC_SUBST([VERSION], [$2])],
|
||||
[_AM_SET_OPTIONS([$1])dnl
|
||||
dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT.
|
||||
m4_if(m4_ifdef([AC_PACKAGE_NAME], 1)m4_ifdef([AC_PACKAGE_VERSION], 1), 11,,
|
||||
[m4_fatal([AC_INIT should be called with package and version arguments])])dnl
|
||||
AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl
|
||||
AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl
|
||||
|
||||
_AM_IF_OPTION([no-define],,
|
||||
[AC_DEFINE_UNQUOTED(PACKAGE, "$PACKAGE", [Name of package])
|
||||
AC_DEFINE_UNQUOTED(VERSION, "$VERSION", [Version number of package])])dnl
|
||||
|
||||
# Some tools Automake needs.
|
||||
AC_REQUIRE([AM_SANITY_CHECK])dnl
|
||||
AC_REQUIRE([AC_ARG_PROGRAM])dnl
|
||||
AM_MISSING_PROG(ACLOCAL, aclocal-${am__api_version})
|
||||
AM_MISSING_PROG(AUTOCONF, autoconf)
|
||||
AM_MISSING_PROG(AUTOMAKE, automake-${am__api_version})
|
||||
AM_MISSING_PROG(AUTOHEADER, autoheader)
|
||||
AM_MISSING_PROG(MAKEINFO, makeinfo)
|
||||
AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
|
||||
AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl
|
||||
AC_REQUIRE([AM_PROG_MKDIR_P])dnl
|
||||
# We need awk for the "check" target. The system "awk" is bad on
|
||||
# some platforms.
|
||||
AC_REQUIRE([AC_PROG_AWK])dnl
|
||||
AC_REQUIRE([AC_PROG_MAKE_SET])dnl
|
||||
AC_REQUIRE([AM_SET_LEADING_DOT])dnl
|
||||
_AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])],
|
||||
[_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],
|
||||
[_AM_PROG_TAR([v7])])])
|
||||
_AM_IF_OPTION([no-dependencies],,
|
||||
[AC_PROVIDE_IFELSE([AC_PROG_CC],
|
||||
[_AM_DEPENDENCIES(CC)],
|
||||
[define([AC_PROG_CC],
|
||||
defn([AC_PROG_CC])[_AM_DEPENDENCIES(CC)])])dnl
|
||||
AC_PROVIDE_IFELSE([AC_PROG_CXX],
|
||||
[_AM_DEPENDENCIES(CXX)],
|
||||
[define([AC_PROG_CXX],
|
||||
defn([AC_PROG_CXX])[_AM_DEPENDENCIES(CXX)])])dnl
|
||||
AC_PROVIDE_IFELSE([AC_PROG_OBJC],
|
||||
[_AM_DEPENDENCIES(OBJC)],
|
||||
[define([AC_PROG_OBJC],
|
||||
defn([AC_PROG_OBJC])[_AM_DEPENDENCIES(OBJC)])])dnl
|
||||
])
|
||||
_AM_IF_OPTION([silent-rules], [AC_REQUIRE([AM_SILENT_RULES])])dnl
|
||||
dnl The `parallel-tests' driver may need to know about EXEEXT, so add the
|
||||
dnl `am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen. This macro
|
||||
dnl is hooked onto _AC_COMPILER_EXEEXT early, see below.
|
||||
AC_CONFIG_COMMANDS_PRE(dnl
|
||||
[m4_provide_if([_AM_COMPILER_EXEEXT],
|
||||
[AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl
|
||||
])
|
||||
|
||||
dnl Hook into `_AC_COMPILER_EXEEXT' early to learn its expansion. Do not
|
||||
dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further
|
||||
dnl mangled by Autoconf and run in a shell conditional statement.
|
||||
m4_define([_AC_COMPILER_EXEEXT],
|
||||
m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])])
|
||||
|
||||
|
||||
# When config.status generates a header, we must update the stamp-h file.
|
||||
# This file resides in the same directory as the config header
|
||||
# that is generated. The stamp files are numbered to have different names.
|
||||
|
||||
# Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the
|
||||
# loop where config.status creates the headers, so we can generate
|
||||
# our stamp files there.
|
||||
AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK],
|
||||
[# Compute $1's index in $config_headers.
|
||||
_am_arg=$1
|
||||
_am_stamp_count=1
|
||||
for _am_header in $config_headers :; do
|
||||
case $_am_header in
|
||||
$_am_arg | $_am_arg:* )
|
||||
break ;;
|
||||
* )
|
||||
_am_stamp_count=`expr $_am_stamp_count + 1` ;;
|
||||
esac
|
||||
done
|
||||
echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count])
|
||||
|
||||
# Copyright (C) 2001, 2003, 2005, 2008, 2011 Free Software Foundation,
|
||||
# Inc.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 1
|
||||
|
||||
# AM_PROG_INSTALL_SH
|
||||
# ------------------
|
||||
# Define $install_sh.
|
||||
AC_DEFUN([AM_PROG_INSTALL_SH],
|
||||
[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
|
||||
if test x"${install_sh}" != xset; then
|
||||
case $am_aux_dir in
|
||||
*\ * | *\ *)
|
||||
install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
|
||||
*)
|
||||
install_sh="\${SHELL} $am_aux_dir/install-sh"
|
||||
esac
|
||||
fi
|
||||
AC_SUBST(install_sh)])
|
||||
|
||||
# Copyright (C) 2003, 2005 Free Software Foundation, Inc.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 2
|
||||
|
||||
# Check whether the underlying file-system supports filenames
|
||||
# with a leading dot. For instance MS-DOS doesn't.
|
||||
AC_DEFUN([AM_SET_LEADING_DOT],
|
||||
[rm -rf .tst 2>/dev/null
|
||||
mkdir .tst 2>/dev/null
|
||||
if test -d .tst; then
|
||||
am__leading_dot=.
|
||||
else
|
||||
am__leading_dot=_
|
||||
fi
|
||||
rmdir .tst 2>/dev/null
|
||||
AC_SUBST([am__leading_dot])])
|
||||
|
||||
# Fake the existence of programs that GNU maintainers use. -*- Autoconf -*-
|
||||
|
||||
# Copyright (C) 1997, 1999, 2000, 2001, 2003, 2004, 2005, 2008
|
||||
# Free Software Foundation, Inc.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 6
|
||||
|
||||
# AM_MISSING_PROG(NAME, PROGRAM)
|
||||
# ------------------------------
|
||||
AC_DEFUN([AM_MISSING_PROG],
|
||||
[AC_REQUIRE([AM_MISSING_HAS_RUN])
|
||||
$1=${$1-"${am_missing_run}$2"}
|
||||
AC_SUBST($1)])
|
||||
|
||||
|
||||
# AM_MISSING_HAS_RUN
|
||||
# ------------------
|
||||
# Define MISSING if not defined so far and test if it supports --run.
|
||||
# If it does, set am_missing_run to use it, otherwise, to nothing.
|
||||
AC_DEFUN([AM_MISSING_HAS_RUN],
|
||||
[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
|
||||
AC_REQUIRE_AUX_FILE([missing])dnl
|
||||
if test x"${MISSING+set}" != xset; then
|
||||
case $am_aux_dir in
|
||||
*\ * | *\ *)
|
||||
MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
|
||||
*)
|
||||
MISSING="\${SHELL} $am_aux_dir/missing" ;;
|
||||
esac
|
||||
fi
|
||||
# Use eval to expand $SHELL
|
||||
if eval "$MISSING --run true"; then
|
||||
am_missing_run="$MISSING --run "
|
||||
else
|
||||
am_missing_run=
|
||||
AC_MSG_WARN([`missing' script is too old or missing])
|
||||
fi
|
||||
])
|
||||
|
||||
# Copyright (C) 2003, 2004, 2005, 2006, 2011 Free Software Foundation,
|
||||
# Inc.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 1
|
||||
|
||||
# AM_PROG_MKDIR_P
|
||||
# ---------------
|
||||
# Check for `mkdir -p'.
|
||||
AC_DEFUN([AM_PROG_MKDIR_P],
|
||||
[AC_PREREQ([2.60])dnl
|
||||
AC_REQUIRE([AC_PROG_MKDIR_P])dnl
|
||||
dnl Automake 1.8 to 1.9.6 used to define mkdir_p. We now use MKDIR_P,
|
||||
dnl while keeping a definition of mkdir_p for backward compatibility.
|
||||
dnl @MKDIR_P@ is magic: AC_OUTPUT adjusts its value for each Makefile.
|
||||
dnl However we cannot define mkdir_p as $(MKDIR_P) for the sake of
|
||||
dnl Makefile.ins that do not define MKDIR_P, so we do our own
|
||||
dnl adjustment using top_builddir (which is defined more often than
|
||||
dnl MKDIR_P).
|
||||
AC_SUBST([mkdir_p], ["$MKDIR_P"])dnl
|
||||
case $mkdir_p in
|
||||
[[\\/$]]* | ?:[[\\/]]*) ;;
|
||||
*/*) mkdir_p="\$(top_builddir)/$mkdir_p" ;;
|
||||
esac
|
||||
])
|
||||
|
||||
# Helper functions for option handling. -*- Autoconf -*-
|
||||
|
||||
# Copyright (C) 2001, 2002, 2003, 2005, 2008, 2010 Free Software
|
||||
# Foundation, Inc.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 5
|
||||
|
||||
# _AM_MANGLE_OPTION(NAME)
|
||||
# -----------------------
|
||||
AC_DEFUN([_AM_MANGLE_OPTION],
|
||||
[[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])])
|
||||
|
||||
# _AM_SET_OPTION(NAME)
|
||||
# --------------------
|
||||
# Set option NAME. Presently that only means defining a flag for this option.
|
||||
AC_DEFUN([_AM_SET_OPTION],
|
||||
[m4_define(_AM_MANGLE_OPTION([$1]), 1)])
|
||||
|
||||
# _AM_SET_OPTIONS(OPTIONS)
|
||||
# ------------------------
|
||||
# OPTIONS is a space-separated list of Automake options.
|
||||
AC_DEFUN([_AM_SET_OPTIONS],
|
||||
[m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])])
|
||||
|
||||
# _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET])
|
||||
# -------------------------------------------
|
||||
# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise.
|
||||
AC_DEFUN([_AM_IF_OPTION],
|
||||
[m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])])
|
||||
|
||||
# Check to make sure that the build environment is sane. -*- Autoconf -*-
|
||||
|
||||
# Copyright (C) 1996, 1997, 2000, 2001, 2003, 2005, 2008
|
||||
# Free Software Foundation, Inc.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 5
|
||||
|
||||
# AM_SANITY_CHECK
|
||||
# ---------------
|
||||
AC_DEFUN([AM_SANITY_CHECK],
|
||||
[AC_MSG_CHECKING([whether build environment is sane])
|
||||
# Just in case
|
||||
sleep 1
|
||||
echo timestamp > conftest.file
|
||||
# Reject unsafe characters in $srcdir or the absolute working directory
|
||||
# name. Accept space and tab only in the latter.
|
||||
am_lf='
|
||||
'
|
||||
case `pwd` in
|
||||
*[[\\\"\#\$\&\'\`$am_lf]]*)
|
||||
AC_MSG_ERROR([unsafe absolute working directory name]);;
|
||||
esac
|
||||
case $srcdir in
|
||||
*[[\\\"\#\$\&\'\`$am_lf\ \ ]]*)
|
||||
AC_MSG_ERROR([unsafe srcdir value: `$srcdir']);;
|
||||
esac
|
||||
|
||||
# Do `set' in a subshell so we don't clobber the current shell's
|
||||
# arguments. Must try -L first in case configure is actually a
|
||||
# symlink; some systems play weird games with the mod time of symlinks
|
||||
# (eg FreeBSD returns the mod time of the symlink's containing
|
||||
# directory).
|
||||
if (
|
||||
set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
|
||||
if test "$[*]" = "X"; then
|
||||
# -L didn't work.
|
||||
set X `ls -t "$srcdir/configure" conftest.file`
|
||||
fi
|
||||
rm -f conftest.file
|
||||
if test "$[*]" != "X $srcdir/configure conftest.file" \
|
||||
&& test "$[*]" != "X conftest.file $srcdir/configure"; then
|
||||
|
||||
# If neither matched, then we have a broken ls. This can happen
|
||||
# if, for instance, CONFIG_SHELL is bash and it inherits a
|
||||
# broken ls alias from the environment. This has actually
|
||||
# happened. Such a system could not be considered "sane".
|
||||
AC_MSG_ERROR([ls -t appears to fail. Make sure there is not a broken
|
||||
alias in your environment])
|
||||
fi
|
||||
|
||||
test "$[2]" = conftest.file
|
||||
)
|
||||
then
|
||||
# Ok.
|
||||
:
|
||||
else
|
||||
AC_MSG_ERROR([newly created file is older than distributed files!
|
||||
Check your system clock])
|
||||
fi
|
||||
AC_MSG_RESULT(yes)])
|
||||
|
||||
# Copyright (C) 2001, 2003, 2005, 2011 Free Software Foundation, Inc.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 1
|
||||
|
||||
# AM_PROG_INSTALL_STRIP
|
||||
# ---------------------
|
||||
# One issue with vendor `install' (even GNU) is that you can't
|
||||
# specify the program used to strip binaries. This is especially
|
||||
# annoying in cross-compiling environments, where the build's strip
|
||||
# is unlikely to handle the host's binaries.
|
||||
# Fortunately install-sh will honor a STRIPPROG variable, so we
|
||||
# always use install-sh in `make install-strip', and initialize
|
||||
# STRIPPROG with the value of the STRIP variable (set by the user).
|
||||
AC_DEFUN([AM_PROG_INSTALL_STRIP],
|
||||
[AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
|
||||
# Installed binaries are usually stripped using `strip' when the user
|
||||
# run `make install-strip'. However `strip' might not be the right
|
||||
# tool to use in cross-compilation environments, therefore Automake
|
||||
# will honor the `STRIP' environment variable to overrule this program.
|
||||
dnl Don't test for $cross_compiling = yes, because it might be `maybe'.
|
||||
if test "$cross_compiling" != no; then
|
||||
AC_CHECK_TOOL([STRIP], [strip], :)
|
||||
fi
|
||||
INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
|
||||
AC_SUBST([INSTALL_STRIP_PROGRAM])])
|
||||
|
||||
# Copyright (C) 2006, 2008, 2010 Free Software Foundation, Inc.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 3
|
||||
|
||||
# _AM_SUBST_NOTMAKE(VARIABLE)
|
||||
# ---------------------------
|
||||
# Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in.
|
||||
# This macro is traced by Automake.
|
||||
AC_DEFUN([_AM_SUBST_NOTMAKE])
|
||||
|
||||
# AM_SUBST_NOTMAKE(VARIABLE)
|
||||
# --------------------------
|
||||
# Public sister of _AM_SUBST_NOTMAKE.
|
||||
AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)])
|
||||
|
||||
# Check how to create a tarball. -*- Autoconf -*-
|
||||
|
||||
# Copyright (C) 2004, 2005, 2012 Free Software Foundation, Inc.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 2
|
||||
|
||||
# _AM_PROG_TAR(FORMAT)
|
||||
# --------------------
|
||||
# Check how to create a tarball in format FORMAT.
|
||||
# FORMAT should be one of `v7', `ustar', or `pax'.
|
||||
#
|
||||
# Substitute a variable $(am__tar) that is a command
|
||||
# writing to stdout a FORMAT-tarball containing the directory
|
||||
# $tardir.
|
||||
# tardir=directory && $(am__tar) > result.tar
|
||||
#
|
||||
# Substitute a variable $(am__untar) that extract such
|
||||
# a tarball read from stdin.
|
||||
# $(am__untar) < result.tar
|
||||
AC_DEFUN([_AM_PROG_TAR],
|
||||
[# Always define AMTAR for backward compatibility. Yes, it's still used
|
||||
# in the wild :-( We should find a proper way to deprecate it ...
|
||||
AC_SUBST([AMTAR], ['$${TAR-tar}'])
|
||||
m4_if([$1], [v7],
|
||||
[am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'],
|
||||
[m4_case([$1], [ustar],, [pax],,
|
||||
[m4_fatal([Unknown tar format])])
|
||||
AC_MSG_CHECKING([how to create a $1 tar archive])
|
||||
# Loop over all known methods to create a tar archive until one works.
|
||||
_am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none'
|
||||
_am_tools=${am_cv_prog_tar_$1-$_am_tools}
|
||||
# Do not fold the above two line into one, because Tru64 sh and
|
||||
# Solaris sh will not grok spaces in the rhs of `-'.
|
||||
for _am_tool in $_am_tools
|
||||
do
|
||||
case $_am_tool in
|
||||
gnutar)
|
||||
for _am_tar in tar gnutar gtar;
|
||||
do
|
||||
AM_RUN_LOG([$_am_tar --version]) && break
|
||||
done
|
||||
am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"'
|
||||
am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"'
|
||||
am__untar="$_am_tar -xf -"
|
||||
;;
|
||||
plaintar)
|
||||
# Must skip GNU tar: if it does not support --format= it doesn't create
|
||||
# ustar tarball either.
|
||||
(tar --version) >/dev/null 2>&1 && continue
|
||||
am__tar='tar chf - "$$tardir"'
|
||||
am__tar_='tar chf - "$tardir"'
|
||||
am__untar='tar xf -'
|
||||
;;
|
||||
pax)
|
||||
am__tar='pax -L -x $1 -w "$$tardir"'
|
||||
am__tar_='pax -L -x $1 -w "$tardir"'
|
||||
am__untar='pax -r'
|
||||
;;
|
||||
cpio)
|
||||
am__tar='find "$$tardir" -print | cpio -o -H $1 -L'
|
||||
am__tar_='find "$tardir" -print | cpio -o -H $1 -L'
|
||||
am__untar='cpio -i -H $1 -d'
|
||||
;;
|
||||
none)
|
||||
am__tar=false
|
||||
am__tar_=false
|
||||
am__untar=false
|
||||
;;
|
||||
esac
|
||||
|
||||
# If the value was cached, stop now. We just wanted to have am__tar
|
||||
# and am__untar set.
|
||||
test -n "${am_cv_prog_tar_$1}" && break
|
||||
|
||||
# tar/untar a dummy directory, and stop if the command works
|
||||
rm -rf conftest.dir
|
||||
mkdir conftest.dir
|
||||
echo GrepMe > conftest.dir/file
|
||||
AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar])
|
||||
rm -rf conftest.dir
|
||||
if test -s conftest.tar; then
|
||||
AM_RUN_LOG([$am__untar <conftest.tar])
|
||||
grep GrepMe conftest.dir/file >/dev/null 2>&1 && break
|
||||
fi
|
||||
done
|
||||
rm -rf conftest.dir
|
||||
|
||||
AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool])
|
||||
AC_MSG_RESULT([$am_cv_prog_tar_$1])])
|
||||
AC_SUBST([am__tar])
|
||||
AC_SUBST([am__untar])
|
||||
]) # _AM_PROG_TAR
|
||||
|
||||
m4_include([m4/ax_check_compile_flag.m4])
|
||||
m4_include([m4/ax_ext.m4])
|
||||
m4_include([m4/ax_gcc_x86_avx_xgetbv.m4])
|
||||
m4_include([m4/ax_gcc_x86_cpuid.m4])
|
||||
m4_include([m4/libtool.m4])
|
||||
m4_include([m4/ltoptions.m4])
|
||||
m4_include([m4/ltsugar.m4])
|
||||
m4_include([m4/ltversion.m4])
|
||||
m4_include([m4/lt~obsolete.m4])
|
||||
|
|
@ -0,0 +1,2 @@
|
|||
#!/bin/sh
|
||||
autoreconf --force --install -I m4
|
||||
53
cauchy.h
53
cauchy.h
|
|
@ -1,53 +0,0 @@
|
|||
/* cauchy.h
|
||||
* James S. Plank
|
||||
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
*/
|
||||
|
||||
extern int *cauchy_original_coding_matrix(int k, int m, int w);
|
||||
extern int *cauchy_xy_coding_matrix(int k, int m, int w, int *x, int *y);
|
||||
extern void cauchy_improve_coding_matrix(int k, int m, int w, int *matrix);
|
||||
extern int *cauchy_good_general_coding_matrix(int k, int m, int w);
|
||||
extern int cauchy_n_ones(int n, int w);
|
||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,32 @@
|
|||
# Jerasure autoconf template
|
||||
|
||||
# FIXME - add project url as the last argument
|
||||
AC_INIT(Jerasure, 2.0)
|
||||
|
||||
AC_PREREQ([2.61])
|
||||
|
||||
AM_INIT_AUTOMAKE([no-dependencies], [foreign])
|
||||
LT_INIT # libtool
|
||||
|
||||
AC_CONFIG_HEADER(include/config.h)
|
||||
|
||||
dnl Needed when reconfiguring with 'autoreconf -i -s'
|
||||
AC_CONFIG_MACRO_DIR([m4])
|
||||
|
||||
dnl Compiling with per-target flags requires AM_PROG_CC_C_O.
|
||||
AC_PROG_CC
|
||||
|
||||
# Check for gf_complete headers
|
||||
AC_CHECK_HEADERS(gf_complete.h gf_general.h gf_int.h gf_method.h gf_rand.h)
|
||||
|
||||
AC_CHECK_LIB([gf_complete], [gf_init_easy], [],
|
||||
[
|
||||
echo "Error! You need to have gf_complete installed."
|
||||
echo "gf_complete is available from http://web.eecs.utk.edu/~plank/plank/papers/CS-13-703.html"
|
||||
exit -1
|
||||
])
|
||||
|
||||
AX_EXT()
|
||||
|
||||
AC_CONFIG_FILES([Makefile Examples/Makefile src/Makefile])
|
||||
AC_OUTPUT
|
||||
823
galois.c
823
galois.c
|
|
@ -1,823 +0,0 @@
|
|||
/* Galois.c
|
||||
* James S. Plank
|
||||
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#include "galois.h"
|
||||
|
||||
#define NONE (10)
|
||||
#define TABLE (11)
|
||||
#define SHIFT (12)
|
||||
#define LOGS (13)
|
||||
#define SPLITW8 (14)
|
||||
|
||||
static int prim_poly[33] =
|
||||
{ 0,
|
||||
/* 1 */ 1,
|
||||
/* 2 */ 07,
|
||||
/* 3 */ 013,
|
||||
/* 4 */ 023,
|
||||
/* 5 */ 045,
|
||||
/* 6 */ 0103,
|
||||
/* 7 */ 0211,
|
||||
/* 8 */ 0435,
|
||||
/* 9 */ 01021,
|
||||
/* 10 */ 02011,
|
||||
/* 11 */ 04005,
|
||||
/* 12 */ 010123,
|
||||
/* 13 */ 020033,
|
||||
/* 14 */ 042103,
|
||||
/* 15 */ 0100003,
|
||||
/* 16 */ 0210013,
|
||||
/* 17 */ 0400011,
|
||||
/* 18 */ 01000201,
|
||||
/* 19 */ 02000047,
|
||||
/* 20 */ 04000011,
|
||||
/* 21 */ 010000005,
|
||||
/* 22 */ 020000003,
|
||||
/* 23 */ 040000041,
|
||||
/* 24 */ 0100000207,
|
||||
/* 25 */ 0200000011,
|
||||
/* 26 */ 0400000107,
|
||||
/* 27 */ 01000000047,
|
||||
/* 28 */ 02000000011,
|
||||
/* 29 */ 04000000005,
|
||||
/* 30 */ 010040000007,
|
||||
/* 31 */ 020000000011,
|
||||
/* 32 */ 00020000007 }; /* Really 40020000007, but we're omitting the high order bit */
|
||||
|
||||
static int mult_type[33] =
|
||||
{ NONE,
|
||||
/* 1 */ TABLE,
|
||||
/* 2 */ TABLE,
|
||||
/* 3 */ TABLE,
|
||||
/* 4 */ TABLE,
|
||||
/* 5 */ TABLE,
|
||||
/* 6 */ TABLE,
|
||||
/* 7 */ TABLE,
|
||||
/* 8 */ TABLE,
|
||||
/* 9 */ TABLE,
|
||||
/* 10 */ LOGS,
|
||||
/* 11 */ LOGS,
|
||||
/* 12 */ LOGS,
|
||||
/* 13 */ LOGS,
|
||||
/* 14 */ LOGS,
|
||||
/* 15 */ LOGS,
|
||||
/* 16 */ LOGS,
|
||||
/* 17 */ LOGS,
|
||||
/* 18 */ LOGS,
|
||||
/* 19 */ LOGS,
|
||||
/* 20 */ LOGS,
|
||||
/* 21 */ LOGS,
|
||||
/* 22 */ LOGS,
|
||||
/* 23 */ SHIFT,
|
||||
/* 24 */ SHIFT,
|
||||
/* 25 */ SHIFT,
|
||||
/* 26 */ SHIFT,
|
||||
/* 27 */ SHIFT,
|
||||
/* 28 */ SHIFT,
|
||||
/* 29 */ SHIFT,
|
||||
/* 30 */ SHIFT,
|
||||
/* 31 */ SHIFT,
|
||||
/* 32 */ SPLITW8 };
|
||||
|
||||
static int nw[33] = { 0, (1 << 1), (1 << 2), (1 << 3), (1 << 4),
|
||||
(1 << 5), (1 << 6), (1 << 7), (1 << 8), (1 << 9), (1 << 10),
|
||||
(1 << 11), (1 << 12), (1 << 13), (1 << 14), (1 << 15), (1 << 16),
|
||||
(1 << 17), (1 << 18), (1 << 19), (1 << 20), (1 << 21), (1 << 22),
|
||||
(1 << 23), (1 << 24), (1 << 25), (1 << 26), (1 << 27), (1 << 28),
|
||||
(1 << 29), (1 << 30), (1 << 31), -1 };
|
||||
|
||||
static int nwm1[33] = { 0, (1 << 1)-1, (1 << 2)-1, (1 << 3)-1, (1 << 4)-1,
|
||||
(1 << 5)-1, (1 << 6)-1, (1 << 7)-1, (1 << 8)-1, (1 << 9)-1, (1 << 10)-1,
|
||||
(1 << 11)-1, (1 << 12)-1, (1 << 13)-1, (1 << 14)-1, (1 << 15)-1, (1 << 16)-1,
|
||||
(1 << 17)-1, (1 << 18)-1, (1 << 19)-1, (1 << 20)-1, (1 << 21)-1, (1 << 22)-1,
|
||||
(1 << 23)-1, (1 << 24)-1, (1 << 25)-1, (1 << 26)-1, (1 << 27)-1, (1 << 28)-1,
|
||||
(1 << 29)-1, (1 << 30)-1, 0x7fffffff, 0xffffffff };
|
||||
|
||||
static int *galois_log_tables[33] = { NULL, NULL, NULL, NULL, NULL, NULL, NULL,
|
||||
NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
|
||||
NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL };
|
||||
|
||||
static int *galois_ilog_tables[33] = { NULL, NULL, NULL, NULL, NULL, NULL, NULL,
|
||||
NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
|
||||
NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL };
|
||||
|
||||
static int *galois_mult_tables[33] = { NULL, NULL, NULL, NULL, NULL, NULL, NULL,
|
||||
NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
|
||||
NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL };
|
||||
|
||||
static int *galois_div_tables[33] = { NULL, NULL, NULL, NULL, NULL, NULL, NULL,
|
||||
NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
|
||||
NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL };
|
||||
|
||||
/* Special case for w = 32 */
|
||||
|
||||
static int *galois_split_w8[7] = { NULL, NULL, NULL, NULL, NULL, NULL, NULL };
|
||||
|
||||
int galois_create_log_tables(int w)
|
||||
{
|
||||
int j, b;
|
||||
|
||||
if (w > 30) return -1;
|
||||
if (galois_log_tables[w] != NULL) return 0;
|
||||
galois_log_tables[w] = (int *) malloc(sizeof(int)*nw[w]);
|
||||
if (galois_log_tables[w] == NULL) return -1;
|
||||
|
||||
galois_ilog_tables[w] = (int *) malloc(sizeof(int)*nw[w]*3);
|
||||
if (galois_ilog_tables[w] == NULL) {
|
||||
free(galois_log_tables[w]);
|
||||
galois_log_tables[w] = NULL;
|
||||
return -1;
|
||||
}
|
||||
|
||||
for (j = 0; j < nw[w]; j++) {
|
||||
galois_log_tables[w][j] = nwm1[w];
|
||||
galois_ilog_tables[w][j] = 0;
|
||||
}
|
||||
|
||||
b = 1;
|
||||
for (j = 0; j < nwm1[w]; j++) {
|
||||
if (galois_log_tables[w][b] != nwm1[w]) {
|
||||
fprintf(stderr, "Galois_create_log_tables Error: j=%d, b=%d, B->J[b]=%d, J->B[j]=%d (0%o)\n",
|
||||
j, b, galois_log_tables[w][b], galois_ilog_tables[w][j], (b << 1) ^ prim_poly[w]);
|
||||
exit(1);
|
||||
}
|
||||
galois_log_tables[w][b] = j;
|
||||
galois_ilog_tables[w][j] = b;
|
||||
b = b << 1;
|
||||
if (b & nw[w]) b = (b ^ prim_poly[w]) & nwm1[w];
|
||||
}
|
||||
for (j = 0; j < nwm1[w]; j++) {
|
||||
galois_ilog_tables[w][j+nwm1[w]] = galois_ilog_tables[w][j];
|
||||
galois_ilog_tables[w][j+nwm1[w]*2] = galois_ilog_tables[w][j];
|
||||
}
|
||||
galois_ilog_tables[w] += nwm1[w];
|
||||
return 0;
|
||||
}
|
||||
|
||||
int galois_logtable_multiply(int x, int y, int w)
|
||||
{
|
||||
int sum_j;
|
||||
|
||||
if (x == 0 || y == 0) return 0;
|
||||
|
||||
sum_j = galois_log_tables[w][x] + galois_log_tables[w][y];
|
||||
/* if (sum_j >= nwm1[w]) sum_j -= nwm1[w]; Don't need to do this,
|
||||
because we replicate the ilog table twice. */
|
||||
return galois_ilog_tables[w][sum_j];
|
||||
}
|
||||
|
||||
int galois_logtable_divide(int x, int y, int w)
|
||||
{
|
||||
int sum_j;
|
||||
int z;
|
||||
|
||||
if (y == 0) return -1;
|
||||
if (x == 0) return 0;
|
||||
sum_j = galois_log_tables[w][x] - galois_log_tables[w][y];
|
||||
/* if (sum_j < 0) sum_j += nwm1[w]; Don't need to do this, because we replicate the ilog table twice. */
|
||||
z = galois_ilog_tables[w][sum_j];
|
||||
return z;
|
||||
}
|
||||
|
||||
int galois_create_mult_tables(int w)
|
||||
{
|
||||
int j, x, y, logx;
|
||||
|
||||
if (w >= 14) return -1;
|
||||
|
||||
if (galois_mult_tables[w] != NULL) return 0;
|
||||
galois_mult_tables[w] = (int *) malloc(sizeof(int) * nw[w] * nw[w]);
|
||||
if (galois_mult_tables[w] == NULL) return -1;
|
||||
|
||||
galois_div_tables[w] = (int *) malloc(sizeof(int) * nw[w] * nw[w]);
|
||||
if (galois_div_tables[w] == NULL) {
|
||||
free(galois_mult_tables[w]);
|
||||
galois_mult_tables[w] = NULL;
|
||||
return -1;
|
||||
}
|
||||
if (galois_log_tables[w] == NULL) {
|
||||
if (galois_create_log_tables(w) < 0) {
|
||||
free(galois_mult_tables[w]);
|
||||
free(galois_div_tables[w]);
|
||||
galois_mult_tables[w] = NULL;
|
||||
galois_div_tables[w] = NULL;
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
|
||||
/* Set mult/div tables for x = 0 */
|
||||
j = 0;
|
||||
galois_mult_tables[w][j] = 0; /* y = 0 */
|
||||
galois_div_tables[w][j] = -1;
|
||||
j++;
|
||||
for (y = 1; y < nw[w]; y++) { /* y > 0 */
|
||||
galois_mult_tables[w][j] = 0;
|
||||
galois_div_tables[w][j] = 0;
|
||||
j++;
|
||||
}
|
||||
|
||||
for (x = 1; x < nw[w]; x++) { /* x > 0 */
|
||||
galois_mult_tables[w][j] = 0; /* y = 0 */
|
||||
galois_div_tables[w][j] = -1;
|
||||
j++;
|
||||
logx = galois_log_tables[w][x];
|
||||
for (y = 1; y < nw[w]; y++) { /* y > 0 */
|
||||
galois_mult_tables[w][j] = galois_ilog_tables[w][logx+galois_log_tables[w][y]];
|
||||
galois_div_tables[w][j] = galois_ilog_tables[w][logx-galois_log_tables[w][y]];
|
||||
j++;
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
int galois_ilog(int value, int w)
|
||||
{
|
||||
if (galois_ilog_tables[w] == NULL) {
|
||||
if (galois_create_log_tables(w) < 0) {
|
||||
fprintf(stderr, "Error: galois_ilog - w is too big. Sorry\n");
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
return galois_ilog_tables[w][value];
|
||||
}
|
||||
|
||||
int galois_log(int value, int w)
|
||||
{
|
||||
if (galois_log_tables[w] == NULL) {
|
||||
if (galois_create_log_tables(w) < 0) {
|
||||
fprintf(stderr, "Error: galois_log - w is too big. Sorry\n");
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
return galois_log_tables[w][value];
|
||||
}
|
||||
|
||||
|
||||
int galois_shift_multiply(int x, int y, int w)
|
||||
{
|
||||
int prod;
|
||||
int i, j, ind;
|
||||
int k;
|
||||
int scratch[33];
|
||||
|
||||
prod = 0;
|
||||
for (i = 0; i < w; i++) {
|
||||
scratch[i] = y;
|
||||
if (y & (1 << (w-1))) {
|
||||
y = y << 1;
|
||||
y = (y ^ prim_poly[w]) & nwm1[w];
|
||||
} else {
|
||||
y = y << 1;
|
||||
}
|
||||
}
|
||||
for (i = 0; i < w; i++) {
|
||||
ind = (1 << i);
|
||||
if (ind & x) {
|
||||
j = 1;
|
||||
for (k = 0; k < w; k++) {
|
||||
prod = prod ^ (j & scratch[i]);
|
||||
j = (j << 1);
|
||||
}
|
||||
}
|
||||
}
|
||||
return prod;
|
||||
}
|
||||
|
||||
int galois_single_multiply(int x, int y, int w)
|
||||
{
|
||||
int sum_j;
|
||||
int z;
|
||||
|
||||
if (x == 0 || y == 0) return 0;
|
||||
|
||||
if (mult_type[w] == TABLE) {
|
||||
if (galois_mult_tables[w] == NULL) {
|
||||
if (galois_create_mult_tables(w) < 0) {
|
||||
fprintf(stderr, "ERROR -- cannot make multiplication tables for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
return galois_mult_tables[w][(x<<w)|y];
|
||||
} else if (mult_type[w] == LOGS) {
|
||||
if (galois_log_tables[w] == NULL) {
|
||||
if (galois_create_log_tables(w) < 0) {
|
||||
fprintf(stderr, "ERROR -- cannot make log tables for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
sum_j = galois_log_tables[w][x] + galois_log_tables[w][y];
|
||||
z = galois_ilog_tables[w][sum_j];
|
||||
return z;
|
||||
} else if (mult_type[w] == SPLITW8) {
|
||||
if (galois_split_w8[0] == NULL) {
|
||||
if (galois_create_split_w8_tables() < 0) {
|
||||
fprintf(stderr, "ERROR -- cannot make log split_w8_tables for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
return galois_split_w8_multiply(x, y);
|
||||
} else if (mult_type[w] == SHIFT) {
|
||||
return galois_shift_multiply(x, y, w);
|
||||
}
|
||||
fprintf(stderr, "Galois_single_multiply - no implementation for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
int galois_multtable_multiply(int x, int y, int w)
|
||||
{
|
||||
return galois_mult_tables[w][(x<<w)|y];
|
||||
}
|
||||
|
||||
int galois_single_divide(int a, int b, int w)
|
||||
{
|
||||
int sum_j;
|
||||
|
||||
if (mult_type[w] == TABLE) {
|
||||
if (galois_div_tables[w] == NULL) {
|
||||
if (galois_create_mult_tables(w) < 0) {
|
||||
fprintf(stderr, "ERROR -- cannot make multiplication tables for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
return galois_div_tables[w][(a<<w)|b];
|
||||
} else if (mult_type[w] == LOGS) {
|
||||
if (b == 0) return -1;
|
||||
if (a == 0) return 0;
|
||||
if (galois_log_tables[w] == NULL) {
|
||||
if (galois_create_log_tables(w) < 0) {
|
||||
fprintf(stderr, "ERROR -- cannot make log tables for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
sum_j = galois_log_tables[w][a] - galois_log_tables[w][b];
|
||||
return galois_ilog_tables[w][sum_j];
|
||||
} else {
|
||||
if (b == 0) return -1;
|
||||
if (a == 0) return 0;
|
||||
sum_j = galois_inverse(b, w);
|
||||
return galois_single_multiply(a, sum_j, w);
|
||||
}
|
||||
fprintf(stderr, "Galois_single_divide - no implementation for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
int galois_shift_divide(int a, int b, int w)
|
||||
{
|
||||
int inverse;
|
||||
|
||||
if (b == 0) return -1;
|
||||
if (a == 0) return 0;
|
||||
inverse = galois_shift_inverse(b, w);
|
||||
return galois_shift_multiply(a, inverse, w);
|
||||
}
|
||||
|
||||
int galois_multtable_divide(int x, int y, int w)
|
||||
{
|
||||
return galois_div_tables[w][(x<<w)|y];
|
||||
}
|
||||
|
||||
void galois_w08_region_multiply(char *region, /* Region to multiply */
|
||||
int multby, /* Number to multiply by */
|
||||
int nbytes, /* Number of bytes in region */
|
||||
char *r2, /* If r2 != NULL, products go here */
|
||||
int add)
|
||||
{
|
||||
unsigned char *ur1, *ur2, *cp;
|
||||
unsigned char prod;
|
||||
int i, srow, j;
|
||||
unsigned long l, *lp2;
|
||||
unsigned char *lp;
|
||||
int sol;
|
||||
|
||||
ur1 = (unsigned char *) region;
|
||||
ur2 = (r2 == NULL) ? ur1 : (unsigned char *) r2;
|
||||
|
||||
/* This is used to test its performance with respect to just calling galois_single_multiply
|
||||
if (r2 == NULL || !add) {
|
||||
for (i = 0; i < nbytes; i++) ur2[i] = galois_single_multiply(ur1[i], multby, 8);
|
||||
} else {
|
||||
for (i = 0; i < nbytes; i++) {
|
||||
ur2[i] = (ur2[i]^galois_single_multiply(ur1[i], multby, 8));
|
||||
}
|
||||
}
|
||||
*/
|
||||
|
||||
if (galois_mult_tables[8] == NULL) {
|
||||
if (galois_create_mult_tables(8) < 0) {
|
||||
fprintf(stderr, "galois_08_region_multiply -- couldn't make multiplication tables\n");
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
srow = multby * nw[8];
|
||||
if (r2 == NULL || !add) {
|
||||
for (i = 0; i < nbytes; i++) {
|
||||
prod = galois_mult_tables[8][srow+ur1[i]];
|
||||
ur2[i] = prod;
|
||||
}
|
||||
} else {
|
||||
sol = sizeof(long);
|
||||
lp2 = &l;
|
||||
lp = (unsigned char *) lp2;
|
||||
for (i = 0; i < nbytes; i += sol) {
|
||||
cp = ur2+i;
|
||||
lp2 = (unsigned long *) cp;
|
||||
for (j = 0; j < sol; j++) {
|
||||
prod = galois_mult_tables[8][srow+ur1[i+j]];
|
||||
lp[j] = prod;
|
||||
}
|
||||
*lp2 = (*lp2) ^ l;
|
||||
}
|
||||
}
|
||||
return;
|
||||
}
|
||||
|
||||
void galois_w16_region_multiply(char *region, /* Region to multiply */
|
||||
int multby, /* Number to multiply by */
|
||||
int nbytes, /* Number of bytes in region */
|
||||
char *r2, /* If r2 != NULL, products go here */
|
||||
int add)
|
||||
{
|
||||
unsigned short *ur1, *ur2, *cp;
|
||||
int prod;
|
||||
int i, log1, j, log2;
|
||||
unsigned long l, *lp2, *lptop;
|
||||
unsigned short *lp;
|
||||
int sol;
|
||||
|
||||
ur1 = (unsigned short *) region;
|
||||
ur2 = (r2 == NULL) ? ur1 : (unsigned short *) r2;
|
||||
nbytes /= 2;
|
||||
|
||||
|
||||
/* This is used to test its performance with respect to just calling galois_single_multiply */
|
||||
/*
|
||||
if (r2 == NULL || !add) {
|
||||
for (i = 0; i < nbytes; i++) ur2[i] = galois_single_multiply(ur1[i], multby, 16);
|
||||
} else {
|
||||
for (i = 0; i < nbytes; i++) {
|
||||
ur2[i] = (ur2[i]^galois_single_multiply(ur1[i], multby, 16));
|
||||
}
|
||||
}
|
||||
return;
|
||||
*/
|
||||
|
||||
if (multby == 0) {
|
||||
if (!add) {
|
||||
lp2 = (unsigned long *) ur2;
|
||||
ur2 += nbytes;
|
||||
lptop = (unsigned long *) ur2;
|
||||
while (lp2 < lptop) { *lp2 = 0; lp2++; }
|
||||
}
|
||||
return;
|
||||
}
|
||||
|
||||
if (galois_log_tables[16] == NULL) {
|
||||
if (galois_create_log_tables(16) < 0) {
|
||||
fprintf(stderr, "galois_16_region_multiply -- couldn't make log tables\n");
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
log1 = galois_log_tables[16][multby];
|
||||
|
||||
if (r2 == NULL || !add) {
|
||||
for (i = 0; i < nbytes; i++) {
|
||||
if (ur1[i] == 0) {
|
||||
ur2[i] = 0;
|
||||
} else {
|
||||
prod = galois_log_tables[16][ur1[i]] + log1;
|
||||
ur2[i] = galois_ilog_tables[16][prod];
|
||||
}
|
||||
}
|
||||
} else {
|
||||
sol = sizeof(long)/2;
|
||||
lp2 = &l;
|
||||
lp = (unsigned short *) lp2;
|
||||
for (i = 0; i < nbytes; i += sol) {
|
||||
cp = ur2+i;
|
||||
lp2 = (unsigned long *) cp;
|
||||
for (j = 0; j < sol; j++) {
|
||||
if (ur1[i+j] == 0) {
|
||||
lp[j] = 0;
|
||||
} else {
|
||||
log2 = galois_log_tables[16][ur1[i+j]];
|
||||
prod = log2 + log1;
|
||||
lp[j] = galois_ilog_tables[16][prod];
|
||||
}
|
||||
}
|
||||
*lp2 = (*lp2) ^ l;
|
||||
}
|
||||
}
|
||||
return;
|
||||
}
|
||||
|
||||
/* This will destroy mat, by the way */
|
||||
|
||||
void galois_invert_binary_matrix(int *mat, int *inv, int rows)
|
||||
{
|
||||
int cols, i, j, k;
|
||||
int tmp;
|
||||
|
||||
cols = rows;
|
||||
|
||||
for (i = 0; i < rows; i++) inv[i] = (1 << i);
|
||||
|
||||
/* First -- convert into upper triangular */
|
||||
|
||||
for (i = 0; i < cols; i++) {
|
||||
|
||||
/* Swap rows if we ave a zero i,i element. If we can't swap, then the
|
||||
matrix was not invertible */
|
||||
|
||||
if ((mat[i] & (1 << i)) == 0) {
|
||||
for (j = i+1; j < rows && (mat[j] & (1 << i)) == 0; j++) ;
|
||||
if (j == rows) {
|
||||
fprintf(stderr, "galois_invert_matrix: Matrix not invertible!!\n");
|
||||
exit(1);
|
||||
}
|
||||
tmp = mat[i]; mat[i] = mat[j]; mat[j] = tmp;
|
||||
tmp = inv[i]; inv[i] = inv[j]; inv[j] = tmp;
|
||||
}
|
||||
|
||||
/* Now for each j>i, add A_ji*Ai to Aj */
|
||||
for (j = i+1; j != rows; j++) {
|
||||
if ((mat[j] & (1 << i)) != 0) {
|
||||
mat[j] ^= mat[i];
|
||||
inv[j] ^= inv[i];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* Now the matrix is upper triangular. Start at the top and multiply down */
|
||||
|
||||
for (i = rows-1; i >= 0; i--) {
|
||||
for (j = 0; j < i; j++) {
|
||||
if (mat[j] & (1 << i)) {
|
||||
/* mat[j] ^= mat[i]; */
|
||||
inv[j] ^= inv[i];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int galois_inverse(int y, int w)
|
||||
{
|
||||
|
||||
if (y == 0) return -1;
|
||||
if (mult_type[w] == SHIFT || mult_type[w] == SPLITW8) return galois_shift_inverse(y, w);
|
||||
return galois_single_divide(1, y, w);
|
||||
}
|
||||
|
||||
int galois_shift_inverse(int y, int w)
|
||||
{
|
||||
int mat[1024], mat2[32];
|
||||
int inv[1024], inv2[32];
|
||||
int ind, i, j, k, prod;
|
||||
|
||||
for (i = 0; i < w; i++) {
|
||||
mat2[i] = y;
|
||||
|
||||
if (y & nw[w-1]) {
|
||||
y = y << 1;
|
||||
y = (y ^ prim_poly[w]) & nwm1[w];
|
||||
} else {
|
||||
y = y << 1;
|
||||
}
|
||||
}
|
||||
|
||||
galois_invert_binary_matrix(mat2, inv2, w);
|
||||
|
||||
return inv2[0];
|
||||
}
|
||||
|
||||
int *galois_get_mult_table(int w)
|
||||
{
|
||||
if (galois_mult_tables[w] == NULL) {
|
||||
if (galois_create_mult_tables(w)) {
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
return galois_mult_tables[w];
|
||||
}
|
||||
|
||||
int *galois_get_div_table(int w)
|
||||
{
|
||||
if (galois_mult_tables[w] == NULL) {
|
||||
if (galois_create_mult_tables(w)) {
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
return galois_div_tables[w];
|
||||
}
|
||||
|
||||
int *galois_get_log_table(int w)
|
||||
{
|
||||
if (galois_log_tables[w] == NULL) {
|
||||
if (galois_create_log_tables(w)) {
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
return galois_log_tables[w];
|
||||
}
|
||||
|
||||
int *galois_get_ilog_table(int w)
|
||||
{
|
||||
if (galois_ilog_tables[w] == NULL) {
|
||||
if (galois_create_log_tables(w)) {
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
return galois_ilog_tables[w];
|
||||
}
|
||||
|
||||
void galois_w32_region_multiply(char *region, /* Region to multiply */
|
||||
int multby, /* Number to multiply by */
|
||||
int nbytes, /* Number of bytes in region */
|
||||
char *r2, /* If r2 != NULL, products go here */
|
||||
int add)
|
||||
{
|
||||
unsigned int *ur1, *ur2, *cp, *ur2top;
|
||||
unsigned long *lp2, *lptop;
|
||||
int i, j, a, b, accumulator, i8, j8, k;
|
||||
int acache[4];
|
||||
|
||||
ur1 = (unsigned int *) region;
|
||||
ur2 = (r2 == NULL) ? ur1 : (unsigned int *) r2;
|
||||
nbytes /= sizeof(int);
|
||||
ur2top = ur2 + nbytes;
|
||||
|
||||
if (galois_split_w8[0]== NULL) {
|
||||
if (galois_create_split_w8_tables(8) < 0) {
|
||||
fprintf(stderr, "galois_32_region_multiply -- couldn't make split multiplication tables\n");
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
|
||||
/* If we're overwriting r2, then we can't do better than just calling split_multiply.
|
||||
We'll inline it here to save on the procedure call overhead */
|
||||
|
||||
i8 = 0;
|
||||
for (i = 0; i < 4; i++) {
|
||||
acache[i] = (((multby >> i8) & 255) << 8);
|
||||
i8 += 8;
|
||||
}
|
||||
if (!add) {
|
||||
for (k = 0; k < nbytes; k++) {
|
||||
accumulator = 0;
|
||||
for (i = 0; i < 4; i++) {
|
||||
a = acache[i];
|
||||
j8 = 0;
|
||||
for (j = 0; j < 4; j++) {
|
||||
b = ((ur1[k] >> j8) & 255);
|
||||
accumulator ^= galois_split_w8[i+j][a|b];
|
||||
j8 += 8;
|
||||
}
|
||||
}
|
||||
ur2[k] = accumulator;
|
||||
}
|
||||
} else {
|
||||
for (k = 0; k < nbytes; k++) {
|
||||
accumulator = 0;
|
||||
for (i = 0; i < 4; i++) {
|
||||
a = acache[i];
|
||||
j8 = 0;
|
||||
for (j = 0; j < 4; j++) {
|
||||
b = ((ur1[k] >> j8) & 255);
|
||||
accumulator ^= galois_split_w8[i+j][a|b];
|
||||
j8 += 8;
|
||||
}
|
||||
}
|
||||
ur2[k] = (ur2[k] ^ accumulator);
|
||||
}
|
||||
}
|
||||
return;
|
||||
|
||||
}
|
||||
|
||||
void galois_region_xor( char *r1, /* Region 1 */
|
||||
char *r2, /* Region 2 */
|
||||
char *r3, /* Sum region (r3 = r1 ^ r2) -- can be r1 or r2 */
|
||||
int nbytes) /* Number of bytes in region */
|
||||
{
|
||||
long *l1;
|
||||
long *l2;
|
||||
long *l3;
|
||||
long *ltop;
|
||||
char *ctop;
|
||||
|
||||
ctop = r1 + nbytes;
|
||||
ltop = (long *) ctop;
|
||||
l1 = (long *) r1;
|
||||
l2 = (long *) r2;
|
||||
l3 = (long *) r3;
|
||||
|
||||
while (l1 < ltop) {
|
||||
*l3 = ((*l1) ^ (*l2));
|
||||
l1++;
|
||||
l2++;
|
||||
l3++;
|
||||
}
|
||||
}
|
||||
|
||||
int galois_create_split_w8_tables()
|
||||
{
|
||||
int p1, p2, i, j, p1elt, p2elt, index, ishift, jshift, *table;
|
||||
|
||||
if (galois_split_w8[0] != NULL) return 0;
|
||||
|
||||
if (galois_create_mult_tables(8) < 0) return -1;
|
||||
|
||||
for (i = 0; i < 7; i++) {
|
||||
galois_split_w8[i] = (int *) malloc(sizeof(int) * (1 << 16));
|
||||
if (galois_split_w8[i] == NULL) {
|
||||
for (i--; i >= 0; i--) free(galois_split_w8[i]);
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
|
||||
for (i = 0; i < 4; i += 3) {
|
||||
ishift = i * 8;
|
||||
for (j = ((i == 0) ? 0 : 1) ; j < 4; j++) {
|
||||
jshift = j * 8;
|
||||
table = galois_split_w8[i+j];
|
||||
index = 0;
|
||||
for (p1 = 0; p1 < 256; p1++) {
|
||||
p1elt = (p1 << ishift);
|
||||
for (p2 = 0; p2 < 256; p2++) {
|
||||
p2elt = (p2 << jshift);
|
||||
table[index] = galois_shift_multiply(p1elt, p2elt, 32);
|
||||
index++;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
int galois_split_w8_multiply(int x, int y)
|
||||
{
|
||||
int i, j, a, b, accumulator, i8, j8;
|
||||
|
||||
accumulator = 0;
|
||||
|
||||
i8 = 0;
|
||||
for (i = 0; i < 4; i++) {
|
||||
a = (((x >> i8) & 255) << 8);
|
||||
j8 = 0;
|
||||
for (j = 0; j < 4; j++) {
|
||||
b = ((y >> j8) & 255);
|
||||
accumulator ^= galois_split_w8[i+j][a|b];
|
||||
j8 += 8;
|
||||
}
|
||||
i8 += 8;
|
||||
}
|
||||
return accumulator;
|
||||
}
|
||||
111
galois.h
111
galois.h
|
|
@ -1,111 +0,0 @@
|
|||
/* Galois.h
|
||||
* James S. Plank
|
||||
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
*/
|
||||
|
||||
#ifndef _GALOIS_H
|
||||
#define _GALOIS_H
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
extern int galois_single_multiply(int a, int b, int w);
|
||||
extern int galois_single_divide(int a, int b, int w);
|
||||
extern int galois_log(int value, int w);
|
||||
extern int galois_ilog(int value, int w);
|
||||
|
||||
extern int galois_create_log_tables(int w); /* Returns 0 on success, -1 on failure */
|
||||
extern int galois_logtable_multiply(int x, int y, int w);
|
||||
extern int galois_logtable_divide(int x, int y, int w);
|
||||
|
||||
extern int galois_create_mult_tables(int w); /* Returns 0 on success, -1 on failure */
|
||||
extern int galois_multtable_multiply(int x, int y, int w);
|
||||
extern int galois_multtable_divide(int x, int y, int w);
|
||||
|
||||
extern int galois_shift_multiply(int x, int y, int w);
|
||||
extern int galois_shift_divide(int x, int y, int w);
|
||||
|
||||
extern int galois_create_split_w8_tables();
|
||||
extern int galois_split_w8_multiply(int x, int y);
|
||||
|
||||
extern int galois_inverse(int x, int w);
|
||||
extern int galois_shift_inverse(int y, int w);
|
||||
|
||||
extern int *galois_get_mult_table(int w);
|
||||
extern int *galois_get_div_table(int w);
|
||||
extern int *galois_get_log_table(int w);
|
||||
extern int *galois_get_ilog_table(int w);
|
||||
|
||||
void galois_region_xor( char *r1, /* Region 1 */
|
||||
char *r2, /* Region 2 */
|
||||
char *r3, /* Sum region (r3 = r1 ^ r2) -- can be r1 or r2 */
|
||||
int nbytes); /* Number of bytes in region */
|
||||
|
||||
/* These multiply regions in w=8, w=16 and w=32. They are much faster
|
||||
than calling galois_single_multiply. The regions must be long word aligned. */
|
||||
|
||||
void galois_w08_region_multiply(char *region, /* Region to multiply */
|
||||
int multby, /* Number to multiply by */
|
||||
int nbytes, /* Number of bytes in region */
|
||||
char *r2, /* If r2 != NULL, products go here.
|
||||
Otherwise region is overwritten */
|
||||
int add); /* If (r2 != NULL && add) the produce is XOR'd with r2 */
|
||||
|
||||
void galois_w16_region_multiply(char *region, /* Region to multiply */
|
||||
int multby, /* Number to multiply by */
|
||||
int nbytes, /* Number of bytes in region */
|
||||
char *r2, /* If r2 != NULL, products go here.
|
||||
Otherwise region is overwritten */
|
||||
int add); /* If (r2 != NULL && add) the produce is XOR'd with r2 */
|
||||
|
||||
void galois_w32_region_multiply(char *region, /* Region to multiply */
|
||||
int multby, /* Number to multiply by */
|
||||
int nbytes, /* Number of bytes in region */
|
||||
char *r2, /* If r2 != NULL, products go here.
|
||||
Otherwise region is overwritten */
|
||||
int add); /* If (r2 != NULL && add) the produce is XOR'd with r2 */
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,45 @@
|
|||
/* *
|
||||
* Copyright (c) 2013, 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.
|
||||
*/
|
||||
|
||||
|
||||
extern int *cauchy_original_coding_matrix(int k, int m, int w);
|
||||
extern int *cauchy_xy_coding_matrix(int k, int m, int w, int *x, int *y);
|
||||
extern void cauchy_improve_coding_matrix(int k, int m, int w, int *matrix);
|
||||
extern int *cauchy_good_general_coding_matrix(int k, int m, int w);
|
||||
extern int cauchy_n_ones(int n, int w);
|
||||
|
|
@ -0,0 +1,107 @@
|
|||
/* include/config.h.in. Generated from configure.ac by autoheader. */
|
||||
|
||||
/* Support Altivec instructions */
|
||||
#undef HAVE_ALTIVEC
|
||||
|
||||
/* Support AVX (Advanced Vector Extensions) instructions */
|
||||
#undef HAVE_AVX
|
||||
|
||||
/* Define to 1 if you have the <dlfcn.h> header file. */
|
||||
#undef HAVE_DLFCN_H
|
||||
|
||||
/* Define to 1 if you have the <gf_complete.h> header file. */
|
||||
#undef HAVE_GF_COMPLETE_H
|
||||
|
||||
/* Define to 1 if you have the <gf_general.h> header file. */
|
||||
#undef HAVE_GF_GENERAL_H
|
||||
|
||||
/* Define to 1 if you have the <gf_int.h> header file. */
|
||||
#undef HAVE_GF_INT_H
|
||||
|
||||
/* Define to 1 if you have the <gf_method.h> header file. */
|
||||
#undef HAVE_GF_METHOD_H
|
||||
|
||||
/* Define to 1 if you have the <gf_rand.h> header file. */
|
||||
#undef HAVE_GF_RAND_H
|
||||
|
||||
/* Define to 1 if you have the <inttypes.h> header file. */
|
||||
#undef HAVE_INTTYPES_H
|
||||
|
||||
/* Define to 1 if you have the `gf_complete' library (-lgf_complete). */
|
||||
#undef HAVE_LIBGF_COMPLETE
|
||||
|
||||
/* Define to 1 if you have the <memory.h> header file. */
|
||||
#undef HAVE_MEMORY_H
|
||||
|
||||
/* Support mmx instructions */
|
||||
#undef HAVE_MMX
|
||||
|
||||
/* Support SSE (Streaming SIMD Extensions) instructions */
|
||||
#undef HAVE_SSE
|
||||
|
||||
/* Support SSE2 (Streaming SIMD Extensions 2) instructions */
|
||||
#undef HAVE_SSE2
|
||||
|
||||
/* Support SSE3 (Streaming SIMD Extensions 3) instructions */
|
||||
#undef HAVE_SSE3
|
||||
|
||||
/* Support SSSE4.1 (Streaming SIMD Extensions 4.1) instructions */
|
||||
#undef HAVE_SSE4_1
|
||||
|
||||
/* Support SSSE4.2 (Streaming SIMD Extensions 4.2) instructions */
|
||||
#undef HAVE_SSE4_2
|
||||
|
||||
/* Support SSSE3 (Supplemental Streaming SIMD Extensions 3) instructions */
|
||||
#undef HAVE_SSSE3
|
||||
|
||||
/* Define to 1 if you have the <stdint.h> header file. */
|
||||
#undef HAVE_STDINT_H
|
||||
|
||||
/* Define to 1 if you have the <stdlib.h> header file. */
|
||||
#undef HAVE_STDLIB_H
|
||||
|
||||
/* Define to 1 if you have the <strings.h> header file. */
|
||||
#undef HAVE_STRINGS_H
|
||||
|
||||
/* Define to 1 if you have the <string.h> header file. */
|
||||
#undef HAVE_STRING_H
|
||||
|
||||
/* Define to 1 if you have the <sys/stat.h> header file. */
|
||||
#undef HAVE_SYS_STAT_H
|
||||
|
||||
/* Define to 1 if you have the <sys/types.h> header file. */
|
||||
#undef HAVE_SYS_TYPES_H
|
||||
|
||||
/* Define to 1 if you have the <unistd.h> header file. */
|
||||
#undef HAVE_UNISTD_H
|
||||
|
||||
/* Define to the sub-directory in which libtool stores uninstalled libraries.
|
||||
*/
|
||||
#undef LT_OBJDIR
|
||||
|
||||
/* Name of package */
|
||||
#undef PACKAGE
|
||||
|
||||
/* Define to the address where bug reports for this package should be sent. */
|
||||
#undef PACKAGE_BUGREPORT
|
||||
|
||||
/* Define to the full name of this package. */
|
||||
#undef PACKAGE_NAME
|
||||
|
||||
/* Define to the full name and version of this package. */
|
||||
#undef PACKAGE_STRING
|
||||
|
||||
/* Define to the one symbol short name of this package. */
|
||||
#undef PACKAGE_TARNAME
|
||||
|
||||
/* Define to the home page for this package. */
|
||||
#undef PACKAGE_URL
|
||||
|
||||
/* Define to the version of this package. */
|
||||
#undef PACKAGE_VERSION
|
||||
|
||||
/* Define to 1 if you have the ANSI C header files. */
|
||||
#undef STDC_HEADERS
|
||||
|
||||
/* Version number of package */
|
||||
#undef VERSION
|
||||
|
|
@ -0,0 +1,107 @@
|
|||
/* include/config.h.in. Generated from configure.ac by autoheader. */
|
||||
|
||||
/* Support Altivec instructions */
|
||||
#undef HAVE_ALTIVEC
|
||||
|
||||
/* Support AVX (Advanced Vector Extensions) instructions */
|
||||
#undef HAVE_AVX
|
||||
|
||||
/* Define to 1 if you have the <dlfcn.h> header file. */
|
||||
#undef HAVE_DLFCN_H
|
||||
|
||||
/* Define to 1 if you have the <gf_complete.h> header file. */
|
||||
#undef HAVE_GF_COMPLETE_H
|
||||
|
||||
/* Define to 1 if you have the <gf_general.h> header file. */
|
||||
#undef HAVE_GF_GENERAL_H
|
||||
|
||||
/* Define to 1 if you have the <gf_int.h> header file. */
|
||||
#undef HAVE_GF_INT_H
|
||||
|
||||
/* Define to 1 if you have the <gf_method.h> header file. */
|
||||
#undef HAVE_GF_METHOD_H
|
||||
|
||||
/* Define to 1 if you have the <gf_rand.h> header file. */
|
||||
#undef HAVE_GF_RAND_H
|
||||
|
||||
/* Define to 1 if you have the <inttypes.h> header file. */
|
||||
#undef HAVE_INTTYPES_H
|
||||
|
||||
/* Define to 1 if you have the `gf_complete' library (-lgf_complete). */
|
||||
#undef HAVE_LIBGF_COMPLETE
|
||||
|
||||
/* Define to 1 if you have the <memory.h> header file. */
|
||||
#undef HAVE_MEMORY_H
|
||||
|
||||
/* Support mmx instructions */
|
||||
#undef HAVE_MMX
|
||||
|
||||
/* Support SSE (Streaming SIMD Extensions) instructions */
|
||||
#undef HAVE_SSE
|
||||
|
||||
/* Support SSE2 (Streaming SIMD Extensions 2) instructions */
|
||||
#undef HAVE_SSE2
|
||||
|
||||
/* Support SSE3 (Streaming SIMD Extensions 3) instructions */
|
||||
#undef HAVE_SSE3
|
||||
|
||||
/* Support SSSE4.1 (Streaming SIMD Extensions 4.1) instructions */
|
||||
#undef HAVE_SSE4_1
|
||||
|
||||
/* Support SSSE4.2 (Streaming SIMD Extensions 4.2) instructions */
|
||||
#undef HAVE_SSE4_2
|
||||
|
||||
/* Support SSSE3 (Supplemental Streaming SIMD Extensions 3) instructions */
|
||||
#undef HAVE_SSSE3
|
||||
|
||||
/* Define to 1 if you have the <stdint.h> header file. */
|
||||
#undef HAVE_STDINT_H
|
||||
|
||||
/* Define to 1 if you have the <stdlib.h> header file. */
|
||||
#undef HAVE_STDLIB_H
|
||||
|
||||
/* Define to 1 if you have the <strings.h> header file. */
|
||||
#undef HAVE_STRINGS_H
|
||||
|
||||
/* Define to 1 if you have the <string.h> header file. */
|
||||
#undef HAVE_STRING_H
|
||||
|
||||
/* Define to 1 if you have the <sys/stat.h> header file. */
|
||||
#undef HAVE_SYS_STAT_H
|
||||
|
||||
/* Define to 1 if you have the <sys/types.h> header file. */
|
||||
#undef HAVE_SYS_TYPES_H
|
||||
|
||||
/* Define to 1 if you have the <unistd.h> header file. */
|
||||
#undef HAVE_UNISTD_H
|
||||
|
||||
/* Define to the sub-directory in which libtool stores uninstalled libraries.
|
||||
*/
|
||||
#undef LT_OBJDIR
|
||||
|
||||
/* Name of package */
|
||||
#undef PACKAGE
|
||||
|
||||
/* Define to the address where bug reports for this package should be sent. */
|
||||
#undef PACKAGE_BUGREPORT
|
||||
|
||||
/* Define to the full name of this package. */
|
||||
#undef PACKAGE_NAME
|
||||
|
||||
/* Define to the full name and version of this package. */
|
||||
#undef PACKAGE_STRING
|
||||
|
||||
/* Define to the one symbol short name of this package. */
|
||||
#undef PACKAGE_TARNAME
|
||||
|
||||
/* Define to the home page for this package. */
|
||||
#undef PACKAGE_URL
|
||||
|
||||
/* Define to the version of this package. */
|
||||
#undef PACKAGE_VERSION
|
||||
|
||||
/* Define to 1 if you have the ANSI C header files. */
|
||||
#undef STDC_HEADERS
|
||||
|
||||
/* Version number of package */
|
||||
#undef VERSION
|
||||
|
|
@ -0,0 +1,99 @@
|
|||
/* *
|
||||
* Copyright (c) 2013, 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.
|
||||
*/
|
||||
|
||||
|
||||
#ifndef _GALOIS_H
|
||||
#define _GALOIS_H
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <gf_complete.h>
|
||||
|
||||
extern void galois_change_technique(gf_t *gf, int w);
|
||||
|
||||
extern int galois_single_multiply(int a, int b, int w);
|
||||
extern int galois_single_divide(int a, int b, int w);
|
||||
extern int galois_inverse(int x, int w);
|
||||
|
||||
void galois_region_xor( char *src, /* Source Region */
|
||||
char *dest, /* Dest Region (holds result) */
|
||||
int nbytes); /* Number of bytes in region */
|
||||
|
||||
/* These multiply regions in w=8, w=16 and w=32. They are much faster
|
||||
than calling galois_single_multiply. The regions must be long word aligned. */
|
||||
|
||||
void galois_w08_region_multiply(char *region, /* Region to multiply */
|
||||
int multby, /* Number to multiply by */
|
||||
int nbytes, /* Number of bytes in region */
|
||||
char *r2, /* If r2 != NULL, products go here.
|
||||
Otherwise region is overwritten */
|
||||
int add); /* If (r2 != NULL && add) the produce is XOR'd with r2 */
|
||||
|
||||
void galois_w16_region_multiply(char *region, /* Region to multiply */
|
||||
int multby, /* Number to multiply by */
|
||||
int nbytes, /* Number of bytes in region */
|
||||
char *r2, /* If r2 != NULL, products go here.
|
||||
Otherwise region is overwritten */
|
||||
int add); /* If (r2 != NULL && add) the produce is XOR'd with r2 */
|
||||
|
||||
void galois_w32_region_multiply(char *region, /* Region to multiply */
|
||||
int multby, /* Number to multiply by */
|
||||
int nbytes, /* Number of bytes in region */
|
||||
char *r2, /* If r2 != NULL, products go here.
|
||||
Otherwise region is overwritten */
|
||||
int add); /* If (r2 != NULL && add) the produce is XOR'd with r2 */
|
||||
|
||||
gf_t* galois_init_field(int w,
|
||||
int mult_type,
|
||||
int region_type,
|
||||
int divide_type,
|
||||
uint64_t prim_poly,
|
||||
int arg1,
|
||||
int arg2);
|
||||
|
||||
gf_t* galois_init_composite_field(int w,
|
||||
int region_type,
|
||||
int divide_type,
|
||||
int degree,
|
||||
gf_t* base_gf);
|
||||
|
||||
gf_t * galois_get_field_ptr(int w);
|
||||
|
||||
|
||||
#endif
|
||||
|
|
@ -1,51 +1,43 @@
|
|||
/* jerasure.h - header of kernel procedures
|
||||
* James S. Plank
|
||||
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
/* *
|
||||
* Copyright (c) 2013, 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.
|
||||
*/
|
||||
|
||||
|
||||
#ifndef _JERASURE_H
|
||||
#define _JERASURE_H
|
||||
|
||||
|
|
@ -297,4 +289,6 @@ int *jerasure_matrix_multiply(int *m1, int *m2, int r1, int c1, int r2, int c2,
|
|||
|
||||
void jerasure_get_stats(double *fill_in);
|
||||
|
||||
int jerasure_autoconf_test();
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,47 @@
|
|||
/* *
|
||||
* Copyright (c) 2013, 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.
|
||||
*/
|
||||
|
||||
|
||||
#ifndef _LIBERATION
|
||||
|
||||
extern int *liberation_coding_bitmatrix(int k, int w);
|
||||
extern int *liber8tion_coding_bitmatrix(int k);
|
||||
extern int *blaum_roth_coding_bitmatrix(int k, int w);
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,50 @@
|
|||
/* *
|
||||
* Copyright (c) 2013, 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.
|
||||
*/
|
||||
|
||||
|
||||
extern int *reed_sol_vandermonde_coding_matrix(int k, int m, int w);
|
||||
extern int *reed_sol_extended_vandermonde_matrix(int rows, int cols, int w);
|
||||
extern int *reed_sol_big_vandermonde_distribution_matrix(int rows, int cols, int w);
|
||||
|
||||
extern int reed_sol_r6_encode(int k, int w, char **data_ptrs, char **coding_ptrs, int size);
|
||||
extern int *reed_sol_r6_coding_matrix(int k, int w);
|
||||
|
||||
extern void reed_sol_galois_w08_region_multby_2(char *region, int nbytes);
|
||||
extern void reed_sol_galois_w16_region_multby_2(char *region, int nbytes);
|
||||
extern void reed_sol_galois_w32_region_multby_2(char *region, int nbytes);
|
||||
|
|
@ -0,0 +1,527 @@
|
|||
#!/bin/sh
|
||||
# install - install a program, script, or datafile
|
||||
|
||||
scriptversion=2011-01-19.21; # UTC
|
||||
|
||||
# This originates from X11R5 (mit/util/scripts/install.sh), which was
|
||||
# later released in X11R6 (xc/config/util/install.sh) with the
|
||||
# following copyright and license.
|
||||
#
|
||||
# Copyright (C) 1994 X Consortium
|
||||
#
|
||||
# Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||
# of this software and associated documentation files (the "Software"), to
|
||||
# deal in the Software without restriction, including without limitation the
|
||||
# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
||||
# sell copies of the Software, and to permit persons to whom the Software is
|
||||
# furnished to do so, subject to the following conditions:
|
||||
#
|
||||
# The above copyright notice and this permission notice shall be included in
|
||||
# all copies or substantial portions of the Software.
|
||||
#
|
||||
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||
# X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
|
||||
# AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC-
|
||||
# TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
#
|
||||
# Except as contained in this notice, the name of the X Consortium shall not
|
||||
# be used in advertising or otherwise to promote the sale, use or other deal-
|
||||
# ings in this Software without prior written authorization from the X Consor-
|
||||
# tium.
|
||||
#
|
||||
#
|
||||
# FSF changes to this file are in the public domain.
|
||||
#
|
||||
# Calling this script install-sh is preferred over install.sh, to prevent
|
||||
# `make' implicit rules from creating a file called install from it
|
||||
# when there is no Makefile.
|
||||
#
|
||||
# This script is compatible with the BSD install script, but was written
|
||||
# from scratch.
|
||||
|
||||
nl='
|
||||
'
|
||||
IFS=" "" $nl"
|
||||
|
||||
# set DOITPROG to echo to test this script
|
||||
|
||||
# Don't use :- since 4.3BSD and earlier shells don't like it.
|
||||
doit=${DOITPROG-}
|
||||
if test -z "$doit"; then
|
||||
doit_exec=exec
|
||||
else
|
||||
doit_exec=$doit
|
||||
fi
|
||||
|
||||
# Put in absolute file names if you don't have them in your path;
|
||||
# or use environment vars.
|
||||
|
||||
chgrpprog=${CHGRPPROG-chgrp}
|
||||
chmodprog=${CHMODPROG-chmod}
|
||||
chownprog=${CHOWNPROG-chown}
|
||||
cmpprog=${CMPPROG-cmp}
|
||||
cpprog=${CPPROG-cp}
|
||||
mkdirprog=${MKDIRPROG-mkdir}
|
||||
mvprog=${MVPROG-mv}
|
||||
rmprog=${RMPROG-rm}
|
||||
stripprog=${STRIPPROG-strip}
|
||||
|
||||
posix_glob='?'
|
||||
initialize_posix_glob='
|
||||
test "$posix_glob" != "?" || {
|
||||
if (set -f) 2>/dev/null; then
|
||||
posix_glob=
|
||||
else
|
||||
posix_glob=:
|
||||
fi
|
||||
}
|
||||
'
|
||||
|
||||
posix_mkdir=
|
||||
|
||||
# Desired mode of installed file.
|
||||
mode=0755
|
||||
|
||||
chgrpcmd=
|
||||
chmodcmd=$chmodprog
|
||||
chowncmd=
|
||||
mvcmd=$mvprog
|
||||
rmcmd="$rmprog -f"
|
||||
stripcmd=
|
||||
|
||||
src=
|
||||
dst=
|
||||
dir_arg=
|
||||
dst_arg=
|
||||
|
||||
copy_on_change=false
|
||||
no_target_directory=
|
||||
|
||||
usage="\
|
||||
Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE
|
||||
or: $0 [OPTION]... SRCFILES... DIRECTORY
|
||||
or: $0 [OPTION]... -t DIRECTORY SRCFILES...
|
||||
or: $0 [OPTION]... -d DIRECTORIES...
|
||||
|
||||
In the 1st form, copy SRCFILE to DSTFILE.
|
||||
In the 2nd and 3rd, copy all SRCFILES to DIRECTORY.
|
||||
In the 4th, create DIRECTORIES.
|
||||
|
||||
Options:
|
||||
--help display this help and exit.
|
||||
--version display version info and exit.
|
||||
|
||||
-c (ignored)
|
||||
-C install only if different (preserve the last data modification time)
|
||||
-d create directories instead of installing files.
|
||||
-g GROUP $chgrpprog installed files to GROUP.
|
||||
-m MODE $chmodprog installed files to MODE.
|
||||
-o USER $chownprog installed files to USER.
|
||||
-s $stripprog installed files.
|
||||
-t DIRECTORY install into DIRECTORY.
|
||||
-T report an error if DSTFILE is a directory.
|
||||
|
||||
Environment variables override the default commands:
|
||||
CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG
|
||||
RMPROG STRIPPROG
|
||||
"
|
||||
|
||||
while test $# -ne 0; do
|
||||
case $1 in
|
||||
-c) ;;
|
||||
|
||||
-C) copy_on_change=true;;
|
||||
|
||||
-d) dir_arg=true;;
|
||||
|
||||
-g) chgrpcmd="$chgrpprog $2"
|
||||
shift;;
|
||||
|
||||
--help) echo "$usage"; exit $?;;
|
||||
|
||||
-m) mode=$2
|
||||
case $mode in
|
||||
*' '* | *' '* | *'
|
||||
'* | *'*'* | *'?'* | *'['*)
|
||||
echo "$0: invalid mode: $mode" >&2
|
||||
exit 1;;
|
||||
esac
|
||||
shift;;
|
||||
|
||||
-o) chowncmd="$chownprog $2"
|
||||
shift;;
|
||||
|
||||
-s) stripcmd=$stripprog;;
|
||||
|
||||
-t) dst_arg=$2
|
||||
# Protect names problematic for `test' and other utilities.
|
||||
case $dst_arg in
|
||||
-* | [=\(\)!]) dst_arg=./$dst_arg;;
|
||||
esac
|
||||
shift;;
|
||||
|
||||
-T) no_target_directory=true;;
|
||||
|
||||
--version) echo "$0 $scriptversion"; exit $?;;
|
||||
|
||||
--) shift
|
||||
break;;
|
||||
|
||||
-*) echo "$0: invalid option: $1" >&2
|
||||
exit 1;;
|
||||
|
||||
*) break;;
|
||||
esac
|
||||
shift
|
||||
done
|
||||
|
||||
if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then
|
||||
# When -d is used, all remaining arguments are directories to create.
|
||||
# When -t is used, the destination is already specified.
|
||||
# Otherwise, the last argument is the destination. Remove it from $@.
|
||||
for arg
|
||||
do
|
||||
if test -n "$dst_arg"; then
|
||||
# $@ is not empty: it contains at least $arg.
|
||||
set fnord "$@" "$dst_arg"
|
||||
shift # fnord
|
||||
fi
|
||||
shift # arg
|
||||
dst_arg=$arg
|
||||
# Protect names problematic for `test' and other utilities.
|
||||
case $dst_arg in
|
||||
-* | [=\(\)!]) dst_arg=./$dst_arg;;
|
||||
esac
|
||||
done
|
||||
fi
|
||||
|
||||
if test $# -eq 0; then
|
||||
if test -z "$dir_arg"; then
|
||||
echo "$0: no input file specified." >&2
|
||||
exit 1
|
||||
fi
|
||||
# It's OK to call `install-sh -d' without argument.
|
||||
# This can happen when creating conditional directories.
|
||||
exit 0
|
||||
fi
|
||||
|
||||
if test -z "$dir_arg"; then
|
||||
do_exit='(exit $ret); exit $ret'
|
||||
trap "ret=129; $do_exit" 1
|
||||
trap "ret=130; $do_exit" 2
|
||||
trap "ret=141; $do_exit" 13
|
||||
trap "ret=143; $do_exit" 15
|
||||
|
||||
# Set umask so as not to create temps with too-generous modes.
|
||||
# However, 'strip' requires both read and write access to temps.
|
||||
case $mode in
|
||||
# Optimize common cases.
|
||||
*644) cp_umask=133;;
|
||||
*755) cp_umask=22;;
|
||||
|
||||
*[0-7])
|
||||
if test -z "$stripcmd"; then
|
||||
u_plus_rw=
|
||||
else
|
||||
u_plus_rw='% 200'
|
||||
fi
|
||||
cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;;
|
||||
*)
|
||||
if test -z "$stripcmd"; then
|
||||
u_plus_rw=
|
||||
else
|
||||
u_plus_rw=,u+rw
|
||||
fi
|
||||
cp_umask=$mode$u_plus_rw;;
|
||||
esac
|
||||
fi
|
||||
|
||||
for src
|
||||
do
|
||||
# Protect names problematic for `test' and other utilities.
|
||||
case $src in
|
||||
-* | [=\(\)!]) src=./$src;;
|
||||
esac
|
||||
|
||||
if test -n "$dir_arg"; then
|
||||
dst=$src
|
||||
dstdir=$dst
|
||||
test -d "$dstdir"
|
||||
dstdir_status=$?
|
||||
else
|
||||
|
||||
# Waiting for this to be detected by the "$cpprog $src $dsttmp" command
|
||||
# might cause directories to be created, which would be especially bad
|
||||
# if $src (and thus $dsttmp) contains '*'.
|
||||
if test ! -f "$src" && test ! -d "$src"; then
|
||||
echo "$0: $src does not exist." >&2
|
||||
exit 1
|
||||
fi
|
||||
|
||||
if test -z "$dst_arg"; then
|
||||
echo "$0: no destination specified." >&2
|
||||
exit 1
|
||||
fi
|
||||
dst=$dst_arg
|
||||
|
||||
# If destination is a directory, append the input filename; won't work
|
||||
# if double slashes aren't ignored.
|
||||
if test -d "$dst"; then
|
||||
if test -n "$no_target_directory"; then
|
||||
echo "$0: $dst_arg: Is a directory" >&2
|
||||
exit 1
|
||||
fi
|
||||
dstdir=$dst
|
||||
dst=$dstdir/`basename "$src"`
|
||||
dstdir_status=0
|
||||
else
|
||||
# Prefer dirname, but fall back on a substitute if dirname fails.
|
||||
dstdir=`
|
||||
(dirname "$dst") 2>/dev/null ||
|
||||
expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
|
||||
X"$dst" : 'X\(//\)[^/]' \| \
|
||||
X"$dst" : 'X\(//\)$' \| \
|
||||
X"$dst" : 'X\(/\)' \| . 2>/dev/null ||
|
||||
echo X"$dst" |
|
||||
sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
|
||||
s//\1/
|
||||
q
|
||||
}
|
||||
/^X\(\/\/\)[^/].*/{
|
||||
s//\1/
|
||||
q
|
||||
}
|
||||
/^X\(\/\/\)$/{
|
||||
s//\1/
|
||||
q
|
||||
}
|
||||
/^X\(\/\).*/{
|
||||
s//\1/
|
||||
q
|
||||
}
|
||||
s/.*/./; q'
|
||||
`
|
||||
|
||||
test -d "$dstdir"
|
||||
dstdir_status=$?
|
||||
fi
|
||||
fi
|
||||
|
||||
obsolete_mkdir_used=false
|
||||
|
||||
if test $dstdir_status != 0; then
|
||||
case $posix_mkdir in
|
||||
'')
|
||||
# Create intermediate dirs using mode 755 as modified by the umask.
|
||||
# This is like FreeBSD 'install' as of 1997-10-28.
|
||||
umask=`umask`
|
||||
case $stripcmd.$umask in
|
||||
# Optimize common cases.
|
||||
*[2367][2367]) mkdir_umask=$umask;;
|
||||
.*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;;
|
||||
|
||||
*[0-7])
|
||||
mkdir_umask=`expr $umask + 22 \
|
||||
- $umask % 100 % 40 + $umask % 20 \
|
||||
- $umask % 10 % 4 + $umask % 2
|
||||
`;;
|
||||
*) mkdir_umask=$umask,go-w;;
|
||||
esac
|
||||
|
||||
# With -d, create the new directory with the user-specified mode.
|
||||
# Otherwise, rely on $mkdir_umask.
|
||||
if test -n "$dir_arg"; then
|
||||
mkdir_mode=-m$mode
|
||||
else
|
||||
mkdir_mode=
|
||||
fi
|
||||
|
||||
posix_mkdir=false
|
||||
case $umask in
|
||||
*[123567][0-7][0-7])
|
||||
# POSIX mkdir -p sets u+wx bits regardless of umask, which
|
||||
# is incompatible with FreeBSD 'install' when (umask & 300) != 0.
|
||||
;;
|
||||
*)
|
||||
tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$
|
||||
trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0
|
||||
|
||||
if (umask $mkdir_umask &&
|
||||
exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1
|
||||
then
|
||||
if test -z "$dir_arg" || {
|
||||
# Check for POSIX incompatibilities with -m.
|
||||
# HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or
|
||||
# other-writeable bit of parent directory when it shouldn't.
|
||||
# FreeBSD 6.1 mkdir -m -p sets mode of existing directory.
|
||||
ls_ld_tmpdir=`ls -ld "$tmpdir"`
|
||||
case $ls_ld_tmpdir in
|
||||
d????-?r-*) different_mode=700;;
|
||||
d????-?--*) different_mode=755;;
|
||||
*) false;;
|
||||
esac &&
|
||||
$mkdirprog -m$different_mode -p -- "$tmpdir" && {
|
||||
ls_ld_tmpdir_1=`ls -ld "$tmpdir"`
|
||||
test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1"
|
||||
}
|
||||
}
|
||||
then posix_mkdir=:
|
||||
fi
|
||||
rmdir "$tmpdir/d" "$tmpdir"
|
||||
else
|
||||
# Remove any dirs left behind by ancient mkdir implementations.
|
||||
rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null
|
||||
fi
|
||||
trap '' 0;;
|
||||
esac;;
|
||||
esac
|
||||
|
||||
if
|
||||
$posix_mkdir && (
|
||||
umask $mkdir_umask &&
|
||||
$doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir"
|
||||
)
|
||||
then :
|
||||
else
|
||||
|
||||
# The umask is ridiculous, or mkdir does not conform to POSIX,
|
||||
# or it failed possibly due to a race condition. Create the
|
||||
# directory the slow way, step by step, checking for races as we go.
|
||||
|
||||
case $dstdir in
|
||||
/*) prefix='/';;
|
||||
[-=\(\)!]*) prefix='./';;
|
||||
*) prefix='';;
|
||||
esac
|
||||
|
||||
eval "$initialize_posix_glob"
|
||||
|
||||
oIFS=$IFS
|
||||
IFS=/
|
||||
$posix_glob set -f
|
||||
set fnord $dstdir
|
||||
shift
|
||||
$posix_glob set +f
|
||||
IFS=$oIFS
|
||||
|
||||
prefixes=
|
||||
|
||||
for d
|
||||
do
|
||||
test X"$d" = X && continue
|
||||
|
||||
prefix=$prefix$d
|
||||
if test -d "$prefix"; then
|
||||
prefixes=
|
||||
else
|
||||
if $posix_mkdir; then
|
||||
(umask=$mkdir_umask &&
|
||||
$doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break
|
||||
# Don't fail if two instances are running concurrently.
|
||||
test -d "$prefix" || exit 1
|
||||
else
|
||||
case $prefix in
|
||||
*\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;;
|
||||
*) qprefix=$prefix;;
|
||||
esac
|
||||
prefixes="$prefixes '$qprefix'"
|
||||
fi
|
||||
fi
|
||||
prefix=$prefix/
|
||||
done
|
||||
|
||||
if test -n "$prefixes"; then
|
||||
# Don't fail if two instances are running concurrently.
|
||||
(umask $mkdir_umask &&
|
||||
eval "\$doit_exec \$mkdirprog $prefixes") ||
|
||||
test -d "$dstdir" || exit 1
|
||||
obsolete_mkdir_used=true
|
||||
fi
|
||||
fi
|
||||
fi
|
||||
|
||||
if test -n "$dir_arg"; then
|
||||
{ test -z "$chowncmd" || $doit $chowncmd "$dst"; } &&
|
||||
{ test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } &&
|
||||
{ test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false ||
|
||||
test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1
|
||||
else
|
||||
|
||||
# Make a couple of temp file names in the proper directory.
|
||||
dsttmp=$dstdir/_inst.$$_
|
||||
rmtmp=$dstdir/_rm.$$_
|
||||
|
||||
# Trap to clean up those temp files at exit.
|
||||
trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0
|
||||
|
||||
# Copy the file name to the temp name.
|
||||
(umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") &&
|
||||
|
||||
# and set any options; do chmod last to preserve setuid bits.
|
||||
#
|
||||
# If any of these fail, we abort the whole thing. If we want to
|
||||
# ignore errors from any of these, just make sure not to ignore
|
||||
# errors from the above "$doit $cpprog $src $dsttmp" command.
|
||||
#
|
||||
{ test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } &&
|
||||
{ test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } &&
|
||||
{ test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } &&
|
||||
{ test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } &&
|
||||
|
||||
# If -C, don't bother to copy if it wouldn't change the file.
|
||||
if $copy_on_change &&
|
||||
old=`LC_ALL=C ls -dlL "$dst" 2>/dev/null` &&
|
||||
new=`LC_ALL=C ls -dlL "$dsttmp" 2>/dev/null` &&
|
||||
|
||||
eval "$initialize_posix_glob" &&
|
||||
$posix_glob set -f &&
|
||||
set X $old && old=:$2:$4:$5:$6 &&
|
||||
set X $new && new=:$2:$4:$5:$6 &&
|
||||
$posix_glob set +f &&
|
||||
|
||||
test "$old" = "$new" &&
|
||||
$cmpprog "$dst" "$dsttmp" >/dev/null 2>&1
|
||||
then
|
||||
rm -f "$dsttmp"
|
||||
else
|
||||
# Rename the file to the real destination.
|
||||
$doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null ||
|
||||
|
||||
# The rename failed, perhaps because mv can't rename something else
|
||||
# to itself, or perhaps because mv is so ancient that it does not
|
||||
# support -f.
|
||||
{
|
||||
# Now remove or move aside any old file at destination location.
|
||||
# We try this two ways since rm can't unlink itself on some
|
||||
# systems and the destination file might be busy for other
|
||||
# reasons. In this case, the final cleanup might fail but the new
|
||||
# file should still install successfully.
|
||||
{
|
||||
test ! -f "$dst" ||
|
||||
$doit $rmcmd -f "$dst" 2>/dev/null ||
|
||||
{ $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null &&
|
||||
{ $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; }
|
||||
} ||
|
||||
{ echo "$0: cannot unlink or rename $dst" >&2
|
||||
(exit 1); exit 1
|
||||
}
|
||||
} &&
|
||||
|
||||
# Now rename the file to the real destination.
|
||||
$doit $mvcmd "$dsttmp" "$dst"
|
||||
}
|
||||
fi || exit 1
|
||||
|
||||
trap '' 0
|
||||
fi
|
||||
done
|
||||
|
||||
# Local variables:
|
||||
# eval: (add-hook 'write-file-hooks 'time-stamp)
|
||||
# time-stamp-start: "scriptversion="
|
||||
# time-stamp-format: "%:y-%02m-%02d.%02H"
|
||||
# time-stamp-time-zone: "UTC"
|
||||
# time-stamp-end: "; # UTC"
|
||||
# End:
|
||||
|
|
@ -0,0 +1,72 @@
|
|||
# ===========================================================================
|
||||
# http://www.gnu.org/software/autoconf-archive/ax_check_compile_flag.html
|
||||
# ===========================================================================
|
||||
#
|
||||
# SYNOPSIS
|
||||
#
|
||||
# AX_CHECK_COMPILE_FLAG(FLAG, [ACTION-SUCCESS], [ACTION-FAILURE], [EXTRA-FLAGS])
|
||||
#
|
||||
# DESCRIPTION
|
||||
#
|
||||
# Check whether the given FLAG works with the current language's compiler
|
||||
# or gives an error. (Warnings, however, are ignored)
|
||||
#
|
||||
# ACTION-SUCCESS/ACTION-FAILURE are shell commands to execute on
|
||||
# success/failure.
|
||||
#
|
||||
# If EXTRA-FLAGS is defined, it is added to the current language's default
|
||||
# flags (e.g. CFLAGS) when the check is done. The check is thus made with
|
||||
# the flags: "CFLAGS EXTRA-FLAGS FLAG". This can for example be used to
|
||||
# force the compiler to issue an error when a bad flag is given.
|
||||
#
|
||||
# NOTE: Implementation based on AX_CFLAGS_GCC_OPTION. Please keep this
|
||||
# macro in sync with AX_CHECK_{PREPROC,LINK}_FLAG.
|
||||
#
|
||||
# LICENSE
|
||||
#
|
||||
# Copyright (c) 2008 Guido U. Draheim <guidod@gmx.de>
|
||||
# Copyright (c) 2011 Maarten Bosmans <mkbosmans@gmail.com>
|
||||
#
|
||||
# This program is free software: you can redistribute it and/or modify it
|
||||
# under the terms of the GNU General Public License as published by the
|
||||
# Free Software Foundation, either version 3 of the License, or (at your
|
||||
# option) any later version.
|
||||
#
|
||||
# This program is distributed in the hope that it will be useful, but
|
||||
# WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
|
||||
# Public License for more details.
|
||||
#
|
||||
# You should have received a copy of the GNU General Public License along
|
||||
# with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
#
|
||||
# As a special exception, the respective Autoconf Macro's copyright owner
|
||||
# gives unlimited permission to copy, distribute and modify the configure
|
||||
# scripts that are the output of Autoconf when processing the Macro. You
|
||||
# need not follow the terms of the GNU General Public License when using
|
||||
# or distributing such scripts, even though portions of the text of the
|
||||
# Macro appear in them. The GNU General Public License (GPL) does govern
|
||||
# all other use of the material that constitutes the Autoconf Macro.
|
||||
#
|
||||
# This special exception to the GPL applies to versions of the Autoconf
|
||||
# Macro released by the Autoconf Archive. When you make and distribute a
|
||||
# modified version of the Autoconf Macro, you may extend this special
|
||||
# exception to the GPL to apply to your modified version as well.
|
||||
|
||||
#serial 2
|
||||
|
||||
AC_DEFUN([AX_CHECK_COMPILE_FLAG],
|
||||
[AC_PREREQ(2.59)dnl for _AC_LANG_PREFIX
|
||||
AS_VAR_PUSHDEF([CACHEVAR],[ax_cv_check_[]_AC_LANG_ABBREV[]flags_$4_$1])dnl
|
||||
AC_CACHE_CHECK([whether _AC_LANG compiler accepts $1], CACHEVAR, [
|
||||
ax_check_save_flags=$[]_AC_LANG_PREFIX[]FLAGS
|
||||
_AC_LANG_PREFIX[]FLAGS="$[]_AC_LANG_PREFIX[]FLAGS $4 $1"
|
||||
AC_COMPILE_IFELSE([AC_LANG_PROGRAM()],
|
||||
[AS_VAR_SET(CACHEVAR,[yes])],
|
||||
[AS_VAR_SET(CACHEVAR,[no])])
|
||||
_AC_LANG_PREFIX[]FLAGS=$ax_check_save_flags])
|
||||
AS_IF([test x"AS_VAR_GET(CACHEVAR)" = xyes],
|
||||
[m4_default([$2], :)],
|
||||
[m4_default([$3], :)])
|
||||
AS_VAR_POPDEF([CACHEVAR])dnl
|
||||
])dnl AX_CHECK_COMPILE_FLAGS
|
||||
|
|
@ -0,0 +1,245 @@
|
|||
#
|
||||
# Updated by KMG to support -DINTEL_SSE for GF-Complete
|
||||
#
|
||||
# ===========================================================================
|
||||
# http://www.gnu.org/software/autoconf-archive/ax_ext.html
|
||||
# ===========================================================================
|
||||
#
|
||||
# SYNOPSIS
|
||||
#
|
||||
# AX_EXT
|
||||
#
|
||||
# DESCRIPTION
|
||||
#
|
||||
# Find supported SIMD extensions by requesting cpuid. When an SIMD
|
||||
# extension is found, the -m"simdextensionname" is added to SIMD_FLAGS if
|
||||
# compiler supports it. For example, if "sse2" is available, then "-msse2"
|
||||
# is added to SIMD_FLAGS.
|
||||
#
|
||||
# This macro calls:
|
||||
#
|
||||
# AC_SUBST(SIMD_FLAGS)
|
||||
#
|
||||
# And defines:
|
||||
#
|
||||
# HAVE_MMX / HAVE_SSE / HAVE_SSE2 / HAVE_SSE3 / HAVE_SSSE3 / HAVE_SSE4.1 / HAVE_SSE4.2 / HAVE_AVX
|
||||
#
|
||||
# LICENSE
|
||||
#
|
||||
# Copyright (c) 2007 Christophe Tournayre <turn3r@users.sourceforge.net>
|
||||
# Copyright (c) 2013 Michael Petch <mpetch@capp-sysware.com>
|
||||
#
|
||||
# Copying and distribution of this file, with or without modification, are
|
||||
# permitted in any medium without royalty provided the copyright notice
|
||||
# and this notice are preserved. This file is offered as-is, without any
|
||||
# warranty.
|
||||
|
||||
#serial 12
|
||||
|
||||
AC_DEFUN([AX_EXT],
|
||||
[
|
||||
AC_REQUIRE([AC_CANONICAL_HOST])
|
||||
|
||||
case $host_cpu in
|
||||
powerpc*)
|
||||
AC_CACHE_CHECK([whether altivec is supported], [ax_cv_have_altivec_ext],
|
||||
[
|
||||
if test `/usr/sbin/sysctl -a 2>/dev/null| grep -c hw.optional.altivec` != 0; then
|
||||
if test `/usr/sbin/sysctl -n hw.optional.altivec` = 1; then
|
||||
ax_cv_have_altivec_ext=yes
|
||||
fi
|
||||
fi
|
||||
])
|
||||
|
||||
if test "$ax_cv_have_altivec_ext" = yes; then
|
||||
AC_DEFINE(HAVE_ALTIVEC,,[Support Altivec instructions])
|
||||
AX_CHECK_COMPILE_FLAG(-faltivec, SIMD_FLAGS="$SIMD_FLAGS -faltivec", [])
|
||||
fi
|
||||
;;
|
||||
|
||||
|
||||
i[[3456]]86*|x86_64*|amd64*)
|
||||
|
||||
AC_REQUIRE([AX_GCC_X86_CPUID])
|
||||
AC_REQUIRE([AX_GCC_X86_AVX_XGETBV])
|
||||
|
||||
AX_GCC_X86_CPUID(0x00000001)
|
||||
ecx=`echo $ax_cv_gcc_x86_cpuid_0x00000001 | cut -d ":" -f 3`
|
||||
edx=`echo $ax_cv_gcc_x86_cpuid_0x00000001 | cut -d ":" -f 4`
|
||||
|
||||
AC_CACHE_CHECK([whether mmx is supported], [ax_cv_have_mmx_ext],
|
||||
[
|
||||
ax_cv_have_mmx_ext=no
|
||||
if test "$((0x$edx>>23&0x01))" = 1; then
|
||||
ax_cv_have_mmx_ext=yes
|
||||
fi
|
||||
])
|
||||
|
||||
AC_CACHE_CHECK([whether sse is supported], [ax_cv_have_sse_ext],
|
||||
[
|
||||
ax_cv_have_sse_ext=no
|
||||
if test "$((0x$edx>>25&0x01))" = 1; then
|
||||
ax_cv_have_sse_ext=yes
|
||||
fi
|
||||
])
|
||||
|
||||
AC_CACHE_CHECK([whether sse2 is supported], [ax_cv_have_sse2_ext],
|
||||
[
|
||||
ax_cv_have_sse2_ext=no
|
||||
if test "$((0x$edx>>26&0x01))" = 1; then
|
||||
ax_cv_have_sse2_ext=yes
|
||||
fi
|
||||
])
|
||||
|
||||
AC_CACHE_CHECK([whether sse3 is supported], [ax_cv_have_sse3_ext],
|
||||
[
|
||||
ax_cv_have_sse3_ext=no
|
||||
if test "$((0x$ecx&0x01))" = 1; then
|
||||
ax_cv_have_sse3_ext=yes
|
||||
fi
|
||||
])
|
||||
|
||||
AC_CACHE_CHECK([whether ssse3 is supported], [ax_cv_have_ssse3_ext],
|
||||
[
|
||||
ax_cv_have_ssse3_ext=no
|
||||
if test "$((0x$ecx>>9&0x01))" = 1; then
|
||||
ax_cv_have_ssse3_ext=yes
|
||||
fi
|
||||
])
|
||||
|
||||
AC_CACHE_CHECK([whether sse4.1 is supported], [ax_cv_have_sse41_ext],
|
||||
[
|
||||
ax_cv_have_sse41_ext=no
|
||||
if test "$((0x$ecx>>19&0x01))" = 1; then
|
||||
ax_cv_have_sse41_ext=yes
|
||||
fi
|
||||
])
|
||||
|
||||
AC_CACHE_CHECK([whether sse4.2 is supported], [ax_cv_have_sse42_ext],
|
||||
[
|
||||
ax_cv_have_sse42_ext=no
|
||||
if test "$((0x$ecx>>20&0x01))" = 1; then
|
||||
ax_cv_have_sse42_ext=yes
|
||||
fi
|
||||
])
|
||||
|
||||
AC_CACHE_CHECK([whether avx is supported by processor], [ax_cv_have_avx_cpu_ext],
|
||||
[
|
||||
ax_cv_have_avx_cpu_ext=no
|
||||
if test "$((0x$ecx>>28&0x01))" = 1; then
|
||||
ax_cv_have_avx_cpu_ext=yes
|
||||
fi
|
||||
])
|
||||
|
||||
if test x"$ax_cv_have_avx_cpu_ext" = x"yes"; then
|
||||
AX_GCC_X86_AVX_XGETBV(0x00000000)
|
||||
|
||||
xgetbv_eax="0"
|
||||
if test x"$ax_cv_gcc_x86_avx_xgetbv_0x00000000" != x"unknown"; then
|
||||
xgetbv_eax=`echo $ax_cv_gcc_x86_avx_xgetbv_0x00000000 | cut -d ":" -f 1`
|
||||
fi
|
||||
|
||||
AC_CACHE_CHECK([whether avx is supported by operating system], [ax_cv_have_avx_ext],
|
||||
[
|
||||
ax_cv_have_avx_ext=no
|
||||
|
||||
if test "$((0x$ecx>>27&0x01))" = 1; then
|
||||
if test "$((0x$xgetbv_eax&0x6))" = 6; then
|
||||
ax_cv_have_avx_ext=yes
|
||||
fi
|
||||
fi
|
||||
])
|
||||
if test x"$ax_cv_have_avx_ext" = x"no"; then
|
||||
AC_MSG_WARN([Your processor supports AVX, but your operating system doesn't])
|
||||
fi
|
||||
fi
|
||||
|
||||
if test "$ax_cv_have_mmx_ext" = yes; then
|
||||
AX_CHECK_COMPILE_FLAG(-mmmx, ax_cv_support_mmx_ext=yes, [])
|
||||
if test x"$ax_cv_support_mmx_ext" = x"yes"; then
|
||||
SIMD_FLAGS="$SIMD_FLAGS -mmmx"
|
||||
AC_DEFINE(HAVE_MMX,,[Support mmx instructions])
|
||||
else
|
||||
AC_MSG_WARN([Your processor supports mmx instructions but not your compiler, can you try another compiler?])
|
||||
fi
|
||||
fi
|
||||
|
||||
if test "$ac_cv_sizeof_long" -eq 8; then
|
||||
SIMD_FLAGS="$SIMD_FLAGS -DARCH_64"
|
||||
fi
|
||||
|
||||
if test "$ax_cv_have_sse_ext" = yes; then
|
||||
AX_CHECK_COMPILE_FLAG(-msse, ax_cv_support_sse_ext=yes, [])
|
||||
if test x"$ax_cv_support_sse_ext" = x"yes"; then
|
||||
SIMD_FLAGS="$SIMD_FLAGS -msse -DINTEL_SSE"
|
||||
AC_DEFINE(HAVE_SSE,,[Support SSE (Streaming SIMD Extensions) instructions])
|
||||
else
|
||||
AC_MSG_WARN([Your processor supports sse instructions but not your compiler, can you try another compiler?])
|
||||
fi
|
||||
fi
|
||||
|
||||
if test "$ax_cv_have_sse2_ext" = yes; then
|
||||
AX_CHECK_COMPILE_FLAG(-msse2, ax_cv_support_sse2_ext=yes, [])
|
||||
if test x"$ax_cv_support_sse2_ext" = x"yes"; then
|
||||
SIMD_FLAGS="$SIMD_FLAGS -msse2 -DINTEL_SSE2"
|
||||
AC_DEFINE(HAVE_SSE2,,[Support SSE2 (Streaming SIMD Extensions 2) instructions])
|
||||
else
|
||||
AC_MSG_WARN([Your processor supports sse2 instructions but not your compiler, can you try another compiler?])
|
||||
fi
|
||||
fi
|
||||
|
||||
if test "$ax_cv_have_sse3_ext" = yes; then
|
||||
AX_CHECK_COMPILE_FLAG(-msse3, ax_cv_support_sse3_ext=yes, [])
|
||||
if test x"$ax_cv_support_sse3_ext" = x"yes"; then
|
||||
SIMD_FLAGS="$SIMD_FLAGS -msse3 -DINTEL_SSE3"
|
||||
AC_DEFINE(HAVE_SSE3,,[Support SSE3 (Streaming SIMD Extensions 3) instructions])
|
||||
else
|
||||
AC_MSG_WARN([Your processor supports sse3 instructions but not your compiler, can you try another compiler?])
|
||||
fi
|
||||
fi
|
||||
|
||||
if test "$ax_cv_have_ssse3_ext" = yes; then
|
||||
AX_CHECK_COMPILE_FLAG(-mssse3, ax_cv_support_ssse3_ext=yes, [])
|
||||
if test x"$ax_cv_support_ssse3_ext" = x"yes"; then
|
||||
SIMD_FLAGS="$SIMD_FLAGS -mssse3"
|
||||
AC_DEFINE(HAVE_SSSE3,,[Support SSSE3 (Supplemental Streaming SIMD Extensions 3) instructions])
|
||||
else
|
||||
AC_MSG_WARN([Your processor supports ssse3 instructions but not your compiler, can you try another compiler?])
|
||||
fi
|
||||
fi
|
||||
|
||||
if test "$ax_cv_have_sse41_ext" = yes; then
|
||||
AX_CHECK_COMPILE_FLAG(-msse4.1, ax_cv_support_sse41_ext=yes, [])
|
||||
if test x"$ax_cv_support_sse41_ext" = x"yes"; then
|
||||
SIMD_FLAGS="$SIMD_FLAGS -msse4.1 -DINTEL_SSE4"
|
||||
AC_DEFINE(HAVE_SSE4_1,,[Support SSSE4.1 (Streaming SIMD Extensions 4.1) instructions])
|
||||
else
|
||||
AC_MSG_WARN([Your processor supports sse4.1 instructions but not your compiler, can you try another compiler?])
|
||||
fi
|
||||
fi
|
||||
|
||||
if test "$ax_cv_have_sse42_ext" = yes; then
|
||||
AX_CHECK_COMPILE_FLAG(-msse4.2, ax_cv_support_sse42_ext=yes, [])
|
||||
if test x"$ax_cv_support_sse42_ext" = x"yes"; then
|
||||
SIMD_FLAGS="$SIMD_FLAGS -msse4.2 -DINTEL_SSE4"
|
||||
AC_DEFINE(HAVE_SSE4_2,,[Support SSSE4.2 (Streaming SIMD Extensions 4.2) instructions])
|
||||
else
|
||||
AC_MSG_WARN([Your processor supports sse4.2 instructions but not your compiler, can you try another compiler?])
|
||||
fi
|
||||
fi
|
||||
|
||||
if test "$ax_cv_have_avx_ext" = yes; then
|
||||
AX_CHECK_COMPILE_FLAG(-mavx, ax_cv_support_avx_ext=yes, [])
|
||||
if test x"$ax_cv_support_avx_ext" = x"yes"; then
|
||||
SIMD_FLAGS="$SIMD_FLAGS -mavx"
|
||||
AC_DEFINE(HAVE_AVX,,[Support AVX (Advanced Vector Extensions) instructions])
|
||||
else
|
||||
AC_MSG_WARN([Your processor supports avx instructions but not your compiler, can you try another compiler?])
|
||||
fi
|
||||
fi
|
||||
|
||||
;;
|
||||
esac
|
||||
|
||||
AC_SUBST(SIMD_FLAGS)
|
||||
])
|
||||
|
|
@ -0,0 +1,79 @@
|
|||
# ===========================================================================
|
||||
# http://www.gnu.org/software/autoconf-archive/ax_gcc_x86_avx_xgetbv.html
|
||||
# ===========================================================================
|
||||
#
|
||||
# SYNOPSIS
|
||||
#
|
||||
# AX_GCC_X86_AVX_XGETBV
|
||||
#
|
||||
# DESCRIPTION
|
||||
#
|
||||
# On later x86 processors with AVX SIMD support, with gcc or a compiler
|
||||
# that has a compatible syntax for inline assembly instructions, run a
|
||||
# small program that executes the xgetbv instruction with input OP. This
|
||||
# can be used to detect if the OS supports AVX instruction usage.
|
||||
#
|
||||
# On output, the values of the eax and edx registers are stored as
|
||||
# hexadecimal strings as "eax:edx" in the cache variable
|
||||
# ax_cv_gcc_x86_avx_xgetbv.
|
||||
#
|
||||
# If the xgetbv instruction fails (because you are running a
|
||||
# cross-compiler, or because you are not using gcc, or because you are on
|
||||
# a processor that doesn't have this instruction),
|
||||
# ax_cv_gcc_x86_avx_xgetbv_OP is set to the string "unknown".
|
||||
#
|
||||
# This macro mainly exists to be used in AX_EXT.
|
||||
#
|
||||
# LICENSE
|
||||
#
|
||||
# Copyright (c) 2013 Michael Petch <mpetch@capp-sysware.com>
|
||||
#
|
||||
# This program is free software: you can redistribute it and/or modify it
|
||||
# under the terms of the GNU General Public License as published by the
|
||||
# Free Software Foundation, either version 3 of the License, or (at your
|
||||
# option) any later version.
|
||||
#
|
||||
# This program is distributed in the hope that it will be useful, but
|
||||
# WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
|
||||
# Public License for more details.
|
||||
#
|
||||
# You should have received a copy of the GNU General Public License along
|
||||
# with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
#
|
||||
# As a special exception, the respective Autoconf Macro's copyright owner
|
||||
# gives unlimited permission to copy, distribute and modify the configure
|
||||
# scripts that are the output of Autoconf when processing the Macro. You
|
||||
# need not follow the terms of the GNU General Public License when using
|
||||
# or distributing such scripts, even though portions of the text of the
|
||||
# Macro appear in them. The GNU General Public License (GPL) does govern
|
||||
# all other use of the material that constitutes the Autoconf Macro.
|
||||
#
|
||||
# This special exception to the GPL applies to versions of the Autoconf
|
||||
# Macro released by the Autoconf Archive. When you make and distribute a
|
||||
# modified version of the Autoconf Macro, you may extend this special
|
||||
# exception to the GPL to apply to your modified version as well.
|
||||
|
||||
#serial 1
|
||||
|
||||
AC_DEFUN([AX_GCC_X86_AVX_XGETBV],
|
||||
[AC_REQUIRE([AC_PROG_CC])
|
||||
AC_LANG_PUSH([C])
|
||||
AC_CACHE_CHECK(for x86-AVX xgetbv $1 output, ax_cv_gcc_x86_avx_xgetbv_$1,
|
||||
[AC_RUN_IFELSE([AC_LANG_PROGRAM([#include <stdio.h>], [
|
||||
int op = $1, eax, edx;
|
||||
FILE *f;
|
||||
/* Opcodes for xgetbv */
|
||||
__asm__(".byte 0x0f, 0x01, 0xd0"
|
||||
: "=a" (eax), "=d" (edx)
|
||||
: "c" (op));
|
||||
f = fopen("conftest_xgetbv", "w"); if (!f) return 1;
|
||||
fprintf(f, "%x:%x\n", eax, edx);
|
||||
fclose(f);
|
||||
return 0;
|
||||
])],
|
||||
[ax_cv_gcc_x86_avx_xgetbv_$1=`cat conftest_xgetbv`; rm -f conftest_xgetbv],
|
||||
[ax_cv_gcc_x86_avx_xgetbv_$1=unknown; rm -f conftest_xgetbv],
|
||||
[ax_cv_gcc_x86_avx_xgetbv_$1=unknown])])
|
||||
AC_LANG_POP([C])
|
||||
])
|
||||
|
|
@ -0,0 +1,79 @@
|
|||
# ===========================================================================
|
||||
# http://www.gnu.org/software/autoconf-archive/ax_gcc_x86_cpuid.html
|
||||
# ===========================================================================
|
||||
#
|
||||
# SYNOPSIS
|
||||
#
|
||||
# AX_GCC_X86_CPUID(OP)
|
||||
#
|
||||
# DESCRIPTION
|
||||
#
|
||||
# On Pentium and later x86 processors, with gcc or a compiler that has a
|
||||
# compatible syntax for inline assembly instructions, run a small program
|
||||
# that executes the cpuid instruction with input OP. This can be used to
|
||||
# detect the CPU type.
|
||||
#
|
||||
# On output, the values of the eax, ebx, ecx, and edx registers are stored
|
||||
# as hexadecimal strings as "eax:ebx:ecx:edx" in the cache variable
|
||||
# ax_cv_gcc_x86_cpuid_OP.
|
||||
#
|
||||
# If the cpuid instruction fails (because you are running a
|
||||
# cross-compiler, or because you are not using gcc, or because you are on
|
||||
# a processor that doesn't have this instruction), ax_cv_gcc_x86_cpuid_OP
|
||||
# is set to the string "unknown".
|
||||
#
|
||||
# This macro mainly exists to be used in AX_GCC_ARCHFLAG.
|
||||
#
|
||||
# LICENSE
|
||||
#
|
||||
# Copyright (c) 2008 Steven G. Johnson <stevenj@alum.mit.edu>
|
||||
# Copyright (c) 2008 Matteo Frigo
|
||||
#
|
||||
# This program is free software: you can redistribute it and/or modify it
|
||||
# under the terms of the GNU General Public License as published by the
|
||||
# Free Software Foundation, either version 3 of the License, or (at your
|
||||
# option) any later version.
|
||||
#
|
||||
# This program is distributed in the hope that it will be useful, but
|
||||
# WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
|
||||
# Public License for more details.
|
||||
#
|
||||
# You should have received a copy of the GNU General Public License along
|
||||
# with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
#
|
||||
# As a special exception, the respective Autoconf Macro's copyright owner
|
||||
# gives unlimited permission to copy, distribute and modify the configure
|
||||
# scripts that are the output of Autoconf when processing the Macro. You
|
||||
# need not follow the terms of the GNU General Public License when using
|
||||
# or distributing such scripts, even though portions of the text of the
|
||||
# Macro appear in them. The GNU General Public License (GPL) does govern
|
||||
# all other use of the material that constitutes the Autoconf Macro.
|
||||
#
|
||||
# This special exception to the GPL applies to versions of the Autoconf
|
||||
# Macro released by the Autoconf Archive. When you make and distribute a
|
||||
# modified version of the Autoconf Macro, you may extend this special
|
||||
# exception to the GPL to apply to your modified version as well.
|
||||
|
||||
#serial 7
|
||||
|
||||
AC_DEFUN([AX_GCC_X86_CPUID],
|
||||
[AC_REQUIRE([AC_PROG_CC])
|
||||
AC_LANG_PUSH([C])
|
||||
AC_CACHE_CHECK(for x86 cpuid $1 output, ax_cv_gcc_x86_cpuid_$1,
|
||||
[AC_RUN_IFELSE([AC_LANG_PROGRAM([#include <stdio.h>], [
|
||||
int op = $1, eax, ebx, ecx, edx;
|
||||
FILE *f;
|
||||
__asm__("cpuid"
|
||||
: "=a" (eax), "=b" (ebx), "=c" (ecx), "=d" (edx)
|
||||
: "a" (op));
|
||||
f = fopen("conftest_cpuid", "w"); if (!f) return 1;
|
||||
fprintf(f, "%x:%x:%x:%x\n", eax, ebx, ecx, edx);
|
||||
fclose(f);
|
||||
return 0;
|
||||
])],
|
||||
[ax_cv_gcc_x86_cpuid_$1=`cat conftest_cpuid`; rm -f conftest_cpuid],
|
||||
[ax_cv_gcc_x86_cpuid_$1=unknown; rm -f conftest_cpuid],
|
||||
[ax_cv_gcc_x86_cpuid_$1=unknown])])
|
||||
AC_LANG_POP([C])
|
||||
])
|
||||
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,384 @@
|
|||
# Helper functions for option handling. -*- Autoconf -*-
|
||||
#
|
||||
# Copyright (C) 2004, 2005, 2007, 2008, 2009 Free Software Foundation,
|
||||
# Inc.
|
||||
# Written by Gary V. Vaughan, 2004
|
||||
#
|
||||
# This file is free software; the Free Software Foundation gives
|
||||
# unlimited permission to copy and/or distribute it, with or without
|
||||
# modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 7 ltoptions.m4
|
||||
|
||||
# This is to help aclocal find these macros, as it can't see m4_define.
|
||||
AC_DEFUN([LTOPTIONS_VERSION], [m4_if([1])])
|
||||
|
||||
|
||||
# _LT_MANGLE_OPTION(MACRO-NAME, OPTION-NAME)
|
||||
# ------------------------------------------
|
||||
m4_define([_LT_MANGLE_OPTION],
|
||||
[[_LT_OPTION_]m4_bpatsubst($1__$2, [[^a-zA-Z0-9_]], [_])])
|
||||
|
||||
|
||||
# _LT_SET_OPTION(MACRO-NAME, OPTION-NAME)
|
||||
# ---------------------------------------
|
||||
# Set option OPTION-NAME for macro MACRO-NAME, and if there is a
|
||||
# matching handler defined, dispatch to it. Other OPTION-NAMEs are
|
||||
# saved as a flag.
|
||||
m4_define([_LT_SET_OPTION],
|
||||
[m4_define(_LT_MANGLE_OPTION([$1], [$2]))dnl
|
||||
m4_ifdef(_LT_MANGLE_DEFUN([$1], [$2]),
|
||||
_LT_MANGLE_DEFUN([$1], [$2]),
|
||||
[m4_warning([Unknown $1 option `$2'])])[]dnl
|
||||
])
|
||||
|
||||
|
||||
# _LT_IF_OPTION(MACRO-NAME, OPTION-NAME, IF-SET, [IF-NOT-SET])
|
||||
# ------------------------------------------------------------
|
||||
# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise.
|
||||
m4_define([_LT_IF_OPTION],
|
||||
[m4_ifdef(_LT_MANGLE_OPTION([$1], [$2]), [$3], [$4])])
|
||||
|
||||
|
||||
# _LT_UNLESS_OPTIONS(MACRO-NAME, OPTION-LIST, IF-NOT-SET)
|
||||
# -------------------------------------------------------
|
||||
# Execute IF-NOT-SET unless all options in OPTION-LIST for MACRO-NAME
|
||||
# are set.
|
||||
m4_define([_LT_UNLESS_OPTIONS],
|
||||
[m4_foreach([_LT_Option], m4_split(m4_normalize([$2])),
|
||||
[m4_ifdef(_LT_MANGLE_OPTION([$1], _LT_Option),
|
||||
[m4_define([$0_found])])])[]dnl
|
||||
m4_ifdef([$0_found], [m4_undefine([$0_found])], [$3
|
||||
])[]dnl
|
||||
])
|
||||
|
||||
|
||||
# _LT_SET_OPTIONS(MACRO-NAME, OPTION-LIST)
|
||||
# ----------------------------------------
|
||||
# OPTION-LIST is a space-separated list of Libtool options associated
|
||||
# with MACRO-NAME. If any OPTION has a matching handler declared with
|
||||
# LT_OPTION_DEFINE, dispatch to that macro; otherwise complain about
|
||||
# the unknown option and exit.
|
||||
m4_defun([_LT_SET_OPTIONS],
|
||||
[# Set options
|
||||
m4_foreach([_LT_Option], m4_split(m4_normalize([$2])),
|
||||
[_LT_SET_OPTION([$1], _LT_Option)])
|
||||
|
||||
m4_if([$1],[LT_INIT],[
|
||||
dnl
|
||||
dnl Simply set some default values (i.e off) if boolean options were not
|
||||
dnl specified:
|
||||
_LT_UNLESS_OPTIONS([LT_INIT], [dlopen], [enable_dlopen=no
|
||||
])
|
||||
_LT_UNLESS_OPTIONS([LT_INIT], [win32-dll], [enable_win32_dll=no
|
||||
])
|
||||
dnl
|
||||
dnl If no reference was made to various pairs of opposing options, then
|
||||
dnl we run the default mode handler for the pair. For example, if neither
|
||||
dnl `shared' nor `disable-shared' was passed, we enable building of shared
|
||||
dnl archives by default:
|
||||
_LT_UNLESS_OPTIONS([LT_INIT], [shared disable-shared], [_LT_ENABLE_SHARED])
|
||||
_LT_UNLESS_OPTIONS([LT_INIT], [static disable-static], [_LT_ENABLE_STATIC])
|
||||
_LT_UNLESS_OPTIONS([LT_INIT], [pic-only no-pic], [_LT_WITH_PIC])
|
||||
_LT_UNLESS_OPTIONS([LT_INIT], [fast-install disable-fast-install],
|
||||
[_LT_ENABLE_FAST_INSTALL])
|
||||
])
|
||||
])# _LT_SET_OPTIONS
|
||||
|
||||
|
||||
## --------------------------------- ##
|
||||
## Macros to handle LT_INIT options. ##
|
||||
## --------------------------------- ##
|
||||
|
||||
# _LT_MANGLE_DEFUN(MACRO-NAME, OPTION-NAME)
|
||||
# -----------------------------------------
|
||||
m4_define([_LT_MANGLE_DEFUN],
|
||||
[[_LT_OPTION_DEFUN_]m4_bpatsubst(m4_toupper([$1__$2]), [[^A-Z0-9_]], [_])])
|
||||
|
||||
|
||||
# LT_OPTION_DEFINE(MACRO-NAME, OPTION-NAME, CODE)
|
||||
# -----------------------------------------------
|
||||
m4_define([LT_OPTION_DEFINE],
|
||||
[m4_define(_LT_MANGLE_DEFUN([$1], [$2]), [$3])[]dnl
|
||||
])# LT_OPTION_DEFINE
|
||||
|
||||
|
||||
# dlopen
|
||||
# ------
|
||||
LT_OPTION_DEFINE([LT_INIT], [dlopen], [enable_dlopen=yes
|
||||
])
|
||||
|
||||
AU_DEFUN([AC_LIBTOOL_DLOPEN],
|
||||
[_LT_SET_OPTION([LT_INIT], [dlopen])
|
||||
AC_DIAGNOSE([obsolete],
|
||||
[$0: Remove this warning and the call to _LT_SET_OPTION when you
|
||||
put the `dlopen' option into LT_INIT's first parameter.])
|
||||
])
|
||||
|
||||
dnl aclocal-1.4 backwards compatibility:
|
||||
dnl AC_DEFUN([AC_LIBTOOL_DLOPEN], [])
|
||||
|
||||
|
||||
# win32-dll
|
||||
# ---------
|
||||
# Declare package support for building win32 dll's.
|
||||
LT_OPTION_DEFINE([LT_INIT], [win32-dll],
|
||||
[enable_win32_dll=yes
|
||||
|
||||
case $host in
|
||||
*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-cegcc*)
|
||||
AC_CHECK_TOOL(AS, as, false)
|
||||
AC_CHECK_TOOL(DLLTOOL, dlltool, false)
|
||||
AC_CHECK_TOOL(OBJDUMP, objdump, false)
|
||||
;;
|
||||
esac
|
||||
|
||||
test -z "$AS" && AS=as
|
||||
_LT_DECL([], [AS], [1], [Assembler program])dnl
|
||||
|
||||
test -z "$DLLTOOL" && DLLTOOL=dlltool
|
||||
_LT_DECL([], [DLLTOOL], [1], [DLL creation program])dnl
|
||||
|
||||
test -z "$OBJDUMP" && OBJDUMP=objdump
|
||||
_LT_DECL([], [OBJDUMP], [1], [Object dumper program])dnl
|
||||
])# win32-dll
|
||||
|
||||
AU_DEFUN([AC_LIBTOOL_WIN32_DLL],
|
||||
[AC_REQUIRE([AC_CANONICAL_HOST])dnl
|
||||
_LT_SET_OPTION([LT_INIT], [win32-dll])
|
||||
AC_DIAGNOSE([obsolete],
|
||||
[$0: Remove this warning and the call to _LT_SET_OPTION when you
|
||||
put the `win32-dll' option into LT_INIT's first parameter.])
|
||||
])
|
||||
|
||||
dnl aclocal-1.4 backwards compatibility:
|
||||
dnl AC_DEFUN([AC_LIBTOOL_WIN32_DLL], [])
|
||||
|
||||
|
||||
# _LT_ENABLE_SHARED([DEFAULT])
|
||||
# ----------------------------
|
||||
# implement the --enable-shared flag, and supports the `shared' and
|
||||
# `disable-shared' LT_INIT options.
|
||||
# DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'.
|
||||
m4_define([_LT_ENABLE_SHARED],
|
||||
[m4_define([_LT_ENABLE_SHARED_DEFAULT], [m4_if($1, no, no, yes)])dnl
|
||||
AC_ARG_ENABLE([shared],
|
||||
[AS_HELP_STRING([--enable-shared@<:@=PKGS@:>@],
|
||||
[build shared libraries @<:@default=]_LT_ENABLE_SHARED_DEFAULT[@:>@])],
|
||||
[p=${PACKAGE-default}
|
||||
case $enableval in
|
||||
yes) enable_shared=yes ;;
|
||||
no) enable_shared=no ;;
|
||||
*)
|
||||
enable_shared=no
|
||||
# Look at the argument we got. We use all the common list separators.
|
||||
lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
|
||||
for pkg in $enableval; do
|
||||
IFS="$lt_save_ifs"
|
||||
if test "X$pkg" = "X$p"; then
|
||||
enable_shared=yes
|
||||
fi
|
||||
done
|
||||
IFS="$lt_save_ifs"
|
||||
;;
|
||||
esac],
|
||||
[enable_shared=]_LT_ENABLE_SHARED_DEFAULT)
|
||||
|
||||
_LT_DECL([build_libtool_libs], [enable_shared], [0],
|
||||
[Whether or not to build shared libraries])
|
||||
])# _LT_ENABLE_SHARED
|
||||
|
||||
LT_OPTION_DEFINE([LT_INIT], [shared], [_LT_ENABLE_SHARED([yes])])
|
||||
LT_OPTION_DEFINE([LT_INIT], [disable-shared], [_LT_ENABLE_SHARED([no])])
|
||||
|
||||
# Old names:
|
||||
AC_DEFUN([AC_ENABLE_SHARED],
|
||||
[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[shared])
|
||||
])
|
||||
|
||||
AC_DEFUN([AC_DISABLE_SHARED],
|
||||
[_LT_SET_OPTION([LT_INIT], [disable-shared])
|
||||
])
|
||||
|
||||
AU_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)])
|
||||
AU_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)])
|
||||
|
||||
dnl aclocal-1.4 backwards compatibility:
|
||||
dnl AC_DEFUN([AM_ENABLE_SHARED], [])
|
||||
dnl AC_DEFUN([AM_DISABLE_SHARED], [])
|
||||
|
||||
|
||||
|
||||
# _LT_ENABLE_STATIC([DEFAULT])
|
||||
# ----------------------------
|
||||
# implement the --enable-static flag, and support the `static' and
|
||||
# `disable-static' LT_INIT options.
|
||||
# DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'.
|
||||
m4_define([_LT_ENABLE_STATIC],
|
||||
[m4_define([_LT_ENABLE_STATIC_DEFAULT], [m4_if($1, no, no, yes)])dnl
|
||||
AC_ARG_ENABLE([static],
|
||||
[AS_HELP_STRING([--enable-static@<:@=PKGS@:>@],
|
||||
[build static libraries @<:@default=]_LT_ENABLE_STATIC_DEFAULT[@:>@])],
|
||||
[p=${PACKAGE-default}
|
||||
case $enableval in
|
||||
yes) enable_static=yes ;;
|
||||
no) enable_static=no ;;
|
||||
*)
|
||||
enable_static=no
|
||||
# Look at the argument we got. We use all the common list separators.
|
||||
lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
|
||||
for pkg in $enableval; do
|
||||
IFS="$lt_save_ifs"
|
||||
if test "X$pkg" = "X$p"; then
|
||||
enable_static=yes
|
||||
fi
|
||||
done
|
||||
IFS="$lt_save_ifs"
|
||||
;;
|
||||
esac],
|
||||
[enable_static=]_LT_ENABLE_STATIC_DEFAULT)
|
||||
|
||||
_LT_DECL([build_old_libs], [enable_static], [0],
|
||||
[Whether or not to build static libraries])
|
||||
])# _LT_ENABLE_STATIC
|
||||
|
||||
LT_OPTION_DEFINE([LT_INIT], [static], [_LT_ENABLE_STATIC([yes])])
|
||||
LT_OPTION_DEFINE([LT_INIT], [disable-static], [_LT_ENABLE_STATIC([no])])
|
||||
|
||||
# Old names:
|
||||
AC_DEFUN([AC_ENABLE_STATIC],
|
||||
[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[static])
|
||||
])
|
||||
|
||||
AC_DEFUN([AC_DISABLE_STATIC],
|
||||
[_LT_SET_OPTION([LT_INIT], [disable-static])
|
||||
])
|
||||
|
||||
AU_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)])
|
||||
AU_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)])
|
||||
|
||||
dnl aclocal-1.4 backwards compatibility:
|
||||
dnl AC_DEFUN([AM_ENABLE_STATIC], [])
|
||||
dnl AC_DEFUN([AM_DISABLE_STATIC], [])
|
||||
|
||||
|
||||
|
||||
# _LT_ENABLE_FAST_INSTALL([DEFAULT])
|
||||
# ----------------------------------
|
||||
# implement the --enable-fast-install flag, and support the `fast-install'
|
||||
# and `disable-fast-install' LT_INIT options.
|
||||
# DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'.
|
||||
m4_define([_LT_ENABLE_FAST_INSTALL],
|
||||
[m4_define([_LT_ENABLE_FAST_INSTALL_DEFAULT], [m4_if($1, no, no, yes)])dnl
|
||||
AC_ARG_ENABLE([fast-install],
|
||||
[AS_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@],
|
||||
[optimize for fast installation @<:@default=]_LT_ENABLE_FAST_INSTALL_DEFAULT[@:>@])],
|
||||
[p=${PACKAGE-default}
|
||||
case $enableval in
|
||||
yes) enable_fast_install=yes ;;
|
||||
no) enable_fast_install=no ;;
|
||||
*)
|
||||
enable_fast_install=no
|
||||
# Look at the argument we got. We use all the common list separators.
|
||||
lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
|
||||
for pkg in $enableval; do
|
||||
IFS="$lt_save_ifs"
|
||||
if test "X$pkg" = "X$p"; then
|
||||
enable_fast_install=yes
|
||||
fi
|
||||
done
|
||||
IFS="$lt_save_ifs"
|
||||
;;
|
||||
esac],
|
||||
[enable_fast_install=]_LT_ENABLE_FAST_INSTALL_DEFAULT)
|
||||
|
||||
_LT_DECL([fast_install], [enable_fast_install], [0],
|
||||
[Whether or not to optimize for fast installation])dnl
|
||||
])# _LT_ENABLE_FAST_INSTALL
|
||||
|
||||
LT_OPTION_DEFINE([LT_INIT], [fast-install], [_LT_ENABLE_FAST_INSTALL([yes])])
|
||||
LT_OPTION_DEFINE([LT_INIT], [disable-fast-install], [_LT_ENABLE_FAST_INSTALL([no])])
|
||||
|
||||
# Old names:
|
||||
AU_DEFUN([AC_ENABLE_FAST_INSTALL],
|
||||
[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[fast-install])
|
||||
AC_DIAGNOSE([obsolete],
|
||||
[$0: Remove this warning and the call to _LT_SET_OPTION when you put
|
||||
the `fast-install' option into LT_INIT's first parameter.])
|
||||
])
|
||||
|
||||
AU_DEFUN([AC_DISABLE_FAST_INSTALL],
|
||||
[_LT_SET_OPTION([LT_INIT], [disable-fast-install])
|
||||
AC_DIAGNOSE([obsolete],
|
||||
[$0: Remove this warning and the call to _LT_SET_OPTION when you put
|
||||
the `disable-fast-install' option into LT_INIT's first parameter.])
|
||||
])
|
||||
|
||||
dnl aclocal-1.4 backwards compatibility:
|
||||
dnl AC_DEFUN([AC_ENABLE_FAST_INSTALL], [])
|
||||
dnl AC_DEFUN([AM_DISABLE_FAST_INSTALL], [])
|
||||
|
||||
|
||||
# _LT_WITH_PIC([MODE])
|
||||
# --------------------
|
||||
# implement the --with-pic flag, and support the `pic-only' and `no-pic'
|
||||
# LT_INIT options.
|
||||
# MODE is either `yes' or `no'. If omitted, it defaults to `both'.
|
||||
m4_define([_LT_WITH_PIC],
|
||||
[AC_ARG_WITH([pic],
|
||||
[AS_HELP_STRING([--with-pic@<:@=PKGS@:>@],
|
||||
[try to use only PIC/non-PIC objects @<:@default=use both@:>@])],
|
||||
[lt_p=${PACKAGE-default}
|
||||
case $withval in
|
||||
yes|no) pic_mode=$withval ;;
|
||||
*)
|
||||
pic_mode=default
|
||||
# Look at the argument we got. We use all the common list separators.
|
||||
lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
|
||||
for lt_pkg in $withval; do
|
||||
IFS="$lt_save_ifs"
|
||||
if test "X$lt_pkg" = "X$lt_p"; then
|
||||
pic_mode=yes
|
||||
fi
|
||||
done
|
||||
IFS="$lt_save_ifs"
|
||||
;;
|
||||
esac],
|
||||
[pic_mode=default])
|
||||
|
||||
test -z "$pic_mode" && pic_mode=m4_default([$1], [default])
|
||||
|
||||
_LT_DECL([], [pic_mode], [0], [What type of objects to build])dnl
|
||||
])# _LT_WITH_PIC
|
||||
|
||||
LT_OPTION_DEFINE([LT_INIT], [pic-only], [_LT_WITH_PIC([yes])])
|
||||
LT_OPTION_DEFINE([LT_INIT], [no-pic], [_LT_WITH_PIC([no])])
|
||||
|
||||
# Old name:
|
||||
AU_DEFUN([AC_LIBTOOL_PICMODE],
|
||||
[_LT_SET_OPTION([LT_INIT], [pic-only])
|
||||
AC_DIAGNOSE([obsolete],
|
||||
[$0: Remove this warning and the call to _LT_SET_OPTION when you
|
||||
put the `pic-only' option into LT_INIT's first parameter.])
|
||||
])
|
||||
|
||||
dnl aclocal-1.4 backwards compatibility:
|
||||
dnl AC_DEFUN([AC_LIBTOOL_PICMODE], [])
|
||||
|
||||
## ----------------- ##
|
||||
## LTDL_INIT Options ##
|
||||
## ----------------- ##
|
||||
|
||||
m4_define([_LTDL_MODE], [])
|
||||
LT_OPTION_DEFINE([LTDL_INIT], [nonrecursive],
|
||||
[m4_define([_LTDL_MODE], [nonrecursive])])
|
||||
LT_OPTION_DEFINE([LTDL_INIT], [recursive],
|
||||
[m4_define([_LTDL_MODE], [recursive])])
|
||||
LT_OPTION_DEFINE([LTDL_INIT], [subproject],
|
||||
[m4_define([_LTDL_MODE], [subproject])])
|
||||
|
||||
m4_define([_LTDL_TYPE], [])
|
||||
LT_OPTION_DEFINE([LTDL_INIT], [installable],
|
||||
[m4_define([_LTDL_TYPE], [installable])])
|
||||
LT_OPTION_DEFINE([LTDL_INIT], [convenience],
|
||||
[m4_define([_LTDL_TYPE], [convenience])])
|
||||
|
|
@ -0,0 +1,123 @@
|
|||
# ltsugar.m4 -- libtool m4 base layer. -*-Autoconf-*-
|
||||
#
|
||||
# Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc.
|
||||
# Written by Gary V. Vaughan, 2004
|
||||
#
|
||||
# This file is free software; the Free Software Foundation gives
|
||||
# unlimited permission to copy and/or distribute it, with or without
|
||||
# modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 6 ltsugar.m4
|
||||
|
||||
# This is to help aclocal find these macros, as it can't see m4_define.
|
||||
AC_DEFUN([LTSUGAR_VERSION], [m4_if([0.1])])
|
||||
|
||||
|
||||
# lt_join(SEP, ARG1, [ARG2...])
|
||||
# -----------------------------
|
||||
# Produce ARG1SEPARG2...SEPARGn, omitting [] arguments and their
|
||||
# associated separator.
|
||||
# Needed until we can rely on m4_join from Autoconf 2.62, since all earlier
|
||||
# versions in m4sugar had bugs.
|
||||
m4_define([lt_join],
|
||||
[m4_if([$#], [1], [],
|
||||
[$#], [2], [[$2]],
|
||||
[m4_if([$2], [], [], [[$2]_])$0([$1], m4_shift(m4_shift($@)))])])
|
||||
m4_define([_lt_join],
|
||||
[m4_if([$#$2], [2], [],
|
||||
[m4_if([$2], [], [], [[$1$2]])$0([$1], m4_shift(m4_shift($@)))])])
|
||||
|
||||
|
||||
# lt_car(LIST)
|
||||
# lt_cdr(LIST)
|
||||
# ------------
|
||||
# Manipulate m4 lists.
|
||||
# These macros are necessary as long as will still need to support
|
||||
# Autoconf-2.59 which quotes differently.
|
||||
m4_define([lt_car], [[$1]])
|
||||
m4_define([lt_cdr],
|
||||
[m4_if([$#], 0, [m4_fatal([$0: cannot be called without arguments])],
|
||||
[$#], 1, [],
|
||||
[m4_dquote(m4_shift($@))])])
|
||||
m4_define([lt_unquote], $1)
|
||||
|
||||
|
||||
# lt_append(MACRO-NAME, STRING, [SEPARATOR])
|
||||
# ------------------------------------------
|
||||
# Redefine MACRO-NAME to hold its former content plus `SEPARATOR'`STRING'.
|
||||
# Note that neither SEPARATOR nor STRING are expanded; they are appended
|
||||
# to MACRO-NAME as is (leaving the expansion for when MACRO-NAME is invoked).
|
||||
# No SEPARATOR is output if MACRO-NAME was previously undefined (different
|
||||
# than defined and empty).
|
||||
#
|
||||
# This macro is needed until we can rely on Autoconf 2.62, since earlier
|
||||
# versions of m4sugar mistakenly expanded SEPARATOR but not STRING.
|
||||
m4_define([lt_append],
|
||||
[m4_define([$1],
|
||||
m4_ifdef([$1], [m4_defn([$1])[$3]])[$2])])
|
||||
|
||||
|
||||
|
||||
# lt_combine(SEP, PREFIX-LIST, INFIX, SUFFIX1, [SUFFIX2...])
|
||||
# ----------------------------------------------------------
|
||||
# Produce a SEP delimited list of all paired combinations of elements of
|
||||
# PREFIX-LIST with SUFFIX1 through SUFFIXn. Each element of the list
|
||||
# has the form PREFIXmINFIXSUFFIXn.
|
||||
# Needed until we can rely on m4_combine added in Autoconf 2.62.
|
||||
m4_define([lt_combine],
|
||||
[m4_if(m4_eval([$# > 3]), [1],
|
||||
[m4_pushdef([_Lt_sep], [m4_define([_Lt_sep], m4_defn([lt_car]))])]]dnl
|
||||
[[m4_foreach([_Lt_prefix], [$2],
|
||||
[m4_foreach([_Lt_suffix],
|
||||
]m4_dquote(m4_dquote(m4_shift(m4_shift(m4_shift($@)))))[,
|
||||
[_Lt_sep([$1])[]m4_defn([_Lt_prefix])[$3]m4_defn([_Lt_suffix])])])])])
|
||||
|
||||
|
||||
# lt_if_append_uniq(MACRO-NAME, VARNAME, [SEPARATOR], [UNIQ], [NOT-UNIQ])
|
||||
# -----------------------------------------------------------------------
|
||||
# Iff MACRO-NAME does not yet contain VARNAME, then append it (delimited
|
||||
# by SEPARATOR if supplied) and expand UNIQ, else NOT-UNIQ.
|
||||
m4_define([lt_if_append_uniq],
|
||||
[m4_ifdef([$1],
|
||||
[m4_if(m4_index([$3]m4_defn([$1])[$3], [$3$2$3]), [-1],
|
||||
[lt_append([$1], [$2], [$3])$4],
|
||||
[$5])],
|
||||
[lt_append([$1], [$2], [$3])$4])])
|
||||
|
||||
|
||||
# lt_dict_add(DICT, KEY, VALUE)
|
||||
# -----------------------------
|
||||
m4_define([lt_dict_add],
|
||||
[m4_define([$1($2)], [$3])])
|
||||
|
||||
|
||||
# lt_dict_add_subkey(DICT, KEY, SUBKEY, VALUE)
|
||||
# --------------------------------------------
|
||||
m4_define([lt_dict_add_subkey],
|
||||
[m4_define([$1($2:$3)], [$4])])
|
||||
|
||||
|
||||
# lt_dict_fetch(DICT, KEY, [SUBKEY])
|
||||
# ----------------------------------
|
||||
m4_define([lt_dict_fetch],
|
||||
[m4_ifval([$3],
|
||||
m4_ifdef([$1($2:$3)], [m4_defn([$1($2:$3)])]),
|
||||
m4_ifdef([$1($2)], [m4_defn([$1($2)])]))])
|
||||
|
||||
|
||||
# lt_if_dict_fetch(DICT, KEY, [SUBKEY], VALUE, IF-TRUE, [IF-FALSE])
|
||||
# -----------------------------------------------------------------
|
||||
m4_define([lt_if_dict_fetch],
|
||||
[m4_if(lt_dict_fetch([$1], [$2], [$3]), [$4],
|
||||
[$5],
|
||||
[$6])])
|
||||
|
||||
|
||||
# lt_dict_filter(DICT, [SUBKEY], VALUE, [SEPARATOR], KEY, [...])
|
||||
# --------------------------------------------------------------
|
||||
m4_define([lt_dict_filter],
|
||||
[m4_if([$5], [], [],
|
||||
[lt_join(m4_quote(m4_default([$4], [[, ]])),
|
||||
lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_key, lt_car([m4_shiftn(4, $@)]),
|
||||
[lt_if_dict_fetch([$1], _Lt_key, [$2], [$3], [_Lt_key ])])))))])[]dnl
|
||||
])
|
||||
|
|
@ -0,0 +1,23 @@
|
|||
# ltversion.m4 -- version numbers -*- Autoconf -*-
|
||||
#
|
||||
# Copyright (C) 2004 Free Software Foundation, Inc.
|
||||
# Written by Scott James Remnant, 2004
|
||||
#
|
||||
# This file is free software; the Free Software Foundation gives
|
||||
# unlimited permission to copy and/or distribute it, with or without
|
||||
# modifications, as long as this notice is preserved.
|
||||
|
||||
# @configure_input@
|
||||
|
||||
# serial 3337 ltversion.m4
|
||||
# This file is part of GNU Libtool
|
||||
|
||||
m4_define([LT_PACKAGE_VERSION], [2.4.2])
|
||||
m4_define([LT_PACKAGE_REVISION], [1.3337])
|
||||
|
||||
AC_DEFUN([LTVERSION_VERSION],
|
||||
[macro_version='2.4.2'
|
||||
macro_revision='1.3337'
|
||||
_LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?])
|
||||
_LT_DECL(, macro_revision, 0)
|
||||
])
|
||||
|
|
@ -0,0 +1,98 @@
|
|||
# lt~obsolete.m4 -- aclocal satisfying obsolete definitions. -*-Autoconf-*-
|
||||
#
|
||||
# Copyright (C) 2004, 2005, 2007, 2009 Free Software Foundation, Inc.
|
||||
# Written by Scott James Remnant, 2004.
|
||||
#
|
||||
# This file is free software; the Free Software Foundation gives
|
||||
# unlimited permission to copy and/or distribute it, with or without
|
||||
# modifications, as long as this notice is preserved.
|
||||
|
||||
# serial 5 lt~obsolete.m4
|
||||
|
||||
# These exist entirely to fool aclocal when bootstrapping libtool.
|
||||
#
|
||||
# In the past libtool.m4 has provided macros via AC_DEFUN (or AU_DEFUN)
|
||||
# which have later been changed to m4_define as they aren't part of the
|
||||
# exported API, or moved to Autoconf or Automake where they belong.
|
||||
#
|
||||
# The trouble is, aclocal is a bit thick. It'll see the old AC_DEFUN
|
||||
# in /usr/share/aclocal/libtool.m4 and remember it, then when it sees us
|
||||
# using a macro with the same name in our local m4/libtool.m4 it'll
|
||||
# pull the old libtool.m4 in (it doesn't see our shiny new m4_define
|
||||
# and doesn't know about Autoconf macros at all.)
|
||||
#
|
||||
# So we provide this file, which has a silly filename so it's always
|
||||
# included after everything else. This provides aclocal with the
|
||||
# AC_DEFUNs it wants, but when m4 processes it, it doesn't do anything
|
||||
# because those macros already exist, or will be overwritten later.
|
||||
# We use AC_DEFUN over AU_DEFUN for compatibility with aclocal-1.6.
|
||||
#
|
||||
# Anytime we withdraw an AC_DEFUN or AU_DEFUN, remember to add it here.
|
||||
# Yes, that means every name once taken will need to remain here until
|
||||
# we give up compatibility with versions before 1.7, at which point
|
||||
# we need to keep only those names which we still refer to.
|
||||
|
||||
# This is to help aclocal find these macros, as it can't see m4_define.
|
||||
AC_DEFUN([LTOBSOLETE_VERSION], [m4_if([1])])
|
||||
|
||||
m4_ifndef([AC_LIBTOOL_LINKER_OPTION], [AC_DEFUN([AC_LIBTOOL_LINKER_OPTION])])
|
||||
m4_ifndef([AC_PROG_EGREP], [AC_DEFUN([AC_PROG_EGREP])])
|
||||
m4_ifndef([_LT_AC_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH])])
|
||||
m4_ifndef([_LT_AC_SHELL_INIT], [AC_DEFUN([_LT_AC_SHELL_INIT])])
|
||||
m4_ifndef([_LT_AC_SYS_LIBPATH_AIX], [AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX])])
|
||||
m4_ifndef([_LT_PROG_LTMAIN], [AC_DEFUN([_LT_PROG_LTMAIN])])
|
||||
m4_ifndef([_LT_AC_TAGVAR], [AC_DEFUN([_LT_AC_TAGVAR])])
|
||||
m4_ifndef([AC_LTDL_ENABLE_INSTALL], [AC_DEFUN([AC_LTDL_ENABLE_INSTALL])])
|
||||
m4_ifndef([AC_LTDL_PREOPEN], [AC_DEFUN([AC_LTDL_PREOPEN])])
|
||||
m4_ifndef([_LT_AC_SYS_COMPILER], [AC_DEFUN([_LT_AC_SYS_COMPILER])])
|
||||
m4_ifndef([_LT_AC_LOCK], [AC_DEFUN([_LT_AC_LOCK])])
|
||||
m4_ifndef([AC_LIBTOOL_SYS_OLD_ARCHIVE], [AC_DEFUN([AC_LIBTOOL_SYS_OLD_ARCHIVE])])
|
||||
m4_ifndef([_LT_AC_TRY_DLOPEN_SELF], [AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF])])
|
||||
m4_ifndef([AC_LIBTOOL_PROG_CC_C_O], [AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O])])
|
||||
m4_ifndef([AC_LIBTOOL_SYS_HARD_LINK_LOCKS], [AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS])])
|
||||
m4_ifndef([AC_LIBTOOL_OBJDIR], [AC_DEFUN([AC_LIBTOOL_OBJDIR])])
|
||||
m4_ifndef([AC_LTDL_OBJDIR], [AC_DEFUN([AC_LTDL_OBJDIR])])
|
||||
m4_ifndef([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH], [AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH])])
|
||||
m4_ifndef([AC_LIBTOOL_SYS_LIB_STRIP], [AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP])])
|
||||
m4_ifndef([AC_PATH_MAGIC], [AC_DEFUN([AC_PATH_MAGIC])])
|
||||
m4_ifndef([AC_PROG_LD_GNU], [AC_DEFUN([AC_PROG_LD_GNU])])
|
||||
m4_ifndef([AC_PROG_LD_RELOAD_FLAG], [AC_DEFUN([AC_PROG_LD_RELOAD_FLAG])])
|
||||
m4_ifndef([AC_DEPLIBS_CHECK_METHOD], [AC_DEFUN([AC_DEPLIBS_CHECK_METHOD])])
|
||||
m4_ifndef([AC_LIBTOOL_PROG_COMPILER_NO_RTTI], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI])])
|
||||
m4_ifndef([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE], [AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE])])
|
||||
m4_ifndef([AC_LIBTOOL_PROG_COMPILER_PIC], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC])])
|
||||
m4_ifndef([AC_LIBTOOL_PROG_LD_SHLIBS], [AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS])])
|
||||
m4_ifndef([AC_LIBTOOL_POSTDEP_PREDEP], [AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP])])
|
||||
m4_ifndef([LT_AC_PROG_EGREP], [AC_DEFUN([LT_AC_PROG_EGREP])])
|
||||
m4_ifndef([LT_AC_PROG_SED], [AC_DEFUN([LT_AC_PROG_SED])])
|
||||
m4_ifndef([_LT_CC_BASENAME], [AC_DEFUN([_LT_CC_BASENAME])])
|
||||
m4_ifndef([_LT_COMPILER_BOILERPLATE], [AC_DEFUN([_LT_COMPILER_BOILERPLATE])])
|
||||
m4_ifndef([_LT_LINKER_BOILERPLATE], [AC_DEFUN([_LT_LINKER_BOILERPLATE])])
|
||||
m4_ifndef([_AC_PROG_LIBTOOL], [AC_DEFUN([_AC_PROG_LIBTOOL])])
|
||||
m4_ifndef([AC_LIBTOOL_SETUP], [AC_DEFUN([AC_LIBTOOL_SETUP])])
|
||||
m4_ifndef([_LT_AC_CHECK_DLFCN], [AC_DEFUN([_LT_AC_CHECK_DLFCN])])
|
||||
m4_ifndef([AC_LIBTOOL_SYS_DYNAMIC_LINKER], [AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER])])
|
||||
m4_ifndef([_LT_AC_TAGCONFIG], [AC_DEFUN([_LT_AC_TAGCONFIG])])
|
||||
m4_ifndef([AC_DISABLE_FAST_INSTALL], [AC_DEFUN([AC_DISABLE_FAST_INSTALL])])
|
||||
m4_ifndef([_LT_AC_LANG_CXX], [AC_DEFUN([_LT_AC_LANG_CXX])])
|
||||
m4_ifndef([_LT_AC_LANG_F77], [AC_DEFUN([_LT_AC_LANG_F77])])
|
||||
m4_ifndef([_LT_AC_LANG_GCJ], [AC_DEFUN([_LT_AC_LANG_GCJ])])
|
||||
m4_ifndef([AC_LIBTOOL_LANG_C_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG])])
|
||||
m4_ifndef([_LT_AC_LANG_C_CONFIG], [AC_DEFUN([_LT_AC_LANG_C_CONFIG])])
|
||||
m4_ifndef([AC_LIBTOOL_LANG_CXX_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG])])
|
||||
m4_ifndef([_LT_AC_LANG_CXX_CONFIG], [AC_DEFUN([_LT_AC_LANG_CXX_CONFIG])])
|
||||
m4_ifndef([AC_LIBTOOL_LANG_F77_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG])])
|
||||
m4_ifndef([_LT_AC_LANG_F77_CONFIG], [AC_DEFUN([_LT_AC_LANG_F77_CONFIG])])
|
||||
m4_ifndef([AC_LIBTOOL_LANG_GCJ_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG])])
|
||||
m4_ifndef([_LT_AC_LANG_GCJ_CONFIG], [AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG])])
|
||||
m4_ifndef([AC_LIBTOOL_LANG_RC_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG])])
|
||||
m4_ifndef([_LT_AC_LANG_RC_CONFIG], [AC_DEFUN([_LT_AC_LANG_RC_CONFIG])])
|
||||
m4_ifndef([AC_LIBTOOL_CONFIG], [AC_DEFUN([AC_LIBTOOL_CONFIG])])
|
||||
m4_ifndef([_LT_AC_FILE_LTDLL_C], [AC_DEFUN([_LT_AC_FILE_LTDLL_C])])
|
||||
m4_ifndef([_LT_REQUIRED_DARWIN_CHECKS], [AC_DEFUN([_LT_REQUIRED_DARWIN_CHECKS])])
|
||||
m4_ifndef([_LT_AC_PROG_CXXCPP], [AC_DEFUN([_LT_AC_PROG_CXXCPP])])
|
||||
m4_ifndef([_LT_PREPARE_SED_QUOTE_VARS], [AC_DEFUN([_LT_PREPARE_SED_QUOTE_VARS])])
|
||||
m4_ifndef([_LT_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_PROG_ECHO_BACKSLASH])])
|
||||
m4_ifndef([_LT_PROG_F77], [AC_DEFUN([_LT_PROG_F77])])
|
||||
m4_ifndef([_LT_PROG_FC], [AC_DEFUN([_LT_PROG_FC])])
|
||||
m4_ifndef([_LT_PROG_CXX], [AC_DEFUN([_LT_PROG_CXX])])
|
||||
|
|
@ -27,15 +27,33 @@
|
|||
# $Revision: 1.0 $
|
||||
# $Date: 2007/09/25 15:12:20 $
|
||||
|
||||
CC = gcc
|
||||
CFLAGS = -O3 -I$(HOME)/include
|
||||
UNAME := $(shell uname)
|
||||
|
||||
ALL = galois.o jerasure.o reed_sol.o cauchy.o liberation.o
|
||||
ifeq ($(UNAME), Linux)
|
||||
LIBARGS=-shared -Wl,-soname,libJerasure.so.0
|
||||
endif
|
||||
ifeq ($(UNAME), Darwin)
|
||||
LIBARGS=-shared -Wl,-install_name,libJerasure.so.0
|
||||
endif
|
||||
|
||||
PREFIX=/usr/local
|
||||
BINDIR=${PREFIX}/bin
|
||||
LIBDIR=${PREFIX}/lib
|
||||
INCDIR=${PREFIX}/include
|
||||
|
||||
CC = gcc
|
||||
CFLAGS = -O3 -I${INCDIR} -L${LIBDIR} -fPIC
|
||||
|
||||
ALL = galois.o jerasure.o reed_sol.o cauchy.o liberation.o lib/libJerasure.so
|
||||
OBJS = galois.o jerasure.o reed_sol.o cauchy.o liberation.o
|
||||
|
||||
all: $(ALL)
|
||||
|
||||
clean:
|
||||
rm -f core *.o $(ALL) a.out
|
||||
rm -f core *.o $(ALL) a.out lib/libJerasure.so.0
|
||||
|
||||
lib:
|
||||
mkdir -p lib
|
||||
|
||||
.SUFFIXES: .c .o
|
||||
.c.o:
|
||||
|
|
@ -47,3 +65,15 @@ reed_sol.o: jerasure.h galois.h reed_sol.h
|
|||
cauchy.o: jerasure.h galois.h cauchy.h
|
||||
liberation.o: jerasure.h galois.h liberation.h
|
||||
|
||||
lib/libJerasure.so: lib/libJerasure.so.0
|
||||
ln -sf libJerasure.so.0 lib/libJerasure.so
|
||||
|
||||
lib/libJerasure.so.0: lib $(OBJS)
|
||||
$(CC) $(LIBARGS) \
|
||||
-o lib/libJerasure.so.0 $(OBJS) -lgf_complete
|
||||
|
||||
install: lib/libJerasure.so
|
||||
cp -P lib/libJerasure.so* ${LIBDIR}
|
||||
mkdir -p ${INCDIR}
|
||||
cp *.h ${INCDIR}
|
||||
|
||||
|
|
@ -0,0 +1,331 @@
|
|||
#! /bin/sh
|
||||
# Common stub for a few missing GNU programs while installing.
|
||||
|
||||
scriptversion=2012-01-06.13; # UTC
|
||||
|
||||
# Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005, 2006,
|
||||
# 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc.
|
||||
# Originally by Fran,cois Pinard <pinard@iro.umontreal.ca>, 1996.
|
||||
|
||||
# This program is free software; you can redistribute it and/or modify
|
||||
# it under the terms of the GNU General Public License as published by
|
||||
# the Free Software Foundation; either version 2, or (at your option)
|
||||
# any later version.
|
||||
|
||||
# This program is distributed in the hope that it will be useful,
|
||||
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
# GNU General Public License for more details.
|
||||
|
||||
# You should have received a copy of the GNU General Public License
|
||||
# along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
# As a special exception to the GNU General Public License, if you
|
||||
# distribute this file as part of a program that contains a
|
||||
# configuration script generated by Autoconf, you may include it under
|
||||
# the same distribution terms that you use for the rest of that program.
|
||||
|
||||
if test $# -eq 0; then
|
||||
echo 1>&2 "Try \`$0 --help' for more information"
|
||||
exit 1
|
||||
fi
|
||||
|
||||
run=:
|
||||
sed_output='s/.* --output[ =]\([^ ]*\).*/\1/p'
|
||||
sed_minuso='s/.* -o \([^ ]*\).*/\1/p'
|
||||
|
||||
# In the cases where this matters, `missing' is being run in the
|
||||
# srcdir already.
|
||||
if test -f configure.ac; then
|
||||
configure_ac=configure.ac
|
||||
else
|
||||
configure_ac=configure.in
|
||||
fi
|
||||
|
||||
msg="missing on your system"
|
||||
|
||||
case $1 in
|
||||
--run)
|
||||
# Try to run requested program, and just exit if it succeeds.
|
||||
run=
|
||||
shift
|
||||
"$@" && exit 0
|
||||
# Exit code 63 means version mismatch. This often happens
|
||||
# when the user try to use an ancient version of a tool on
|
||||
# a file that requires a minimum version. In this case we
|
||||
# we should proceed has if the program had been absent, or
|
||||
# if --run hadn't been passed.
|
||||
if test $? = 63; then
|
||||
run=:
|
||||
msg="probably too old"
|
||||
fi
|
||||
;;
|
||||
|
||||
-h|--h|--he|--hel|--help)
|
||||
echo "\
|
||||
$0 [OPTION]... PROGRAM [ARGUMENT]...
|
||||
|
||||
Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an
|
||||
error status if there is no known handling for PROGRAM.
|
||||
|
||||
Options:
|
||||
-h, --help display this help and exit
|
||||
-v, --version output version information and exit
|
||||
--run try to run the given command, and emulate it if it fails
|
||||
|
||||
Supported PROGRAM values:
|
||||
aclocal touch file \`aclocal.m4'
|
||||
autoconf touch file \`configure'
|
||||
autoheader touch file \`config.h.in'
|
||||
autom4te touch the output file, or create a stub one
|
||||
automake touch all \`Makefile.in' files
|
||||
bison create \`y.tab.[ch]', if possible, from existing .[ch]
|
||||
flex create \`lex.yy.c', if possible, from existing .c
|
||||
help2man touch the output file
|
||||
lex create \`lex.yy.c', if possible, from existing .c
|
||||
makeinfo touch the output file
|
||||
yacc create \`y.tab.[ch]', if possible, from existing .[ch]
|
||||
|
||||
Version suffixes to PROGRAM as well as the prefixes \`gnu-', \`gnu', and
|
||||
\`g' are ignored when checking the name.
|
||||
|
||||
Send bug reports to <bug-automake@gnu.org>."
|
||||
exit $?
|
||||
;;
|
||||
|
||||
-v|--v|--ve|--ver|--vers|--versi|--versio|--version)
|
||||
echo "missing $scriptversion (GNU Automake)"
|
||||
exit $?
|
||||
;;
|
||||
|
||||
-*)
|
||||
echo 1>&2 "$0: Unknown \`$1' option"
|
||||
echo 1>&2 "Try \`$0 --help' for more information"
|
||||
exit 1
|
||||
;;
|
||||
|
||||
esac
|
||||
|
||||
# normalize program name to check for.
|
||||
program=`echo "$1" | sed '
|
||||
s/^gnu-//; t
|
||||
s/^gnu//; t
|
||||
s/^g//; t'`
|
||||
|
||||
# Now exit if we have it, but it failed. Also exit now if we
|
||||
# don't have it and --version was passed (most likely to detect
|
||||
# the program). This is about non-GNU programs, so use $1 not
|
||||
# $program.
|
||||
case $1 in
|
||||
lex*|yacc*)
|
||||
# Not GNU programs, they don't have --version.
|
||||
;;
|
||||
|
||||
*)
|
||||
if test -z "$run" && ($1 --version) > /dev/null 2>&1; then
|
||||
# We have it, but it failed.
|
||||
exit 1
|
||||
elif test "x$2" = "x--version" || test "x$2" = "x--help"; then
|
||||
# Could not run --version or --help. This is probably someone
|
||||
# running `$TOOL --version' or `$TOOL --help' to check whether
|
||||
# $TOOL exists and not knowing $TOOL uses missing.
|
||||
exit 1
|
||||
fi
|
||||
;;
|
||||
esac
|
||||
|
||||
# If it does not exist, or fails to run (possibly an outdated version),
|
||||
# try to emulate it.
|
||||
case $program in
|
||||
aclocal*)
|
||||
echo 1>&2 "\
|
||||
WARNING: \`$1' is $msg. You should only need it if
|
||||
you modified \`acinclude.m4' or \`${configure_ac}'. You might want
|
||||
to install the \`Automake' and \`Perl' packages. Grab them from
|
||||
any GNU archive site."
|
||||
touch aclocal.m4
|
||||
;;
|
||||
|
||||
autoconf*)
|
||||
echo 1>&2 "\
|
||||
WARNING: \`$1' is $msg. You should only need it if
|
||||
you modified \`${configure_ac}'. You might want to install the
|
||||
\`Autoconf' and \`GNU m4' packages. Grab them from any GNU
|
||||
archive site."
|
||||
touch configure
|
||||
;;
|
||||
|
||||
autoheader*)
|
||||
echo 1>&2 "\
|
||||
WARNING: \`$1' is $msg. You should only need it if
|
||||
you modified \`acconfig.h' or \`${configure_ac}'. You might want
|
||||
to install the \`Autoconf' and \`GNU m4' packages. Grab them
|
||||
from any GNU archive site."
|
||||
files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}`
|
||||
test -z "$files" && files="config.h"
|
||||
touch_files=
|
||||
for f in $files; do
|
||||
case $f in
|
||||
*:*) touch_files="$touch_files "`echo "$f" |
|
||||
sed -e 's/^[^:]*://' -e 's/:.*//'`;;
|
||||
*) touch_files="$touch_files $f.in";;
|
||||
esac
|
||||
done
|
||||
touch $touch_files
|
||||
;;
|
||||
|
||||
automake*)
|
||||
echo 1>&2 "\
|
||||
WARNING: \`$1' is $msg. You should only need it if
|
||||
you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'.
|
||||
You might want to install the \`Automake' and \`Perl' packages.
|
||||
Grab them from any GNU archive site."
|
||||
find . -type f -name Makefile.am -print |
|
||||
sed 's/\.am$/.in/' |
|
||||
while read f; do touch "$f"; done
|
||||
;;
|
||||
|
||||
autom4te*)
|
||||
echo 1>&2 "\
|
||||
WARNING: \`$1' is needed, but is $msg.
|
||||
You might have modified some files without having the
|
||||
proper tools for further handling them.
|
||||
You can get \`$1' as part of \`Autoconf' from any GNU
|
||||
archive site."
|
||||
|
||||
file=`echo "$*" | sed -n "$sed_output"`
|
||||
test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"`
|
||||
if test -f "$file"; then
|
||||
touch $file
|
||||
else
|
||||
test -z "$file" || exec >$file
|
||||
echo "#! /bin/sh"
|
||||
echo "# Created by GNU Automake missing as a replacement of"
|
||||
echo "# $ $@"
|
||||
echo "exit 0"
|
||||
chmod +x $file
|
||||
exit 1
|
||||
fi
|
||||
;;
|
||||
|
||||
bison*|yacc*)
|
||||
echo 1>&2 "\
|
||||
WARNING: \`$1' $msg. You should only need it if
|
||||
you modified a \`.y' file. You may need the \`Bison' package
|
||||
in order for those modifications to take effect. You can get
|
||||
\`Bison' from any GNU archive site."
|
||||
rm -f y.tab.c y.tab.h
|
||||
if test $# -ne 1; then
|
||||
eval LASTARG=\${$#}
|
||||
case $LASTARG in
|
||||
*.y)
|
||||
SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'`
|
||||
if test -f "$SRCFILE"; then
|
||||
cp "$SRCFILE" y.tab.c
|
||||
fi
|
||||
SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'`
|
||||
if test -f "$SRCFILE"; then
|
||||
cp "$SRCFILE" y.tab.h
|
||||
fi
|
||||
;;
|
||||
esac
|
||||
fi
|
||||
if test ! -f y.tab.h; then
|
||||
echo >y.tab.h
|
||||
fi
|
||||
if test ! -f y.tab.c; then
|
||||
echo 'main() { return 0; }' >y.tab.c
|
||||
fi
|
||||
;;
|
||||
|
||||
lex*|flex*)
|
||||
echo 1>&2 "\
|
||||
WARNING: \`$1' is $msg. You should only need it if
|
||||
you modified a \`.l' file. You may need the \`Flex' package
|
||||
in order for those modifications to take effect. You can get
|
||||
\`Flex' from any GNU archive site."
|
||||
rm -f lex.yy.c
|
||||
if test $# -ne 1; then
|
||||
eval LASTARG=\${$#}
|
||||
case $LASTARG in
|
||||
*.l)
|
||||
SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'`
|
||||
if test -f "$SRCFILE"; then
|
||||
cp "$SRCFILE" lex.yy.c
|
||||
fi
|
||||
;;
|
||||
esac
|
||||
fi
|
||||
if test ! -f lex.yy.c; then
|
||||
echo 'main() { return 0; }' >lex.yy.c
|
||||
fi
|
||||
;;
|
||||
|
||||
help2man*)
|
||||
echo 1>&2 "\
|
||||
WARNING: \`$1' is $msg. You should only need it if
|
||||
you modified a dependency of a manual page. You may need the
|
||||
\`Help2man' package in order for those modifications to take
|
||||
effect. You can get \`Help2man' from any GNU archive site."
|
||||
|
||||
file=`echo "$*" | sed -n "$sed_output"`
|
||||
test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"`
|
||||
if test -f "$file"; then
|
||||
touch $file
|
||||
else
|
||||
test -z "$file" || exec >$file
|
||||
echo ".ab help2man is required to generate this page"
|
||||
exit $?
|
||||
fi
|
||||
;;
|
||||
|
||||
makeinfo*)
|
||||
echo 1>&2 "\
|
||||
WARNING: \`$1' is $msg. You should only need it if
|
||||
you modified a \`.texi' or \`.texinfo' file, or any other file
|
||||
indirectly affecting the aspect of the manual. The spurious
|
||||
call might also be the consequence of using a buggy \`make' (AIX,
|
||||
DU, IRIX). You might want to install the \`Texinfo' package or
|
||||
the \`GNU make' package. Grab either from any GNU archive site."
|
||||
# The file to touch is that specified with -o ...
|
||||
file=`echo "$*" | sed -n "$sed_output"`
|
||||
test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"`
|
||||
if test -z "$file"; then
|
||||
# ... or it is the one specified with @setfilename ...
|
||||
infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'`
|
||||
file=`sed -n '
|
||||
/^@setfilename/{
|
||||
s/.* \([^ ]*\) *$/\1/
|
||||
p
|
||||
q
|
||||
}' $infile`
|
||||
# ... or it is derived from the source name (dir/f.texi becomes f.info)
|
||||
test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info
|
||||
fi
|
||||
# If the file does not exist, the user really needs makeinfo;
|
||||
# let's fail without touching anything.
|
||||
test -f $file || exit 1
|
||||
touch $file
|
||||
;;
|
||||
|
||||
*)
|
||||
echo 1>&2 "\
|
||||
WARNING: \`$1' is needed, and is $msg.
|
||||
You might have modified some files without having the
|
||||
proper tools for further handling them. Check the \`README' file,
|
||||
it often tells you about the needed prerequisites for installing
|
||||
this package. You may also peek at any GNU archive site, in case
|
||||
some other package would contain this missing \`$1' program."
|
||||
exit 1
|
||||
;;
|
||||
esac
|
||||
|
||||
exit 0
|
||||
|
||||
# Local variables:
|
||||
# eval: (add-hook 'write-file-hooks 'time-stamp)
|
||||
# time-stamp-start: "scriptversion="
|
||||
# time-stamp-format: "%:y-%02m-%02d.%02H"
|
||||
# time-stamp-time-zone: "UTC"
|
||||
# time-stamp-end: "; # UTC"
|
||||
# End:
|
||||
59
reed_sol.h
59
reed_sol.h
|
|
@ -1,59 +0,0 @@
|
|||
/* reed_sol.h
|
||||
* James S. Plank
|
||||
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
|
||||
|
||||
*/
|
||||
|
||||
extern int *reed_sol_vandermonde_coding_matrix(int k, int m, int w);
|
||||
extern int *reed_sol_extended_vandermonde_matrix(int rows, int cols, int w);
|
||||
extern int *reed_sol_big_vandermonde_distribution_matrix(int rows, int cols, int w);
|
||||
|
||||
extern int reed_sol_r6_encode(int k, int w, char **data_ptrs, char **coding_ptrs, int size);
|
||||
extern int *reed_sol_r6_coding_matrix(int k, int w);
|
||||
|
||||
extern void reed_sol_galois_w08_region_multby_2(char *region, int nbytes);
|
||||
extern void reed_sol_galois_w16_region_multby_2(char *region, int nbytes);
|
||||
extern void reed_sol_galois_w32_region_multby_2(char *region, int nbytes);
|
||||
|
|
@ -0,0 +1,10 @@
|
|||
# Jerasure AM file
|
||||
|
||||
INCLUDES=-I./
|
||||
AM_CFLAGS = -O3 $(SIMD_FLAGS) -fPIC $(INCLUDES)
|
||||
|
||||
lib_LTLIBRARIES = libJerasure.la
|
||||
libJerasure_la_SOURCES = galois.c jerasure.c reed_sol.c cauchy.c liberation.c
|
||||
libJerasure_la_LDFLAGS = -version-info 2:0:0
|
||||
libJerasure_la_LIBADD = -lgf_complete
|
||||
include_HEADERS = ../include/jerasure.h
|
||||
|
|
@ -0,0 +1,543 @@
|
|||
# Makefile.in generated by automake 1.11.3 from Makefile.am.
|
||||
# @configure_input@
|
||||
|
||||
# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
|
||||
# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
|
||||
# Foundation, Inc.
|
||||
# This Makefile.in is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# This program is distributed in the hope that it will be useful,
|
||||
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
|
||||
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
|
||||
# PARTICULAR PURPOSE.
|
||||
|
||||
@SET_MAKE@
|
||||
|
||||
# Jerasure AM file
|
||||
|
||||
|
||||
VPATH = @srcdir@
|
||||
pkgdatadir = $(datadir)/@PACKAGE@
|
||||
pkgincludedir = $(includedir)/@PACKAGE@
|
||||
pkglibdir = $(libdir)/@PACKAGE@
|
||||
pkglibexecdir = $(libexecdir)/@PACKAGE@
|
||||
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
|
||||
install_sh_DATA = $(install_sh) -c -m 644
|
||||
install_sh_PROGRAM = $(install_sh) -c
|
||||
install_sh_SCRIPT = $(install_sh) -c
|
||||
INSTALL_HEADER = $(INSTALL_DATA)
|
||||
transform = $(program_transform_name)
|
||||
NORMAL_INSTALL = :
|
||||
PRE_INSTALL = :
|
||||
POST_INSTALL = :
|
||||
NORMAL_UNINSTALL = :
|
||||
PRE_UNINSTALL = :
|
||||
POST_UNINSTALL = :
|
||||
build_triplet = @build@
|
||||
host_triplet = @host@
|
||||
subdir = src
|
||||
DIST_COMMON = $(include_HEADERS) $(srcdir)/Makefile.am \
|
||||
$(srcdir)/Makefile.in
|
||||
ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
|
||||
am__aclocal_m4_deps = $(top_srcdir)/m4/ax_check_compile_flag.m4 \
|
||||
$(top_srcdir)/m4/ax_ext.m4 \
|
||||
$(top_srcdir)/m4/ax_gcc_x86_avx_xgetbv.m4 \
|
||||
$(top_srcdir)/m4/ax_gcc_x86_cpuid.m4 \
|
||||
$(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \
|
||||
$(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \
|
||||
$(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac
|
||||
am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
|
||||
$(ACLOCAL_M4)
|
||||
mkinstalldirs = $(install_sh) -d
|
||||
CONFIG_HEADER = $(top_builddir)/include/config.h
|
||||
CONFIG_CLEAN_FILES =
|
||||
CONFIG_CLEAN_VPATH_FILES =
|
||||
am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
|
||||
am__vpath_adj = case $$p in \
|
||||
$(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
|
||||
*) f=$$p;; \
|
||||
esac;
|
||||
am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
|
||||
am__install_max = 40
|
||||
am__nobase_strip_setup = \
|
||||
srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
|
||||
am__nobase_strip = \
|
||||
for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
|
||||
am__nobase_list = $(am__nobase_strip_setup); \
|
||||
for p in $$list; do echo "$$p $$p"; done | \
|
||||
sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
|
||||
$(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
|
||||
if (++n[$$2] == $(am__install_max)) \
|
||||
{ print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
|
||||
END { for (dir in files) print dir, files[dir] }'
|
||||
am__base_list = \
|
||||
sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
|
||||
sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
|
||||
am__uninstall_files_from_dir = { \
|
||||
test -z "$$files" \
|
||||
|| { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
|
||||
|| { echo " ( cd '$$dir' && rm -f" $$files ")"; \
|
||||
$(am__cd) "$$dir" && rm -f $$files; }; \
|
||||
}
|
||||
am__installdirs = "$(DESTDIR)$(libdir)" "$(DESTDIR)$(includedir)"
|
||||
LTLIBRARIES = $(lib_LTLIBRARIES)
|
||||
libJerasure_la_DEPENDENCIES =
|
||||
am_libJerasure_la_OBJECTS = galois.lo jerasure.lo reed_sol.lo \
|
||||
cauchy.lo liberation.lo
|
||||
libJerasure_la_OBJECTS = $(am_libJerasure_la_OBJECTS)
|
||||
libJerasure_la_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) \
|
||||
$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
|
||||
$(libJerasure_la_LDFLAGS) $(LDFLAGS) -o $@
|
||||
DEFAULT_INCLUDES = -I.@am__isrc@ -I$(top_builddir)/include
|
||||
depcomp =
|
||||
am__depfiles_maybe =
|
||||
COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
|
||||
$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
|
||||
LTCOMPILE = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
|
||||
--mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
|
||||
$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
|
||||
CCLD = $(CC)
|
||||
LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
|
||||
--mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) \
|
||||
$(LDFLAGS) -o $@
|
||||
SOURCES = $(libJerasure_la_SOURCES)
|
||||
DIST_SOURCES = $(libJerasure_la_SOURCES)
|
||||
HEADERS = $(include_HEADERS)
|
||||
ETAGS = etags
|
||||
CTAGS = ctags
|
||||
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
|
||||
ACLOCAL = @ACLOCAL@
|
||||
AMTAR = @AMTAR@
|
||||
AR = @AR@
|
||||
AUTOCONF = @AUTOCONF@
|
||||
AUTOHEADER = @AUTOHEADER@
|
||||
AUTOMAKE = @AUTOMAKE@
|
||||
AWK = @AWK@
|
||||
CC = @CC@
|
||||
CFLAGS = @CFLAGS@
|
||||
CPP = @CPP@
|
||||
CPPFLAGS = @CPPFLAGS@
|
||||
CYGPATH_W = @CYGPATH_W@
|
||||
DEFS = @DEFS@
|
||||
DLLTOOL = @DLLTOOL@
|
||||
DSYMUTIL = @DSYMUTIL@
|
||||
DUMPBIN = @DUMPBIN@
|
||||
ECHO_C = @ECHO_C@
|
||||
ECHO_N = @ECHO_N@
|
||||
ECHO_T = @ECHO_T@
|
||||
EGREP = @EGREP@
|
||||
EXEEXT = @EXEEXT@
|
||||
FGREP = @FGREP@
|
||||
GREP = @GREP@
|
||||
INSTALL = @INSTALL@
|
||||
INSTALL_DATA = @INSTALL_DATA@
|
||||
INSTALL_PROGRAM = @INSTALL_PROGRAM@
|
||||
INSTALL_SCRIPT = @INSTALL_SCRIPT@
|
||||
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
|
||||
LD = @LD@
|
||||
LDFLAGS = @LDFLAGS@
|
||||
LIBOBJS = @LIBOBJS@
|
||||
LIBS = @LIBS@
|
||||
LIBTOOL = @LIBTOOL@
|
||||
LIPO = @LIPO@
|
||||
LN_S = @LN_S@
|
||||
LTLIBOBJS = @LTLIBOBJS@
|
||||
MAKEINFO = @MAKEINFO@
|
||||
MANIFEST_TOOL = @MANIFEST_TOOL@
|
||||
MKDIR_P = @MKDIR_P@
|
||||
NM = @NM@
|
||||
NMEDIT = @NMEDIT@
|
||||
OBJDUMP = @OBJDUMP@
|
||||
OBJEXT = @OBJEXT@
|
||||
OTOOL = @OTOOL@
|
||||
OTOOL64 = @OTOOL64@
|
||||
PACKAGE = @PACKAGE@
|
||||
PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
|
||||
PACKAGE_NAME = @PACKAGE_NAME@
|
||||
PACKAGE_STRING = @PACKAGE_STRING@
|
||||
PACKAGE_TARNAME = @PACKAGE_TARNAME@
|
||||
PACKAGE_URL = @PACKAGE_URL@
|
||||
PACKAGE_VERSION = @PACKAGE_VERSION@
|
||||
PATH_SEPARATOR = @PATH_SEPARATOR@
|
||||
RANLIB = @RANLIB@
|
||||
SED = @SED@
|
||||
SET_MAKE = @SET_MAKE@
|
||||
SHELL = @SHELL@
|
||||
SIMD_FLAGS = @SIMD_FLAGS@
|
||||
STRIP = @STRIP@
|
||||
VERSION = @VERSION@
|
||||
abs_builddir = @abs_builddir@
|
||||
abs_srcdir = @abs_srcdir@
|
||||
abs_top_builddir = @abs_top_builddir@
|
||||
abs_top_srcdir = @abs_top_srcdir@
|
||||
ac_ct_AR = @ac_ct_AR@
|
||||
ac_ct_CC = @ac_ct_CC@
|
||||
ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
|
||||
am__leading_dot = @am__leading_dot@
|
||||
am__tar = @am__tar@
|
||||
am__untar = @am__untar@
|
||||
bindir = @bindir@
|
||||
build = @build@
|
||||
build_alias = @build_alias@
|
||||
build_cpu = @build_cpu@
|
||||
build_os = @build_os@
|
||||
build_vendor = @build_vendor@
|
||||
builddir = @builddir@
|
||||
datadir = @datadir@
|
||||
datarootdir = @datarootdir@
|
||||
docdir = @docdir@
|
||||
dvidir = @dvidir@
|
||||
exec_prefix = @exec_prefix@
|
||||
host = @host@
|
||||
host_alias = @host_alias@
|
||||
host_cpu = @host_cpu@
|
||||
host_os = @host_os@
|
||||
host_vendor = @host_vendor@
|
||||
htmldir = @htmldir@
|
||||
includedir = @includedir@
|
||||
infodir = @infodir@
|
||||
install_sh = @install_sh@
|
||||
libdir = @libdir@
|
||||
libexecdir = @libexecdir@
|
||||
localedir = @localedir@
|
||||
localstatedir = @localstatedir@
|
||||
mandir = @mandir@
|
||||
mkdir_p = @mkdir_p@
|
||||
oldincludedir = @oldincludedir@
|
||||
pdfdir = @pdfdir@
|
||||
prefix = @prefix@
|
||||
program_transform_name = @program_transform_name@
|
||||
psdir = @psdir@
|
||||
sbindir = @sbindir@
|
||||
sharedstatedir = @sharedstatedir@
|
||||
srcdir = @srcdir@
|
||||
sysconfdir = @sysconfdir@
|
||||
target_alias = @target_alias@
|
||||
top_build_prefix = @top_build_prefix@
|
||||
top_builddir = @top_builddir@
|
||||
top_srcdir = @top_srcdir@
|
||||
INCLUDES = -I./
|
||||
AM_CFLAGS = -O3 $(SIMD_FLAGS) -fPIC $(INCLUDES)
|
||||
lib_LTLIBRARIES = libJerasure.la
|
||||
libJerasure_la_SOURCES = galois.c jerasure.c reed_sol.c cauchy.c liberation.c
|
||||
libJerasure_la_LDFLAGS = -version-info 2:0:0
|
||||
libJerasure_la_LIBADD = -lgf_complete
|
||||
include_HEADERS = ../include/jerasure.h
|
||||
all: all-am
|
||||
|
||||
.SUFFIXES:
|
||||
.SUFFIXES: .c .lo .o .obj
|
||||
$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps)
|
||||
@for dep in $?; do \
|
||||
case '$(am__configure_deps)' in \
|
||||
*$$dep*) \
|
||||
( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \
|
||||
&& { if test -f $@; then exit 0; else break; fi; }; \
|
||||
exit 1;; \
|
||||
esac; \
|
||||
done; \
|
||||
echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps src/Makefile'; \
|
||||
$(am__cd) $(top_srcdir) && \
|
||||
$(AUTOMAKE) --gnu --ignore-deps src/Makefile
|
||||
.PRECIOUS: Makefile
|
||||
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
|
||||
@case '$?' in \
|
||||
*config.status*) \
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
|
||||
*) \
|
||||
echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
|
||||
cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
|
||||
esac;
|
||||
|
||||
$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
|
||||
|
||||
$(top_srcdir)/configure: $(am__configure_deps)
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
|
||||
$(ACLOCAL_M4): $(am__aclocal_m4_deps)
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
|
||||
$(am__aclocal_m4_deps):
|
||||
install-libLTLIBRARIES: $(lib_LTLIBRARIES)
|
||||
@$(NORMAL_INSTALL)
|
||||
test -z "$(libdir)" || $(MKDIR_P) "$(DESTDIR)$(libdir)"
|
||||
@list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \
|
||||
list2=; for p in $$list; do \
|
||||
if test -f $$p; then \
|
||||
list2="$$list2 $$p"; \
|
||||
else :; fi; \
|
||||
done; \
|
||||
test -z "$$list2" || { \
|
||||
echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \
|
||||
$(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \
|
||||
}
|
||||
|
||||
uninstall-libLTLIBRARIES:
|
||||
@$(NORMAL_UNINSTALL)
|
||||
@list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \
|
||||
for p in $$list; do \
|
||||
$(am__strip_dir) \
|
||||
echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'"; \
|
||||
$(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$f"; \
|
||||
done
|
||||
|
||||
clean-libLTLIBRARIES:
|
||||
-test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES)
|
||||
@list='$(lib_LTLIBRARIES)'; for p in $$list; do \
|
||||
dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
|
||||
test "$$dir" != "$$p" || dir=.; \
|
||||
echo "rm -f \"$${dir}/so_locations\""; \
|
||||
rm -f "$${dir}/so_locations"; \
|
||||
done
|
||||
libJerasure.la: $(libJerasure_la_OBJECTS) $(libJerasure_la_DEPENDENCIES) $(EXTRA_libJerasure_la_DEPENDENCIES)
|
||||
$(libJerasure_la_LINK) -rpath $(libdir) $(libJerasure_la_OBJECTS) $(libJerasure_la_LIBADD) $(LIBS)
|
||||
|
||||
mostlyclean-compile:
|
||||
-rm -f *.$(OBJEXT)
|
||||
|
||||
distclean-compile:
|
||||
-rm -f *.tab.c
|
||||
|
||||
.c.o:
|
||||
$(COMPILE) -c $<
|
||||
|
||||
.c.obj:
|
||||
$(COMPILE) -c `$(CYGPATH_W) '$<'`
|
||||
|
||||
.c.lo:
|
||||
$(LTCOMPILE) -c -o $@ $<
|
||||
|
||||
mostlyclean-libtool:
|
||||
-rm -f *.lo
|
||||
|
||||
clean-libtool:
|
||||
-rm -rf .libs _libs
|
||||
install-includeHEADERS: $(include_HEADERS)
|
||||
@$(NORMAL_INSTALL)
|
||||
test -z "$(includedir)" || $(MKDIR_P) "$(DESTDIR)$(includedir)"
|
||||
@list='$(include_HEADERS)'; test -n "$(includedir)" || list=; \
|
||||
for p in $$list; do \
|
||||
if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
|
||||
echo "$$d$$p"; \
|
||||
done | $(am__base_list) | \
|
||||
while read files; do \
|
||||
echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(includedir)'"; \
|
||||
$(INSTALL_HEADER) $$files "$(DESTDIR)$(includedir)" || exit $$?; \
|
||||
done
|
||||
|
||||
uninstall-includeHEADERS:
|
||||
@$(NORMAL_UNINSTALL)
|
||||
@list='$(include_HEADERS)'; test -n "$(includedir)" || list=; \
|
||||
files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
|
||||
dir='$(DESTDIR)$(includedir)'; $(am__uninstall_files_from_dir)
|
||||
|
||||
ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
|
||||
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
|
||||
unique=`for i in $$list; do \
|
||||
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||
done | \
|
||||
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
|
||||
END { if (nonempty) { for (i in files) print i; }; }'`; \
|
||||
mkid -fID $$unique
|
||||
tags: TAGS
|
||||
|
||||
TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
|
||||
$(TAGS_FILES) $(LISP)
|
||||
set x; \
|
||||
here=`pwd`; \
|
||||
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
|
||||
unique=`for i in $$list; do \
|
||||
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||
done | \
|
||||
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
|
||||
END { if (nonempty) { for (i in files) print i; }; }'`; \
|
||||
shift; \
|
||||
if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \
|
||||
test -n "$$unique" || unique=$$empty_fix; \
|
||||
if test $$# -gt 0; then \
|
||||
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
|
||||
"$$@" $$unique; \
|
||||
else \
|
||||
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
|
||||
$$unique; \
|
||||
fi; \
|
||||
fi
|
||||
ctags: CTAGS
|
||||
CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
|
||||
$(TAGS_FILES) $(LISP)
|
||||
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
|
||||
unique=`for i in $$list; do \
|
||||
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||
done | \
|
||||
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
|
||||
END { if (nonempty) { for (i in files) print i; }; }'`; \
|
||||
test -z "$(CTAGS_ARGS)$$unique" \
|
||||
|| $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
|
||||
$$unique
|
||||
|
||||
GTAGS:
|
||||
here=`$(am__cd) $(top_builddir) && pwd` \
|
||||
&& $(am__cd) $(top_srcdir) \
|
||||
&& gtags -i $(GTAGS_ARGS) "$$here"
|
||||
|
||||
distclean-tags:
|
||||
-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
|
||||
|
||||
distdir: $(DISTFILES)
|
||||
@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
|
||||
topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
|
||||
list='$(DISTFILES)'; \
|
||||
dist_files=`for file in $$list; do echo $$file; done | \
|
||||
sed -e "s|^$$srcdirstrip/||;t" \
|
||||
-e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
|
||||
case $$dist_files in \
|
||||
*/*) $(MKDIR_P) `echo "$$dist_files" | \
|
||||
sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
|
||||
sort -u` ;; \
|
||||
esac; \
|
||||
for file in $$dist_files; do \
|
||||
if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
|
||||
if test -d $$d/$$file; then \
|
||||
dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
|
||||
if test -d "$(distdir)/$$file"; then \
|
||||
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
|
||||
fi; \
|
||||
if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
|
||||
cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
|
||||
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
|
||||
fi; \
|
||||
cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
|
||||
else \
|
||||
test -f "$(distdir)/$$file" \
|
||||
|| cp -p $$d/$$file "$(distdir)/$$file" \
|
||||
|| exit 1; \
|
||||
fi; \
|
||||
done
|
||||
check-am: all-am
|
||||
check: check-am
|
||||
all-am: Makefile $(LTLIBRARIES) $(HEADERS)
|
||||
installdirs:
|
||||
for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(includedir)"; do \
|
||||
test -z "$$dir" || $(MKDIR_P) "$$dir"; \
|
||||
done
|
||||
install: install-am
|
||||
install-exec: install-exec-am
|
||||
install-data: install-data-am
|
||||
uninstall: uninstall-am
|
||||
|
||||
install-am: all-am
|
||||
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
|
||||
|
||||
installcheck: installcheck-am
|
||||
install-strip:
|
||||
if test -z '$(STRIP)'; then \
|
||||
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
|
||||
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
|
||||
install; \
|
||||
else \
|
||||
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
|
||||
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
|
||||
"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
|
||||
fi
|
||||
mostlyclean-generic:
|
||||
|
||||
clean-generic:
|
||||
|
||||
distclean-generic:
|
||||
-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
|
||||
-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
|
||||
|
||||
maintainer-clean-generic:
|
||||
@echo "This command is intended for maintainers to use"
|
||||
@echo "it deletes files that may require special tools to rebuild."
|
||||
clean: clean-am
|
||||
|
||||
clean-am: clean-generic clean-libLTLIBRARIES clean-libtool \
|
||||
mostlyclean-am
|
||||
|
||||
distclean: distclean-am
|
||||
-rm -f Makefile
|
||||
distclean-am: clean-am distclean-compile distclean-generic \
|
||||
distclean-tags
|
||||
|
||||
dvi: dvi-am
|
||||
|
||||
dvi-am:
|
||||
|
||||
html: html-am
|
||||
|
||||
html-am:
|
||||
|
||||
info: info-am
|
||||
|
||||
info-am:
|
||||
|
||||
install-data-am: install-includeHEADERS
|
||||
|
||||
install-dvi: install-dvi-am
|
||||
|
||||
install-dvi-am:
|
||||
|
||||
install-exec-am: install-libLTLIBRARIES
|
||||
|
||||
install-html: install-html-am
|
||||
|
||||
install-html-am:
|
||||
|
||||
install-info: install-info-am
|
||||
|
||||
install-info-am:
|
||||
|
||||
install-man:
|
||||
|
||||
install-pdf: install-pdf-am
|
||||
|
||||
install-pdf-am:
|
||||
|
||||
install-ps: install-ps-am
|
||||
|
||||
install-ps-am:
|
||||
|
||||
installcheck-am:
|
||||
|
||||
maintainer-clean: maintainer-clean-am
|
||||
-rm -f Makefile
|
||||
maintainer-clean-am: distclean-am maintainer-clean-generic
|
||||
|
||||
mostlyclean: mostlyclean-am
|
||||
|
||||
mostlyclean-am: mostlyclean-compile mostlyclean-generic \
|
||||
mostlyclean-libtool
|
||||
|
||||
pdf: pdf-am
|
||||
|
||||
pdf-am:
|
||||
|
||||
ps: ps-am
|
||||
|
||||
ps-am:
|
||||
|
||||
uninstall-am: uninstall-includeHEADERS uninstall-libLTLIBRARIES
|
||||
|
||||
.MAKE: install-am install-strip
|
||||
|
||||
.PHONY: CTAGS GTAGS all all-am check check-am clean clean-generic \
|
||||
clean-libLTLIBRARIES clean-libtool ctags distclean \
|
||||
distclean-compile distclean-generic distclean-libtool \
|
||||
distclean-tags distdir dvi dvi-am html html-am info info-am \
|
||||
install install-am install-data install-data-am install-dvi \
|
||||
install-dvi-am install-exec install-exec-am install-html \
|
||||
install-html-am install-includeHEADERS install-info \
|
||||
install-info-am install-libLTLIBRARIES install-man install-pdf \
|
||||
install-pdf-am install-ps install-ps-am install-strip \
|
||||
installcheck installcheck-am installdirs maintainer-clean \
|
||||
maintainer-clean-generic mostlyclean mostlyclean-compile \
|
||||
mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \
|
||||
tags uninstall uninstall-am uninstall-includeHEADERS \
|
||||
uninstall-libLTLIBRARIES
|
||||
|
||||
|
||||
# Tell versions [3.59,3.63) of GNU make to not export all variables.
|
||||
# Otherwise a system limit (for SysV at least) may be exceeded.
|
||||
.NOEXPORT:
|
||||
|
|
@ -1,50 +1,47 @@
|
|||
/* cauchy.c
|
||||
* James S. Plank
|
||||
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
/* *
|
||||
* 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>
|
||||
|
|
@ -1,49 +1,47 @@
|
|||
/* cauchy_best_r6.c
|
||||
* James S. Plank
|
||||
/* *
|
||||
* 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 - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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>
|
||||
|
|
@ -0,0 +1,351 @@
|
|||
/* *
|
||||
* 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 "galois.h"
|
||||
|
||||
#define MAX_GF_INSTANCES 64
|
||||
gf_t *gfp_array[MAX_GF_INSTANCES] = { 0 };
|
||||
int gfp_is_composite[MAX_GF_INSTANCES] = { 0 };
|
||||
|
||||
gf_t *galois_get_field_ptr(int w)
|
||||
{
|
||||
if (gfp_array[w] != NULL) {
|
||||
return gfp_array[w];
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
gf_t* galois_init_field(int w,
|
||||
int mult_type,
|
||||
int region_type,
|
||||
int divide_type,
|
||||
uint64_t prim_poly,
|
||||
int arg1,
|
||||
int arg2)
|
||||
{
|
||||
int scratch_size;
|
||||
void *scratch_memory;
|
||||
gf_t *gfp;
|
||||
|
||||
if (w <= 0 || w > 32) {
|
||||
fprintf(stderr, "ERROR -- cannot init default Galois field for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
gfp = (gf_t *) malloc(sizeof(gf_t));
|
||||
if (!gfp) {
|
||||
fprintf(stderr, "ERROR -- cannot allocate memory for Galois field w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
scratch_size = gf_scratch_size(w, mult_type, region_type, divide_type, arg1, arg2);
|
||||
if (!scratch_size) {
|
||||
fprintf(stderr, "ERROR -- cannot get scratch size for base field w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
scratch_memory = malloc(scratch_size);
|
||||
if (!scratch_memory) {
|
||||
fprintf(stderr, "ERROR -- cannot get scratch memory for base field w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
if(!gf_init_hard(gfp,
|
||||
w,
|
||||
mult_type,
|
||||
region_type,
|
||||
divide_type,
|
||||
prim_poly,
|
||||
arg1,
|
||||
arg2,
|
||||
NULL,
|
||||
scratch_memory))
|
||||
{
|
||||
fprintf(stderr, "ERROR -- cannot init default Galois field for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
gfp_is_composite[w] = 0;
|
||||
return gfp;
|
||||
}
|
||||
|
||||
gf_t* galois_init_composite_field(int w,
|
||||
int region_type,
|
||||
int divide_type,
|
||||
int degree,
|
||||
gf_t* base_gf)
|
||||
{
|
||||
int scratch_size;
|
||||
void *scratch_memory;
|
||||
gf_t *gfp;
|
||||
|
||||
if (w <= 0 || w > 32) {
|
||||
fprintf(stderr, "ERROR -- cannot init composite field for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
gfp = (gf_t *) malloc(sizeof(gf_t));
|
||||
if (!gfp) {
|
||||
fprintf(stderr, "ERROR -- cannot allocate memory for Galois field w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
scratch_size = gf_scratch_size(w, GF_MULT_COMPOSITE, region_type, divide_type, degree, 0);
|
||||
if (!scratch_size) {
|
||||
fprintf(stderr, "ERROR -- cannot get scratch size for composite field w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
scratch_memory = malloc(scratch_size);
|
||||
if (!scratch_memory) {
|
||||
fprintf(stderr, "ERROR -- cannot get scratch memory for composite field w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
if(!gf_init_hard(gfp,
|
||||
w,
|
||||
GF_MULT_COMPOSITE,
|
||||
region_type,
|
||||
divide_type,
|
||||
0,
|
||||
degree,
|
||||
0,
|
||||
base_gf,
|
||||
scratch_memory))
|
||||
{
|
||||
fprintf(stderr, "ERROR -- cannot init default composite field for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
gfp_is_composite[w] = 1;
|
||||
return gfp;
|
||||
}
|
||||
|
||||
static void galois_init_default_field(int w)
|
||||
{
|
||||
if (w <= 0 || w > 32) {
|
||||
fprintf(stderr, "ERROR -- cannot init default Galois field for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
if (gfp_array[w] == NULL) {
|
||||
gfp_array[w] = (gf_t*)malloc(sizeof(gf_t));
|
||||
if (gfp_array[w] == NULL) {
|
||||
fprintf(stderr, "ERROR -- cannot allocate memory for Galois field w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
|
||||
if (!gf_init_easy(gfp_array[w], w)) {
|
||||
fprintf(stderr, "ERROR -- cannot init default Galois field for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
static int is_valid_gf(gf_t *gf, int w)
|
||||
{
|
||||
// TODO: I assume we may eventually
|
||||
// want to do w=64 and 128, so w
|
||||
// will be needed to perform this check
|
||||
(void)w;
|
||||
|
||||
if (gf == NULL) {
|
||||
return 0;
|
||||
}
|
||||
if (gf->multiply.w32 == NULL) {
|
||||
return 0;
|
||||
}
|
||||
if (gf->multiply_region.w32 == NULL) {
|
||||
return 0;
|
||||
}
|
||||
if (gf->divide.w32 == NULL) {
|
||||
return 0;
|
||||
}
|
||||
if (gf->inverse.w32 == NULL) {
|
||||
return 0;
|
||||
}
|
||||
if (gf->extract_word.w32 == NULL) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
return 1;
|
||||
}
|
||||
|
||||
void galois_change_technique(gf_t *gf, int w)
|
||||
{
|
||||
if (w <= 0 || w > 32) {
|
||||
fprintf(stderr, "ERROR -- cannot support Galois field for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
if (!is_valid_gf(gf, w)) {
|
||||
fprintf(stderr, "ERROR -- overriding with invalid Galois field for w=%d\n", w);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
if (gfp_array[w] != NULL) {
|
||||
gf_free(gfp_array[w], gfp_is_composite[w]);
|
||||
}
|
||||
|
||||
gfp_array[w] = gf;
|
||||
}
|
||||
|
||||
int galois_single_multiply(int x, int y, int w)
|
||||
{
|
||||
if (x == 0 || y == 0) return 0;
|
||||
|
||||
if (gfp_array[w] == NULL) {
|
||||
galois_init_default_field(w);
|
||||
}
|
||||
|
||||
if (w <= 32) {
|
||||
return gfp_array[w]->multiply.w32(gfp_array[w], x, y);
|
||||
} else {
|
||||
fprintf(stderr, "ERROR -- Galois field not implemented for w=%d\n", w);
|
||||
}
|
||||
}
|
||||
|
||||
int galois_single_divide(int x, int y, int w)
|
||||
{
|
||||
if (x == 0) return 0;
|
||||
if (y == 0) return -1;
|
||||
|
||||
if (gfp_array[w] == NULL) {
|
||||
galois_init_default_field(w);
|
||||
}
|
||||
|
||||
if (w <= 32) {
|
||||
return gfp_array[w]->divide.w32(gfp_array[w], x, y);
|
||||
} else {
|
||||
fprintf(stderr, "ERROR -- Galois field not implemented for w=%d\n", w);
|
||||
}
|
||||
}
|
||||
|
||||
void galois_w08_region_multiply(char *region, /* Region to multiply */
|
||||
int multby, /* Number to multiply by */
|
||||
int nbytes, /* Number of bytes in region */
|
||||
char *r2, /* If r2 != NULL, products go here */
|
||||
int add)
|
||||
{
|
||||
if (gfp_array[8] == NULL) {
|
||||
galois_init_default_field(8);
|
||||
}
|
||||
gfp_array[8]->multiply_region.w32(gfp_array[8], region, r2, multby, nbytes, add);
|
||||
}
|
||||
|
||||
void galois_w16_region_multiply(char *region, /* Region to multiply */
|
||||
int multby, /* Number to multiply by */
|
||||
int nbytes, /* Number of bytes in region */
|
||||
char *r2, /* If r2 != NULL, products go here */
|
||||
int add)
|
||||
{
|
||||
if (gfp_array[16] == NULL) {
|
||||
galois_init_default_field(16);
|
||||
}
|
||||
gfp_array[16]->multiply_region.w32(gfp_array[16], region, r2, multby, nbytes, add);
|
||||
}
|
||||
|
||||
|
||||
void galois_w32_region_multiply(char *region, /* Region to multiply */
|
||||
int multby, /* Number to multiply by */
|
||||
int nbytes, /* Number of bytes in region */
|
||||
char *r2, /* If r2 != NULL, products go here */
|
||||
int add)
|
||||
{
|
||||
if (gfp_array[32] == NULL) {
|
||||
galois_init_default_field(32);
|
||||
}
|
||||
gfp_array[32]->multiply_region.w32(gfp_array[32], region, r2, multby, nbytes, add);
|
||||
}
|
||||
|
||||
void galois_w8_region_xor(void *src, void *dest, int nbytes)
|
||||
{
|
||||
if (gfp_array[8] == NULL) {
|
||||
galois_init_default_field(8);
|
||||
}
|
||||
gfp_array[8]->multiply_region.w32(gfp_array[32], src, dest, 1, nbytes, 1);
|
||||
}
|
||||
|
||||
void galois_w16_region_xor(void *src, void *dest, int nbytes)
|
||||
{
|
||||
if (gfp_array[16] == NULL) {
|
||||
galois_init_default_field(16);
|
||||
}
|
||||
gfp_array[16]->multiply_region.w32(gfp_array[16], src, dest, 1, nbytes, 1);
|
||||
}
|
||||
|
||||
void galois_w32_region_xor(void *src, void *dest, int nbytes)
|
||||
{
|
||||
if (gfp_array[32] == NULL) {
|
||||
galois_init_default_field(32);
|
||||
}
|
||||
gfp_array[32]->multiply_region.w32(gfp_array[32], src, dest, 1, nbytes, 1);
|
||||
}
|
||||
|
||||
void galois_region_xor(char *src, char *dest, int nbytes)
|
||||
{
|
||||
if (nbytes >= 16) {
|
||||
galois_w32_region_xor(src, dest, nbytes);
|
||||
} else {
|
||||
int i = 0;
|
||||
for (i = 0; i < nbytes; i++) {
|
||||
*dest ^= *src;
|
||||
dest++;
|
||||
src++;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int galois_inverse(int y, int w)
|
||||
{
|
||||
if (y == 0) return -1;
|
||||
return galois_single_divide(1, y, w);
|
||||
}
|
||||
|
|
@ -1,49 +1,47 @@
|
|||
/* jerasure.c
|
||||
* James S. Plank
|
||||
/* *
|
||||
* 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 - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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>
|
||||
|
|
@ -349,7 +347,7 @@ void jerasure_bitmatrix_dotprod(int k, int w, int *bitmatrix_row,
|
|||
jerasure_total_memcpy_bytes += packetsize;
|
||||
pstarted = 1;
|
||||
} else {
|
||||
galois_region_xor(pptr, dptr, pptr, packetsize);
|
||||
galois_region_xor(dptr, pptr, packetsize);
|
||||
jerasure_total_xor_bytes += packetsize;
|
||||
}
|
||||
}
|
||||
|
|
@ -368,7 +366,7 @@ void jerasure_do_parity(int k, char **data_ptrs, char *parity_ptr, int size)
|
|||
jerasure_total_memcpy_bytes += size;
|
||||
|
||||
for (i = 1; i < k; i++) {
|
||||
galois_region_xor(data_ptrs[i], parity_ptr, parity_ptr, size);
|
||||
galois_region_xor(data_ptrs[i], parity_ptr, size);
|
||||
jerasure_total_xor_bytes += size;
|
||||
}
|
||||
}
|
||||
|
|
@ -607,7 +605,7 @@ void jerasure_matrix_dotprod(int k, int w, int *matrix_row,
|
|||
jerasure_total_memcpy_bytes += size;
|
||||
init = 1;
|
||||
} else {
|
||||
galois_region_xor(sptr, dptr, dptr, size);
|
||||
galois_region_xor(sptr, dptr, size);
|
||||
jerasure_total_xor_bytes += size;
|
||||
}
|
||||
}
|
||||
|
|
@ -1181,7 +1179,7 @@ void jerasure_do_scheduled_operations(char **ptrs, int **operations, int packets
|
|||
operations[op][2],
|
||||
operations[op][3]);
|
||||
printf("xor(0x%x, 0x%x -> 0x%x, %d)\n", sptr, dptr, dptr, packetsize); */
|
||||
galois_region_xor(sptr, dptr, dptr, packetsize);
|
||||
galois_region_xor(sptr, dptr, packetsize);
|
||||
jerasure_total_xor_bytes += packetsize;
|
||||
} else {
|
||||
/* printf("memcpy(0x%x <- 0x%x)\n", dptr, sptr); */
|
||||
|
|
@ -1380,3 +1378,16 @@ void jerasure_bitmatrix_encode(int k, int m, int w, int *bitmatrix,
|
|||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* Exported function for use by autoconf to perform quick
|
||||
* spot-check.
|
||||
*/
|
||||
int jerasure_autoconf_test()
|
||||
{
|
||||
int x = galois_single_multiply(1, 2, 8);
|
||||
if (x != 2) {
|
||||
return -1;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
|
@ -1,50 +1,47 @@
|
|||
/* liberation.c
|
||||
* James S. Plank
|
||||
|
||||
Jerasure - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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.
|
||||
/* *
|
||||
* 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>
|
||||
|
|
@ -1,55 +1,54 @@
|
|||
/* reed_sol.c
|
||||
* James S. Plank
|
||||
/* *
|
||||
* 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 - A C/C++ Library for a Variety of Reed-Solomon and RAID-6 Erasure Coding Techniques
|
||||
|
||||
Revision 1.2A
|
||||
May 24, 2011
|
||||
|
||||
James S. Plank
|
||||
Department of Electrical Engineering and Computer Science
|
||||
University of Tennessee
|
||||
Knoxville, TN 37996
|
||||
plank@cs.utk.edu
|
||||
|
||||
Copyright (c) 2011, James S. Plank
|
||||
All rights reserved.
|
||||
|
||||
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 <gf_complete.h>
|
||||
#include "galois.h"
|
||||
#include "jerasure.h"
|
||||
#include "reed_sol.h"
|
||||
|
|
@ -99,118 +98,52 @@ int *reed_sol_vandermonde_coding_matrix(int k, int m, int w)
|
|||
return dist;
|
||||
}
|
||||
|
||||
static int prim32 = -1;
|
||||
|
||||
#define rgw32_mask(v) ((v) & 0x80000000)
|
||||
|
||||
void reed_sol_galois_w32_region_multby_2(char *region, int nbytes)
|
||||
{
|
||||
int *l1;
|
||||
int *ltop;
|
||||
char *ctop;
|
||||
|
||||
if (prim32 == -1) prim32 = galois_single_multiply((1 << 31), 2, 32);
|
||||
|
||||
ctop = region + nbytes;
|
||||
ltop = (int *) ctop;
|
||||
l1 = (int *) region;
|
||||
|
||||
while (l1 < ltop) {
|
||||
*l1 = ((*l1) << 1) ^ ((*l1 & 0x80000000) ? prim32 : 0);
|
||||
l1++;
|
||||
}
|
||||
}
|
||||
|
||||
static int prim08 = -1;
|
||||
static int mask08_1 = -1;
|
||||
static int mask08_2 = -1;
|
||||
static gf_t GF08;
|
||||
|
||||
void reed_sol_galois_w08_region_multby_2(char *region, int nbytes)
|
||||
{
|
||||
unsigned int *l1;
|
||||
unsigned int *ltop;
|
||||
char *ctop;
|
||||
unsigned int tmp, tmp2;
|
||||
|
||||
|
||||
if (prim08 == -1) {
|
||||
tmp = galois_single_multiply((1 << 7), 2, 8);
|
||||
prim08 = 0;
|
||||
while (tmp != 0) {
|
||||
prim08 |= tmp;
|
||||
tmp = (tmp << 8);
|
||||
}
|
||||
tmp = (1 << 8) - 2;
|
||||
mask08_1 = 0;
|
||||
while (tmp != 0) {
|
||||
mask08_1 |= tmp;
|
||||
tmp = (tmp << 8);
|
||||
}
|
||||
tmp = (1 << 7);
|
||||
mask08_2 = 0;
|
||||
while (tmp != 0) {
|
||||
mask08_2 |= tmp;
|
||||
tmp = (tmp << 8);
|
||||
prim08 = galois_single_multiply((1 << 7), 2, 8);
|
||||
if (!gf_init_hard(&GF08, 8, GF_MULT_BYTWO_b, GF_REGION_DEFAULT, GF_DIVIDE_DEFAULT,
|
||||
prim08, 0, 0, NULL, NULL)) {
|
||||
fprintf(stderr, "Error: Can't initialize the GF for reed_sol_galois_w08_region_multby_2\n");
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
|
||||
ctop = region + nbytes;
|
||||
ltop = (unsigned int *) ctop;
|
||||
l1 = (unsigned int *) region;
|
||||
|
||||
while (l1 < ltop) {
|
||||
tmp = ((*l1) << 1) & mask08_1;
|
||||
tmp2 = (*l1) & mask08_2;
|
||||
tmp2 = ((tmp2 << 1) - (tmp2 >> 7));
|
||||
*l1 = (tmp ^ (tmp2 & prim08));
|
||||
l1++;
|
||||
}
|
||||
GF08.multiply_region.w32(&GF08, region, region, 2, nbytes, 0);
|
||||
}
|
||||
|
||||
static int prim16 = -1;
|
||||
static int mask16_1 = -1;
|
||||
static int mask16_2 = -1;
|
||||
static gf_t GF16;
|
||||
|
||||
void reed_sol_galois_w16_region_multby_2(char *region, int nbytes)
|
||||
{
|
||||
unsigned int *l1;
|
||||
unsigned int *ltop;
|
||||
char *ctop;
|
||||
unsigned int tmp, tmp2;
|
||||
|
||||
|
||||
if (prim16 == -1) {
|
||||
tmp = galois_single_multiply((1 << 15), 2, 16);
|
||||
prim16 = 0;
|
||||
while (tmp != 0) {
|
||||
prim16 |= tmp;
|
||||
tmp = (tmp << 16);
|
||||
}
|
||||
tmp = (1 << 16) - 2;
|
||||
mask16_1 = 0;
|
||||
while (tmp != 0) {
|
||||
mask16_1 |= tmp;
|
||||
tmp = (tmp << 16);
|
||||
}
|
||||
tmp = (1 << 15);
|
||||
mask16_2 = 0;
|
||||
while (tmp != 0) {
|
||||
mask16_2 |= tmp;
|
||||
tmp = (tmp << 16);
|
||||
prim16 = galois_single_multiply((1 << 15), 2, 16);
|
||||
if (!gf_init_hard(&GF16, 16, GF_MULT_BYTWO_b, GF_REGION_DEFAULT, GF_DIVIDE_DEFAULT,
|
||||
prim16, 0, 0, NULL, NULL)) {
|
||||
fprintf(stderr, "Error: Can't initialize the GF for reed_sol_galois_w16_region_multby_2\n");
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
GF16.multiply_region.w32(&GF16, region, region, 2, nbytes, 0);
|
||||
}
|
||||
|
||||
ctop = region + nbytes;
|
||||
ltop = (unsigned int *) ctop;
|
||||
l1 = (unsigned int *) region;
|
||||
static int prim32 = -1;
|
||||
static gf_t GF32;
|
||||
|
||||
while (l1 < ltop) {
|
||||
tmp = ((*l1) << 1) & mask16_1;
|
||||
tmp2 = (*l1) & mask16_2;
|
||||
tmp2 = ((tmp2 << 1) - (tmp2 >> 15));
|
||||
*l1 = (tmp ^ (tmp2 & prim16));
|
||||
l1++;
|
||||
void reed_sol_galois_w32_region_multby_2(char *region, int nbytes)
|
||||
{
|
||||
if (prim32 == -1) {
|
||||
prim32 = galois_single_multiply((1 << 31), 2, 32);
|
||||
if (!gf_init_hard(&GF32, 32, GF_MULT_BYTWO_b, GF_REGION_DEFAULT, GF_DIVIDE_DEFAULT,
|
||||
prim32, 0, 0, NULL, NULL)) {
|
||||
fprintf(stderr, "Error: Can't initialize the GF for reed_sol_galois_w32_region_multby_2\n");
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
GF32.multiply_region.w32(&GF32, region, region, 2, nbytes, 0);
|
||||
}
|
||||
|
||||
int reed_sol_r6_encode(int k, int w, char **data_ptrs, char **coding_ptrs, int size)
|
||||
|
|
@ -221,7 +154,7 @@ int reed_sol_r6_encode(int k, int w, char **data_ptrs, char **coding_ptrs, int s
|
|||
|
||||
memcpy(coding_ptrs[0], data_ptrs[0], size);
|
||||
|
||||
for (i = 1; i < k; i++) galois_region_xor(coding_ptrs[0], data_ptrs[i], coding_ptrs[0], size);
|
||||
for (i = 1; i < k; i++) galois_region_xor(data_ptrs[i], coding_ptrs[0], size);
|
||||
|
||||
/* Next, put the sum of (2^j)*Dj into coding region 1 */
|
||||
|
||||
|
|
@ -235,7 +168,7 @@ int reed_sol_r6_encode(int k, int w, char **data_ptrs, char **coding_ptrs, int s
|
|||
default: return 0;
|
||||
}
|
||||
|
||||
galois_region_xor(coding_ptrs[1], data_ptrs[i], coding_ptrs[1], size);
|
||||
galois_region_xor(data_ptrs[i], coding_ptrs[1], size);
|
||||
}
|
||||
return 1;
|
||||
}
|
||||
Loading…
Reference in New Issue