Lines Matching refs:k
418 int k, pp = -1; in compute_error_locator_polynomial() local
431 k = 2*i-pp; in compute_error_locator_polynomial()
438 elp->c[j+k] ^= a_pow(bch, tmp+l); in compute_error_locator_polynomial()
442 tmp = pelp->deg+k; in compute_error_locator_polynomial()
470 int rem, c, r, p, k, param[BCH_MAX_M]; in solve_linear_system() local
472 k = 0; in solve_linear_system()
478 p = c-k; in solve_linear_system()
497 param[k++] = c; in solve_linear_system()
502 if (k > 0) { in solve_linear_system()
503 p = k; in solve_linear_system()
505 if ((r > m-1-k) && rows[r]) in solve_linear_system()
514 if (nsol != (1 << k)) in solve_linear_system()
520 for (c = 0; c < k; c++) in solve_linear_system()
542 int i, j, k; in find_affine4_roots() local
547 k = a_log(bch, a); in find_affine4_roots()
553 (a ? bch->a_pow_tab[mod_s(bch, k)] : 0)^ in find_affine4_roots()
556 k += 2; in find_affine4_roots()
563 for (k = 0; k < 16; k = (k+j+1) & ~j) { in find_affine4_roots()
564 t = ((rows[k] >> j)^rows[k+j]) & mask; in find_affine4_roots()
565 rows[k] ^= (t << j); in find_affine4_roots()
566 rows[k+j] ^= t; in find_affine4_roots()
818 static void compute_trace_bk_mod(struct bch_control *bch, int k, in compute_trace_bk_mod() argument
828 z->c[1] = bch->a_pow_tab[k]; in compute_trace_bk_mod()
855 dbg("Tr(a^%d.X) mod f = %s\n", k, gf_poly_str(out)); in compute_trace_bk_mod()
861 static void factor_polynomial(struct bch_control *bch, int k, struct gf_poly *f, in factor_polynomial() argument
876 compute_trace_bk_mod(bch, k, f, z, tk); in factor_polynomial()
897 static int find_poly_roots(struct bch_control *bch, unsigned int k, in find_poly_roots() argument
920 if (poly->deg && (k <= GF_M(bch))) { in find_poly_roots()
921 factor_polynomial(bch, k, poly, &f1, &f2); in find_poly_roots()
923 cnt += find_poly_roots(bch, k+1, f1, roots); in find_poly_roots()
925 cnt += find_poly_roots(bch, k+1, f2, roots+cnt); in find_poly_roots()
942 const unsigned int k = 8*len+bch->ecc_bits; in chien_search() local
949 for (i = GF_N(bch)-k+1; i <= GF_N(bch); i++) { in chien_search()
1079 const unsigned int k = 1 << deg(poly); in build_gf_tables() local
1082 if (k != (1u << GF_M(bch))) in build_gf_tables()
1092 if (x & k) in build_gf_tables()