350 	int i, j, s;  in compute_syndromes()  local
369 			for (j = 0; j < 2*t; j += 2)  in compute_syndromes()
370 				syn[j] ^= a_pow(bch, (j+1)*(i+s));  in compute_syndromes()
377 	for (j = 0; j < t; j++)  in compute_syndromes()
378 		syn[2*j+1] = gf_sqr(bch, syn[j]);  in compute_syndromes()
391 	unsigned int i, j, tmp, l, pd = 1, d = syn[0];  in compute_error_locator_polynomial()  local
412 			for (j = 0; j <= pelp->deg; j++) {  in compute_error_locator_polynomial()
413 				if (pelp->c[j]) {  in compute_error_locator_polynomial()
414 					l = a_log(bch, pelp->c[j]);  in compute_error_locator_polynomial()
415 					elp->c[j+k] ^= a_pow(bch, tmp+l);  in compute_error_locator_polynomial()
430 			for (j = 1; j <= elp->deg; j++)  in compute_error_locator_polynomial()
431 				d ^= gf_mul(bch, elp->c[j], syn[2*i+2-j]);  in compute_error_locator_polynomial()
522 	int i, j, k;  in find_affine4_roots()  local
526 	j = a_log(bch, b);  in find_affine4_roots()
534 			(b ? bch->a_pow_tab[mod_s(bch, j)] : 0);  in find_affine4_roots()
535 		j++;  in find_affine4_roots()
542 	for (j = 8; j != 0; j >>= 1, mask ^= (mask << j)) {  in find_affine4_roots()
543 		for (k = 0; k < 16; k = (k+j+1) & ~j) {  in find_affine4_roots()
544 			t = ((rows[k] >> j)^rows[k+j]) & mask;  in find_affine4_roots()
545 			rows[k] ^= (t << j);  in find_affine4_roots()
546 			rows[k+j] ^= t;  in find_affine4_roots()
726 	unsigned int i, j, *c = a->c;  in gf_poly_mod()  local
738 	for (j = a->deg; j >= d; j--) {  in gf_poly_mod()
739 		if (c[j]) {  in gf_poly_mod()
740 			la = a_log(bch, c[j]);  in gf_poly_mod()
741 			p = j-d;  in gf_poly_mod()
810 	int i, j;  in compute_trace_bk_mod()  local
825 		for (j = z->deg; j >= 0; j--) {  in compute_trace_bk_mod()
826 			out->c[j] ^= z->c[j];  in compute_trace_bk_mod()
827 			z->c[2*j] = gf_sqr(bch, z->c[j]);  in compute_trace_bk_mod()
828 			z->c[2*j+1] = 0;  in compute_trace_bk_mod()
928 	unsigned int i, j, syn, syn0, count = 0;  in chien_search()  local
938 		for (j = 1, syn = syn0; j <= p->deg; j++) {  in chien_search()
939 			m = bch->cache[j];  in chien_search()
941 				syn ^= a_pow(bch, m+j*i);  in chien_search()
1091 	int i, j, b, d;  in build_mod8_tables()  local
1109 				for (j = 0; j < ecclen; j++) {  in build_mod8_tables()
1110 					hi = (d < 31) ? g[j] << (d+1) : 0;  in build_mod8_tables()
1111 					lo = (j+1 < plen) ?  in build_mod8_tables()
1112 						g[j+1] >> (31-d) : 0;  in build_mod8_tables()
1113 					tab[j] ^= hi|lo;  in build_mod8_tables()
1126 	int i, j, r;  in build_deg2_base()  local
1131 		for (j = 0, sum = 0; j < m; j++)  in build_deg2_base()
1132 			sum ^= a_pow(bch, i*(1 << j));  in build_deg2_base()
1179 	unsigned int i, j, nbits, r, word, *roots;  in compute_generator_polynomial()  local
1196 		for (j = 0, r = 2*i+1; j < m; j++) {  in compute_generator_polynomial()
1209 			for (j = g->deg; j > 0; j--)  in compute_generator_polynomial()
1210 				g->c[j] = gf_mul(bch, g->c[j], r)^g->c[j-1];  in compute_generator_polynomial()
1222 		for (j = 0, word = 0; j < nbits; j++) {  in compute_generator_polynomial()
1223 			if (g->c[n-1-j])  in compute_generator_polynomial()
1224 				word |= 1u << (31-j);  in compute_generator_polynomial()