105 	unsigned int c[0];   /* polynomial terms */  member
114 	unsigned int   c[2];  member
401 	pelp->c[0] = 1;  in compute_error_locator_polynomial()
403 	elp->c[0] = 1;  in compute_error_locator_polynomial()
413 				if (pelp->c[j]) {  in compute_error_locator_polynomial()
414 					l = a_log(bch, pelp->c[j]);  in compute_error_locator_polynomial()
415 					elp->c[j+k] ^= a_pow(bch, tmp+l);  in compute_error_locator_polynomial()
431 				d ^= gf_mul(bch, elp->c[j], syn[2*i+2-j]);  in compute_error_locator_polynomial()
447 	int rem, c, r, p, k, param[BCH_MAX_M];  in solve_linear_system()  local
453 	for (c = 0; c < m; c++) {  in solve_linear_system()
455 		p = c-k;  in solve_linear_system()
477 			param[k++] = c;  in solve_linear_system()
500 		for (c = 0; c < k; c++)  in solve_linear_system()
501 			rows[param[c]] = (rows[param[c]] & ~1)|((p >> c) & 1);  in solve_linear_system()
519 			      unsigned int b, unsigned int c,  in find_affine4_roots()  argument
528 	rows[0] = c;  in find_affine4_roots()
560 	if (poly->c[0])  in find_poly_deg1_roots()
562 		roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+  in find_poly_deg1_roots()
563 				   bch->a_log_tab[poly->c[1]]);  in find_poly_deg1_roots()
576 	if (poly->c[0] && poly->c[1]) {  in find_poly_deg2_roots()
578 		l0 = bch->a_log_tab[poly->c[0]];  in find_poly_deg2_roots()
579 		l1 = bch->a_log_tab[poly->c[1]];  in find_poly_deg2_roots()
580 		l2 = bch->a_log_tab[poly->c[2]];  in find_poly_deg2_roots()
616 	unsigned int a, b, c, a2, b2, c2, e3, tmp[4];  in find_poly_deg3_roots()  local
618 	if (poly->c[0]) {  in find_poly_deg3_roots()
620 		e3 = poly->c[3];  in find_poly_deg3_roots()
621 		c2 = gf_div(bch, poly->c[0], e3);  in find_poly_deg3_roots()
622 		b2 = gf_div(bch, poly->c[1], e3);  in find_poly_deg3_roots()
623 		a2 = gf_div(bch, poly->c[2], e3);  in find_poly_deg3_roots()
626 		c = gf_mul(bch, a2, c2);           /* c = a2c2      */  in find_poly_deg3_roots()
631 		if (find_affine4_roots(bch, a, b, c, tmp) == 4) {  in find_poly_deg3_roots()
649 	unsigned int a, b, c, d, e = 0, f, a2, b2, c2, e4;  in find_poly_deg4_roots()  local
651 	if (poly->c[0] == 0)  in find_poly_deg4_roots()
655 	e4 = poly->c[4];  in find_poly_deg4_roots()
656 	d = gf_div(bch, poly->c[0], e4);  in find_poly_deg4_roots()
657 	c = gf_div(bch, poly->c[1], e4);  in find_poly_deg4_roots()
658 	b = gf_div(bch, poly->c[2], e4);  in find_poly_deg4_roots()
659 	a = gf_div(bch, poly->c[3], e4);  in find_poly_deg4_roots()
664 		if (c) {  in find_poly_deg4_roots()
666 			f = gf_div(bch, c, a);  in find_poly_deg4_roots()
691 		b2 = c;  in find_poly_deg4_roots()
712 	int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]);  in gf_poly_logrep()
716 		rep[i] = a->c[i] ? mod_s(bch, a_log(bch, a->c[i])+l) : -1;  in gf_poly_logrep()
726 	unsigned int i, j, *c = a->c;  in gf_poly_mod()  local
739 		if (c[j]) {  in gf_poly_mod()
740 			la = a_log(bch, c[j]);  in gf_poly_mod()
745 					c[p] ^= bch->a_pow_tab[mod_s(bch,  in gf_poly_mod()
751 	while (!c[a->deg] && a->deg)  in gf_poly_mod()
766 		memcpy(q->c, &a->c[b->deg], (1+q->deg)*sizeof(unsigned int));  in gf_poly_div()
769 		q->c[0] = 0;  in gf_poly_div()
814 	z->c[0] = 0;  in compute_trace_bk_mod()
815 	z->c[1] = bch->a_pow_tab[k];  in compute_trace_bk_mod()
826 			out->c[j] ^= z->c[j];  in compute_trace_bk_mod()
827 			z->c[2*j] = gf_sqr(bch, z->c[j]);  in compute_trace_bk_mod()
828 			z->c[2*j+1] = 0;  in compute_trace_bk_mod()
839 	while (!out->c[out->deg] && out->deg)  in compute_trace_bk_mod()
934 	syn0 = gf_div(bch, p->c[0], p->c[p->deg]);  in chien_search()
1203 	g->c[0] = 1;  in compute_generator_polynomial()
1208 			g->c[g->deg+1] = 1;  in compute_generator_polynomial()
1210 				g->c[j] = gf_mul(bch, g->c[j], r)^g->c[j-1];  in compute_generator_polynomial()
1212 			g->c[0] = gf_mul(bch, g->c[0], r);  in compute_generator_polynomial()
1223 			if (g->c[n-1-j])  in compute_generator_polynomial()