GF_N
for (i = 0; i < GF_N(bch); i++) {
bch->a_pow_tab[GF_N(bch)] = 1;
for (x = 0; (x <= GF_N(bch)) && remaining; x++) {
for (i = 0; i < GF_N(bch); i++) {
const unsigned int n = GF_N(bch);
const unsigned int n = GF_N(bch);
GF_N(bch)-bch->a_log_tab[b])] : 0;
return bch->a_pow_tab[GF_N(bch)-bch->a_log_tab[a]];
return mod_s(bch, GF_N(bch)-bch->a_log_tab[x]);
const unsigned int n = GF_N(bch);
roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+
u = a_pow(bch, l0+l2+2*(GF_N(bch)-l1));
roots[n++] = modulo(bch, 2*GF_N(bch)-l1-
roots[n++] = modulo(bch, 2*GF_N(bch)-l1-
l += (l & 1) ? GF_N(bch) : 0;
int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]);
for (i = GF_N(bch)-k+1; i <= GF_N(bch); i++) {
roots[count++] = GF_N(bch)-i;