2013-12-28 09:10:00 +01:00
|
|
|
/*
|
|
|
|
|
* Copyright (C) 2013 Andrea Mazzoleni
|
|
|
|
|
*
|
|
|
|
|
* 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 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.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include "internal.h"
|
2013-12-31 15:46:24 +01:00
|
|
|
#include "memory.h"
|
2013-12-28 09:10:00 +01:00
|
|
|
#include "cpu.h"
|
|
|
|
|
|
2014-01-01 20:38:19 +01:00
|
|
|
/*
|
|
|
|
|
* Initializes and selects the best algorithm.
|
|
|
|
|
*/
|
2013-12-28 09:10:00 +01:00
|
|
|
void raid_init(void)
|
|
|
|
|
{
|
|
|
|
|
raid_par3_ptr = raid_par3_int8;
|
|
|
|
|
raid_par_ptr[3] = raid_par4_int8;
|
|
|
|
|
raid_par_ptr[4] = raid_par5_int8;
|
|
|
|
|
raid_par_ptr[5] = raid_par6_int8;
|
|
|
|
|
|
2013-12-28 12:04:16 +01:00
|
|
|
if (sizeof(void *) == 4) {
|
2013-12-28 09:10:00 +01:00
|
|
|
raid_par_ptr[0] = raid_par1_int32;
|
|
|
|
|
raid_par_ptr[1] = raid_par2_int32;
|
|
|
|
|
raid_parz_ptr = raid_parz_int32;
|
|
|
|
|
} else {
|
|
|
|
|
raid_par_ptr[0] = raid_par1_int64;
|
|
|
|
|
raid_par_ptr[1] = raid_par2_int64;
|
|
|
|
|
raid_parz_ptr = raid_parz_int64;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
raid_rec_ptr[0] = raid_rec1_int8;
|
|
|
|
|
raid_rec_ptr[1] = raid_rec2_int8;
|
|
|
|
|
raid_rec_ptr[2] = raid_recX_int8;
|
|
|
|
|
raid_rec_ptr[3] = raid_recX_int8;
|
|
|
|
|
raid_rec_ptr[4] = raid_recX_int8;
|
|
|
|
|
raid_rec_ptr[5] = raid_recX_int8;
|
|
|
|
|
|
2013-12-30 21:12:29 +01:00
|
|
|
#ifdef CONFIG_X86
|
2013-12-28 09:10:00 +01:00
|
|
|
if (raid_cpu_has_sse2()) {
|
|
|
|
|
raid_par_ptr[0] = raid_par1_sse2;
|
2013-12-30 21:12:29 +01:00
|
|
|
#ifdef CONFIG_X86_64
|
2013-12-28 09:10:00 +01:00
|
|
|
if (raid_cpu_has_slowextendedreg()) {
|
|
|
|
|
raid_par_ptr[1] = raid_par2_sse2;
|
|
|
|
|
raid_parz_ptr = raid_parz_sse2;
|
|
|
|
|
} else {
|
|
|
|
|
raid_par_ptr[1] = raid_par2_sse2ext;
|
|
|
|
|
raid_parz_ptr = raid_parz_sse2ext;
|
|
|
|
|
}
|
|
|
|
|
#else
|
|
|
|
|
raid_par_ptr[1] = raid_par2_sse2;
|
|
|
|
|
raid_parz_ptr = raid_parz_sse2;
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (raid_cpu_has_ssse3()) {
|
2013-12-30 21:12:29 +01:00
|
|
|
#ifdef CONFIG_X86_64
|
2013-12-28 09:10:00 +01:00
|
|
|
raid_par3_ptr = raid_par3_ssse3ext;
|
|
|
|
|
raid_par_ptr[3] = raid_par4_ssse3ext;
|
|
|
|
|
raid_par_ptr[4] = raid_par5_ssse3ext;
|
|
|
|
|
raid_par_ptr[5] = raid_par6_ssse3ext;
|
|
|
|
|
#else
|
|
|
|
|
raid_par3_ptr = raid_par3_ssse3;
|
|
|
|
|
raid_par_ptr[3] = raid_par4_ssse3;
|
|
|
|
|
raid_par_ptr[4] = raid_par5_ssse3;
|
|
|
|
|
raid_par_ptr[5] = raid_par6_ssse3;
|
|
|
|
|
#endif
|
|
|
|
|
raid_rec_ptr[0] = raid_rec1_ssse3;
|
|
|
|
|
raid_rec_ptr[1] = raid_rec2_ssse3;
|
|
|
|
|
raid_rec_ptr[2] = raid_recX_ssse3;
|
|
|
|
|
raid_rec_ptr[3] = raid_recX_ssse3;
|
|
|
|
|
raid_rec_ptr[4] = raid_recX_ssse3;
|
|
|
|
|
raid_rec_ptr[5] = raid_recX_ssse3;
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* set the default mode */
|
|
|
|
|
raid_mode(RAID_MODE_CAUCHY);
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-31 15:46:24 +01:00
|
|
|
/*
|
|
|
|
|
* Refence parity computation.
|
|
|
|
|
*/
|
|
|
|
|
void raid_par_ref(int nd, int np, size_t size, void **vv)
|
|
|
|
|
{
|
|
|
|
|
uint8_t **v = (uint8_t **)vv;
|
|
|
|
|
size_t i;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < size; ++i) {
|
|
|
|
|
uint8_t p[RAID_PARITY_MAX];
|
|
|
|
|
int j, d;
|
|
|
|
|
|
|
|
|
|
for (j = 0; j < np; ++j)
|
|
|
|
|
p[j] = 0;
|
|
|
|
|
|
|
|
|
|
for (d = 0; d < nd; ++d) {
|
|
|
|
|
uint8_t b = v[d][i];
|
|
|
|
|
|
|
|
|
|
for (j = 0; j < np; ++j)
|
|
|
|
|
p[j] ^= gfmul[b][gfgen[j][d]];
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (j = 0; j < np; ++j)
|
|
|
|
|
v[nd + j][i] = p[j];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2014-01-01 20:38:19 +01:00
|
|
|
/*
|
|
|
|
|
* Size of the blocks to test.
|
|
|
|
|
*/
|
2014-01-01 22:26:56 +01:00
|
|
|
#define TEST_SIZE 4096
|
2014-01-01 20:38:19 +01:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Number of data blocks to test.
|
2013-12-31 15:46:24 +01:00
|
|
|
*/
|
2014-01-01 20:38:19 +01:00
|
|
|
#define TEST_COUNT (65536 / TEST_SIZE)
|
2013-12-31 15:46:24 +01:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Parity generation test.
|
|
|
|
|
*/
|
|
|
|
|
static int raid_test_par(int nd, int np, size_t size, void **v, void **ref)
|
|
|
|
|
{
|
|
|
|
|
int i;
|
2014-01-01 20:38:19 +01:00
|
|
|
void *t[TEST_COUNT + RAID_PARITY_MAX];
|
2013-12-31 15:46:24 +01:00
|
|
|
|
|
|
|
|
/* setup data */
|
|
|
|
|
for (i = 0; i < nd; ++i)
|
|
|
|
|
t[i] = ref[i];
|
|
|
|
|
|
|
|
|
|
/* setup parity */
|
|
|
|
|
for (i = 0; i < np; ++i)
|
|
|
|
|
t[nd+i] = v[nd+i];
|
|
|
|
|
|
|
|
|
|
raid_par(nd, np, size, t);
|
|
|
|
|
|
|
|
|
|
/* compare parity */
|
|
|
|
|
for (i = 0; i < np; ++i)
|
|
|
|
|
if (memcmp(t[nd+i], ref[nd+i], size) != 0)
|
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Recovering test.
|
|
|
|
|
*/
|
|
|
|
|
static int raid_test_rec(int nrd, int *id, int nrp, int *ip, int nd, int np, size_t size, void **v, void **ref)
|
|
|
|
|
{
|
|
|
|
|
int i, j;
|
2014-01-01 20:38:19 +01:00
|
|
|
void *t[TEST_COUNT + RAID_PARITY_MAX];
|
2013-12-31 15:46:24 +01:00
|
|
|
|
|
|
|
|
/* setup data */
|
|
|
|
|
for (i = 0, j = 0; i < nd; ++i) {
|
|
|
|
|
if (j < nrd && id[j] == i) {
|
|
|
|
|
t[i] = v[i];
|
|
|
|
|
++j;
|
|
|
|
|
} else {
|
|
|
|
|
t[i] = ref[i];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* setup parity */
|
|
|
|
|
for (i = 0, j = 0; i < np; ++i) {
|
|
|
|
|
if (j < nrp && ip[j] == i) {
|
|
|
|
|
t[nd+i] = v[nd+i];
|
|
|
|
|
++j;
|
|
|
|
|
} else {
|
|
|
|
|
t[nd+i] = ref[nd+i];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
raid_rec(nrd, id, nrp, ip, nd, np, size, t);
|
|
|
|
|
|
|
|
|
|
/* compare all data and parity */
|
|
|
|
|
for (i = 0; i < nd+np; ++i)
|
|
|
|
|
if (t[i] != ref[i] && memcmp(t[i], ref[i], size) != 0)
|
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Basic functionality self test.
|
|
|
|
|
*/
|
|
|
|
|
int raid_selftest(void)
|
|
|
|
|
{
|
2014-01-01 20:38:19 +01:00
|
|
|
const int nd = TEST_COUNT;
|
|
|
|
|
const size_t size = TEST_SIZE;
|
2013-12-31 15:46:24 +01:00
|
|
|
const int nv = nd + RAID_PARITY_MAX * 2 + 1;
|
|
|
|
|
void *v_alloc;
|
|
|
|
|
void **v;
|
|
|
|
|
void *ref[nd + RAID_PARITY_MAX];
|
|
|
|
|
int id[RAID_PARITY_MAX];
|
|
|
|
|
int ip[RAID_PARITY_MAX];
|
|
|
|
|
int i, np;
|
2014-01-01 20:38:19 +01:00
|
|
|
int ret = 0;
|
2013-12-31 15:46:24 +01:00
|
|
|
|
|
|
|
|
/* ensure to have enough space for data */
|
2014-01-01 20:38:19 +01:00
|
|
|
BUG_ON(nd * size > 65536);
|
2013-12-31 15:46:24 +01:00
|
|
|
|
|
|
|
|
v = raid_malloc_vector(nd, nv, size, &v_alloc);
|
|
|
|
|
if (!v)
|
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
|
|
memset(v[nv-1], 0, size);
|
|
|
|
|
raid_zero(v[nv-1]);
|
|
|
|
|
|
|
|
|
|
/* use the multiplication table as data */
|
|
|
|
|
for (i = 0; i < nd; ++i)
|
|
|
|
|
ref[i] = ((uint8_t *)gfmul) + size * i;
|
|
|
|
|
|
|
|
|
|
/* setup reference parity */
|
|
|
|
|
for (i = 0; i < RAID_PARITY_MAX; ++i)
|
|
|
|
|
ref[nd+i] = v[nd+RAID_PARITY_MAX+i];
|
|
|
|
|
|
|
|
|
|
/* compute reference parity */
|
|
|
|
|
raid_par_ref(nd, RAID_PARITY_MAX, size, ref);
|
|
|
|
|
|
|
|
|
|
/* test for each parity level */
|
|
|
|
|
for (np = 1; np <= RAID_PARITY_MAX; ++np) {
|
|
|
|
|
/* test parity generation */
|
2014-01-01 20:38:19 +01:00
|
|
|
ret = raid_test_par(nd, np, size, v, ref);
|
|
|
|
|
if (ret != 0)
|
2014-01-02 17:51:50 +01:00
|
|
|
goto bail;
|
2013-12-31 15:46:24 +01:00
|
|
|
|
|
|
|
|
/* test recovering with full broken data disks */
|
|
|
|
|
for (i = 0; i < np; ++i)
|
|
|
|
|
id[i] = nd - np + i;
|
|
|
|
|
|
2014-01-01 20:38:19 +01:00
|
|
|
ret = raid_test_rec(np, id, 0, ip, nd, np, size, v, ref);
|
|
|
|
|
if (ret != 0)
|
|
|
|
|
goto bail;
|
2013-12-31 15:46:24 +01:00
|
|
|
|
|
|
|
|
/* test recovering with half broken data and ending parity */
|
|
|
|
|
for (i = 0; i < np / 2; ++i)
|
|
|
|
|
id[i] = i;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < (np + 1) / 2; ++i)
|
|
|
|
|
ip[i] = np - np / 2 + i;
|
|
|
|
|
|
2014-01-01 20:38:19 +01:00
|
|
|
ret = raid_test_rec(np / 2, id, np / 2, ip, nd, np, size, v, ref);
|
|
|
|
|
if (ret != 0)
|
|
|
|
|
goto bail;
|
2013-12-31 15:46:24 +01:00
|
|
|
|
|
|
|
|
/* test recovering with half broken data and leading parity */
|
|
|
|
|
for (i = 0; i < np / 2; ++i)
|
|
|
|
|
id[i] = i;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < (np + 1) / 2; ++i)
|
|
|
|
|
ip[i] = i;
|
|
|
|
|
|
2014-01-01 20:38:19 +01:00
|
|
|
ret = raid_test_rec(np / 2, id, np / 2, ip, nd, np, size, v, ref);
|
|
|
|
|
if (ret != 0)
|
|
|
|
|
goto bail;
|
2013-12-31 15:46:24 +01:00
|
|
|
}
|
|
|
|
|
|
2014-01-01 20:38:19 +01:00
|
|
|
bail:
|
2013-12-31 15:46:24 +01:00
|
|
|
free(v_alloc);
|
|
|
|
|
|
2014-01-01 20:38:19 +01:00
|
|
|
return ret;
|
2013-12-31 15:46:24 +01:00
|
|
|
}
|
|
|
|
|
|
2013-12-28 09:10:00 +01:00
|
|
|
static struct raid_func {
|
2013-12-28 12:04:16 +01:00
|
|
|
const char *name;
|
|
|
|
|
void *p;
|
2013-12-28 09:10:00 +01:00
|
|
|
} RAID_FUNC[] = {
|
|
|
|
|
{ "int8", raid_par3_int8 },
|
|
|
|
|
{ "int8", raid_par4_int8 },
|
|
|
|
|
{ "int8", raid_par5_int8 },
|
|
|
|
|
{ "int8", raid_par6_int8 },
|
|
|
|
|
{ "int32", raid_par1_int32 },
|
|
|
|
|
{ "int64", raid_par1_int64 },
|
|
|
|
|
{ "int32", raid_par2_int32 },
|
|
|
|
|
{ "int64", raid_par2_int64 },
|
|
|
|
|
{ "int32", raid_parz_int32 },
|
|
|
|
|
{ "int64", raid_parz_int64 },
|
|
|
|
|
{ "int8", raid_rec1_int8 },
|
|
|
|
|
{ "int8", raid_rec2_int8 },
|
|
|
|
|
{ "int8", raid_recX_int8 },
|
|
|
|
|
|
2013-12-30 21:12:29 +01:00
|
|
|
#ifdef CONFIG_X86
|
2013-12-28 09:10:00 +01:00
|
|
|
{ "sse2", raid_par1_sse2 },
|
|
|
|
|
{ "sse2", raid_par2_sse2 },
|
|
|
|
|
{ "sse2", raid_parz_sse2 },
|
|
|
|
|
{ "ssse3", raid_par3_ssse3 },
|
|
|
|
|
{ "ssse3", raid_par4_ssse3 },
|
|
|
|
|
{ "ssse3", raid_par5_ssse3 },
|
|
|
|
|
{ "ssse3", raid_par6_ssse3 },
|
|
|
|
|
{ "ssse3", raid_rec1_ssse3 },
|
|
|
|
|
{ "ssse3", raid_rec2_ssse3 },
|
|
|
|
|
{ "ssse3", raid_recX_ssse3 },
|
|
|
|
|
#endif
|
|
|
|
|
|
2013-12-30 21:12:29 +01:00
|
|
|
#ifdef CONFIG_X86_64
|
2013-12-28 09:10:00 +01:00
|
|
|
{ "sse2e", raid_par2_sse2ext },
|
|
|
|
|
{ "sse2e", raid_parz_sse2ext },
|
|
|
|
|
{ "ssse3e", raid_par3_ssse3ext },
|
|
|
|
|
{ "ssse3e", raid_par4_ssse3ext },
|
|
|
|
|
{ "ssse3e", raid_par5_ssse3ext },
|
|
|
|
|
{ "ssse3e", raid_par6_ssse3ext },
|
|
|
|
|
#endif
|
|
|
|
|
{ 0, 0 }
|
|
|
|
|
};
|
|
|
|
|
|
2013-12-28 12:04:16 +01:00
|
|
|
static const char *raid_tag(void *func)
|
2013-12-28 09:10:00 +01:00
|
|
|
{
|
2013-12-28 12:04:16 +01:00
|
|
|
struct raid_func *i = RAID_FUNC;
|
2013-12-28 09:10:00 +01:00
|
|
|
while (i->name != 0) {
|
|
|
|
|
if (i->p == func)
|
|
|
|
|
return i->name;
|
|
|
|
|
++i;
|
|
|
|
|
}
|
|
|
|
|
return "unknown";
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-28 12:04:16 +01:00
|
|
|
const char *raid_par1_tag(void)
|
2013-12-28 09:10:00 +01:00
|
|
|
{
|
|
|
|
|
return raid_tag(raid_par_ptr[0]);
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-28 12:04:16 +01:00
|
|
|
const char *raid_par2_tag(void)
|
2013-12-28 09:10:00 +01:00
|
|
|
{
|
|
|
|
|
return raid_tag(raid_par_ptr[1]);
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-28 12:04:16 +01:00
|
|
|
const char *raid_parz_tag(void)
|
2013-12-28 09:10:00 +01:00
|
|
|
{
|
|
|
|
|
return raid_tag(raid_parz_ptr);
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-28 12:04:16 +01:00
|
|
|
const char *raid_par3_tag(void)
|
2013-12-28 09:10:00 +01:00
|
|
|
{
|
|
|
|
|
return raid_tag(raid_par_ptr[2]);
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-28 12:04:16 +01:00
|
|
|
const char *raid_par4_tag(void)
|
2013-12-28 09:10:00 +01:00
|
|
|
{
|
|
|
|
|
return raid_tag(raid_par_ptr[3]);
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-28 12:04:16 +01:00
|
|
|
const char *raid_par5_tag(void)
|
2013-12-28 09:10:00 +01:00
|
|
|
{
|
|
|
|
|
return raid_tag(raid_par_ptr[4]);
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-28 12:04:16 +01:00
|
|
|
const char *raid_par6_tag(void)
|
2013-12-28 09:10:00 +01:00
|
|
|
{
|
|
|
|
|
return raid_tag(raid_par_ptr[5]);
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-28 12:04:16 +01:00
|
|
|
const char *raid_rec1_tag(void)
|
2013-12-28 09:10:00 +01:00
|
|
|
{
|
|
|
|
|
return raid_tag(raid_rec_ptr[0]);
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-28 12:04:16 +01:00
|
|
|
const char *raid_rec2_tag(void)
|
2013-12-28 09:10:00 +01:00
|
|
|
{
|
|
|
|
|
return raid_tag(raid_rec_ptr[1]);
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-28 12:04:16 +01:00
|
|
|
const char *raid_recX_tag(void)
|
2013-12-28 09:10:00 +01:00
|
|
|
{
|
|
|
|
|
return raid_tag(raid_rec_ptr[2]);
|
|
|
|
|
}
|
|
|
|
|
|