lib/bch.c

1085

for (i = 0; i < GF_N(bch); i++) {

lib/bch.c

1095

bch->a_pow_tab[GF_N(bch)] = 1;

lib/bch.c

1158

for (x = 0; (x <= GF_N(bch)) && remaining; x++) {

lib/bch.c

1219

for (i = 0; i < GF_N(bch); i++) {

lib/bch.c

291

const unsigned int n = GF_N(bch);

lib/bch.c

304

const unsigned int n = GF_N(bch);

lib/bch.c

344

GF_N(bch)-bch->a_log_tab[b])] : 0;

lib/bch.c

349

return bch->a_pow_tab[GF_N(bch)-bch->a_log_tab[a]];

lib/bch.c

364

return mod_s(bch, GF_N(bch)-bch->a_log_tab[x]);

lib/bch.c

413

const unsigned int n = GF_N(bch);

lib/bch.c

582

roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+

lib/bch.c

603

u = a_pow(bch, l0+l2+2*(GF_N(bch)-l1));

lib/bch.c

620

roots[n++] = modulo(bch, 2*GF_N(bch)-l1-

lib/bch.c

622

roots[n++] = modulo(bch, 2*GF_N(bch)-l1-

lib/bch.c

688

l += (l & 1) ? GF_N(bch) : 0;

lib/bch.c

732

int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]);

lib/bch.c

949

for (i = GF_N(bch)-k+1; i <= GF_N(bch); i++) {

lib/bch.c

957

roots[count++] = GF_N(bch)-i;