Lines Matching defs:lambda
32 uint16_t *lambda = rsc->buffers + RS_DECODE_LAMBDA * (nroots + 1);
106 memset(&lambda[1], 0, nroots * sizeof(lambda[0]));
107 lambda[0] = 1;
110 /* Init lambda to be the erasure locator polynomial */
111 lambda[1] = alpha_to[rs_modnn(rs,
116 tmp = index_of[lambda[j - 1]];
118 lambda[j] ^=
126 b[i] = index_of[lambda[i]];
138 if ((lambda[i] != 0) && (s[r - i - 1] != nn)) {
141 index_of[lambda[i]] +
151 /* 7 lines below: T(x) <-- lambda(x)-discr_r*x*b(x) */
152 t[0] = lambda[0];
155 t[i + 1] = lambda[i + 1] ^
159 t[i + 1] = lambda[i + 1];
165 * lambda(x)
168 b[i] = (lambda[i] == 0) ? nn :
169 rs_modnn(rs, index_of[lambda[i]]
177 memcpy(lambda, t, (nroots + 1) * sizeof(t[0]));
181 /* Convert lambda to index form and compute deg(lambda(x)) */
184 lambda[i] = index_of[lambda[i]];
185 if (lambda[i] != nn)
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 */
227 * deg(lambda) unequal to number of roots => uncorrectable
233 * Compute err+eras evaluator poly omega(x) = s(x)*lambda(x) (modulo
240 if ((s[i - j] != nn) && (lambda[j] != nn))
242 alpha_to[rs_modnn(rs, s[i - j] + lambda[j])];
270 /* lambda[i+1] for i even is the formal derivative
271 * lambda_pr of lambda[i] */
273 if (lambda[i + 1] != nn) {
274 den ^= alpha_to[rs_modnn(rs, lambda[i + 1] +