Home
last modified time | relevance | path

Searched refs:genpoly (Results 1 – 5 of 5) sorted by relevance

/linux/lib/reed_solomon/
A Dreed_solomon.c100 if(rs->genpoly == NULL) in codec_init()
134 rs->genpoly[0] = 1; in codec_init()
136 rs->genpoly[i + 1] = 1; in codec_init()
139 if (rs->genpoly[j] != 0) { in codec_init()
140 rs->genpoly[j] = rs->genpoly[j -1] ^ in codec_init()
144 rs->genpoly[j] = rs->genpoly[j - 1]; in codec_init()
147 rs->genpoly[0] = in codec_init()
149 rs->index_of[rs->genpoly[0]] + root)]; in codec_init()
153 rs->genpoly[i] = rs->index_of[rs->genpoly[i]]; in codec_init()
160 kfree(rs->genpoly); in codec_init()
[all …]
A Dencode_rs.c19 uint16_t *genpoly = rs->genpoly; variable
34 genpoly[nroots - j])];
41 fb + genpoly[0])];
A Dtest_rslib.c38 int genpoly; member
453 rsc = init_rs(e->symsize, e->genpoly, e->fcs, e->prim, e->nroots); in run_exercise()
/linux/lib/
A Dbch.c1240 uint32_t *genpoly; in compute_generator_polynomial() local
1244 genpoly = bch_alloc(DIV_ROUND_UP(m*t+1, 32)*sizeof(*genpoly), &err); in compute_generator_polynomial()
1247 kfree(genpoly); in compute_generator_polynomial()
1248 genpoly = NULL; in compute_generator_polynomial()
1285 genpoly[i++] = word; in compute_generator_polynomial()
1294 return genpoly; in compute_generator_polynomial()
1324 uint32_t *genpoly; in bch_init() local
1398 genpoly = compute_generator_polynomial(bch); in bch_init()
1399 if (genpoly == NULL) in bch_init()
1402 build_mod8_tables(bch, genpoly); in bch_init()
[all …]
/linux/include/linux/
A Drslib.h39 uint16_t *genpoly; member

Completed in 12 milliseconds