Lines Matching +full:0 +full:deg
24 int count = 0;
42 BUG_ON(pad < 0 || pad >= nn);
46 for (i = 0; i < nroots; i++) {
55 return 0;
60 for (i = 0; i < nroots; i++)
61 syn[i] = (((uint16_t) data[0]) ^ invmsk) & msk;
64 for (i = 0; i < nroots; i++) {
65 if (syn[i] == 0) {
77 for (j = 0; j < nroots; j++) {
78 for (i = 0; i < nroots; i++) {
79 if (syn[i] == 0) {
91 syn_error = 0;
92 for (i = 0; i < nroots; i++) {
101 count = 0;
106 memset(&lambda[1], 0, nroots * sizeof(lambda[0]));
107 lambda[0] = 1;
109 if (no_eras > 0) {
112 prim * (nn - 1 - (eras_pos[0] + pad)))];
115 for (j = i + 1; j > 0; j--) {
125 for (i = 0; i < nroots + 1; i++)
136 discr_r = 0;
137 for (i = 0; i < r; i++) {
138 if ((lambda[i] != 0) && (s[r - i - 1] != nn)) {
148 memmove (&b[1], b, nroots * sizeof (b[0]));
149 b[0] = nn;
152 t[0] = lambda[0];
153 for (i = 0; i < nroots; i++) {
167 for (i = 0; i <= nroots; i++) {
168 b[i] = (lambda[i] == 0) ? nn :
174 memmove(&b[1], b, nroots * sizeof(b[0]));
175 b[0] = nn;
177 memcpy(lambda, t, (nroots + 1) * sizeof(t[0]));
181 /* Convert lambda to index form and compute deg(lambda(x)) */
182 deg_lambda = 0;
183 for (i = 0; i < nroots + 1; i++) {
189 memcpy(®[1], &lambda[1], nroots * sizeof(reg[0]));
190 count = 0; /* Number of roots of lambda(x) */
192 q = 1; /* lambda[0] is always 0 */
193 for (j = deg_lambda; j > 0; j--) {
199 if (q != 0)
212 * deg(lambda) unequal to number of roots => uncorrectable
220 * x**nroots). in index form. Also find deg(omega).
223 for (i = 0; i <= deg_omega; i++) {
224 tmp = 0;
225 for (j = i; j >= 0; j--) {
237 for (j = count - 1; j >= 0; j--) {
238 num1 = 0;
239 for (i = deg_omega; i >= 0; i--) {
245 den = 0;
249 for (i = min(deg_lambda, nroots - 1) & ~1; i >= 0; i -= 2) {
256 if (num1 != 0 && loc[j] >= pad) {
276 for (i = 0; i < count; i++)