Lines Matching defs:nf
42 int nf = 0, best = 0, nterm = 0, i, g, j;
122 nf = i;
128 for (j = 0; j < nf; j++) {
155 "bfwh j %d nf %d master %ld k %ld\n",
156 j, nf, prevdrop.b[j], (long)(k));
159 "bfwh j %d nf %d master %ld k %ld\n",
160 j, nf, prevdrop.a[j], (long)(k));
162 while (j < nf &&
166 fprintf(stderr, "j %d nf %d prevdrop "
168 "%d k %ld\n", j, nf, prevdrop.b[j],
172 fprintf(stderr, "j %d nf %d prevdrop "
174 "%d k %ld\n", j, nf, prevdrop.a[j],
202 if (colevel == 0 && j >= nf) break;
203 if (j < nf &&
235 for (; j < nf; j++)
255 nf = g;
259 for (j = 0; j < nf; j++)
265 for (g = j = 0; j < nf; j++)
272 nf = g;
274 fprintf(stderr, "yet got %d\n", nf);
278 fprintf(stderr, " returning with %d\n", nf);
285 for (g = 0; g < nf; g++)
291 return (nf);