Searched refs:nroots (Results 1 - 6 of 6) sorted by relevance

/linux-master/lib/reed_solomon/
H A Dencode_rs.c16 int nroots = rs->nroots; variable
24 pad = nn - nroots - len;
32 for (j = 1; j < nroots; j++) {
34 genpoly[nroots - j])];
38 memmove(&par[0], &par[1], sizeof(uint16_t) * (nroots - 1));
40 par[nroots - 1] = alpha_to[rs_modnn(rs,
43 par[nroots - 1] = 0;
H A Ddecode_rs.c17 int nroots = rs->nroots; variable
30 * arrays sized [nroots + 1]
32 uint16_t *lambda = rsc->buffers + RS_DECODE_LAMBDA * (nroots + 1);
33 uint16_t *syn = rsc->buffers + RS_DECODE_SYN * (nroots + 1);
34 uint16_t *b = rsc->buffers + RS_DECODE_B * (nroots + 1);
35 uint16_t *t = rsc->buffers + RS_DECODE_T * (nroots + 1);
36 uint16_t *omega = rsc->buffers + RS_DECODE_OMEGA * (nroots + 1);
37 uint16_t *root = rsc->buffers + RS_DECODE_ROOT * (nroots + 1);
38 uint16_t *reg = rsc->buffers + RS_DECODE_REG * (nroots
[all...]
H A Dtest_rslib.c41 int nroots; member in struct:etab
110 int nroots = rs->nroots; local
118 ws->c = kmalloc_array(2 * (nn + nroots),
125 ws->corr = ws->s + nroots;
127 ws->errlocs = kmalloc_array(nn + nroots, sizeof(int), GFP_KERNEL);
154 int nroots = rs->codec->nroots; local
157 int dlen = len - nroots;
169 memset(c + dlen, 0, nroots * sizeo
235 int nroots = rs->nroots; local
323 int nroots = rs->codec->nroots; local
370 int nroots = rs->codec->nroots; local
411 int nroots = rs->codec->nroots; local
[all...]
H A Dreed_solomon.c64 * @nroots: RS code generator polynomial degree (number of roots)
71 int fcr, int prim, int nroots, gfp_t gfp)
86 rs->nroots = nroots;
99 rs->genpoly = kmalloc_array(rs->nroots + 1, sizeof(uint16_t), gfp);
135 for (i = 0, root = fcr * prim; i < nroots; i++, root += prim) {
152 for (i = 0; i <= nroots; i++)
210 * @nroots: RS code generator polynomial degree (number of roots)
215 int prim, int nroots, gfp_t gfp)
228 if (nroots <
70 codec_init(int symsize, int gfpoly, int (*gffunc)(int), int fcr, int prim, int nroots, gfp_t gfp) argument
213 init_rs_internal(int symsize, int gfpoly, int (*gffunc)(int), int fcr, int prim, int nroots, gfp_t gfp) argument
288 init_rs_gfp(int symsize, int gfpoly, int fcr, int prim, int nroots, gfp_t gfp) argument
307 init_rs_non_canonical(int symsize, int (*gffunc)(int), int fcr, int prim, int nroots) argument
[all...]
/linux-master/include/linux/
H A Drslib.h24 * @nroots: Number of generator roots = number of parity symbols
39 int nroots; member in struct:rs_codec
82 int nroots, gfp_t gfp);
93 * @nroots: RS code generator polynomial degree (number of roots)
98 int prim, int nroots)
100 return init_rs_gfp(symsize, gfpoly, fcr, prim, nroots, GFP_KERNEL);
104 int fcr, int prim, int nroots);
97 init_rs(int symsize, int gfpoly, int fcr, int prim, int nroots) argument
/linux-master/lib/
H A Dbch.c1025 int i, err, nroots; local
1061 nroots = find_poly_roots(bch, 1, bch->elp, errloc);
1062 if (err != nroots)

Completed in 232 milliseconds