Add xor scheme to builtins, algsig/crc32 code to utils
Signed-off-by: Tushar Gohad <tushar.gohad@intel.com>
This commit is contained in:
Tushar Gohad
@@ -74,6 +74,8 @@ SOURCES="$SOURCES $srcdir/src/backends/jerasure/*.c"
|
||||
SOURCES="$SOURCES $srcdir/src/backends/gf_complete/*.c"
|
||||
SOURCES="$SOURCES $srcdir/src/backends/isa_l/*.c"
|
||||
SOURCES="$SOURCES $srcdir/src/backends/xor/*.c"
|
||||
SOURCES="$SOURCES $srcdir/src/builtins/xor/*.c"
|
||||
SOURCES="$SOURCES $srcdir/src/utils/chksum/*.c"
|
||||
SOURCES="$SOURCES $srcdir/test/*.c"
|
||||
|
||||
# Check for jerasure/gf_complete headers
|
||||
|
||||
108
include/xor_code.h
Normal file
108
include/xor_code.h
Normal file
@@ -0,0 +1,108 @@
|
||||
/* * Copyright (c) 2013, Kevin Greenan (kmgreen2@gmail.com)
|
||||
* 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. 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 _XOR_CODE_H
|
||||
#define _XOR_CODE_H
|
||||
|
||||
#define MAX_DATA 32
|
||||
#define MAX_PARITY MAX_DATA
|
||||
|
||||
#define MEM_ALIGN_SIZE 16
|
||||
|
||||
#define DECODED_MISSING_IDX MAX_DATA
|
||||
|
||||
typedef enum { FAIL_PATTERN_GE_HD, // Num failures greater than or equal to HD
|
||||
FAIL_PATTERN_0D_0P,
|
||||
FAIL_PATTERN_1D_0P,
|
||||
FAIL_PATTERN_2D_0P,
|
||||
FAIL_PATTERN_3D_0P,
|
||||
FAIL_PATTERN_1D_1P,
|
||||
FAIL_PATTERN_1D_2P,
|
||||
FAIL_PATTERN_2D_1P,
|
||||
FAIL_PATTERN_0D_1P,
|
||||
FAIL_PATTERN_0D_2P,
|
||||
FAIL_PATTERN_0D_3P } failure_pattern_t;
|
||||
|
||||
#define is_aligned(x) (((unsigned long)x & (MEM_ALIGN_SIZE-1)) == 0)
|
||||
#define num_unaligned_end(size) (size % MEM_ALIGN_SIZE)
|
||||
|
||||
struct xor_code_s;
|
||||
|
||||
typedef struct xor_code_s
|
||||
{
|
||||
int k;
|
||||
int m;
|
||||
int hd;
|
||||
int *parity_bms;
|
||||
int *data_bms;
|
||||
void (*decode)(struct xor_code_s *code_desc, char **data, char **parity, int *missing_idxs, int blocksize, int decode_parity);
|
||||
void (*encode)(struct xor_code_s *code_desc, char **data, char **parity, int blocksize);
|
||||
int (*fragments_needed)(struct xor_code_s *code_desc, int *missing_idxs, int *fragments_needed);
|
||||
} xor_code_t;
|
||||
|
||||
int is_data_in_parity(int data_idx, unsigned int parity_bm);
|
||||
|
||||
int does_parity_have_data(int parity_idx, unsigned int data_bm);
|
||||
|
||||
int parity_bit_lookup(xor_code_t *code_desc, int index);
|
||||
|
||||
int data_bit_lookup(xor_code_t *code_desc, int index);
|
||||
|
||||
int missing_elements_bm(xor_code_t *code_desc, int *missing_elements, int (*bit_lookup_func)(xor_code_t *code_desc, int index));
|
||||
|
||||
void *aligned_malloc( size_t size, int align );
|
||||
|
||||
void aligned_free( void *mem );
|
||||
|
||||
failure_pattern_t get_failure_pattern(xor_code_t *code_desc, int *missing_idxs);
|
||||
|
||||
void *aligned_malloc( size_t size, int align);
|
||||
|
||||
void aligned_free(void *mem);
|
||||
|
||||
void fast_memcpy(char *dst, char *src, int size);
|
||||
|
||||
void xor_bufs_and_store(char *buf1, char *buf2, int blocksize);
|
||||
|
||||
void xor_code_encode(xor_code_t *code_desc, char **data, char **parity, int blocksize);
|
||||
|
||||
void selective_encode(xor_code_t *code_desc, char **data, char **parity, int *missing_parity, int blocksize);
|
||||
|
||||
int * get_missing_parity(xor_code_t *code_desc, int *missing_idxs);
|
||||
|
||||
int * get_missing_data(xor_code_t *code_desc, int *missing_idxs);
|
||||
|
||||
int num_missing_data_in_parity(xor_code_t *code_desc, int parity_idx, int *missing_data);
|
||||
|
||||
int index_of_connected_parity(xor_code_t *code_desc, int data_index, int *missing_parity, int *missing_data);
|
||||
|
||||
void remove_from_missing_list(int element, int *missing_list);
|
||||
|
||||
int* get_symbols_needed(xor_code_t *code_desc, int *missing_list);
|
||||
|
||||
void xor_reconstruct_one(xor_code_t *code_desc, char **data, char **parity, int *missing_idxs, int index_to_reconstruct, int blocksize);
|
||||
|
||||
xor_code_t* init_xor_hd_code(int k, int m, int hd);
|
||||
|
||||
#endif
|
||||
134
include/xor_hd_code_defs.h
Normal file
134
include/xor_hd_code_defs.h
Normal file
@@ -0,0 +1,134 @@
|
||||
/* * Copyright (c) 2013, Kevin Greenan (kmgreen2@gmail.com)
|
||||
* 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. 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 _XOR_HD_CODE_DEFS_H
|
||||
#define _XOR_HD_CODE_DEFS_H
|
||||
|
||||
|
||||
|
||||
// I made these by hand...
|
||||
unsigned int g_12_6_4_hd_code_parity_bms[] = { 1649, 3235, 2375, 718, 1436, 2872 };
|
||||
unsigned int g_12_6_4_hd_code_data_bms[] = { 7, 14, 28, 56, 49, 35, 13, 26, 52, 41, 19, 38 };
|
||||
|
||||
unsigned int g_10_5_3_hd_code_parity_bms[] = { 163, 300, 337, 582, 664 };
|
||||
unsigned int g_10_5_3_hd_code_data_bms[] = { 5, 9, 10, 18, 20, 3, 12, 17, 6, 24 };
|
||||
|
||||
|
||||
// The rest were generated via the "goldilocks" code algorithm
|
||||
unsigned int g_6_6_3_hd_code_parity_bms[] = { 3, 48, 36, 24, 9, 6 };
|
||||
unsigned int g_6_6_3_hd_code_data_bms[] = { 17, 33, 36, 24, 10, 6 };
|
||||
unsigned int g_7_6_3_hd_code_parity_bms[] = { 67, 112, 36, 24, 9, 6 };
|
||||
unsigned int g_7_6_3_hd_code_data_bms[] = { 17, 33, 36, 24, 10, 6, 3 };
|
||||
unsigned int g_8_6_3_hd_code_parity_bms[] = { 67, 112, 164, 152, 9, 6 };
|
||||
unsigned int g_8_6_3_hd_code_data_bms[] = { 17, 33, 36, 24, 10, 6, 3, 12 };
|
||||
unsigned int g_9_6_3_hd_code_parity_bms[] = { 67, 112, 164, 152, 265, 262 };
|
||||
unsigned int g_9_6_3_hd_code_data_bms[] = { 17, 33, 36, 24, 10, 6, 3, 12, 48 };
|
||||
unsigned int g_10_6_3_hd_code_parity_bms[] = { 579, 112, 676, 152, 265, 262 };
|
||||
unsigned int g_10_6_3_hd_code_data_bms[] = { 17, 33, 36, 24, 10, 6, 3, 12, 48, 5 };
|
||||
unsigned int g_11_6_3_hd_code_parity_bms[] = { 579, 1136, 676, 152, 1289, 262 };
|
||||
unsigned int g_11_6_3_hd_code_data_bms[] = { 17, 33, 36, 24, 10, 6, 3, 12, 48, 5, 18 };
|
||||
unsigned int g_12_6_3_hd_code_parity_bms[] = { 579, 1136, 676, 2200, 1289, 2310 };
|
||||
unsigned int g_12_6_3_hd_code_data_bms[] = { 17, 33, 36, 24, 10, 6, 3, 12, 48, 5, 18, 40 };
|
||||
unsigned int g_13_6_3_hd_code_parity_bms[] = { 4675, 1136, 676, 6296, 1289, 2310 };
|
||||
unsigned int g_13_6_3_hd_code_data_bms[] = { 17, 33, 36, 24, 10, 6, 3, 12, 48, 5, 18, 40, 9 };
|
||||
unsigned int g_14_6_3_hd_code_parity_bms[] = { 4675, 9328, 676, 6296, 1289, 10502 };
|
||||
unsigned int g_14_6_3_hd_code_data_bms[] = { 17, 33, 36, 24, 10, 6, 3, 12, 48, 5, 18, 40, 9, 34 };
|
||||
unsigned int g_15_6_3_hd_code_parity_bms[] = { 4675, 9328, 17060, 6296, 17673, 10502 };
|
||||
unsigned int g_15_6_3_hd_code_data_bms[] = { 17, 33, 36, 24, 10, 6, 3, 12, 48, 5, 18, 40, 9, 34, 20 };
|
||||
|
||||
unsigned int g_6_6_4_hd_code_parity_bms[] = { 7, 56, 56, 11, 21, 38 };
|
||||
unsigned int g_6_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38 };
|
||||
unsigned int g_7_6_4_hd_code_parity_bms[] = { 71, 120, 120, 11, 21, 38 };
|
||||
unsigned int g_7_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38, 7 };
|
||||
unsigned int g_8_6_4_hd_code_parity_bms[] = { 71, 120, 120, 139, 149, 166 };
|
||||
unsigned int g_8_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38, 7, 56 };
|
||||
unsigned int g_9_6_4_hd_code_parity_bms[] = { 327, 376, 120, 395, 149, 166 };
|
||||
unsigned int g_9_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38, 7, 56, 11 };
|
||||
unsigned int g_10_6_4_hd_code_parity_bms[] = { 327, 376, 632, 395, 661, 678 };
|
||||
unsigned int g_10_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38, 7, 56, 11, 52 };
|
||||
unsigned int g_11_6_4_hd_code_parity_bms[] = { 1351, 1400, 632, 395, 1685, 678 };
|
||||
unsigned int g_11_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38, 7, 56, 11, 52, 19 };
|
||||
unsigned int g_13_6_4_hd_code_parity_bms[] = { 5447, 5496, 2680, 2443, 1685, 6822 };
|
||||
unsigned int g_13_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38, 7, 56, 11, 52, 19, 44, 35 };
|
||||
unsigned int g_14_6_4_hd_code_parity_bms[] = { 5447, 5496, 10872, 10635, 9877, 6822 };
|
||||
unsigned int g_14_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38, 7, 56, 11, 52, 19, 44, 35, 28 };
|
||||
unsigned int g_15_6_4_hd_code_parity_bms[] = { 21831, 5496, 27256, 27019, 9877, 6822 };
|
||||
unsigned int g_15_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38, 7, 56, 11, 52, 19, 44, 35, 28, 13 };
|
||||
unsigned int g_16_6_4_hd_code_parity_bms[] = { 21831, 38264, 27256, 27019, 42645, 39590 };
|
||||
unsigned int g_16_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38, 7, 56, 11, 52, 19, 44, 35, 28, 13, 50 };
|
||||
unsigned int g_17_6_4_hd_code_parity_bms[] = { 87367, 38264, 92792, 27019, 108181, 39590 };
|
||||
unsigned int g_17_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38, 7, 56, 11, 52, 19, 44, 35, 28, 13, 50, 21 };
|
||||
unsigned int g_18_6_4_hd_code_parity_bms[] = { 87367, 169336, 92792, 158091, 108181, 170662 };
|
||||
unsigned int g_18_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38, 7, 56, 11, 52, 19, 44, 35, 28, 13, 50, 21, 42 };
|
||||
unsigned int g_19_6_4_hd_code_parity_bms[] = { 349511, 169336, 354936, 158091, 108181, 432806 };
|
||||
unsigned int g_19_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38, 7, 56, 11, 52, 19, 44, 35, 28, 13, 50, 21, 42, 37 };
|
||||
unsigned int g_20_6_4_hd_code_parity_bms[] = { 349511, 693624, 354936, 682379, 632469, 432806 };
|
||||
unsigned int g_20_6_4_hd_code_data_bms[] = { 25, 41, 49, 14, 22, 38, 7, 56, 11, 52, 19, 44, 35, 28, 13, 50, 21, 42, 37, 26 };
|
||||
|
||||
|
||||
unsigned int g_5_5_3_hd_code_parity_bms[] = { 3, 12, 17, 6, 24 };
|
||||
unsigned int g_5_5_3_hd_code_data_bms[] = { 5, 9, 10, 18, 20 };
|
||||
unsigned int g_6_5_3_hd_code_parity_bms[] = { 35, 44, 17, 6, 24 };
|
||||
unsigned int g_6_5_3_hd_code_data_bms[] = { 5, 9, 10, 18, 20, 3 };
|
||||
unsigned int g_7_5_3_hd_code_parity_bms[] = { 35, 44, 81, 70, 24 };
|
||||
unsigned int g_7_5_3_hd_code_data_bms[] = { 5, 9, 10, 18, 20, 3, 12 };
|
||||
unsigned int g_8_5_3_hd_code_parity_bms[] = { 163, 44, 81, 70, 152 };
|
||||
unsigned int g_8_5_3_hd_code_data_bms[] = { 5, 9, 10, 18, 20, 3, 12, 17 };
|
||||
unsigned int g_9_5_3_hd_code_parity_bms[] = { 163, 300, 337, 70, 152 };
|
||||
unsigned int g_9_5_3_hd_code_data_bms[] = { 5, 9, 10, 18, 20, 3, 12, 17, 6 };
|
||||
|
||||
unsigned int g_5_5_4_hd_code_parity_bms[] = { 7, 25, 14, 19, 28 };
|
||||
unsigned int g_5_5_4_hd_code_data_bms[] = { 11, 13, 21, 22, 26 };
|
||||
unsigned int g_6_5_4_hd_code_parity_bms[] = { 39, 57, 46, 19, 28 };
|
||||
unsigned int g_6_5_4_hd_code_data_bms[] = { 11, 13, 21, 22, 26, 7 };
|
||||
unsigned int g_7_5_4_hd_code_parity_bms[] = { 103, 57, 46, 83, 92 };
|
||||
unsigned int g_7_5_4_hd_code_data_bms[] = { 11, 13, 21, 22, 26, 7, 25 };
|
||||
unsigned int g_8_5_4_hd_code_parity_bms[] = { 103, 185, 174, 211, 92 };
|
||||
unsigned int g_8_5_4_hd_code_data_bms[] = { 11, 13, 21, 22, 26, 7, 25, 14 };
|
||||
unsigned int g_9_5_4_hd_code_parity_bms[] = { 359, 441, 174, 211, 348 };
|
||||
unsigned int g_9_5_4_hd_code_data_bms[] = { 11, 13, 21, 22, 26, 7, 25, 14, 19 };
|
||||
unsigned int g_10_5_4_hd_code_parity_bms[] = { 359, 441, 686, 723, 860 };
|
||||
unsigned int g_10_5_4_hd_code_data_bms[] = { 11, 13, 21, 22, 26, 7, 25, 14, 19, 28 };
|
||||
|
||||
// Indexed by k
|
||||
unsigned int * hd4_m5_parity[11] = { 0, 0, 0, 0, 0, g_5_5_4_hd_code_parity_bms, g_6_5_4_hd_code_parity_bms, g_7_5_4_hd_code_parity_bms, g_8_5_4_hd_code_parity_bms, g_9_5_4_hd_code_parity_bms, g_10_5_4_hd_code_parity_bms };
|
||||
unsigned int * hd4_m5_data[11] = { 0, 0, 0, 0, 0, g_5_5_4_hd_code_data_bms, g_6_5_4_hd_code_data_bms, g_7_5_4_hd_code_data_bms, g_8_5_4_hd_code_data_bms, g_9_5_4_hd_code_data_bms, g_10_5_4_hd_code_data_bms };
|
||||
unsigned int * hd4_m6_parity[21] = { 0, 0, 0, 0, 0, 0, g_6_6_4_hd_code_parity_bms, g_7_6_4_hd_code_parity_bms, g_8_6_4_hd_code_parity_bms, g_9_6_4_hd_code_parity_bms, g_10_6_4_hd_code_parity_bms, g_11_6_4_hd_code_parity_bms, g_12_6_4_hd_code_parity_bms, g_13_6_4_hd_code_parity_bms, g_14_6_4_hd_code_parity_bms, g_15_6_4_hd_code_parity_bms, g_16_6_4_hd_code_parity_bms, g_17_6_4_hd_code_parity_bms, g_18_6_4_hd_code_parity_bms, g_19_6_4_hd_code_parity_bms, g_20_6_4_hd_code_parity_bms };
|
||||
|
||||
unsigned int * hd4_m6_data[21] = { 0, 0, 0, 0, 0, 0, g_6_6_4_hd_code_data_bms, g_7_6_4_hd_code_data_bms, g_8_6_4_hd_code_data_bms, g_9_6_4_hd_code_data_bms, g_10_6_4_hd_code_data_bms, g_11_6_4_hd_code_data_bms, g_12_6_4_hd_code_data_bms, g_13_6_4_hd_code_data_bms, g_14_6_4_hd_code_data_bms, g_15_6_4_hd_code_data_bms, g_16_6_4_hd_code_data_bms, g_17_6_4_hd_code_data_bms, g_18_6_4_hd_code_data_bms, g_19_6_4_hd_code_data_bms, g_20_6_4_hd_code_data_bms };
|
||||
|
||||
unsigned int * hd3_m5_parity[11] = { 0, 0, 0, 0, 0, g_5_5_3_hd_code_parity_bms, g_6_5_3_hd_code_parity_bms, g_7_5_3_hd_code_parity_bms, g_8_5_3_hd_code_parity_bms, g_9_5_3_hd_code_parity_bms, g_10_5_3_hd_code_parity_bms };
|
||||
unsigned int * hd3_m5_data[11] = { 0, 0, 0, 0, 0, g_5_5_3_hd_code_data_bms, g_6_5_3_hd_code_data_bms, g_7_5_3_hd_code_data_bms, g_8_5_3_hd_code_data_bms, g_9_5_3_hd_code_data_bms, g_10_5_3_hd_code_data_bms };
|
||||
unsigned int * hd3_m6_parity[16] = { 0, 0, 0, 0, 0, 0, g_6_6_3_hd_code_parity_bms, g_7_6_3_hd_code_parity_bms, g_8_6_3_hd_code_parity_bms, g_9_6_3_hd_code_parity_bms, g_10_6_3_hd_code_parity_bms, g_11_6_3_hd_code_parity_bms, g_12_6_3_hd_code_parity_bms, g_13_6_3_hd_code_parity_bms, g_14_6_3_hd_code_parity_bms, g_15_6_3_hd_code_parity_bms };
|
||||
unsigned int * hd3_m6_data[16] = { 0, 0, 0, 0, 0, 0, g_6_6_3_hd_code_data_bms, g_7_6_3_hd_code_data_bms, g_8_6_3_hd_code_data_bms, g_9_6_3_hd_code_data_bms, g_10_6_3_hd_code_data_bms, g_11_6_3_hd_code_data_bms, g_12_6_3_hd_code_data_bms, g_13_6_3_hd_code_data_bms, g_14_6_3_hd_code_data_bms, g_15_6_3_hd_code_data_bms };
|
||||
|
||||
unsigned int ** parity_bm_hd4 [7] = { 0, 0, 0, 0, 0, hd4_m5_parity, hd4_m6_parity };
|
||||
unsigned int ** data_bm_hd4 [7] = { 0, 0, 0, 0, 0, hd4_m5_data, hd4_m6_data };
|
||||
unsigned int ** parity_bm_hd3 [7] = { 0, 0, 0, 0, 0, hd3_m5_parity, hd3_m6_parity };
|
||||
unsigned int ** data_bm_hd3 [7] = { 0, 0, 0, 0, 0, hd3_m5_data, hd3_m6_data };
|
||||
|
||||
#define PARITY_BM_ARY(k, m, hd) (hd == 3) ? parity_bm_hd3[m][k] : parity_bm_hd4[m][k]
|
||||
#define DATA_BM_ARY(k, m, hd) (hd == 3) ? data_bm_hd3[m][k] : data_bm_hd4[m][k]
|
||||
|
||||
#endif
|
||||
403
src/builtin/xor_codes/xor_code.c
Normal file
403
src/builtin/xor_codes/xor_code.c
Normal file
@@ -0,0 +1,403 @@
|
||||
/* * Copyright (c) 2013, Kevin Greenan (kmgreen2@gmail.com)
|
||||
* 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. 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 <emmintrin.h> //SSE2
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <time.h>
|
||||
#include <xor_code.h>
|
||||
|
||||
const int g_bit_lookup[] = {0x1, 0x2, 0x4, 0x8,
|
||||
0x10, 0x20, 0x40, 0x80,
|
||||
0x100, 0x200, 0x400, 0x800,
|
||||
0x1000, 0x2000, 0x4000, 0x8000,
|
||||
0x10000, 0x20000, 0x40000, 0x80000,
|
||||
0x100000, 0x200000, 0x400000, 0x800000,
|
||||
0x1000000, 0x2000000, 0x4000000, 0x8000000,
|
||||
0x10000000, 0x20000000, 0x40000000, 0x80000000};
|
||||
|
||||
int is_data_in_parity(int data_idx, unsigned int parity_bm)
|
||||
{
|
||||
return ((g_bit_lookup[data_idx] & parity_bm) == g_bit_lookup[data_idx]);
|
||||
}
|
||||
|
||||
int does_parity_have_data(int parity_idx, unsigned int data_bm)
|
||||
{
|
||||
return ((g_bit_lookup[parity_idx] & data_bm) == g_bit_lookup[parity_idx]);
|
||||
}
|
||||
|
||||
int parity_bit_lookup(xor_code_t *code_desc, int index)
|
||||
{
|
||||
return g_bit_lookup[code_desc->k - index];
|
||||
}
|
||||
|
||||
int data_bit_lookup(xor_code_t *code_desc, int index)
|
||||
{
|
||||
return g_bit_lookup[index];
|
||||
}
|
||||
|
||||
int missing_elements_bm(xor_code_t *code_desc, int *missing_elements, int (*bit_lookup_func)(xor_code_t *code_desc, int index))
|
||||
{
|
||||
int i = 0;
|
||||
int bm = 0;
|
||||
|
||||
while (missing_elements[i] > -1) {
|
||||
bm |= bit_lookup_func(code_desc, missing_elements[i]);
|
||||
i++;
|
||||
}
|
||||
|
||||
return bm;
|
||||
}
|
||||
|
||||
void *aligned_malloc( size_t size, int align )
|
||||
{
|
||||
void *mem = malloc( size + (align-1) + sizeof(void*) );
|
||||
char *amem;
|
||||
if (!mem) {
|
||||
return NULL;
|
||||
}
|
||||
|
||||
amem = ((char*)mem) + sizeof(void*);
|
||||
amem += align - ((unsigned long)amem & (align - 1));
|
||||
|
||||
((void**)amem)[-1] = mem;
|
||||
return amem;
|
||||
}
|
||||
|
||||
void aligned_free( void *mem )
|
||||
{
|
||||
free( ((void**)mem)[-1] );
|
||||
}
|
||||
|
||||
failure_pattern_t get_failure_pattern(xor_code_t *code_desc, int *missing_idxs)
|
||||
{
|
||||
int i = 0;
|
||||
int num_failures = 0;
|
||||
failure_pattern_t pattern = FAIL_PATTERN_0D_0P;
|
||||
|
||||
while (missing_idxs[i] > -1) {
|
||||
if (num_failures >= code_desc->hd) {
|
||||
pattern = FAIL_PATTERN_GE_HD;
|
||||
}
|
||||
switch(pattern) {
|
||||
case FAIL_PATTERN_0D_0P:
|
||||
pattern = (missing_idxs[i] < code_desc->k) ? FAIL_PATTERN_1D_0P : FAIL_PATTERN_0D_1P;
|
||||
break;
|
||||
case FAIL_PATTERN_1D_0P:
|
||||
pattern = (missing_idxs[i] < code_desc->k) ? FAIL_PATTERN_2D_0P : FAIL_PATTERN_1D_1P;
|
||||
break;
|
||||
case FAIL_PATTERN_2D_0P:
|
||||
pattern = (missing_idxs[i] < code_desc->k) ? FAIL_PATTERN_3D_0P : FAIL_PATTERN_2D_1P;
|
||||
break;
|
||||
case FAIL_PATTERN_3D_0P:
|
||||
pattern = FAIL_PATTERN_GE_HD;
|
||||
break;
|
||||
case FAIL_PATTERN_1D_1P:
|
||||
pattern = (missing_idxs[i] < code_desc->k) ? FAIL_PATTERN_2D_1P : FAIL_PATTERN_1D_2P;
|
||||
break;
|
||||
case FAIL_PATTERN_1D_2P:
|
||||
pattern = FAIL_PATTERN_GE_HD;
|
||||
break;
|
||||
case FAIL_PATTERN_2D_1P:
|
||||
pattern = FAIL_PATTERN_GE_HD;
|
||||
break;
|
||||
case FAIL_PATTERN_0D_1P:
|
||||
pattern = (missing_idxs[i] < code_desc->k) ? FAIL_PATTERN_1D_1P : FAIL_PATTERN_0D_2P;
|
||||
break;
|
||||
case FAIL_PATTERN_0D_2P:
|
||||
pattern = (missing_idxs[i] < code_desc->k) ? FAIL_PATTERN_1D_2P : FAIL_PATTERN_0D_3P;
|
||||
break;
|
||||
case FAIL_PATTERN_0D_3P:
|
||||
pattern = FAIL_PATTERN_GE_HD;
|
||||
break;
|
||||
case FAIL_PATTERN_GE_HD:
|
||||
default:
|
||||
break;
|
||||
}
|
||||
if (pattern == FAIL_PATTERN_GE_HD) {
|
||||
break;
|
||||
}
|
||||
i++;
|
||||
}
|
||||
|
||||
return pattern;
|
||||
}
|
||||
|
||||
void fast_memcpy(char *dst, char *src, int size)
|
||||
{
|
||||
// Use _mm_stream_si128((__m128i*) _buf2, sum);
|
||||
memcpy(dst, src, size);
|
||||
}
|
||||
|
||||
/*
|
||||
* Buffers must be aligned to 16-byte boundaries
|
||||
*
|
||||
* Store in buf2 (opposite of memcpy convention... Maybe change?)
|
||||
*/
|
||||
void xor_bufs_and_store(char *buf1, char *buf2, int blocksize)
|
||||
{
|
||||
#ifdef INTEL_SSE2
|
||||
int residual_bytes = num_unaligned_end(blocksize);
|
||||
int fast_blocksize = blocksize > residual_bytes ? (blocksize - residual_bytes) : 0;
|
||||
int fast_int_blocksize = fast_blocksize / sizeof(__m128i);
|
||||
int i;
|
||||
__m128i *_buf1 = (__m128i*)buf1;
|
||||
__m128i *_buf2 = (__m128i*)buf2;
|
||||
|
||||
/*
|
||||
* XOR aligned region using 128-bit XOR
|
||||
*/
|
||||
for (i=0; i < fast_int_blocksize; i++) {
|
||||
_buf2[i] = _mm_xor_si128(_buf1[i], _buf2[i]);
|
||||
}
|
||||
#else
|
||||
int residual_bytes = num_unaligned_end(blocksize);
|
||||
int fast_blocksize = blocksize > residual_bytes ? (blocksize - residual_bytes) : 0;
|
||||
int fast_int_blocksize = fast_blocksize / sizeof(unsigned long);
|
||||
int i;
|
||||
|
||||
unsigned long*_buf1 = (unsigned long*)buf1;
|
||||
unsigned long*_buf2 = (unsigned long*)buf2;
|
||||
|
||||
for (i=0; i < fast_int_blocksize; i++) {
|
||||
_buf2[i] = _buf1[i] ^ _buf2[i];
|
||||
}
|
||||
#endif
|
||||
|
||||
/*
|
||||
* XOR unaligned end of region
|
||||
*/
|
||||
for (i=fast_blocksize; i < blocksize; i++)
|
||||
{
|
||||
buf2[i] ^= buf1[i];
|
||||
}
|
||||
}
|
||||
|
||||
void xor_code_encode(xor_code_t *code_desc, char **data, char **parity, int blocksize)
|
||||
{
|
||||
int i, j;
|
||||
|
||||
for (i=0; i < code_desc->k; i++) {
|
||||
for (j=0; j < code_desc->m; j++) {
|
||||
if (is_data_in_parity(i, code_desc->parity_bms[j])) {
|
||||
xor_bufs_and_store(data[i], parity[j], blocksize);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void selective_encode(xor_code_t *code_desc, char **data, char **parity, int *missing_parity, int blocksize)
|
||||
{
|
||||
int i;
|
||||
for (i=0; i < code_desc->k; i++) {
|
||||
int j=0;
|
||||
while (missing_parity[j] > -1) {
|
||||
int parity_index = missing_parity[j] - code_desc->k;
|
||||
if (is_data_in_parity(i, code_desc->parity_bms[parity_index])) {
|
||||
xor_bufs_and_store(data[i], parity[parity_index], blocksize);
|
||||
}
|
||||
j++;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int * get_missing_parity(xor_code_t *code_desc, int *missing_idxs)
|
||||
{
|
||||
int *missing_parity = (int*)malloc(sizeof(int)*MAX_PARITY);
|
||||
int i = 0, j = 0;
|
||||
|
||||
while (missing_idxs[i] > -1) {
|
||||
if (missing_idxs[i] >= code_desc->k) {
|
||||
missing_parity[j] = missing_idxs[i];
|
||||
j++;
|
||||
}
|
||||
i++;
|
||||
}
|
||||
|
||||
missing_parity[j] = -1;
|
||||
return missing_parity;
|
||||
}
|
||||
|
||||
int * get_missing_data(xor_code_t *code_desc, int *missing_idxs)
|
||||
{
|
||||
int *missing_data = (int*)malloc(sizeof(int)*MAX_DATA);
|
||||
int i = 0, j = 0;
|
||||
|
||||
while (missing_idxs[i] > -1) {
|
||||
if (missing_idxs[i] < code_desc->k) {
|
||||
missing_data[j] = missing_idxs[i];
|
||||
j++;
|
||||
}
|
||||
i++;
|
||||
}
|
||||
|
||||
missing_data[j] = -1;
|
||||
return missing_data;
|
||||
}
|
||||
|
||||
/*
|
||||
* Reconstruct a single missing symbol, given other symbols may be missing
|
||||
*/
|
||||
void xor_reconstruct_one(xor_code_t *code_desc, char **data, char **parity, int *missing_idxs, int index_to_reconstruct, int blocksize)
|
||||
{
|
||||
int *missing_data = get_missing_data(code_desc, missing_idxs);
|
||||
int *missing_parity = get_missing_parity(code_desc, missing_idxs);
|
||||
int i;
|
||||
|
||||
// If it is a data symbol, we need to figure out
|
||||
// what data+parity symbols are needed to reconstruct
|
||||
// If there is not at least one parity equation with
|
||||
// one missing data element (the index to resonstruct),
|
||||
// just call the underlying decode function
|
||||
if (index_to_reconstruct < code_desc->k) {
|
||||
int connected_parity_idx = index_of_connected_parity(code_desc, index_to_reconstruct, missing_parity, missing_data);
|
||||
|
||||
if (connected_parity_idx >= 0) {
|
||||
// Can do a cheap reoncstruction!
|
||||
int relative_parity_idx = connected_parity_idx - code_desc->k;
|
||||
int parity_bm = code_desc->parity_bms[relative_parity_idx];
|
||||
|
||||
fast_memcpy(data[index_to_reconstruct], parity[relative_parity_idx], blocksize);
|
||||
|
||||
for (i=0; i < code_desc->k; i++) {
|
||||
if (parity_bm & (1 << i)) {
|
||||
if (i != index_to_reconstruct) {
|
||||
xor_bufs_and_store(data[i], data[index_to_reconstruct], blocksize);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
} else {
|
||||
// Just call decode
|
||||
code_desc->decode(code_desc, data, parity, missing_idxs, blocksize, 1);
|
||||
}
|
||||
|
||||
} else {
|
||||
|
||||
// If it is a parity symbol, we need to figure out
|
||||
// what data symbols are needed to reconstruct the
|
||||
// parity. If *any* data symbols in the parity
|
||||
// equation are missing, we are better off calling
|
||||
// the underlying decode function.
|
||||
int num_data_missing = num_missing_data_in_parity(code_desc, index_to_reconstruct, missing_data);
|
||||
|
||||
if (num_data_missing == 0) {
|
||||
int relative_parity_idx = index_to_reconstruct - code_desc->k;
|
||||
int parity_bm = code_desc->parity_bms[relative_parity_idx];
|
||||
|
||||
memset(parity[relative_parity_idx], 0, blocksize);
|
||||
|
||||
for (i=0; i < code_desc->k; i++) {
|
||||
if (parity_bm & (1 << i)) {
|
||||
xor_bufs_and_store(data[i], parity[relative_parity_idx], blocksize);
|
||||
}
|
||||
}
|
||||
|
||||
} else {
|
||||
// Just call decode
|
||||
code_desc->decode(code_desc, data, parity, missing_idxs, blocksize, 1);
|
||||
}
|
||||
}
|
||||
free(missing_data);
|
||||
free(missing_parity);
|
||||
}
|
||||
|
||||
int num_missing_data_in_parity(xor_code_t *code_desc, int parity_idx, int *missing_data)
|
||||
{
|
||||
int i = 0;
|
||||
int num_missing_data = 0;
|
||||
int relative_parity_index = parity_idx - code_desc->k;
|
||||
if (missing_data == NULL) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
while (missing_data[i] > -1) {
|
||||
if (does_parity_have_data(relative_parity_index, code_desc->data_bms[missing_data[i]]) > 0) {
|
||||
num_missing_data++;
|
||||
}
|
||||
i++;
|
||||
}
|
||||
|
||||
return num_missing_data;
|
||||
}
|
||||
|
||||
int index_of_connected_parity(xor_code_t *code_desc, int data_index, int *missing_parity, int *missing_data)
|
||||
{
|
||||
int parity_index = -1;
|
||||
int i;
|
||||
|
||||
for (i=0; i < code_desc->m; i++) {
|
||||
if (num_missing_data_in_parity(code_desc, i + code_desc->k, missing_data) > 1) {
|
||||
continue;
|
||||
}
|
||||
if (is_data_in_parity(data_index, code_desc->parity_bms[i])) {
|
||||
int j=0;
|
||||
int is_missing = 0;
|
||||
if (missing_parity == NULL) {
|
||||
parity_index = i;
|
||||
break;
|
||||
}
|
||||
while (missing_parity[j] > -1) {
|
||||
if ((code_desc->k + i) == missing_parity[j]) {
|
||||
is_missing = 1;
|
||||
break;
|
||||
}
|
||||
j++;
|
||||
}
|
||||
if (!is_missing) {
|
||||
parity_index = i;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Must add k to get the absolute
|
||||
// index of the parity in the stripe
|
||||
return parity_index > -1 ? parity_index + code_desc->k : parity_index;
|
||||
}
|
||||
|
||||
void remove_from_missing_list(int element, int *missing_list)
|
||||
{
|
||||
int i = 0;
|
||||
int elem_idx = -1;
|
||||
int num_elems = 0;
|
||||
|
||||
while (missing_list[i] > -1) {
|
||||
if (missing_list[i] == element) {
|
||||
elem_idx = i;
|
||||
missing_list[i] = -1;
|
||||
}
|
||||
i++;
|
||||
}
|
||||
|
||||
num_elems = i;
|
||||
|
||||
for (i=elem_idx;i < num_elems-1;i++) {
|
||||
int tmp = missing_list[i+1];
|
||||
missing_list[i+1] = missing_list[i];
|
||||
missing_list[i] = tmp;
|
||||
}
|
||||
}
|
||||
|
||||
612
src/builtin/xor_codes/xor_hd_code.c
Normal file
612
src/builtin/xor_codes/xor_hd_code.c
Normal file
@@ -0,0 +1,612 @@
|
||||
/* * Copyright (c) 2013, Kevin Greenan (kmgreen2@gmail.com)
|
||||
* 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. 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 <xor_code.h>
|
||||
#include <xor_hd_code_defs.h>
|
||||
|
||||
/*
|
||||
* Returns -1 if not possible
|
||||
*/
|
||||
static int fragments_needed_one_data(xor_code_t *code_desc, int *missing_data, int *missing_parity, unsigned int *data_bm, unsigned int *parity_bm)
|
||||
{
|
||||
int data_index = missing_data[0];
|
||||
int parity_index = index_of_connected_parity(code_desc, data_index, missing_parity, missing_data);
|
||||
|
||||
if (parity_index < 0) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
// Include all data elements except for this one
|
||||
*data_bm |= (code_desc->parity_bms[parity_index-code_desc->k]);
|
||||
|
||||
// Include this parity element
|
||||
*parity_bm |= (1 << (parity_index-code_desc->k));
|
||||
*data_bm &= ~((unsigned int)1 << data_index);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/*
|
||||
* Returns -1 if not possible
|
||||
*/
|
||||
static int fragments_needed_two_data(xor_code_t *code_desc, int *missing_data, int *missing_parity, unsigned int *data_bm, unsigned int *parity_bm)
|
||||
{
|
||||
// Verify that missing_data[2] == -1?
|
||||
int data_index = missing_data[0];
|
||||
int parity_index = index_of_connected_parity(code_desc, data_index, missing_parity, missing_data);
|
||||
int i;
|
||||
int ret;
|
||||
|
||||
if (parity_index < 0) {
|
||||
data_index = missing_data[1];
|
||||
parity_index = index_of_connected_parity(code_desc, data_index, missing_parity, missing_data);
|
||||
if (parity_index < 0) {
|
||||
return -1;
|
||||
}
|
||||
missing_data[1] = -1;
|
||||
} else {
|
||||
missing_data[0] = missing_data[1];
|
||||
missing_data[1] = -1;
|
||||
}
|
||||
|
||||
// Include all data elements except for this one
|
||||
*data_bm |= (code_desc->parity_bms[parity_index-code_desc->k]);
|
||||
|
||||
// Include this parity element
|
||||
*parity_bm |= (1 << (parity_index-code_desc->k));
|
||||
|
||||
ret = fragments_needed_one_data(code_desc, missing_data, missing_parity, data_bm, parity_bm);
|
||||
|
||||
*data_bm &= ~((unsigned int)1 << data_index);
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
/*
|
||||
* Returns -1 if not possible
|
||||
*/
|
||||
static int fragments_needed_three_data(xor_code_t *code_desc, int *missing_data, int *missing_parity, unsigned int *data_bm, unsigned int *parity_bm)
|
||||
{
|
||||
int i = 0;
|
||||
int parity_index = -1;
|
||||
int data_index = -1;
|
||||
int tmp_parity_bm = -1;
|
||||
int contains_2d = -1;
|
||||
int contains_3d = -1;
|
||||
int ret = 0;
|
||||
|
||||
/*
|
||||
* Try to find a parity that only contains
|
||||
* one of the missing data elements.
|
||||
*/
|
||||
while (missing_data[i] > -1) {
|
||||
parity_index = index_of_connected_parity(code_desc, missing_data[i], missing_parity, missing_data);
|
||||
if (parity_index > -1) {
|
||||
data_index = missing_data[i];
|
||||
tmp_parity_bm = code_desc->parity_bms[parity_index-code_desc->k];
|
||||
break;
|
||||
}
|
||||
i++;
|
||||
}
|
||||
/*
|
||||
* If we cannot find a parity that is connected to only
|
||||
* one missing element, we must find a parity that is
|
||||
* connected to exactly 2 (P) and another that is connected
|
||||
* to exactly 3 (Q) (it should exist!!!).
|
||||
*
|
||||
* We XOR those parities together and use it to recover
|
||||
* the element that is not connected to P.
|
||||
*/
|
||||
if (parity_index < 0) {
|
||||
|
||||
for (i=0;i < code_desc->m;i++) {
|
||||
int num_missing = num_missing_data_in_parity(code_desc, code_desc->k+i, missing_data);
|
||||
if (num_missing == 2 && contains_2d < 0) {
|
||||
contains_2d = i;
|
||||
} else if (num_missing == 3 && contains_3d < 0) {
|
||||
contains_3d = i;
|
||||
}
|
||||
}
|
||||
|
||||
if (contains_2d < 0 || contains_3d < 0) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
// P XOR Q
|
||||
tmp_parity_bm = code_desc->parity_bms[contains_2d] ^ code_desc->parity_bms[contains_3d];
|
||||
|
||||
i=0;
|
||||
data_index = -1;
|
||||
while (missing_data[i] > -1) {
|
||||
if (is_data_in_parity(missing_data[i], tmp_parity_bm)) {
|
||||
data_index = missing_data[i];
|
||||
break;
|
||||
}
|
||||
i++;
|
||||
}
|
||||
|
||||
if (data_index < 0) {
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
|
||||
remove_from_missing_list(data_index, missing_data);
|
||||
|
||||
// Include all data elements except for this one
|
||||
*data_bm |= (code_desc->parity_bms[parity_index-code_desc->k]);
|
||||
|
||||
// Include this parity element
|
||||
if (parity_index > -1) {
|
||||
*parity_bm |= (1 << (parity_index-code_desc->k));
|
||||
} else {
|
||||
*parity_bm |= (1 << (contains_2d-code_desc->k));
|
||||
*parity_bm |= (1 << (contains_3d-code_desc->k));
|
||||
}
|
||||
|
||||
ret = fragments_needed_two_data(code_desc, missing_data, missing_parity, data_bm, parity_bm);
|
||||
|
||||
*data_bm &= ~((unsigned int)1 << data_index);
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
|
||||
|
||||
int xor_hd_fragments_needed(xor_code_t *code_desc, int *missing_idxs, int *fragments_needed)
|
||||
{
|
||||
failure_pattern_t pattern = get_failure_pattern(code_desc, missing_idxs);
|
||||
unsigned int data_bm = 0, parity_bm = 0;
|
||||
int ret = 0;
|
||||
int i, j;
|
||||
|
||||
switch(pattern) {
|
||||
case FAIL_PATTERN_0D_0P:
|
||||
break;
|
||||
case FAIL_PATTERN_1D_0P:
|
||||
{
|
||||
int *missing_data = get_missing_data(code_desc, missing_idxs);
|
||||
ret = fragments_needed_one_data(code_desc, missing_data, NULL, &data_bm, &parity_bm);
|
||||
free(missing_data);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_2D_0P:
|
||||
{
|
||||
int *missing_data = get_missing_data(code_desc, missing_idxs);
|
||||
ret = fragments_needed_two_data(code_desc, missing_data, NULL, &data_bm, &parity_bm);
|
||||
free(missing_data);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_3D_0P:
|
||||
{
|
||||
int *missing_data = get_missing_data(code_desc, missing_idxs);
|
||||
ret = fragments_needed_three_data(code_desc, missing_data, NULL, &data_bm, &parity_bm);
|
||||
free(missing_data);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_1D_1P:
|
||||
{
|
||||
int *missing_data = get_missing_data(code_desc, missing_idxs);
|
||||
int *missing_parity = get_missing_parity(code_desc, missing_idxs);
|
||||
unsigned int missing_data_bm = missing_elements_bm(code_desc, missing_data, data_bit_lookup);
|
||||
ret = fragments_needed_one_data(code_desc, missing_data, missing_parity, &data_bm, &parity_bm);
|
||||
// OR all parities
|
||||
i=0;
|
||||
while (missing_parity[i] > -1) {
|
||||
data_bm |= code_desc->parity_bms[missing_parity[i]-code_desc->k];
|
||||
data_bm &= ~(missing_data_bm);
|
||||
i++;
|
||||
}
|
||||
free(missing_parity);
|
||||
free(missing_data);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_1D_2P:
|
||||
{
|
||||
int *missing_data = get_missing_data(code_desc, missing_idxs);
|
||||
int *missing_parity = get_missing_parity(code_desc, missing_idxs);
|
||||
int missing_data_bm = missing_elements_bm(code_desc, missing_data, data_bit_lookup);
|
||||
ret = fragments_needed_one_data(code_desc, missing_data, missing_parity, &data_bm, &parity_bm);
|
||||
// OR all parities
|
||||
i=0;
|
||||
while (missing_parity[i] > -1) {
|
||||
data_bm |= code_desc->parity_bms[missing_parity[i]-code_desc->k];
|
||||
data_bm &= ~(missing_data_bm);
|
||||
i++;
|
||||
}
|
||||
free(missing_parity);
|
||||
free(missing_data);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_2D_1P:
|
||||
{
|
||||
int *missing_data = get_missing_data(code_desc, missing_idxs);
|
||||
int *missing_parity = get_missing_parity(code_desc, missing_idxs);
|
||||
unsigned int missing_data_bm = missing_elements_bm(code_desc, missing_data, data_bit_lookup);
|
||||
ret = fragments_needed_two_data(code_desc, missing_data, missing_parity, &data_bm, &parity_bm);
|
||||
// OR all parities
|
||||
i=0;
|
||||
while (missing_parity[i] > -1) {
|
||||
data_bm |= code_desc->parity_bms[missing_parity[i]-code_desc->k];
|
||||
data_bm &= ~(missing_data_bm);
|
||||
i++;
|
||||
}
|
||||
free(missing_parity);
|
||||
free(missing_data);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_0D_1P:
|
||||
{
|
||||
int *missing_parity = get_missing_parity(code_desc, missing_idxs);
|
||||
// OR all of the parities
|
||||
i=0;
|
||||
while (missing_parity[i] > -1) {
|
||||
data_bm |= code_desc->parity_bms[missing_parity[i]-code_desc->k];
|
||||
i++;
|
||||
}
|
||||
free(missing_parity);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_0D_2P:
|
||||
{
|
||||
int *missing_parity = get_missing_parity(code_desc, missing_idxs);
|
||||
// OR all of the parities
|
||||
i=0;
|
||||
while (missing_parity[i] > -1) {
|
||||
data_bm |= code_desc->parity_bms[missing_parity[i]-code_desc->k];
|
||||
i++;
|
||||
}
|
||||
free(missing_parity);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_0D_3P:
|
||||
{
|
||||
int *missing_parity = get_missing_parity(code_desc, missing_idxs);
|
||||
// OR all of the parities
|
||||
i=0;
|
||||
while (missing_parity[i] > -1) {
|
||||
data_bm |= code_desc->parity_bms[missing_parity[i]-code_desc->k];
|
||||
i++;
|
||||
}
|
||||
free(missing_parity);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_GE_HD:
|
||||
default:
|
||||
break;
|
||||
}
|
||||
|
||||
if (ret >= 0) {
|
||||
i=0;
|
||||
j=0;
|
||||
while (data_bm) {
|
||||
if (data_bm & 1) {
|
||||
fragments_needed[j] = i;
|
||||
j++;
|
||||
}
|
||||
i++;
|
||||
data_bm >>= 1;
|
||||
}
|
||||
|
||||
i=0;
|
||||
while (parity_bm) {
|
||||
if (parity_bm & 1) {
|
||||
fragments_needed[j] = i + code_desc->k;
|
||||
j++;
|
||||
}
|
||||
i++;
|
||||
parity_bm >>= 1;
|
||||
}
|
||||
|
||||
fragments_needed[j] = -1;
|
||||
}
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
/*
|
||||
* There is one unavailable data element, so any available parity connected to
|
||||
* the data element is sufficient to decode.
|
||||
*/
|
||||
static void decode_one_data(xor_code_t *code_desc, char **data, char **parity, int *missing_data, int *missing_parity, int blocksize)
|
||||
{
|
||||
// Verify that missing_data[1] == -1?
|
||||
int data_index = missing_data[0];
|
||||
int parity_index = index_of_connected_parity(code_desc, data_index, missing_parity, missing_data);
|
||||
int i;
|
||||
|
||||
// Copy the appropriate parity into the data buffer
|
||||
fast_memcpy(data[data_index], parity[parity_index-code_desc->k], blocksize);
|
||||
|
||||
for (i=0; i < code_desc->k; i++) {
|
||||
if (i != data_index && is_data_in_parity(i, code_desc->parity_bms[parity_index-code_desc->k])) {
|
||||
xor_bufs_and_store(data[i], data[data_index], blocksize);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void decode_two_data(xor_code_t *code_desc, char **data, char **parity, int *missing_data, int *missing_parity, int blocksize)
|
||||
{
|
||||
// Verify that missing_data[2] == -1?
|
||||
int data_index = missing_data[0];
|
||||
int parity_index = index_of_connected_parity(code_desc, data_index, missing_parity, missing_data);
|
||||
int i;
|
||||
|
||||
if (parity_index < 0) {
|
||||
data_index = missing_data[1];
|
||||
parity_index = index_of_connected_parity(code_desc, data_index, missing_parity, missing_data);
|
||||
if (parity_index < 0) {
|
||||
fprintf(stderr, "Shit is broken, cannot find a proper parity!!!\n");
|
||||
exit(2);
|
||||
}
|
||||
missing_data[1] = -1;
|
||||
} else {
|
||||
missing_data[0] = missing_data[1];
|
||||
missing_data[1] = -1;
|
||||
}
|
||||
|
||||
// Copy the appropriate parity into the data buffer
|
||||
fast_memcpy(data[data_index], parity[parity_index-code_desc->k], blocksize);
|
||||
|
||||
for (i=0; i < code_desc->k; i++) {
|
||||
if (i != data_index && is_data_in_parity(i, code_desc->parity_bms[parity_index-code_desc->k])) {
|
||||
xor_bufs_and_store(data[i], data[data_index], blocksize);
|
||||
}
|
||||
}
|
||||
decode_one_data(code_desc, data, parity, missing_data, missing_parity, blocksize);
|
||||
}
|
||||
|
||||
static void decode_three_data(xor_code_t *code_desc, char **data, char **parity, int *missing_data, int *missing_parity, int blocksize)
|
||||
{
|
||||
int i = 0;
|
||||
int parity_index = -1;
|
||||
int data_index = -1;
|
||||
unsigned int parity_bm = -1;
|
||||
char *parity_buffer = NULL;
|
||||
|
||||
/*
|
||||
* Try to find a parity that only contains
|
||||
* one of the missing data elements.
|
||||
*/
|
||||
while (missing_data[i] > -1) {
|
||||
parity_index = index_of_connected_parity(code_desc, missing_data[i], missing_parity, missing_data);
|
||||
if (parity_index > -1) {
|
||||
data_index = missing_data[i];
|
||||
parity_buffer = parity[parity_index-code_desc->k];
|
||||
parity_bm = code_desc->parity_bms[parity_index-code_desc->k];
|
||||
break;
|
||||
}
|
||||
i++;
|
||||
}
|
||||
|
||||
/*
|
||||
* If we cannot find a parity that is connected to only
|
||||
* one missing element, we must find a parity that is
|
||||
* connected to exactly 2 (P) and another that is connected
|
||||
* to exactly 3 (Q) (it should exist!!!).
|
||||
*
|
||||
* We XOR those parities together and use it to recover
|
||||
* the element that is not connected to P.
|
||||
*/
|
||||
if (parity_index < 0) {
|
||||
int contains_2d = -1;
|
||||
int contains_3d = -1;
|
||||
|
||||
for (i=0;i < code_desc->m;i++) {
|
||||
int num_missing = num_missing_data_in_parity(code_desc, code_desc->k+i, missing_data);
|
||||
if (num_missing == 2 && contains_2d < 0) {
|
||||
contains_2d = i;
|
||||
} else if (num_missing == 3 && contains_3d < 0) {
|
||||
contains_3d = i;
|
||||
}
|
||||
}
|
||||
|
||||
if (contains_2d < 0 || contains_3d < 0) {
|
||||
fprintf(stderr, "Shit is broken, cannot find a proper parity (2 and 3-connected parities)!!!\n");
|
||||
exit(2);
|
||||
}
|
||||
|
||||
parity_buffer = aligned_malloc(blocksize, 16);
|
||||
|
||||
// P XOR Q
|
||||
parity_bm = code_desc->parity_bms[contains_2d] ^ code_desc->parity_bms[contains_3d];
|
||||
|
||||
// Create buffer with P XOR Q -> parity_buffer
|
||||
fast_memcpy(parity_buffer, parity[contains_2d], blocksize);
|
||||
xor_bufs_and_store(parity[contains_3d], parity_buffer, blocksize);
|
||||
|
||||
i=0;
|
||||
data_index = -1;
|
||||
while (missing_data[i] > -1) {
|
||||
if (is_data_in_parity(missing_data[i], parity_bm)) {
|
||||
data_index = missing_data[i];
|
||||
break;
|
||||
}
|
||||
i++;
|
||||
}
|
||||
|
||||
if (data_index < 0) {
|
||||
fprintf(stderr, "Shit is broken, cannot construct equations to repair 3 failures!!!\n");
|
||||
exit(2);
|
||||
}
|
||||
// Copy the appropriate parity into the data buffer
|
||||
fast_memcpy(data[data_index], parity_buffer, blocksize);
|
||||
// Free up the buffer we allocated above
|
||||
aligned_free(parity_buffer);
|
||||
} else {
|
||||
// Copy the appropriate parity into the data buffer
|
||||
fast_memcpy(data[data_index], parity_buffer, blocksize);
|
||||
}
|
||||
|
||||
|
||||
for (i=0; i < code_desc->k; i++) {
|
||||
if (i != data_index && is_data_in_parity(i, parity_bm)) {
|
||||
xor_bufs_and_store(data[i], data[data_index], blocksize);
|
||||
}
|
||||
}
|
||||
|
||||
remove_from_missing_list(data_index, missing_data);
|
||||
|
||||
decode_two_data(code_desc, data, parity, missing_data, missing_parity, blocksize);
|
||||
}
|
||||
|
||||
void xor_hd_decode(xor_code_t *code_desc, char **data, char **parity, int *missing_idxs, int blocksize, int decode_parity)
|
||||
{
|
||||
failure_pattern_t pattern = get_failure_pattern(code_desc, missing_idxs);
|
||||
|
||||
switch(pattern) {
|
||||
case FAIL_PATTERN_0D_0P:
|
||||
break;
|
||||
case FAIL_PATTERN_1D_0P:
|
||||
{
|
||||
int *missing_data = get_missing_data(code_desc, missing_idxs);
|
||||
decode_one_data(code_desc, data, parity, missing_data, NULL, blocksize);
|
||||
free(missing_data);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_2D_0P:
|
||||
{
|
||||
int *missing_data = get_missing_data(code_desc, missing_idxs);
|
||||
decode_two_data(code_desc, data, parity, missing_data, NULL, blocksize);
|
||||
free(missing_data);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_3D_0P:
|
||||
{
|
||||
int *missing_data = get_missing_data(code_desc, missing_idxs);
|
||||
decode_three_data(code_desc, data, parity, missing_data, NULL, blocksize);
|
||||
free(missing_data);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_1D_1P:
|
||||
{
|
||||
int *missing_data = get_missing_data(code_desc, missing_idxs);
|
||||
int *missing_parity = get_missing_parity(code_desc, missing_idxs);
|
||||
decode_one_data(code_desc, data, parity, missing_data, missing_parity, blocksize);
|
||||
if (decode_parity) {
|
||||
selective_encode(code_desc, data, parity, missing_parity, blocksize);
|
||||
}
|
||||
free(missing_parity);
|
||||
free(missing_data);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_1D_2P:
|
||||
{
|
||||
int *missing_data = get_missing_data(code_desc, missing_idxs);
|
||||
int *missing_parity = get_missing_parity(code_desc, missing_idxs);
|
||||
decode_one_data(code_desc, data, parity, missing_data, missing_parity, blocksize);
|
||||
if (decode_parity) {
|
||||
selective_encode(code_desc, data, parity, missing_parity, blocksize);
|
||||
}
|
||||
free(missing_data);
|
||||
free(missing_parity);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_2D_1P:
|
||||
{
|
||||
int *missing_data = get_missing_data(code_desc, missing_idxs);
|
||||
int *missing_parity = get_missing_parity(code_desc, missing_idxs);
|
||||
decode_two_data(code_desc, data, parity, missing_data, missing_parity, blocksize);
|
||||
if (decode_parity) {
|
||||
selective_encode(code_desc, data, parity, missing_parity, blocksize);
|
||||
}
|
||||
free(missing_parity);
|
||||
free(missing_data);
|
||||
break;
|
||||
}
|
||||
case FAIL_PATTERN_0D_1P:
|
||||
if (decode_parity) {
|
||||
int *missing_parity = get_missing_parity(code_desc, missing_idxs);
|
||||
selective_encode(code_desc, data, parity, missing_parity, blocksize);
|
||||
free(missing_parity);
|
||||
}
|
||||
break;
|
||||
case FAIL_PATTERN_0D_2P:
|
||||
if (decode_parity) {
|
||||
int *missing_parity = get_missing_parity(code_desc, missing_idxs);
|
||||
selective_encode(code_desc, data, parity, missing_parity, blocksize);
|
||||
free(missing_parity);
|
||||
}
|
||||
break;
|
||||
case FAIL_PATTERN_0D_3P:
|
||||
if (decode_parity) {
|
||||
int *missing_parity = get_missing_parity(code_desc, missing_idxs);
|
||||
selective_encode(code_desc, data, parity, missing_parity, blocksize);
|
||||
free(missing_parity);
|
||||
}
|
||||
break;
|
||||
case FAIL_PATTERN_GE_HD:
|
||||
default:
|
||||
break;
|
||||
}
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
xor_code_t* init_xor_hd_code(int k, int m, int hd)
|
||||
{
|
||||
xor_code_t *code_desc = NULL;
|
||||
int is_valid = 0;
|
||||
|
||||
if (hd == 3) {
|
||||
if (m == 6) {
|
||||
if (k <= 15 && k >= 6) {
|
||||
is_valid = 1;
|
||||
}
|
||||
} else if (m == 5) {
|
||||
if (k <= 10 && k >= 5) {
|
||||
is_valid = 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (hd == 4) {
|
||||
if (m == 6) {
|
||||
if (k <= 20 && k >= 6) {
|
||||
is_valid = 1;
|
||||
}
|
||||
} else if (m == 5) {
|
||||
if (k <= 10 && k >= 5) {
|
||||
is_valid = 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (is_valid) {
|
||||
code_desc = (xor_code_t*)malloc(sizeof(xor_code_t));
|
||||
code_desc->parity_bms = PARITY_BM_ARY(k, m, hd);
|
||||
code_desc->data_bms = DATA_BM_ARY(k, m, hd);
|
||||
code_desc->k = k;
|
||||
code_desc->m = m;
|
||||
code_desc->hd = hd;
|
||||
code_desc->decode = xor_hd_decode;
|
||||
code_desc->encode = xor_code_encode;
|
||||
code_desc->fragments_needed = xor_hd_fragments_needed;
|
||||
}
|
||||
|
||||
return code_desc;
|
||||
}
|
||||
|
||||
344
src/utils/chksum/alg_sig.c
Normal file
344
src/utils/chksum/alg_sig.c
Normal file
@@ -0,0 +1,344 @@
|
||||
/* * Copyright (c) 2013, Kevin Greenan (kmgreen2@gmail.com)
|
||||
* 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. 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<alg_sig.h>
|
||||
#include<stdlib.h>
|
||||
#include<string.h>
|
||||
|
||||
int valid_gf_w[] = { 8, 16, -1 };
|
||||
int valid_pairs[][2] = { { 8, 32}, {16, 32}, {16, 64}, {-1, -1} };
|
||||
|
||||
|
||||
static
|
||||
alg_sig_t *init_alg_sig_w8(int sig_len)
|
||||
{
|
||||
alg_sig_t *alg_sig_handle;
|
||||
int num_gf_lr_table_syms;
|
||||
int i;
|
||||
int w = 8;
|
||||
int alpha = 2, beta = 4, gamma = 8;
|
||||
int num_components = sig_len / w;
|
||||
|
||||
alg_sig_handle = (alg_sig_t *)malloc(sizeof(alg_sig_t));
|
||||
if (alg_sig_handle == NULL) {
|
||||
return NULL;
|
||||
}
|
||||
|
||||
alg_sig_handle->sig_len = sig_len;
|
||||
alg_sig_handle->gf_w = w;
|
||||
|
||||
num_gf_lr_table_syms = 1 << (w >> 1);
|
||||
|
||||
if (num_components >= 4) {
|
||||
alg_sig_handle->tbl1_l = (int*)malloc(sizeof(int) * num_gf_lr_table_syms);
|
||||
alg_sig_handle->tbl1_r = (int*)malloc(sizeof(int) * num_gf_lr_table_syms);
|
||||
alg_sig_handle->tbl2_l = (int*)malloc(sizeof(int) * num_gf_lr_table_syms);
|
||||
alg_sig_handle->tbl2_r = (int*)malloc(sizeof(int) * num_gf_lr_table_syms);
|
||||
alg_sig_handle->tbl3_l = (int*)malloc(sizeof(int) * num_gf_lr_table_syms);
|
||||
alg_sig_handle->tbl3_r = (int*)malloc(sizeof(int) * num_gf_lr_table_syms);
|
||||
}
|
||||
|
||||
/*
|
||||
* Note that \alpha = 2
|
||||
* Note that \beta = 4 (\alpha ^ 2)
|
||||
* Note that \gamme = 8 (\alpha ^ 3)
|
||||
*/
|
||||
for (i = 0; i < 16; i++) {
|
||||
if (num_components >= 4) {
|
||||
alg_sig_handle->tbl1_l[i] = galois_single_multiply((unsigned char) (i << 4) & 0xf0, alpha, w);
|
||||
alg_sig_handle->tbl1_r[i] = galois_single_multiply((unsigned char) i, alpha, w);
|
||||
|
||||
alg_sig_handle->tbl2_l[i] = galois_single_multiply((unsigned char) (i << 4) & 0xf0, beta, w);
|
||||
alg_sig_handle->tbl2_r[i] = galois_single_multiply((unsigned char) i, beta, w);
|
||||
|
||||
alg_sig_handle->tbl3_l[i] = galois_single_multiply((unsigned char) (i << 4) & 0xf0, gamma, w);
|
||||
alg_sig_handle->tbl3_r[i] = galois_single_multiply((unsigned char) i, gamma, w);
|
||||
}
|
||||
}
|
||||
|
||||
return alg_sig_handle;
|
||||
}
|
||||
|
||||
static
|
||||
alg_sig_t *init_alg_sig_w16(int sig_len)
|
||||
{
|
||||
alg_sig_t *alg_sig_handle;
|
||||
int num_gf_lr_table_syms;
|
||||
int i;
|
||||
int w = 16;
|
||||
int alpha = 2, beta = 4, gamma = 8;
|
||||
int num_components = sig_len / w;
|
||||
|
||||
alg_sig_handle = (alg_sig_t *)malloc(sizeof(alg_sig_t));
|
||||
if (alg_sig_handle == NULL) {
|
||||
return NULL;
|
||||
}
|
||||
|
||||
alg_sig_handle->sig_len = sig_len;
|
||||
alg_sig_handle->gf_w = w;
|
||||
|
||||
num_gf_lr_table_syms = 1 << (w >> 1);
|
||||
|
||||
if (num_components >= 2) {
|
||||
alg_sig_handle->tbl1_l = (int*)malloc(sizeof(int) * num_gf_lr_table_syms);
|
||||
alg_sig_handle->tbl1_r = (int*)malloc(sizeof(int) * num_gf_lr_table_syms);
|
||||
}
|
||||
|
||||
if (num_components >= 4) {
|
||||
alg_sig_handle->tbl2_l = (int*)malloc(sizeof(int) * num_gf_lr_table_syms);
|
||||
alg_sig_handle->tbl2_r = (int*)malloc(sizeof(int) * num_gf_lr_table_syms);
|
||||
alg_sig_handle->tbl3_l = (int*)malloc(sizeof(int) * num_gf_lr_table_syms);
|
||||
alg_sig_handle->tbl3_r = (int*)malloc(sizeof(int) * num_gf_lr_table_syms);
|
||||
}
|
||||
|
||||
/*
|
||||
* Note that \alpha = 2
|
||||
* Note that \beta = 4 (\alpha ^ 2 MOD 2^16)
|
||||
* Note that \gamme = 8 (\alpha ^ 3 MOD 2^16)
|
||||
*/
|
||||
for (i = 0; i < 256; i++) {
|
||||
alg_sig_handle->tbl1_l[i] = galois_single_multiply((unsigned short) (i << 8), alpha, w);
|
||||
alg_sig_handle->tbl1_r[i] = galois_single_multiply((unsigned short) i, alpha, w);
|
||||
|
||||
if (num_components >= 4) {
|
||||
alg_sig_handle->tbl2_l[i] = galois_single_multiply((unsigned short) (i << 8), beta, w);
|
||||
alg_sig_handle->tbl2_r[i] = galois_single_multiply((unsigned short) i, beta, w);
|
||||
|
||||
alg_sig_handle->tbl3_l[i] = galois_single_multiply((unsigned short) (i << 8), gamma, w);
|
||||
alg_sig_handle->tbl3_r[i] = galois_single_multiply((unsigned short) i, gamma, w);
|
||||
}
|
||||
}
|
||||
|
||||
return alg_sig_handle;
|
||||
}
|
||||
|
||||
alg_sig_t *init_alg_sig(int sig_len, int gf_w)
|
||||
{
|
||||
int i=0;
|
||||
while (valid_pairs[i][0] > -1) {
|
||||
if (gf_w == valid_pairs[i][0] &&
|
||||
sig_len == valid_pairs[i][1]) {
|
||||
break;
|
||||
}
|
||||
i++;
|
||||
}
|
||||
|
||||
if (valid_pairs[i][0] == -1) {
|
||||
return NULL;
|
||||
}
|
||||
|
||||
if (gf_w == 8) {
|
||||
return init_alg_sig_w8(sig_len);
|
||||
} else if (gf_w == 16) {
|
||||
return init_alg_sig_w16(sig_len);
|
||||
}
|
||||
return NULL;
|
||||
}
|
||||
|
||||
void destroy_alg_sig(alg_sig_t* alg_sig_handle)
|
||||
{
|
||||
if (alg_sig_handle == NULL) {
|
||||
return;
|
||||
}
|
||||
if (alg_sig_handle->gf_w == 0) {
|
||||
free(alg_sig_handle);
|
||||
return;
|
||||
}
|
||||
int num_components = alg_sig_handle->sig_len / alg_sig_handle->gf_w;
|
||||
|
||||
free(alg_sig_handle->tbl1_l);
|
||||
free(alg_sig_handle->tbl1_r);
|
||||
if (num_components >= 4) {
|
||||
free(alg_sig_handle->tbl2_l);
|
||||
free(alg_sig_handle->tbl2_r);
|
||||
free(alg_sig_handle->tbl3_l);
|
||||
free(alg_sig_handle->tbl3_r);
|
||||
}
|
||||
free(alg_sig_handle);
|
||||
}
|
||||
|
||||
|
||||
static
|
||||
int compute_w8_alg_sig_32(alg_sig_t *alg_sig_handle, char *buf, int len, char *sig)
|
||||
{
|
||||
int bit_mask;
|
||||
int i;
|
||||
int alpha = 2, beta = 4, gamma = 8;
|
||||
int w = 8;
|
||||
|
||||
if (len == 0) {
|
||||
bzero(sig, 4);
|
||||
return 0;
|
||||
}
|
||||
|
||||
sig[0] = buf[len-1];
|
||||
sig[1] = buf[len-1];
|
||||
sig[2] = buf[len-1];
|
||||
sig[3] = buf[len-1];
|
||||
|
||||
/**
|
||||
* This is the loop to optimize. It is currently optimized enough : using Horner's alg.,
|
||||
* shortened mult. tables, and other tricks.
|
||||
*/
|
||||
for (i = len - 2; i >= 0; i--) {
|
||||
sig[0] ^= buf[i];
|
||||
sig[1] = (buf[i] ^ (alg_sig_handle->tbl1_l[(sig[1] >> 4) & 0x0f] ^ alg_sig_handle->tbl1_r[sig[1] & 0x0f]));
|
||||
sig[2] = (buf[i] ^ (alg_sig_handle->tbl2_l[(sig[2] >> 4) & 0x0f] ^ alg_sig_handle->tbl2_r[sig[2] & 0x0f]));
|
||||
sig[3] = (buf[i] ^ (alg_sig_handle->tbl3_l[(sig[3] >> 4) & 0x0f] ^ alg_sig_handle->tbl3_r[sig[3] & 0x0f]));
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static
|
||||
int compute_w16_alg_sig_64(alg_sig_t *alg_sig_handle, char *buf, int len, char *sig)
|
||||
{
|
||||
int bit_mask;
|
||||
int adj_len = len / 2;
|
||||
int i;
|
||||
unsigned short *_buf = (unsigned short *)buf;
|
||||
unsigned short sig_buf[4];
|
||||
|
||||
if (len == 0) {
|
||||
bzero(sig, 8);
|
||||
return 0;
|
||||
}
|
||||
|
||||
switch (len % 2) {
|
||||
case 1:
|
||||
bit_mask = 0x00ff;
|
||||
break;
|
||||
default:
|
||||
bit_mask = 0xffff;
|
||||
break;
|
||||
}
|
||||
|
||||
if (len % 2 > 0) {
|
||||
adj_len++;
|
||||
}
|
||||
|
||||
// Account for buffer not being uint16_t aligned
|
||||
sig_buf[0] = (_buf[adj_len - 1] & bit_mask);
|
||||
sig_buf[1] = (_buf[adj_len - 1] & bit_mask);
|
||||
sig_buf[2] = (_buf[adj_len - 1] & bit_mask);
|
||||
sig_buf[3] = (_buf[adj_len - 1] & bit_mask);
|
||||
|
||||
/**
|
||||
* This is the loop to optimize. It is currently optimized enough : using Horner's alg.,
|
||||
* shortened mult. tables, and other tricks.
|
||||
*/
|
||||
for (i = adj_len - 2; i >= 0; i--) {
|
||||
sig_buf[0] ^= _buf[i];
|
||||
sig_buf[1] = (_buf[i] ^ (alg_sig_handle->tbl1_l[(sig_buf[1] >> 8) & 0x00ff] ^ alg_sig_handle->tbl1_r[sig_buf[1] & 0x00ff]));
|
||||
sig_buf[2] = (_buf[i] ^ (alg_sig_handle->tbl2_l[(sig_buf[2] >> 8) & 0x00ff] ^ alg_sig_handle->tbl2_r[sig_buf[2] & 0x00ff]));
|
||||
sig_buf[3] = (_buf[i] ^ (alg_sig_handle->tbl3_l[(sig_buf[3] >> 8) & 0x00ff] ^ alg_sig_handle->tbl3_r[sig_buf[3] & 0x00ff]));
|
||||
}
|
||||
|
||||
sig[0] = (char) (sig_buf[0] & 0x000ff);
|
||||
sig[1] = (char) ((sig_buf[0] >> 8) & 0x000ff);
|
||||
sig[2] = (char) (sig_buf[1] & 0x00ff);
|
||||
sig[3] = (char) ((sig_buf[1] >> 8) & 0x00ff);
|
||||
sig[4] = (char) (sig_buf[2] & 0x00ff);
|
||||
sig[5] = (char) ((sig_buf[2] >> 8) & 0x00ff);
|
||||
sig[6] = (char) (sig_buf[3] & 0x00ff);
|
||||
sig[7] = (char) ((sig_buf[3] >> 8) & 0x00ff);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static
|
||||
int compute_w16_alg_sig_32(alg_sig_t *alg_sig_handle, char *buf, int len, char *sig)
|
||||
{
|
||||
int bit_mask;
|
||||
int adj_len = len / 2;
|
||||
int i;
|
||||
unsigned short *_buf = (unsigned short *)buf;
|
||||
unsigned short sig_buf[2];
|
||||
|
||||
if (len == 0) {
|
||||
bzero(sig, 8);
|
||||
return 0;
|
||||
}
|
||||
|
||||
switch (len % 2) {
|
||||
case 1:
|
||||
bit_mask = 0x00ff;
|
||||
break;
|
||||
default:
|
||||
bit_mask = 0xffff;
|
||||
break;
|
||||
}
|
||||
|
||||
if (len % 2 > 0) {
|
||||
adj_len++;
|
||||
}
|
||||
|
||||
// Account for buffer not being uint16_t aligned
|
||||
sig_buf[0] = (_buf[adj_len - 1] & bit_mask);
|
||||
sig_buf[1] = (_buf[adj_len - 1] & bit_mask);
|
||||
|
||||
/**
|
||||
* This is the loop to optimize. It is currently optimized enough : using Horner's alg.,
|
||||
* shortened mult. tables, and other tricks.
|
||||
*/
|
||||
for (i = adj_len - 2; i >= 0; i--) {
|
||||
sig_buf[0] ^= _buf[i];
|
||||
sig_buf[1] = (_buf[i] ^ (alg_sig_handle->tbl1_l[(sig_buf[1] >> 8) & 0x00ff] ^ alg_sig_handle->tbl1_r[sig_buf[1] & 0x00ff]));
|
||||
}
|
||||
|
||||
sig[0] = (char) (sig_buf[0] & 0x000ff);
|
||||
sig[1] = (char) ((sig_buf[0] >> 8) & 0x000ff);
|
||||
sig[2] = (char) (sig_buf[1] & 0x00ff);
|
||||
sig[3] = (char) ((sig_buf[1] >> 8) & 0x00ff);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static
|
||||
int compute_alg_sig_32(alg_sig_t *alg_sig_handle, char *buf, int len, char *sig)
|
||||
{
|
||||
if (alg_sig_handle->gf_w == 8) {
|
||||
return compute_w8_alg_sig_32(alg_sig_handle, buf, len, sig);
|
||||
} else if (alg_sig_handle->gf_w == 16) {
|
||||
return compute_w16_alg_sig_32(alg_sig_handle, buf, len, sig);
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
static
|
||||
int compute_alg_sig_64(alg_sig_t *alg_sig_handle, char *buf, int len, char *sig)
|
||||
{
|
||||
if (alg_sig_handle->gf_w == 16) {
|
||||
return compute_w16_alg_sig_64(alg_sig_handle, buf, len, sig);
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
int compute_alg_sig(alg_sig_t *alg_sig_handle, char *buf, int len, char *sig)
|
||||
{
|
||||
if (alg_sig_handle->sig_len == 32) {
|
||||
return compute_alg_sig_32(alg_sig_handle, buf, len, sig);
|
||||
} else if (alg_sig_handle->sig_len == 64) {
|
||||
return compute_alg_sig_64(alg_sig_handle, buf, len, sig);
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
132
src/utils/chksum/crc32.c
Normal file
132
src/utils/chksum/crc32.c
Normal file
@@ -0,0 +1,132 @@
|
||||
/*-
|
||||
* COPYRIGHT (C) 1986 Gary S. Brown. You may use this program, or
|
||||
* code or tables extracted from it, as desired without restriction.
|
||||
*
|
||||
* First, the polynomial itself and its table of feedback terms. The
|
||||
* polynomial is
|
||||
* X^32+X^26+X^23+X^22+X^16+X^12+X^11+X^10+X^8+X^7+X^5+X^4+X^2+X^1+X^0
|
||||
*
|
||||
* Note that we take it "backwards" and put the highest-order term in
|
||||
* the lowest-order bit. The X^32 term is "implied"; the LSB is the
|
||||
* X^31 term, etc. The X^0 term (usually shown as "+1") results in
|
||||
* the MSB being 1
|
||||
*
|
||||
* Note that the usual hardware shift register implementation, which
|
||||
* is what we're using (we're merely optimizing it by doing eight-bit
|
||||
* chunks at a time) shifts bits into the lowest-order term. In our
|
||||
* implementation, that means shifting towards the right. Why do we
|
||||
* do it this way? Because the calculated CRC must be transmitted in
|
||||
* order from highest-order term to lowest-order term. UARTs transmit
|
||||
* characters in order from LSB to MSB. By storing the CRC this way
|
||||
* we hand it to the UART in the order low-byte to high-byte; the UART
|
||||
* sends each low-bit to hight-bit; and the result is transmission bit
|
||||
* by bit from highest- to lowest-order term without requiring any bit
|
||||
* shuffling on our part. Reception works similarly
|
||||
*
|
||||
* The feedback terms table consists of 256, 32-bit entries. Notes
|
||||
*
|
||||
* The table can be generated at runtime if desired; code to do so
|
||||
* is shown later. It might not be obvious, but the feedback
|
||||
* terms simply represent the results of eight shift/xor opera
|
||||
* tions for all combinations of data and CRC register values
|
||||
*
|
||||
* The values must be right-shifted by eight bits by the "updcrc
|
||||
* logic; the shift must be unsigned (bring in zeroes). On some
|
||||
* hardware you could probably optimize the shift in assembler by
|
||||
* using byte-swap instructions
|
||||
* polynomial $edb88320
|
||||
*
|
||||
*
|
||||
* CRC32 code derived from work by Gary S. Brown.
|
||||
*/
|
||||
|
||||
#include <sys/param.h>
|
||||
|
||||
#if defined(INTEL_SSE4)
|
||||
#include <nmmintrin.h>
|
||||
|
||||
int
|
||||
crc32(int crc, const void *buf, size_t size)
|
||||
{
|
||||
unsigned long long *current = (unsigned long long*)buf;
|
||||
unsigned char *current_char;
|
||||
|
||||
crc = crc ^ ~0U;
|
||||
|
||||
while(size >= 8) {
|
||||
crc = _mm_crc32_u64(crc, *current++);
|
||||
size -= 8;
|
||||
}
|
||||
|
||||
current_char = (unsigned char*)current;
|
||||
while (size--) {
|
||||
crc = _mm_crc32_u8(crc, *current_char++);
|
||||
}
|
||||
return crc ^ ~0U;
|
||||
}
|
||||
#else
|
||||
|
||||
static int crc32_tab[] = {
|
||||
0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419, 0x706af48f,
|
||||
0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,
|
||||
0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91, 0x1db71064, 0x6ab020f2,
|
||||
0xf3b97148, 0x84be41de, 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,
|
||||
0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,
|
||||
0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,
|
||||
0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b, 0x35b5a8fa, 0x42b2986c,
|
||||
0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,
|
||||
0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423,
|
||||
0xcfba9599, 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,
|
||||
0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190, 0x01db7106,
|
||||
0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,
|
||||
0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d,
|
||||
0x91646c97, 0xe6635c01, 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,
|
||||
0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,
|
||||
0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,
|
||||
0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, 0x4adfa541, 0x3dd895d7,
|
||||
0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,
|
||||
0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa,
|
||||
0xbe0b1010, 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
|
||||
0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, 0x2eb40d81,
|
||||
0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,
|
||||
0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683, 0xe3630b12, 0x94643b84,
|
||||
0x0d6d6a3e, 0x7a6a5aa8, 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,
|
||||
0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,
|
||||
0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,
|
||||
0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5, 0xd6d6a3e8, 0xa1d1937e,
|
||||
0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,
|
||||
0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55,
|
||||
0x316e8eef, 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,
|
||||
0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe, 0xb2bd0b28,
|
||||
0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,
|
||||
0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a, 0x9c0906a9, 0xeb0e363f,
|
||||
0x72076785, 0x05005713, 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,
|
||||
0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,
|
||||
0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,
|
||||
0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c, 0x8f659eff, 0xf862ae69,
|
||||
0x616bffd3, 0x166ccf45, 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,
|
||||
0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc,
|
||||
0x40df0b66, 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
|
||||
0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605, 0xcdd70693,
|
||||
0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,
|
||||
0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d
|
||||
};
|
||||
|
||||
// Use same polynomial as Intel's SSE4 instruction!
|
||||
#define POLY_CRC_32 0x11EDC6F41
|
||||
|
||||
int
|
||||
crc32(int crc, const void *buf, size_t size)
|
||||
{
|
||||
const char *p;
|
||||
|
||||
p = buf;
|
||||
crc = crc ^ ~0U;
|
||||
|
||||
while (size--)
|
||||
crc = crc32_tab[(crc ^ *p++) & 0xFF] ^ (crc >> 8);
|
||||
|
||||
return crc ^ ~0U;
|
||||
}
|
||||
#endif
|
||||
|
||||
Reference in New Issue
Block a user