Searched refs:GF_N (Results 1 – 1 of 1) sorted by relevance
86 #define GF_N(_p) ((_p)->n) macro325 const unsigned int n = GF_N(bch); in modulo()338 const unsigned int n = GF_N(bch); in mod_s()378 GF_N(bch)-bch->a_log_tab[b])] : 0; in gf_div()447 const unsigned int n = GF_N(bch); in compute_error_locator_polynomial()725 l += (l & 1) ? GF_N(bch) : 0; in find_poly_deg4_roots()993 for (i = GF_N(bch)-k+1; i <= GF_N(bch); i++) { in chien_search()1001 roots[count++] = GF_N(bch)-i; in chien_search()1129 for (i = 0; i < GF_N(bch); i++) { in build_gf_tables()1139 bch->a_pow_tab[GF_N(bch)] = 1; in build_gf_tables()[all …]
Completed in 5 milliseconds