Lines Matching defs:GF_N
81 #define GF_N(_p) ((1 << (CONFIG_BCH_CONST_M))-1)
87 #define GF_N(_p) ((_p)->n)
291 const unsigned int n = GF_N(bch);
304 const unsigned int n = GF_N(bch);
344 GF_N(bch)-bch->a_log_tab[b])] : 0;
349 return bch->a_pow_tab[GF_N(bch)-bch->a_log_tab[a]];
364 return mod_s(bch, GF_N(bch)-bch->a_log_tab[x]);
413 const unsigned int n = GF_N(bch);
585 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+
606 u = a_pow(bch, l0+l2+2*(GF_N(bch)-l1));
623 roots[n++] = modulo(bch, 2*GF_N(bch)-l1-
625 roots[n++] = modulo(bch, 2*GF_N(bch)-l1-
691 l += (l & 1) ? GF_N(bch) : 0;
735 int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]);
959 for (i = GF_N(bch)-k+1; i <= GF_N(bch); i++) {
967 roots[count++] = GF_N(bch)-i;
1095 for (i = 0; i < GF_N(bch); i++) {
1105 bch->a_pow_tab[GF_N(bch)] = 1;
1168 for (x = 0; (x <= GF_N(bch)) && remaining; x++) {
1229 for (i = 0; i < GF_N(bch); i++) {