84 #define GF_M(_p)               ((_p)->m)
195 	unsigned long m;  in encode_bch()  local
215 	m = ((unsigned long)data) & 3;  in encode_bch()
216 	if (m) {  in encode_bch()
217 		mlen = (len < (4-m)) ? len : 4-m;  in encode_bch()
351 	unsigned int m;  in compute_syndromes()  local
358 	m = ((unsigned int)s) & 31;  in compute_syndromes()
359 	if (m)  in compute_syndromes()
360 		ecc[s/32] &= ~((1u << (32-m))-1);  in compute_syndromes()
445 	const int m = GF_M(bch);  in solve_linear_system()  local
450 	mask = 1 << m;  in solve_linear_system()
453 	for (c = 0; c < m; c++) {  in solve_linear_system()
457 		for (r = p; r < m; r++) {  in solve_linear_system()
471 			for (r = rem; r < m; r++) {  in solve_linear_system()
484 		for (r = m-1; r >= 0; r--) {  in solve_linear_system()
485 			if ((r > m-1-k) && rows[r])  in solve_linear_system()
490 				p--, 1u << (m-r) : rows[r-p];  in solve_linear_system()
505 		for (r = m-1; r >= 0; r--) {  in solve_linear_system()
507 			tmp |= parity(mask) << (m-r);  in solve_linear_system()
523 	const int m = GF_M(bch);  in find_affine4_roots()  local
531 	for (i = 0; i < m; i++) {  in find_affine4_roots()
725 	int la, p, m;  in gf_poly_mod()  local
743 				m = rep[i];  in gf_poly_mod()
744 				if (m >= 0)  in gf_poly_mod()
746 								     m+la)];  in gf_poly_mod()
809 	const int m = GF_M(bch);  in compute_trace_bk_mod()  local
823 	for (i = 0; i < m; i++) {  in compute_trace_bk_mod()
833 		if (i < m-1) {  in compute_trace_bk_mod()
927 	int m;  in chien_search()  local
939 			m = bch->cache[j];  in chien_search()
940 			if (m >= 0)  in chien_search()
941 				syn ^= a_pow(bch, m+j*i);  in chien_search()
1125 	const int m = GF_M(bch);  in build_deg2_base()  local
1130 	for (i = 0; i < m; i++) {  in build_deg2_base()
1131 		for (j = 0, sum = 0; j < m; j++)  in build_deg2_base()
1140 	remaining = m;  in build_deg2_base()
1147 			if (y && (r < m) && !xi[r]) {  in build_deg2_base()
1176 	const unsigned int m = GF_M(bch);  in compute_generator_polynomial()  local
1183 	g = bch_alloc(GF_POLY_SZ(m*t), &err);  in compute_generator_polynomial()
1185 	genpoly = bch_alloc(DIV_ROUND_UP(m*t+1, 32)*sizeof(*genpoly), &err);  in compute_generator_polynomial()
1196 		for (j = 0, r = 2*i+1; j < m; j++) {  in compute_generator_polynomial()
1259 struct bch_control *init_bch(int m, int t, unsigned int prim_poly)  in init_bch()  argument
1275 	if ((m != (CONFIG_BCH_CONST_M)) || (t != (CONFIG_BCH_CONST_T))) {  in init_bch()
1282 	if ((m < min_m) || (m > BCH_MAX_M))  in init_bch()
1298 	if ((t < 1) || (m*t >= ((1 << m)-1)))  in init_bch()
1304 		prim_poly = prim_poly_tab[m-min_m];  in init_bch()
1310 	bch->m = m;  in init_bch()
1312 	bch->n = (1 << m)-1;  in init_bch()
1313 	words  = DIV_ROUND_UP(m*t, 32);  in init_bch()
1314 	bch->ecc_bytes = DIV_ROUND_UP(m*t, 8);  in init_bch()
1320 	bch->xi_tab    = bch_alloc(m*sizeof(*bch->xi_tab), &err);  in init_bch()