diff options
| -rw-r--r-- | include/linux/rslib.h | 12 | ||||
| -rw-r--r-- | lib/reed_solomon/reed_solomon.c | 12 |
2 files changed, 12 insertions, 12 deletions
diff --git a/include/linux/rslib.h b/include/linux/rslib.h index 2aae7ef987eb..d7bc66931032 100644 --- a/include/linux/rslib.h +++ b/include/linux/rslib.h @@ -41,15 +41,15 @@ * @list: List entry for the rs control list */ struct rs_control { - int mm; - int nn; + int mm; + int nn; uint16_t *alpha_to; uint16_t *index_of; uint16_t *genpoly; - int nroots; - int fcr; - int prim; - int iprim; + int nroots; + int fcr; + int prim; + int iprim; int gfpoly; int (*gffunc)(int); int users; diff --git a/lib/reed_solomon/reed_solomon.c b/lib/reed_solomon/reed_solomon.c index f8ae1f7b3558..1ea750f8fa55 100644 --- a/lib/reed_solomon/reed_solomon.c +++ b/lib/reed_solomon/reed_solomon.c @@ -193,7 +193,7 @@ EXPORT_SYMBOL_GPL(free_rs); * @gffunc: pointer to function to generate the next field element, * or the multiplicative identity element if given 0. Used * instead of gfpoly if gfpoly is 0 - * @fcr: the first consecutive root of the rs code generator polynomial + * @fcr: the first consecutive root of the rs code generator polynomial * in index form * @prim: primitive element to generate polynomial roots * @nroots: RS code generator polynomial degree (number of roots) @@ -210,9 +210,9 @@ static struct rs_control *init_rs_internal(int symsize, int gfpoly, if (symsize < 1) return NULL; if (fcr < 0 || fcr >= (1<<symsize)) - return NULL; + return NULL; if (prim <= 0 || prim >= (1<<symsize)) - return NULL; + return NULL; if (nroots < 0 || nroots >= (1<<symsize)) return NULL; @@ -255,7 +255,7 @@ out: * @gfpoly: the extended Galois field generator polynomial coefficients, * with the 0th coefficient in the low order bit. The polynomial * must be primitive; - * @fcr: the first consecutive root of the rs code generator polynomial + * @fcr: the first consecutive root of the rs code generator polynomial * in index form * @prim: primitive element to generate polynomial roots * @nroots: RS code generator polynomial degree (number of roots) @@ -276,13 +276,13 @@ EXPORT_SYMBOL_GPL(init_rs_gfp); * @gffunc: pointer to function to generate the next field element, * or the multiplicative identity element if given 0. Used * instead of gfpoly if gfpoly is 0 - * @fcr: the first consecutive root of the rs code generator polynomial + * @fcr: the first consecutive root of the rs code generator polynomial * in index form * @prim: primitive element to generate polynomial roots * @nroots: RS code generator polynomial degree (number of roots) */ struct rs_control *init_rs_non_canonical(int symsize, int (*gffunc)(int), - int fcr, int prim, int nroots) + int fcr, int prim, int nroots) { return init_rs_internal(symsize, 0, gffunc, fcr, prim, nroots, GFP_KERNEL); |