Lines Matching refs:r
213 uint32_t w, r[BCH_ECC_MAX_WORDS]; in bch_encode() local
214 const size_t r_bytes = BCH_ECC_WORDS(bch) * sizeof(*r); in bch_encode()
221 if (WARN_ON(r_bytes > sizeof(r))) in bch_encode()
245 memcpy(r, bch->ecc_buf, r_bytes); in bch_encode()
266 w ^= r[0]; in bch_encode()
273 r[i] = r[i+1]^p0[i]^p1[i]^p2[i]^p3[i]; in bch_encode()
275 r[l] = p0[l]^p1[l]^p2[l]^p3[l]; in bch_encode()
277 memcpy(bch->ecc_buf, r, r_bytes); in bch_encode()
470 int rem, c, r, p, k, param[BCH_MAX_M]; in solve_linear_system() local
480 for (r = p; r < m; r++) { in solve_linear_system()
481 if (rows[r] & mask) { in solve_linear_system()
482 if (r != p) in solve_linear_system()
483 swap(rows[r], rows[p]); in solve_linear_system()
484 rem = r+1; in solve_linear_system()
491 for (r = rem; r < m; r++) { in solve_linear_system()
492 if (rows[r] & mask) in solve_linear_system()
493 rows[r] ^= tmp; in solve_linear_system()
504 for (r = m-1; r >= 0; r--) { in solve_linear_system()
505 if ((r > m-1-k) && rows[r]) in solve_linear_system()
509 rows[r] = (p && (r == param[p-1])) ? in solve_linear_system()
510 p--, 1u << (m-r) : rows[r-p]; in solve_linear_system()
525 for (r = m-1; r >= 0; r--) { in solve_linear_system()
526 mask = rows[r] & (tmp|1); in solve_linear_system()
527 tmp |= parity(mask) << (m-r); in solve_linear_system()
594 unsigned int u, v, r; in find_poly_deg2_roots() local
610 r = 0; in find_poly_deg2_roots()
614 r ^= bch->xi_tab[i]; in find_poly_deg2_roots()
618 if ((gf_sqr(bch, r)^r) == u) { in find_poly_deg2_roots()
621 bch->a_log_tab[r]+l2); in find_poly_deg2_roots()
623 bch->a_log_tab[r^1]+l2); in find_poly_deg2_roots()
1141 int i, j, r; in build_deg2_base() local
1161 r = a_log(bch, y); in build_deg2_base()
1162 if (y && (r < m) && !xi[r]) { in build_deg2_base()
1163 bch->xi_tab[r] = x; in build_deg2_base()
1164 xi[r] = 1; in build_deg2_base()
1166 dbg("x%d = %x\n", r, x); in build_deg2_base()
1194 unsigned int i, j, nbits, r, word, *roots; in compute_generator_polynomial() local
1211 for (j = 0, r = 2*i+1; j < m; j++) { in compute_generator_polynomial()
1212 roots[r] = 1; in compute_generator_polynomial()
1213 r = mod_s(bch, 2*r); in compute_generator_polynomial()
1222 r = bch->a_pow_tab[i]; in compute_generator_polynomial()
1225 g->c[j] = gf_mul(bch, g->c[j], r)^g->c[j-1]; in compute_generator_polynomial()
1227 g->c[0] = gf_mul(bch, g->c[0], r); in compute_generator_polynomial()