86 #define GF_M(_p)               (CONFIG_BCH_CONST_M)  macro
90 #define GF_M(_p)               ((_p)->m)  macro
95 #define BCH_ECC_WORDS(_p)      DIV_ROUND_UP(GF_M(_p)*GF_T(_p), 32)
96 #define BCH_ECC_BYTES(_p)      DIV_ROUND_UP(GF_M(_p)*GF_T(_p), 8)
301 		v = (v & n) + (v >> GF_M(bch));  in modulo()
475 	const int m = GF_M(bch);  in solve_linear_system()
553 	const int m = GF_M(bch);  in find_affine4_roots()
839 	const int m = GF_M(bch);  in compute_trace_bk_mod()
937 		if (poly->deg && (k <= GF_M(bch))) {  in find_poly_roots()
1096 	if (k != (1u << GF_M(bch)))  in build_gf_tables()
1154 	const int m = GF_M(bch);  in build_deg2_base()
1205 	const unsigned int m = GF_M(bch);  in compute_generator_polynomial()