genpoly 39 include/linux/rslib.h uint16_t *genpoly; genpoly 1181 lib/bch.c uint32_t *genpoly; genpoly 1185 lib/bch.c genpoly = bch_alloc(DIV_ROUND_UP(m*t+1, 32)*sizeof(*genpoly), &err); genpoly 1188 lib/bch.c kfree(genpoly); genpoly 1189 lib/bch.c genpoly = NULL; genpoly 1226 lib/bch.c genpoly[i++] = word; genpoly 1235 lib/bch.c return genpoly; genpoly 1263 lib/bch.c uint32_t *genpoly; genpoly 1336 lib/bch.c genpoly = compute_generator_polynomial(bch); genpoly 1337 lib/bch.c if (genpoly == NULL) genpoly 1340 lib/bch.c build_mod8_tables(bch, genpoly); genpoly 1341 lib/bch.c kfree(genpoly); genpoly 19 lib/reed_solomon/encode_rs.c uint16_t *genpoly = rs->genpoly; genpoly 34 lib/reed_solomon/encode_rs.c genpoly[nroots - j])]; genpoly 41 lib/reed_solomon/encode_rs.c fb + genpoly[0])]; genpoly 99 lib/reed_solomon/reed_solomon.c rs->genpoly = kmalloc_array(rs->nroots + 1, sizeof(uint16_t), gfp); genpoly 100 lib/reed_solomon/reed_solomon.c if(rs->genpoly == NULL) genpoly 134 lib/reed_solomon/reed_solomon.c rs->genpoly[0] = 1; genpoly 136 lib/reed_solomon/reed_solomon.c rs->genpoly[i + 1] = 1; genpoly 139 lib/reed_solomon/reed_solomon.c if (rs->genpoly[j] != 0) { genpoly 140 lib/reed_solomon/reed_solomon.c rs->genpoly[j] = rs->genpoly[j -1] ^ genpoly 142 lib/reed_solomon/reed_solomon.c rs->index_of[rs->genpoly[j]] + root)]; genpoly 144 lib/reed_solomon/reed_solomon.c rs->genpoly[j] = rs->genpoly[j - 1]; genpoly 147 lib/reed_solomon/reed_solomon.c rs->genpoly[0] = genpoly 149 lib/reed_solomon/reed_solomon.c rs->index_of[rs->genpoly[0]] + root)]; genpoly 153 lib/reed_solomon/reed_solomon.c rs->genpoly[i] = rs->index_of[rs->genpoly[i]]; genpoly 160 lib/reed_solomon/reed_solomon.c kfree(rs->genpoly); genpoly 190 lib/reed_solomon/reed_solomon.c kfree(cd->genpoly); genpoly 38 lib/reed_solomon/test_rslib.c int genpoly; genpoly 453 lib/reed_solomon/test_rslib.c rsc = init_rs(e->symsize, e->genpoly, e->fcs, e->prim, e->nroots);