{
u32 mod;
- mod = do_div(offset, v->fec->rsn);
+ mod = do_div(offset, v->fec->rs_k);
return offset + mod * (v->fec->rounds << v->data_dev_block_bits);
}
struct dm_verity_fec_io *fio,
unsigned int i, unsigned int j)
{
- return &fio->bufs[i][j * v->fec->rsn];
+ return &fio->bufs[i][j * v->fec->rs_k];
}
/*
}
/* Decode an RS block using Reed-Solomon */
- res = decode_rs8(fio->rs, block, par_buf, v->fec->rsn,
+ res = decode_rs8(fio->rs, block, par_buf, v->fec->rs_k,
NULL, neras, fio->erasures, 0, NULL);
if (res < 0) {
r = res;
return -EINVAL;
/*
- * read each of the rsn data blocks that are part of the RS block, and
+ * read each of the rs_k data blocks that are part of the RS block, and
* interleave contents to available bufs
*/
- for (i = 0; i < v->fec->rsn; i++) {
- ileaved = fec_interleave(v, rsb * v->fec->rsn + i);
+ for (i = 0; i < v->fec->rs_k; i++) {
+ ileaved = fec_interleave(v, rsb * v->fec->rs_k + i);
/*
* target is the data block we want to correct, target_index is
- * the index of this block within the rsn RS blocks
+ * the index of this block within the rs_k RS blocks
*/
if (ileaved == target)
target_index = i;
unsigned int n;
fec_for_each_buffer(fio, n)
- memset(fio->bufs[n], 0, v->fec->rsn << DM_VERITY_FEC_BUF_RS_BITS);
+ memset(fio->bufs[n], 0, v->fec->rs_k << DM_VERITY_FEC_BUF_RS_BITS);
memset(fio->erasures, 0, sizeof(fio->erasures));
}
block = block - v->hash_start + v->data_blocks;
/*
- * For RS(M, N), the continuous FEC data is divided into blocks of N
- * bytes. Since block size may not be divisible by N, the last block
+ * For RS(n, k), the continuous FEC data is divided into blocks of k
+ * bytes. Since block size may not be divisible by k, the last block
* is zero padded when decoding.
*
- * Each byte of the block is covered by a different RS(M, N) code,
- * and each code is interleaved over N blocks to make it less likely
+ * Each byte of the block is covered by a different RS(n, k) code,
+ * and each code is interleaved over k blocks to make it less likely
* that bursty corruption will leave us in unrecoverable state.
*/
ti->error = "Missing " DM_VERITY_OPT_FEC_ROOTS;
return -EINVAL;
}
- f->rsn = DM_VERITY_FEC_RSM - f->roots;
+ f->rs_k = DM_VERITY_FEC_RS_N - f->roots;
if (!f->blocks) {
ti->error = "Missing " DM_VERITY_OPT_FEC_BLOCKS;
}
f->rounds = f->blocks;
- if (sector_div(f->rounds, f->rsn))
+ if (sector_div(f->rounds, f->rs_k))
f->rounds++;
/*
}
f->cache = kmem_cache_create("dm_verity_fec_buffers",
- f->rsn << DM_VERITY_FEC_BUF_RS_BITS,
+ f->rs_k << DM_VERITY_FEC_BUF_RS_BITS,
0, 0, NULL);
if (!f->cache) {
ti->error = "Cannot create FEC buffer cache";
#include "dm-verity.h"
#include <linux/rslib.h>
-/* Reed-Solomon(M, N) parameters */
-#define DM_VERITY_FEC_RSM 255
+/* Reed-Solomon(n, k) parameters */
+#define DM_VERITY_FEC_RS_N 255
#define DM_VERITY_FEC_MIN_ROOTS 2 /* RS(255, 253): ~0.8% space overhead */
#define DM_VERITY_FEC_MAX_ROOTS 24 /* RS(255, 231): ~10% space overhead */
sector_t blocks; /* number of blocks covered */
sector_t rounds; /* number of interleaving rounds */
sector_t hash_blocks; /* blocks covered after v->hash_start */
- unsigned char roots; /* number of parity bytes, M-N of RS(M, N) */
- unsigned char rsn; /* N of RS(M, N) */
+ unsigned char roots; /* parity bytes per RS codeword, n-k of RS(n, k) */
+ unsigned char rs_k; /* message bytes per RS codeword, k of RS(n, k) */
mempool_t fio_pool; /* mempool for dm_verity_fec_io */
mempool_t rs_pool; /* mempool for fio->rs */
mempool_t prealloc_pool; /* mempool for preallocated buffers */