Lines Matching refs:GF_N
87 #define GF_N(_p) ((1 << (CONFIG_BCH_CONST_M))-1) macro
91 #define GF_N(_p) ((_p)->n) macro
297 const unsigned int n = GF_N(bch); in modulo()
310 const unsigned int n = GF_N(bch); in mod_s()
350 GF_N(bch)-bch->a_log_tab[b])] : 0; in gf_div()
355 return bch->a_pow_tab[GF_N(bch)-bch->a_log_tab[a]]; in gf_inv()
370 return mod_s(bch, GF_N(bch)-bch->a_log_tab[x]); in a_ilog()
419 const unsigned int n = GF_N(bch); in compute_error_locator_polynomial()
591 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots()
612 u = a_pow(bch, l0+l2+2*(GF_N(bch)-l1)); in find_poly_deg2_roots()
629 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
631 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
697 l += (l & 1) ? GF_N(bch) : 0; in find_poly_deg4_roots()
741 int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]); in gf_poly_logrep()
965 for (i = GF_N(bch)-k+1; i <= GF_N(bch); i++) { in chien_search()
973 roots[count++] = GF_N(bch)-i; in chien_search()
1098 for (i = 0; i < GF_N(bch); i++) { in build_gf_tables()
1108 bch->a_pow_tab[GF_N(bch)] = 1; in build_gf_tables()
1171 for (x = 0; (x <= GF_N(bch)) && remaining; x++) { in build_deg2_base()
1232 for (i = 0; i < GF_N(bch); i++) { in compute_generator_polynomial()