Lines Matching refs:j
373 int i, j, s; in compute_syndromes() local
392 for (j = 0; j < 2*t; j += 2) in compute_syndromes()
393 syn[j] ^= a_pow(bch, (j+1)*(i+s)); in compute_syndromes()
400 for (j = 0; j < t; j++) in compute_syndromes()
401 syn[2*j+1] = gf_sqr(bch, syn[j]); in compute_syndromes()
414 unsigned int i, j, tmp, l, pd = 1, d = syn[0]; in compute_error_locator_polynomial() local
435 for (j = 0; j <= pelp->deg; j++) { in compute_error_locator_polynomial()
436 if (pelp->c[j]) { in compute_error_locator_polynomial()
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()
453 for (j = 1; j <= elp->deg; j++) in compute_error_locator_polynomial()
454 d ^= gf_mul(bch, elp->c[j], syn[2*i+2-j]); in compute_error_locator_polynomial()
542 int i, j, k; in find_affine4_roots() local
546 j = a_log(bch, b); in find_affine4_roots()
554 (b ? bch->a_pow_tab[mod_s(bch, j)] : 0); in find_affine4_roots()
555 j++; in find_affine4_roots()
562 for (j = 8; j != 0; j >>= 1, mask ^= (mask << j)) { 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()
746 unsigned int i, j, *c = a->c; in gf_poly_mod() local
758 for (j = a->deg; j >= d; j--) { in gf_poly_mod()
759 if (c[j]) { in gf_poly_mod()
760 la = a_log(bch, c[j]); in gf_poly_mod()
761 p = j-d; in gf_poly_mod()
823 int i, j; in compute_trace_bk_mod() local
838 for (j = z->deg; j >= 0; j--) { in compute_trace_bk_mod()
839 out->c[j] ^= z->c[j]; in compute_trace_bk_mod()
840 z->c[2*j] = gf_sqr(bch, z->c[j]); in compute_trace_bk_mod()
841 z->c[2*j+1] = 0; in compute_trace_bk_mod()
941 unsigned int i, j, syn, syn0, count = 0; in chien_search() local
951 for (j = 1, syn = syn0; j <= p->deg; j++) { in chien_search()
952 m = bch->cache[j]; in chien_search()
954 syn ^= a_pow(bch, m+j*i); in chien_search()
1106 int i, j, b, d; in build_mod8_tables() local
1124 for (j = 0; j < ecclen; j++) { in build_mod8_tables()
1125 hi = (d < 31) ? g[j] << (d+1) : 0; in build_mod8_tables()
1126 lo = (j+1 < plen) ? in build_mod8_tables()
1127 g[j+1] >> (31-d) : 0; in build_mod8_tables()
1128 tab[j] ^= hi|lo; in build_mod8_tables()
1141 int i, j, r; in build_deg2_base() local
1146 for (j = 0, sum = 0; j < m; j++) in build_deg2_base()
1147 sum ^= a_pow(bch, i*(1 << j)); in build_deg2_base()
1194 unsigned int i, j, nbits, r, word, *roots; in compute_generator_polynomial() local
1211 for (j = 0, r = 2*i+1; j < m; j++) { in compute_generator_polynomial()
1224 for (j = g->deg; j > 0; j--) in compute_generator_polynomial()
1225 g->c[j] = gf_mul(bch, g->c[j], r)^g->c[j-1]; in compute_generator_polynomial()
1237 for (j = 0, word = 0; j < nbits; j++) { in compute_generator_polynomial()
1238 if (g->c[n-1-j]) in compute_generator_polynomial()
1239 word |= 1u << (31-j); in compute_generator_polynomial()