Lines Matching defs:GF_N
80 #define GF_N(_p) ((1 << (CONFIG_BCH_CONST_M))-1)
86 #define GF_N(_p) ((_p)->n)
325 const unsigned int n = GF_N(bch);
338 const unsigned int n = GF_N(bch);
378 GF_N(bch)-bch->a_log_tab[b])] : 0;
383 return bch->a_pow_tab[GF_N(bch)-bch->a_log_tab[a]];
398 return mod_s(bch, GF_N(bch)-bch->a_log_tab[x]);
447 const unsigned int n = GF_N(bch);
619 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+
640 u = a_pow(bch, l0+l2+2*(GF_N(bch)-l1));
657 roots[n++] = modulo(bch, 2*GF_N(bch)-l1-
659 roots[n++] = modulo(bch, 2*GF_N(bch)-l1-
725 l += (l & 1) ? GF_N(bch) : 0;
769 int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]);
993 for (i = GF_N(bch)-k+1; i <= GF_N(bch); i++) {
1001 roots[count++] = GF_N(bch)-i;
1129 for (i = 0; i < GF_N(bch); i++) {
1139 bch->a_pow_tab[GF_N(bch)] = 1;
1202 for (x = 0; (x <= GF_N(bch)) && remaining; x++) {
1263 for (i = 0; i < GF_N(bch); i++) {