Searched refs:GF_M (Results 1 – 2 of 2) sorted by relevance
78 #define GF_M(_p) (CONFIG_BCH_CONST_M) macro84 #define GF_M(_p) ((_p)->m) macro91 #define BCH_ECC_WORDS(_p) DIV_ROUND_UP(GF_M(_p)*GF_T(_p), 32)92 #define BCH_ECC_BYTES(_p) DIV_ROUND_UP(GF_M(_p)*GF_T(_p), 8)328 v = (v & n) + (v >> GF_M(bch)); in modulo()502 const int m = GF_M(bch); in solve_linear_system()580 const int m = GF_M(bch); in find_affine4_roots()866 const int m = GF_M(bch); in compute_trace_bk_mod()964 if (poly->deg && (k <= GF_M(bch))) { in find_poly_roots()1126 if (k != (1u << GF_M(bch))) in build_gf_tables()[all …]
86 #define GF_M(_p) (CONFIG_BCH_CONST_M) macro90 #define GF_M(_p) ((_p)->m) macro95 #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()[all …]