Searched refs:GF_N (Results 1 – 1 of 1) sorted by relevance
87 #define GF_N(_p) ((_p)->n) macro291 const unsigned int n = GF_N(bch); in modulo()304 const unsigned int n = GF_N(bch); in mod_s()344 GF_N(bch)-bch->a_log_tab[b])] : 0; in gf_div()413 const unsigned int n = GF_N(bch); in compute_error_locator_polynomial()688 l += (l & 1) ? GF_N(bch) : 0; in find_poly_deg4_roots()949 for (i = GF_N(bch)-k+1; i <= GF_N(bch); i++) { in chien_search()957 roots[count++] = GF_N(bch)-i; in chien_search()1085 for (i = 0; i < GF_N(bch); i++) { in build_gf_tables()1095 bch->a_pow_tab[GF_N(bch)] = 1; in build_gf_tables()[all …]