Searched refs:GF_N (Results 1 – 1 of 1) sorted by relevance
80 #define GF_N(_p) ((1 << (CONFIG_BCH_CONST_M))-1) macro86 #define GF_N(_p) ((_p)->n) macro268 const unsigned int n = GF_N(bch); in modulo()281 const unsigned int n = GF_N(bch); in mod_s()321 GF_N(bch)-bch->a_log_tab[b])] : 0; in gf_div()326 return bch->a_pow_tab[GF_N(bch)-bch->a_log_tab[a]]; in gf_inv()341 return mod_s(bch, GF_N(bch)-bch->a_log_tab[x]); in a_ilog()390 const unsigned int n = GF_N(bch); in compute_error_locator_polynomial()562 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots()583 u = a_pow(bch, l0+l2+2*(GF_N(bch)-l1)); in find_poly_deg2_roots()[all …]
