• Home
  • Raw
  • Download

Lines Matching refs:d

381 	unsigned int i, j, tmp, l, pd = 1, d = syn[0];  in compute_error_locator_polynomial()  local
397 if (d) { in compute_error_locator_polynomial()
401 tmp = a_log(bch, d)+n-a_log(bch, pd); in compute_error_locator_polynomial()
413 pd = d; in compute_error_locator_polynomial()
419 d = syn[2*i+2]; in compute_error_locator_polynomial()
421 d ^= gf_mul(bch, elp->c[j], syn[2*i+2-j]); in compute_error_locator_polynomial()
639 unsigned int a, b, c, d, e = 0, f, a2, b2, c2, e4; in find_poly_deg4_roots() local
646 d = gf_div(bch, poly->c[0], e4); in find_poly_deg4_roots()
667 d = a_pow(bch, 2*l)^gf_mul(bch, b, f)^d; in find_poly_deg4_roots()
671 if (d == 0) in find_poly_deg4_roots()
675 c2 = gf_inv(bch, d); in find_poly_deg4_roots()
676 b2 = gf_div(bch, a, d); in find_poly_deg4_roots()
677 a2 = gf_div(bch, b, d); in find_poly_deg4_roots()
680 c2 = d; in find_poly_deg4_roots()
702 int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]); in gf_poly_logrep() local
705 for (i = 0; i < d; i++) in gf_poly_logrep()
717 const unsigned int d = b->deg; in gf_poly_mod() local
719 if (a->deg < d) in gf_poly_mod()
728 for (j = a->deg; j >= d; j--) { in gf_poly_mod()
731 p = j-d; in gf_poly_mod()
732 for (i = 0; i < d; i++, p++) { in gf_poly_mod()
740 a->deg = d-1; in gf_poly_mod()
1081 int i, j, b, d; in build_mod8_tables() local
1096 d = deg(data); in build_mod8_tables()
1098 data ^= g[0] >> (31-d); in build_mod8_tables()
1100 hi = (d < 31) ? g[j] << (d+1) : 0; in build_mod8_tables()
1102 g[j+1] >> (31-d) : 0; in build_mod8_tables()