Lines Matching refs:l
135 const int l = BCH_ECC_WORDS(bch)-1; in bch_encode_unaligned() local
140 p = bch->mod8_tab + (l+1)*(((ecc[0] >> 24)^(tmp)) & 0xff); in bch_encode_unaligned()
142 for (i = 0; i < l; i++) in bch_encode_unaligned()
145 ecc[l] = (ecc[l] << 8)^(*p); in bch_encode_unaligned()
210 const unsigned int l = BCH_ECC_WORDS(bch)-1; in bch_encode() local
216 const uint32_t * const tab1 = tab0 + 256*(l+1); in bch_encode()
217 const uint32_t * const tab2 = tab1 + 256*(l+1); in bch_encode()
218 const uint32_t * const tab3 = tab2 + 256*(l+1); in bch_encode()
267 p0 = tab0 + (l+1)*((w >> 0) & 0xff); in bch_encode()
268 p1 = tab1 + (l+1)*((w >> 8) & 0xff); in bch_encode()
269 p2 = tab2 + (l+1)*((w >> 16) & 0xff); in bch_encode()
270 p3 = tab3 + (l+1)*((w >> 24) & 0xff); in bch_encode()
272 for (i = 0; i < l; i++) in bch_encode()
275 r[l] = p0[l]^p1[l]^p2[l]^p3[l]; in bch_encode()
414 unsigned int i, j, tmp, l, pd = 1, d = syn[0]; in compute_error_locator_polynomial() local
437 l = a_log(bch, pelp->c[j]); in compute_error_locator_polynomial()
438 elp->c[j+k] ^= a_pow(bch, tmp+l); in compute_error_locator_polynomial()
668 int i, l, n = 0; in find_poly_deg4_roots() local
687 l = a_log(bch, f); in find_poly_deg4_roots()
688 l += (l & 1) ? GF_N(bch) : 0; in find_poly_deg4_roots()
689 e = a_pow(bch, l/2); in find_poly_deg4_roots()
697 d = a_pow(bch, 2*l)^gf_mul(bch, b, f)^d; in find_poly_deg4_roots()
732 int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]); in gf_poly_logrep() local
736 rep[i] = a->c[i] ? mod_s(bch, a_log(bch, a->c[i])+l) : -1; in gf_poly_logrep()
1108 const int l = BCH_ECC_WORDS(bch); in build_mod8_tables() local
1112 memset(bch->mod8_tab, 0, 4*256*l*sizeof(*bch->mod8_tab)); in build_mod8_tables()
1118 tab = bch->mod8_tab + (b*256+i)*l; in build_mod8_tables()