Lines Matching refs:deg
105 unsigned int deg; /* polynomial degree */
308 static inline int deg(unsigned int poly)
391 i = deg(poly);
406 memcpy(dst, src, GF_POLY_SZ(src->deg));
423 pelp->deg = 0;
425 elp->deg = 0;
429 for (i = 0; (i < t) && (elp->deg <= t); i++) {
435 for (j = 0; j <= pelp->deg; j++) {
442 tmp = pelp->deg+k;
443 if (tmp > elp->deg) {
444 elp->deg = tmp;
453 for (j = 1; j <= elp->deg; j++)
458 return (elp->deg > t) ? -1 : (int)elp->deg;
616 i = deg(v);
735 int i, d = a->deg, l = GF_N(bch)-a_log(bch, a->c[a->deg]);
750 const unsigned int d = b->deg;
752 if (a->deg < d)
761 for (j = a->deg; j >= d; j--) {
773 a->deg = d-1;
774 while (!c[a->deg] && a->deg)
775 a->deg--;
784 if (a->deg >= b->deg) {
785 q->deg = a->deg-b->deg;
789 memcpy(q->c, &a->c[b->deg], (1+q->deg)*sizeof(unsigned int));
791 q->deg = 0;
806 if (a->deg < b->deg) {
812 while (b->deg > 0) {
836 z->deg = 1;
840 out->deg = 0;
841 memset(out, 0, GF_POLY_SZ(f->deg));
848 for (j = z->deg; j >= 0; j--) {
853 if (z->deg > out->deg)
854 out->deg = z->deg;
857 z->deg *= 2;
862 while (!out->c[out->deg] && out->deg)
863 out->deg--;
888 if (tk->deg > 0) {
892 if (gcd->deg < f->deg) {
896 *h = &((struct gf_poly_deg1 *)f)[gcd->deg].poly;
913 switch (poly->deg) {
930 if (poly->deg && (k <= GF_M(bch))) {
956 bch->cache[p->deg] = 0;
957 syn0 = gf_div(bch, p->c[0], p->c[p->deg]);
961 for (j = 1, syn = syn0; j <= p->deg; j++) {
968 if (count == p->deg)
972 return (count == p->deg) ? count : 0;
1089 const unsigned int k = 1 << deg(poly);
1127 /* we want to compute (p(X).X^(8*b+deg(g))) mod g(X) */
1131 d = deg(data);
1132 /* subtract X^d.g(X) from p(X).X^(8*b+deg(g)) */
1227 g->deg = 0;
1233 g->c[g->deg+1] = 1;
1234 for (j = g->deg; j > 0; j--)
1238 g->deg++;
1242 n = g->deg+1;
1254 bch->ecc_bits = g->deg;