Searched refs:nroots (Results 1 - 4 of 4) sorted by relevance
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/reed_solomon/ |
H A D | encode_rs.c | 23 int nroots = rs->nroots; variable 31 pad = nn - nroots - len; 39 for (j = 1; j < nroots; j++) { 41 genpoly[nroots - j])]; 45 memmove(&par[0], &par[1], sizeof(uint16_t) * (nroots - 1)); 47 par[nroots - 1] = alpha_to[rs_modnn(rs, 50 par[nroots - 1] = 0;
|
H A D | decode_rs.c | 23 int nroots = rs->nroots; variable 31 * of nroots is 8. So the necessary stack size will be about 34 uint16_t lambda[nroots + 1], syn[nroots]; 35 uint16_t b[nroots + 1], t[nroots + 1], omega[nroots + 1]; 36 uint16_t root[nroots], reg[nroots [all...] |
H A D | reed_solomon.c | 61 * @nroots: RS code generator polynomial degree (number of roots) 67 int fcr, int prim, int nroots) 83 rs->nroots = nroots; 96 rs->genpoly = kmalloc(sizeof(uint16_t) * (rs->nroots + 1), GFP_KERNEL); 132 for (i = 0, root = fcr * prim; i < nroots; i++, root += prim) { 149 for (i = 0; i <= nroots; i++) 197 * @nroots: RS code generator polynomial degree (number of roots) 201 int prim, int nroots) 213 if (nroots < 66 rs_init(int symsize, int gfpoly, int (*gffunc)(int), int fcr, int prim, int nroots) argument 199 init_rs_internal(int symsize, int gfpoly, int (*gffunc)(int), int fcr, int prim, int nroots) argument 260 init_rs(int symsize, int gfpoly, int fcr, int prim, int nroots) argument 279 init_rs_non_canonical(int symsize, int (*gffunc)(int), int fcr, int prim, int nroots) argument [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/include/linux/ |
H A D | rslib.h | 32 * @nroots: Number of generator roots = number of parity symbols 47 int nroots; member in struct:rs_control 81 int nroots); 83 int fcr, int prim, int nroots);
|
Completed in 105 milliseconds