Lines Matching refs:i
118 int i; in encode_bch_unaligned() local
125 for (i = 0; i < l; i++) in encode_bch_unaligned()
126 ecc[i] = ((ecc[i] << 8)|(ecc[i+1] >> 24))^(*p++); in encode_bch_unaligned()
139 unsigned int i, nwords = BCH_ECC_WORDS(bch)-1; in load_ecc8() local
141 for (i = 0; i < nwords; i++, src += 4) in load_ecc8()
142 dst[i] = (src[0] << 24)|(src[1] << 16)|(src[2] << 8)|src[3]; in load_ecc8()
155 unsigned int i, nwords = BCH_ECC_WORDS(bch)-1; in store_ecc8() local
157 for (i = 0; i < nwords; i++) { in store_ecc8()
158 *dst++ = (src[i] >> 24); in store_ecc8()
159 *dst++ = (src[i] >> 16) & 0xff; in store_ecc8()
160 *dst++ = (src[i] >> 8) & 0xff; in store_ecc8()
161 *dst++ = (src[i] >> 0) & 0xff; in store_ecc8()
188 unsigned int i, mlen; in encode_bch() local
239 for (i = 0; i < l; i++) in encode_bch()
240 r[i] = r[i+1]^p0[i]^p1[i]^p2[i]^p3[i]; in encode_bch()
319 static inline unsigned int a_pow(struct bch_control *bch, int i) in a_pow() argument
321 return bch->a_pow_tab[modulo(bch, i)]; in a_pow()
340 int i, j, s; in compute_syndromes() local
358 i = deg(poly); in compute_syndromes()
360 syn[j] ^= a_pow(bch, (j+1)*(i+s)); in compute_syndromes()
362 poly ^= (1 << i); in compute_syndromes()
381 unsigned int i, j, tmp, l, pd = 1, d = syn[0]; in compute_error_locator_polynomial() local
396 for (i = 0; (i < t) && (elp->deg <= t); i++) { in compute_error_locator_polynomial()
398 k = 2*i-pp; in compute_error_locator_polynomial()
414 pp = 2*i; in compute_error_locator_polynomial()
418 if (i < t-1) { in compute_error_locator_polynomial()
419 d = syn[2*i+2]; in compute_error_locator_polynomial()
421 d ^= gf_mul(bch, elp->c[j], syn[2*i+2-j]); in compute_error_locator_polynomial()
512 int i, j, k; in find_affine4_roots() local
521 for (i = 0; i < m; i++) { in find_affine4_roots()
522 rows[i+1] = bch->a_pow_tab[4*i]^ in find_affine4_roots()
563 int n = 0, i, l0, l1, l2; in find_poly_deg2_roots() local
583 i = deg(v); in find_poly_deg2_roots()
584 r ^= bch->xi_tab[i]; in find_poly_deg2_roots()
585 v ^= (1 << i); in find_poly_deg2_roots()
605 int i, n = 0; in find_poly_deg3_roots() local
623 for (i = 0; i < 4; i++) { in find_poly_deg3_roots()
624 if (tmp[i] != a2) in find_poly_deg3_roots()
625 roots[n++] = a_ilog(bch, tmp[i]); in find_poly_deg3_roots()
638 int i, l, n = 0; in find_poly_deg4_roots() local
686 for (i = 0; i < 4; i++) { in find_poly_deg4_roots()
688 f = a ? gf_inv(bch, roots[i]) : roots[i]; in find_poly_deg4_roots()
689 roots[i] = a_ilog(bch, f^e); 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
705 for (i = 0; i < d; i++) in gf_poly_logrep()
706 rep[i] = a->c[i] ? mod_s(bch, a_log(bch, a->c[i])+l) : -1; in gf_poly_logrep()
716 unsigned int i, j, *c = a->c; in gf_poly_mod() local
732 for (i = 0; i < d; i++, p++) { in gf_poly_mod()
733 m = rep[i]; in gf_poly_mod()
800 int i, j; in compute_trace_bk_mod() local
813 for (i = 0; i < m; i++) { in compute_trace_bk_mod()
823 if (i < m-1) { in compute_trace_bk_mod()
918 unsigned int i, j, syn, syn0, count = 0; in chien_search() local
926 for (i = GF_N(bch)-k+1; i <= GF_N(bch); i++) { in chien_search()
931 syn ^= a_pow(bch, m+j*i); in chien_search()
934 roots[count++] = GF_N(bch)-i; in chien_search()
992 int i, err, nroots; in decode_bch() local
1014 for (i = 0, sum = 0; i < (int)ecc_words; i++) { in decode_bch()
1015 bch->ecc_buf[i] ^= bch->ecc_buf2[i]; in decode_bch()
1016 sum |= bch->ecc_buf[i]; in decode_bch()
1035 for (i = 0; i < err; i++) { in decode_bch()
1036 if (errloc[i] >= nbits) { in decode_bch()
1040 errloc[i] = nbits-1-errloc[i]; in decode_bch()
1041 errloc[i] = (errloc[i] & ~7)|(7-(errloc[i] & 7)); in decode_bch()
1053 unsigned int i, x = 1; in build_gf_tables() local
1060 for (i = 0; i < GF_N(bch); i++) { in build_gf_tables()
1061 bch->a_pow_tab[i] = x; in build_gf_tables()
1062 bch->a_log_tab[x] = i; in build_gf_tables()
1063 if (i && (x == 1)) in build_gf_tables()
1081 int i, j, b, d; in build_mod8_tables() local
1089 for (i = 0; i < 256; i++) { in build_mod8_tables()
1093 tab = bch->mod8_tab + (b*256+i)*l; in build_mod8_tables()
1094 data = i << (8*b); in build_mod8_tables()
1116 int i, j, r; in build_deg2_base() local
1120 for (i = 0; i < m; i++) { in build_deg2_base()
1122 sum ^= a_pow(bch, i*(1 << j)); in build_deg2_base()
1125 ak = bch->a_pow_tab[i]; in build_deg2_base()
1135 for (i = 0; i < 2; i++) { in build_deg2_base()
1169 unsigned int i, j, nbits, r, word, *roots; in compute_generator_polynomial() local
1185 for (i = 0; i < t; i++) { in compute_generator_polynomial()
1186 for (j = 0, r = 2*i+1; j < m; j++) { in compute_generator_polynomial()
1194 for (i = 0; i < GF_N(bch); i++) { in compute_generator_polynomial()
1195 if (roots[i]) { in compute_generator_polynomial()
1197 r = bch->a_pow_tab[i]; in compute_generator_polynomial()
1208 i = 0; in compute_generator_polynomial()
1216 genpoly[i++] = word; in compute_generator_polynomial()
1252 unsigned int i, words; in init_bch() local
1309 for (i = 0; i < ARRAY_SIZE(bch->poly_2t); i++) in init_bch()
1310 bch->poly_2t[i] = bch_alloc(GF_POLY_SZ(2*t), &err); in init_bch()
1345 unsigned int i; in free_bch() local
1358 for (i = 0; i < ARRAY_SIZE(bch->poly_2t); i++) in free_bch()
1359 kfree(bch->poly_2t[i]); in free_bch()