992 	int i, err, nroots;  in decode_bch()  local
1026 	err = compute_error_locator_polynomial(bch, syn);  in decode_bch()
1027 	if (err > 0) {  in decode_bch()
1029 		if (err != nroots)  in decode_bch()
1030 			err = -1;  in decode_bch()
1032 	if (err > 0) {  in decode_bch()
1035 		for (i = 0; i < err; i++) {  in decode_bch()
1037 				err = -1;  in decode_bch()
1044 	return (err >= 0) ? err : -EBADMSG;  in decode_bch()
1151 static void *bch_alloc(size_t size, int *err)  in bch_alloc()  argument
1157 		*err = 1;  in bch_alloc()
1168 	int n, err = 0;  in compute_generator_polynomial()  local
1173 	g = bch_alloc(GF_POLY_SZ(m*t), &err);  in compute_generator_polynomial()
1174 	roots = bch_alloc((bch->n+1)*sizeof(*roots), &err);  in compute_generator_polynomial()
1175 	genpoly = bch_alloc(DIV_ROUND_UP(m*t+1, 32)*sizeof(*genpoly), &err);  in compute_generator_polynomial()
1177 	if (err) {  in compute_generator_polynomial()
1251 	int err = 0;  in init_bch()  local
1299 	bch->a_pow_tab = bch_alloc((1+bch->n)*sizeof(*bch->a_pow_tab), &err);  in init_bch()
1300 	bch->a_log_tab = bch_alloc((1+bch->n)*sizeof(*bch->a_log_tab), &err);  in init_bch()
1301 	bch->mod8_tab  = bch_alloc(words*1024*sizeof(*bch->mod8_tab), &err);  in init_bch()
1302 	bch->ecc_buf   = bch_alloc(words*sizeof(*bch->ecc_buf), &err);  in init_bch()
1303 	bch->ecc_buf2  = bch_alloc(words*sizeof(*bch->ecc_buf2), &err);  in init_bch()
1304 	bch->xi_tab    = bch_alloc(m*sizeof(*bch->xi_tab), &err);  in init_bch()
1305 	bch->syn       = bch_alloc(2*t*sizeof(*bch->syn), &err);  in init_bch()
1306 	bch->cache     = bch_alloc(2*t*sizeof(*bch->cache), &err);  in init_bch()
1307 	bch->elp       = bch_alloc((t+1)*sizeof(struct gf_poly_deg1), &err);  in init_bch()
1310 		bch->poly_2t[i] = bch_alloc(GF_POLY_SZ(2*t), &err);  in init_bch()
1312 	if (err)  in init_bch()
1315 	err = build_gf_tables(bch, prim_poly);  in init_bch()
1316 	if (err)  in init_bch()
1327 	err = build_deg2_base(bch);  in init_bch()
1328 	if (err)  in init_bch()