Lines Matching defs:nroots
23 int nroots = rs->nroots;
31 * of nroots is 8. So the necessary stack size will be about
34 uint16_t lambda[nroots + 1], syn[nroots];
35 uint16_t b[nroots + 1], t[nroots + 1], omega[nroots + 1];
36 uint16_t root[nroots], reg[nroots + 1], loc[nroots];
41 pad = nn - nroots - len;
50 for (i = 0; i < nroots; i++)
54 for (i = 0; i < nroots; i++) {
67 for (j = 0; j < nroots; j++) {
68 for (i = 0; i < nroots; i++) {
82 for (i = 0; i < nroots; i++) {
96 memset(&lambda[1], 0, nroots * sizeof(lambda[0]));
115 for (i = 0; i < nroots + 1; i++)
124 while (++r <= nroots) { /* r is the step number */
138 memmove (&b[1], b, nroots * sizeof (b[0]));
143 for (i = 0; i < nroots; i++) {
157 for (i = 0; i <= nroots; i++) {
164 memmove(&b[1], b, nroots * sizeof(b[0]));
167 memcpy(lambda, t, (nroots + 1) * sizeof(t[0]));
173 for (i = 0; i < nroots + 1; i++) {
179 memcpy(®[1], &lambda[1], nroots * sizeof(reg[0]));
210 * x**nroots). in index form. Also find deg(omega).
239 for (i = min(deg_lambda, nroots - 1) & ~1; i >= 0; i -= 2) {
258 if (data && (loc[j] < (nn - nroots)))