Lines Matching refs:deg
104 unsigned int deg; /* polynomial degree */
342 static inline int deg(unsigned int poly)
425 i = deg(poly);
440 memcpy(dst, src, GF_POLY_SZ(src->deg));
457 pelp->deg = 0;
459 elp->deg = 0;
463 for (i = 0; (i < t) && (elp->deg <= t); i++) {
469 for (j = 0; j <= pelp->deg; j++) {
476 tmp = pelp->deg+k;
477 if (tmp > elp->deg) {
478 elp->deg = tmp;
487 for (j = 1; j <= elp->deg; j++)
492 return (elp->deg > t) ? -1 : (int)elp->deg;
650 i = deg(v);
769 int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]);
784 const unsigned int d = b->deg;
786 if (a->deg < d)
795 for (j = a->deg; j >= d; j--) {
807 a->deg = d-1;
808 while (!c[a->deg] && a->deg)
809 a->deg--;
818 if (a->deg >= b->deg) {
819 q->deg = a->deg-b->deg;
823 memcpy(q->c, &a->c[b->deg], (1+q->deg)*sizeof(unsigned int));
825 q->deg = 0;
840 if (a->deg < b->deg) {
846 while (b->deg > 0) {
870 z->deg = 1;
874 out->deg = 0;
875 memset(out, 0, GF_POLY_SZ(f->deg));
882 for (j = z->deg; j >= 0; j--) {
887 if (z->deg > out->deg)
888 out->deg = z->deg;
891 z->deg *= 2;
896 while (!out->c[out->deg] && out->deg)
897 out->deg--;
922 if (tk->deg > 0) {
926 if (gcd->deg < f->deg) {
930 *h = &((struct gf_poly_deg1 *)f)[gcd->deg].poly;
947 switch (poly->deg) {
964 if (poly->deg && (k <= GF_M(bch))) {
990 bch->cache[p->deg] = 0;
991 syn0 = gf_div(bch, p->c[0], p->c[p->deg]);
995 for (j = 1, syn = syn0; j <= p->deg; j++) {
1002 if (count == p->deg)
1006 return (count == p->deg) ? count : 0;
1123 const unsigned int k = 1 << deg(poly);
1161 /* we want to compute (p(X).X^(8*b+deg(g))) mod g(X) */
1165 d = deg(data);
1166 /* subtract X^d.g(X) from p(X).X^(8*b+deg(g)) */
1261 g->deg = 0;
1267 g->c[g->deg+1] = 1;
1268 for (j = g->deg; j > 0; j--)
1272 g->deg++;
1276 n = g->deg+1;
1288 bch->ecc_bits = g->deg;