385 	int k, pp = -1;  in compute_error_locator_polynomial()  local
398 			k = 2*i-pp;  in compute_error_locator_polynomial()
405 					elp->c[j+k] ^= a_pow(bch, tmp+l);  in compute_error_locator_polynomial()
409 			tmp = pelp->deg+k;  in compute_error_locator_polynomial()
437 	int rem, c, r, p, k, param[m];  in solve_linear_system()  local
439 	k = 0;  in solve_linear_system()
445 		p = c-k;  in solve_linear_system()
467 			param[k++] = c;  in solve_linear_system()
472 	if (k > 0) {  in solve_linear_system()
473 		p = k;  in solve_linear_system()
475 			if ((r > m-1-k) && rows[r])  in solve_linear_system()
484 	if (nsol != (1 << k))  in solve_linear_system()
490 		for (c = 0; c < k; c++)  in solve_linear_system()
512 	int i, j, k;  in find_affine4_roots()  local
517 	k = a_log(bch, a);  in find_affine4_roots()
523 			(a ? bch->a_pow_tab[mod_s(bch, k)] : 0)^  in find_affine4_roots()
526 		k += 2;  in find_affine4_roots()
533 		for (k = 0; k < 16; k = (k+j+1) & ~j) {  in find_affine4_roots()
534 			t = ((rows[k] >> j)^rows[k+j]) & mask;  in find_affine4_roots()
535 			rows[k] ^= (t << j);  in find_affine4_roots()
536 			rows[k+j] ^= t;  in find_affine4_roots()
795 static void compute_trace_bk_mod(struct bch_control *bch, int k,  in compute_trace_bk_mod()  argument
805 	z->c[1] = bch->a_pow_tab[k];  in compute_trace_bk_mod()
832 	dbg("Tr(a^%d.X) mod f = %s\n", k, gf_poly_str(out));  in compute_trace_bk_mod()
838 static void factor_polynomial(struct bch_control *bch, int k, struct gf_poly *f,  in factor_polynomial()  argument
853 	compute_trace_bk_mod(bch, k, f, z, tk);  in factor_polynomial()
874 static int find_poly_roots(struct bch_control *bch, unsigned int k,  in find_poly_roots()  argument
897 		if (poly->deg && (k <= GF_M(bch))) {  in find_poly_roots()
898 			factor_polynomial(bch, k, poly, &f1, &f2);  in find_poly_roots()
900 				cnt += find_poly_roots(bch, k+1, f1, roots);  in find_poly_roots()
902 				cnt += find_poly_roots(bch, k+1, f2, roots+cnt);  in find_poly_roots()
919 	const unsigned int k = 8*len+bch->ecc_bits;  in chien_search()  local
926 	for (i = GF_N(bch)-k+1; i <= GF_N(bch); i++) {  in chien_search()
1054 	const unsigned int k = 1 << deg(poly);  in build_gf_tables()  local
1057 	if (k != (1u << GF_M(bch)))  in build_gf_tables()
1067 		if (x & k)  in build_gf_tables()