120 	const int l = BCH_ECC_WORDS(bch)-1;  in encode_bch_unaligned()  local
123 		p = bch->mod8_tab + (l+1)*(((ecc[0] >> 24)^(*data++)) & 0xff);  in encode_bch_unaligned()
125 		for (i = 0; i < l; i++)  in encode_bch_unaligned()
128 		ecc[l] = (ecc[l] << 8)^(*p);  in encode_bch_unaligned()
187 	const unsigned int l = BCH_ECC_WORDS(bch)-1;  in encode_bch()  local
190 	uint32_t w, r[l+1];  in encode_bch()
192 	const uint32_t * const tab1 = tab0 + 256*(l+1);  in encode_bch()
193 	const uint32_t * const tab2 = tab1 + 256*(l+1);  in encode_bch()
194 	const uint32_t * const tab3 = tab2 + 256*(l+1);  in encode_bch()
234 		p0 = tab0 + (l+1)*((w >>  0) & 0xff);  in encode_bch()
235 		p1 = tab1 + (l+1)*((w >>  8) & 0xff);  in encode_bch()
236 		p2 = tab2 + (l+1)*((w >> 16) & 0xff);  in encode_bch()
237 		p3 = tab3 + (l+1)*((w >> 24) & 0xff);  in encode_bch()
239 		for (i = 0; i < l; i++)  in encode_bch()
242 		r[l] = p0[l]^p1[l]^p2[l]^p3[l];  in encode_bch()
381 	unsigned int i, j, tmp, l, pd = 1, d = syn[0];  in compute_error_locator_polynomial()  local
404 					l = a_log(bch, pelp->c[j]);  in compute_error_locator_polynomial()
405 					elp->c[j+k] ^= a_pow(bch, tmp+l);  in compute_error_locator_polynomial()
638 	int i, l, n = 0;  in find_poly_deg4_roots()  local
657 			l = a_log(bch, f);  in find_poly_deg4_roots()
658 			l += (l & 1) ? GF_N(bch) : 0;  in find_poly_deg4_roots()
659 			e = a_pow(bch, l/2);  in find_poly_deg4_roots()
667 			d = a_pow(bch, 2*l)^gf_mul(bch, b, f)^d;  in find_poly_deg4_roots()
702 	int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]);  in gf_poly_logrep()  local
706 		rep[i] = a->c[i] ? mod_s(bch, a_log(bch, a->c[i])+l) : -1;  in gf_poly_logrep()
1083 	const int l = BCH_ECC_WORDS(bch);  in build_mod8_tables()  local
1087 	memset(bch->mod8_tab, 0, 4*256*l*sizeof(*bch->mod8_tab));  in build_mod8_tables()
1093 			tab = bch->mod8_tab + (b*256+i)*l;  in build_mod8_tables()