GF_N              268 lib/bch.c      	const unsigned int n = GF_N(bch);
GF_N              281 lib/bch.c      	const unsigned int n = GF_N(bch);
GF_N              321 lib/bch.c      					GF_N(bch)-bch->a_log_tab[b])] : 0;
GF_N              326 lib/bch.c      	return bch->a_pow_tab[GF_N(bch)-bch->a_log_tab[a]];
GF_N              341 lib/bch.c      	return mod_s(bch, GF_N(bch)-bch->a_log_tab[x]);
GF_N              390 lib/bch.c      	const unsigned int n = GF_N(bch);
GF_N              562 lib/bch.c      		roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+
GF_N              583 lib/bch.c      		u = a_pow(bch, l0+l2+2*(GF_N(bch)-l1));
GF_N              600 lib/bch.c      			roots[n++] = modulo(bch, 2*GF_N(bch)-l1-
GF_N              602 lib/bch.c      			roots[n++] = modulo(bch, 2*GF_N(bch)-l1-
GF_N              668 lib/bch.c      			l += (l & 1) ? GF_N(bch) : 0;
GF_N              712 lib/bch.c      	int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]);
GF_N              936 lib/bch.c      	for (i = GF_N(bch)-k+1; i <= GF_N(bch); i++) {
GF_N              944 lib/bch.c      			roots[count++] = GF_N(bch)-i;
GF_N             1070 lib/bch.c      	for (i = 0; i < GF_N(bch); i++) {
GF_N             1080 lib/bch.c      	bch->a_pow_tab[GF_N(bch)] = 1;
GF_N             1143 lib/bch.c      	for (x = 0; (x <= GF_N(bch)) && remaining; x++) {
GF_N             1204 lib/bch.c      	for (i = 0; i < GF_N(bch); i++) {