Lines Matching defs:nn
16 int nn = rs->nn;
26 uint16_t msk = (uint16_t) rs->nn;
42 pad = nn - nroots - len;
43 BUG_ON(pad < 0 || pad >= nn - nroots);
49 * so nn represents zero
51 if (s[i] != nn)
112 prim * (nn - 1 - (eras_pos[0] + pad)))];
114 u = rs_modnn(rs, prim * (nn - 1 - (eras_pos[i] + pad)));
117 if (tmp != nn) {
138 if ((lambda[i] != 0) && (s[r - i - 1] != nn)) {
146 if (discr_r == nn) {
149 b[0] = nn;
154 if (b[i] != nn) {
168 b[i] = (lambda[i] == 0) ? nn :
170 - discr_r + nn);
175 b[0] = nn;
185 if (lambda[i] != nn)
200 for (i = 1, k = iprim - 1; i <= nn; i++, k = rs_modnn(rs, k + iprim)) {
203 if (reg[j] != nn) {
240 if ((s[i - j] != nn) && (lambda[j] != nn))
256 if (omega[i] != nn)
267 num2 = alpha_to[rs_modnn(rs, root[j] * (fcr - 1) + nn)];
273 if (lambda[i + 1] != nn) {
281 nn - index_of[den])];
295 k = (fcr + i) * prim * (nn-loc[j]-1);
318 if (loc[i] < (nn - nroots))