Lines Matching refs:r

123 	int r = 32;  in fls()  local
129 r -= 16; in fls()
133 r -= 8; in fls()
137 r -= 4; in fls()
141 r -= 2; in fls()
145 r -= 1; in fls()
147 return r; in fls()
231 uint32_t w, r[l+1]; in encode_bch() local
242 memset(bch->ecc_buf, 0, sizeof(r)); in encode_bch()
259 memcpy(r, bch->ecc_buf, sizeof(r)); in encode_bch()
274 w = r[0]^cpu_to_be32(*pdata++); in encode_bch()
281 r[i] = r[i+1]^p0[i]^p1[i]^p2[i]^p3[i]; in encode_bch()
283 r[l] = p0[l]^p1[l]^p2[l]^p3[l]; in encode_bch()
285 memcpy(bch->ecc_buf, r, sizeof(r)); in encode_bch()
477 int rem, c, r, p, k, param[m]; in solve_linear_system() local
487 for (r = p; r < m; r++) { in solve_linear_system()
488 if (rows[r] & mask) { in solve_linear_system()
489 if (r != p) { in solve_linear_system()
490 tmp = rows[r]; in solve_linear_system()
491 rows[r] = rows[p]; in solve_linear_system()
494 rem = r+1; in solve_linear_system()
501 for (r = rem; r < m; r++) { in solve_linear_system()
502 if (rows[r] & mask) in solve_linear_system()
503 rows[r] ^= tmp; in solve_linear_system()
514 for (r = m-1; r >= 0; r--) { in solve_linear_system()
515 if ((r > m-1-k) && rows[r]) in solve_linear_system()
519 rows[r] = (p && (r == param[p-1])) ? in solve_linear_system()
520 p--, 1u << (m-r) : rows[r-p]; in solve_linear_system()
535 for (r = m-1; r >= 0; r--) { in solve_linear_system()
536 mask = rows[r] & (tmp|1); in solve_linear_system()
537 tmp |= parity(mask) << (m-r); in solve_linear_system()
604 unsigned int u, v, r; in find_poly_deg2_roots() local
620 r = 0; in find_poly_deg2_roots()
624 r ^= bch->xi_tab[i]; in find_poly_deg2_roots()
628 if ((gf_sqr(bch, r)^r) == u) { in find_poly_deg2_roots()
631 bch->a_log_tab[r]+l2); in find_poly_deg2_roots()
633 bch->a_log_tab[r^1]+l2); in find_poly_deg2_roots()
1155 int i, j, r; in build_deg2_base() local
1175 r = a_log(bch, y); in build_deg2_base()
1176 if (y && (r < m) && !xi[r]) { in build_deg2_base()
1177 bch->xi_tab[r] = x; in build_deg2_base()
1178 xi[r] = 1; in build_deg2_base()
1180 dbg("x%d = %x\n", r, x); in build_deg2_base()
1208 unsigned int i, j, nbits, r, word, *roots; in compute_generator_polynomial() local
1225 for (j = 0, r = 2*i+1; j < m; j++) { in compute_generator_polynomial()
1226 roots[r] = 1; in compute_generator_polynomial()
1227 r = mod_s(bch, 2*r); in compute_generator_polynomial()
1236 r = bch->a_pow_tab[i]; in compute_generator_polynomial()
1239 g->c[j] = gf_mul(bch, g->c[j], r)^g->c[j-1]; in compute_generator_polynomial()
1241 g->c[0] = gf_mul(bch, g->c[0], r); in compute_generator_polynomial()