Lines Matching refs:n
84 #define GF_N(_p) ((_p)->n)
258 const unsigned int n = GF_N(bch); in modulo() local
259 while (v >= n) { in modulo()
260 v -= n; in modulo()
261 v = (v & n) + (v >> GF_M(bch)); in modulo()
271 const unsigned int n = GF_N(bch); in mod_s() local
272 return (v < n) ? v : v-n; in mod_s()
380 const unsigned int n = GF_N(bch); in compute_error_locator_polynomial() local
401 tmp = a_log(bch, d)+n-a_log(bch, pd); in compute_error_locator_polynomial()
548 int n = 0; in find_poly_deg1_roots() local
552 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots()
554 return n; in find_poly_deg1_roots()
563 int n = 0, i, l0, l1, l2; in find_poly_deg2_roots() local
590 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
592 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
596 return n; in find_poly_deg2_roots()
605 int i, n = 0; in find_poly_deg3_roots() local
625 roots[n++] = a_ilog(bch, tmp[i]); in find_poly_deg3_roots()
629 return n; in find_poly_deg3_roots()
638 int i, l, n = 0; in find_poly_deg4_roots() local
691 n = 4; in find_poly_deg4_roots()
693 return n; in find_poly_deg4_roots()
996 if (8*len > (bch->n-bch->ecc_bits)) in decode_bch()
1168 int n, err = 0; in compute_generator_polynomial() local
1174 roots = bch_alloc((bch->n+1)*sizeof(*roots), &err); in compute_generator_polynomial()
1184 memset(roots , 0, (bch->n+1)*sizeof(*roots)); in compute_generator_polynomial()
1207 n = g->deg+1; in compute_generator_polynomial()
1210 while (n > 0) { in compute_generator_polynomial()
1211 nbits = (n > 32) ? 32 : n; in compute_generator_polynomial()
1213 if (g->c[n-1-j]) in compute_generator_polynomial()
1217 n -= nbits; in compute_generator_polynomial()
1296 bch->n = (1 << m)-1; in init_bch()
1299 bch->a_pow_tab = bch_alloc((1+bch->n)*sizeof(*bch->a_pow_tab), &err); in init_bch()
1300 bch->a_log_tab = bch_alloc((1+bch->n)*sizeof(*bch->a_log_tab), &err); in init_bch()