• Home
  • Raw
  • Download

Lines Matching refs:n

86 #define GF_N(_p)               ((_p)->n)
268 const unsigned int n = GF_N(bch); in modulo() local
269 while (v >= n) { in modulo()
270 v -= n; in modulo()
271 v = (v & n) + (v >> GF_M(bch)); in modulo()
281 const unsigned int n = GF_N(bch); in mod_s() local
282 return (v < n) ? v : v-n; in mod_s()
390 const unsigned int n = GF_N(bch); in compute_error_locator_polynomial() local
411 tmp = a_log(bch, d)+n-a_log(bch, pd); in compute_error_locator_polynomial()
558 int n = 0; in find_poly_deg1_roots() local
562 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots()
564 return n; in find_poly_deg1_roots()
573 int n = 0, i, l0, l1, l2; in find_poly_deg2_roots() local
600 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
602 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
606 return n; in find_poly_deg2_roots()
615 int i, n = 0; in find_poly_deg3_roots() local
635 roots[n++] = a_ilog(bch, tmp[i]); in find_poly_deg3_roots()
639 return n; in find_poly_deg3_roots()
648 int i, l, n = 0; in find_poly_deg4_roots() local
701 n = 4; in find_poly_deg4_roots()
703 return n; in find_poly_deg4_roots()
1006 if (8*len > (bch->n-bch->ecc_bits)) in decode_bch()
1178 int n, err = 0; in compute_generator_polynomial() local
1184 roots = bch_alloc((bch->n+1)*sizeof(*roots), &err); in compute_generator_polynomial()
1194 memset(roots , 0, (bch->n+1)*sizeof(*roots)); in compute_generator_polynomial()
1217 n = g->deg+1; in compute_generator_polynomial()
1220 while (n > 0) { in compute_generator_polynomial()
1221 nbits = (n > 32) ? 32 : n; in compute_generator_polynomial()
1223 if (g->c[n-1-j]) in compute_generator_polynomial()
1227 n -= nbits; in compute_generator_polynomial()
1312 bch->n = (1 << m)-1; in init_bch()
1315 bch->a_pow_tab = bch_alloc((1+bch->n)*sizeof(*bch->a_pow_tab), &err); in init_bch()
1316 bch->a_log_tab = bch_alloc((1+bch->n)*sizeof(*bch->a_log_tab), &err); in init_bch()