Home
last modified time | relevance | path

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

/linux-6.12.1/lib/reed_solomon/
Dreed_solomon.c99 rs->genpoly = kmalloc_array(rs->nroots + 1, sizeof(uint16_t), gfp); in codec_init()
100 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()
142 rs->index_of[rs->genpoly[j]] + root)]; 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()
[all …]
Dencode_rs.c19 uint16_t *genpoly = rs->genpoly; variable
34 genpoly[nroots - j])];
41 fb + genpoly[0])];
Dtest_rslib.c38 int genpoly; member
453 rsc = init_rs(e->symsize, e->genpoly, e->fcs, e->prim, e->nroots); in run_exercise()
/linux-6.12.1/lib/
Dbch.c1196 uint32_t *genpoly; in compute_generator_polynomial() local
1200 genpoly = bch_alloc(DIV_ROUND_UP(m*t+1, 32)*sizeof(*genpoly), &err); in compute_generator_polynomial()
1203 kfree(genpoly); in compute_generator_polynomial()
1204 genpoly = NULL; in compute_generator_polynomial()
1241 genpoly[i++] = word; in compute_generator_polynomial()
1250 return genpoly; in compute_generator_polynomial()
1280 uint32_t *genpoly; in bch_init() local
1354 genpoly = compute_generator_polynomial(bch); in bch_init()
1355 if (genpoly == NULL) in bch_init()
1358 build_mod8_tables(bch, genpoly); in bch_init()
[all …]
/linux-6.12.1/include/linux/
Drslib.h38 uint16_t *genpoly; member