98 	unsigned int deg;    /* polynomial degree */  member
275 static inline int deg(unsigned int poly)  in deg()  function
358 			i = deg(poly);  in compute_syndromes()
373 	memcpy(dst, src, GF_POLY_SZ(src->deg));  in gf_poly_copy()
390 	pelp->deg = 0;  in compute_error_locator_polynomial()
392 	elp->deg = 0;  in compute_error_locator_polynomial()
396 	for (i = 0; (i < t) && (elp->deg <= t); i++) {  in compute_error_locator_polynomial()
402 			for (j = 0; j <= pelp->deg; j++) {  in compute_error_locator_polynomial()
409 			tmp = pelp->deg+k;  in compute_error_locator_polynomial()
410 			if (tmp > elp->deg) {  in compute_error_locator_polynomial()
411 				elp->deg = tmp;  in compute_error_locator_polynomial()
420 			for (j = 1; j <= elp->deg; j++)  in compute_error_locator_polynomial()
425 	return (elp->deg > t) ? -1 : (int)elp->deg;  in compute_error_locator_polynomial()
583 			i = deg(v);  in find_poly_deg2_roots()
702 	int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]);  in gf_poly_logrep()
717 	const unsigned int d = b->deg;  in gf_poly_mod()
719 	if (a->deg < d)  in gf_poly_mod()
728 	for (j = a->deg; j >= d; j--) {  in gf_poly_mod()
740 	a->deg = d-1;  in gf_poly_mod()
741 	while (!c[a->deg] && a->deg)  in gf_poly_mod()
742 		a->deg--;  in gf_poly_mod()
751 	if (a->deg >= b->deg) {  in gf_poly_div()
752 		q->deg = a->deg-b->deg;  in gf_poly_div()
756 		memcpy(q->c, &a->c[b->deg], (1+q->deg)*sizeof(unsigned int));  in gf_poly_div()
758 		q->deg = 0;  in gf_poly_div()
773 	if (a->deg < b->deg) {  in gf_poly_gcd()
779 	while (b->deg > 0) {  in gf_poly_gcd()
803 	z->deg = 1;  in compute_trace_bk_mod()
807 	out->deg = 0;  in compute_trace_bk_mod()
808 	memset(out, 0, GF_POLY_SZ(f->deg));  in compute_trace_bk_mod()
815 		for (j = z->deg; j >= 0; j--) {  in compute_trace_bk_mod()
820 		if (z->deg > out->deg)  in compute_trace_bk_mod()
821 			out->deg = z->deg;  in compute_trace_bk_mod()
824 			z->deg *= 2;  in compute_trace_bk_mod()
829 	while (!out->c[out->deg] && out->deg)  in compute_trace_bk_mod()
830 		out->deg--;  in compute_trace_bk_mod()
855 	if (tk->deg > 0) {  in factor_polynomial()
859 		if (gcd->deg < f->deg) {  in factor_polynomial()
863 			*h = &((struct gf_poly_deg1 *)f)[gcd->deg].poly;  in factor_polynomial()
880 	switch (poly->deg) {  in find_poly_roots()
897 		if (poly->deg && (k <= GF_M(bch))) {  in find_poly_roots()
923 	bch->cache[p->deg] = 0;  in chien_search()
924 	syn0 = gf_div(bch, p->c[0], p->c[p->deg]);  in chien_search()
928 		for (j = 1, syn = syn0; j <= p->deg; j++) {  in chien_search()
935 			if (count == p->deg)  in chien_search()
939 	return (count == p->deg) ? count : 0;  in chien_search()
1054 	const unsigned int k = 1 << deg(poly);  in build_gf_tables()
1096 				d = deg(data);  in build_mod8_tables()
1192 	g->deg = 0;  in compute_generator_polynomial()
1198 			g->c[g->deg+1] = 1;  in compute_generator_polynomial()
1199 			for (j = g->deg; j > 0; j--)  in compute_generator_polynomial()
1203 			g->deg++;  in compute_generator_polynomial()
1207 	n = g->deg+1;  in compute_generator_polynomial()
1219 	bch->ecc_bits = g->deg;  in compute_generator_polynomial()