• Home
  • Raw
  • Download

Lines Matching refs:r

247 	uint32_t w, r[BCH_ECC_MAX_WORDS];  in bch_encode()  local
248 const size_t r_bytes = BCH_ECC_WORDS(bch) * sizeof(*r); in bch_encode()
255 if (WARN_ON(r_bytes > sizeof(r))) in bch_encode()
279 memcpy(r, bch->ecc_buf, r_bytes); in bch_encode()
300 w ^= r[0]; in bch_encode()
307 r[i] = r[i+1]^p0[i]^p1[i]^p2[i]^p3[i]; in bch_encode()
309 r[l] = p0[l]^p1[l]^p2[l]^p3[l]; in bch_encode()
311 memcpy(bch->ecc_buf, r, r_bytes); in bch_encode()
504 int rem, c, r, p, k, param[BCH_MAX_M]; in solve_linear_system() local
514 for (r = p; r < m; r++) { in solve_linear_system()
515 if (rows[r] & mask) { in solve_linear_system()
516 if (r != p) { in solve_linear_system()
517 tmp = rows[r]; in solve_linear_system()
518 rows[r] = rows[p]; in solve_linear_system()
521 rem = r+1; in solve_linear_system()
528 for (r = rem; r < m; r++) { in solve_linear_system()
529 if (rows[r] & mask) in solve_linear_system()
530 rows[r] ^= tmp; in solve_linear_system()
541 for (r = m-1; r >= 0; r--) { in solve_linear_system()
542 if ((r > m-1-k) && rows[r]) in solve_linear_system()
546 rows[r] = (p && (r == param[p-1])) ? in solve_linear_system()
547 p--, 1u << (m-r) : rows[r-p]; in solve_linear_system()
562 for (r = m-1; r >= 0; r--) { in solve_linear_system()
563 mask = rows[r] & (tmp|1); in solve_linear_system()
564 tmp |= parity(mask) << (m-r); in solve_linear_system()
631 unsigned int u, v, r; in find_poly_deg2_roots() local
647 r = 0; in find_poly_deg2_roots()
651 r ^= bch->xi_tab[i]; in find_poly_deg2_roots()
655 if ((gf_sqr(bch, r)^r) == u) { in find_poly_deg2_roots()
658 bch->a_log_tab[r]+l2); in find_poly_deg2_roots()
660 bch->a_log_tab[r^1]+l2); in find_poly_deg2_roots()
1185 int i, j, r; in build_deg2_base() local
1205 r = a_log(bch, y); in build_deg2_base()
1206 if (y && (r < m) && !xi[r]) { in build_deg2_base()
1207 bch->xi_tab[r] = x; in build_deg2_base()
1208 xi[r] = 1; in build_deg2_base()
1210 dbg("x%d = %x\n", r, x); in build_deg2_base()
1238 unsigned int i, j, nbits, r, word, *roots; in compute_generator_polynomial() local
1255 for (j = 0, r = 2*i+1; j < m; j++) { in compute_generator_polynomial()
1256 roots[r] = 1; in compute_generator_polynomial()
1257 r = mod_s(bch, 2*r); in compute_generator_polynomial()
1266 r = bch->a_pow_tab[i]; in compute_generator_polynomial()
1269 g->c[j] = gf_mul(bch, g->c[j], r)^g->c[j-1]; in compute_generator_polynomial()
1271 g->c[0] = gf_mul(bch, g->c[0], r); in compute_generator_polynomial()