Lines Matching refs:roots
550 unsigned int *roots) in find_affine4_roots() argument
579 return solve_linear_system(bch, rows, roots, 4); in find_affine4_roots()
586 unsigned int *roots) in find_poly_deg1_roots() argument
592 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots()
601 unsigned int *roots) in find_poly_deg2_roots() argument
630 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
632 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
643 unsigned int *roots) in find_poly_deg3_roots() argument
665 roots[n++] = a_ilog(bch, tmp[i]); in find_poly_deg3_roots()
676 unsigned int *roots) in find_poly_deg4_roots() argument
725 if (find_affine4_roots(bch, a2, b2, c2, roots) == 4) { in find_poly_deg4_roots()
728 f = a ? gf_inv(bch, roots[i]) : roots[i]; in find_poly_deg4_roots()
729 roots[i] = a_ilog(bch, f^e); in find_poly_deg4_roots()
915 struct gf_poly *poly, unsigned int *roots) in find_poly_roots() argument
923 cnt = find_poly_deg1_roots(bch, poly, roots); in find_poly_roots()
926 cnt = find_poly_deg2_roots(bch, poly, roots); in find_poly_roots()
929 cnt = find_poly_deg3_roots(bch, poly, roots); in find_poly_roots()
932 cnt = find_poly_deg4_roots(bch, poly, roots); in find_poly_roots()
940 cnt += find_poly_roots(bch, k+1, f1, roots); in find_poly_roots()
942 cnt += find_poly_roots(bch, k+1, f2, roots+cnt); in find_poly_roots()
955 struct gf_poly *p, unsigned int *roots) in chien_search() argument
974 roots[count++] = GF_N(bch)-i; in chien_search()
1208 unsigned int i, j, nbits, r, word, *roots; in compute_generator_polynomial() local
1213 roots = bch_alloc((bch->n+1)*sizeof(*roots), &err); in compute_generator_polynomial()
1223 memset(roots , 0, (bch->n+1)*sizeof(*roots)); in compute_generator_polynomial()
1226 roots[r] = 1; in compute_generator_polynomial()
1234 if (roots[i]) { in compute_generator_polynomial()
1262 kfree(roots); in compute_generator_polynomial()