Lines Matching +full:0 +full:deg
24 int count = 0;
43 BUG_ON(pad < 0 || pad >= nn - nroots);
47 for (i = 0; i < nroots; i++) {
56 return 0;
61 for (i = 0; i < nroots; i++)
62 syn[i] = (((uint16_t) data[0]) ^ invmsk) & msk;
65 for (i = 0; i < nroots; i++) {
66 if (syn[i] == 0) {
78 for (j = 0; j < nroots; j++) {
79 for (i = 0; i < nroots; i++) {
80 if (syn[i] == 0) {
92 syn_error = 0;
93 for (i = 0; i < nroots; i++) {
102 return 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 if (deg_lambda == 0) {
191 * deg(lambda) is zero even though the syndrome is non-zero
198 memcpy(®[1], &lambda[1], nroots * sizeof(reg[0]));
199 count = 0; /* Number of roots of lambda(x) */
201 q = 1; /* lambda[0] is always 0 */
202 for (j = deg_lambda; j > 0; j--) {
208 if (q != 0)
227 * deg(lambda) unequal to number of roots => uncorrectable
234 * x**nroots). in index form. Also find deg(omega).
237 for (i = 0; i <= deg_omega; i++) {
238 tmp = 0;
239 for (j = i; j >= 0; j--) {
252 num_corrected = 0;
253 for (j = count - 1; j >= 0; j--) {
254 num1 = 0;
255 for (i = deg_omega; i >= 0; i--) {
261 if (num1 == 0) {
263 b[j] = 0;
268 den = 0;
272 for (i = min(deg_lambda, nroots - 1) & ~1; i >= 0; i -= 2) {
289 for (i = 0; i < nroots; i++) {
290 tmp = 0;
291 for (j = 0; j < count; j++) {
292 if (b[j] == 0)
308 j = 0;
309 for (i = 0; i < count; i++) {
317 for (i = 0; i < count; i++) {