Lines Matching refs:nf
40 int nf = 0, best = 0, nterm = 0, i, g, j; in doquery() local
120 nf = i; in doquery()
126 for (j = 0; j < nf; j++) { in doquery()
154 j, nf, prevdrop.b[j], (long)(k)); in doquery()
158 j, nf, prevdrop.a[j], (long)(k)); in doquery()
160 while (j < nf && in doquery()
166 "%d k %ld\n", j, nf, prevdrop.b[j], in doquery()
172 "%d k %ld\n", j, nf, prevdrop.a[j], in doquery()
200 if (colevel == 0 && j >= nf) break; in doquery()
201 if (j < nf && in doquery()
233 for (; j < nf; j++) in doquery()
253 nf = g; in doquery()
257 for (j = 0; j < nf; j++) in doquery()
263 for (g = j = 0; j < nf; j++) in doquery()
270 nf = g; in doquery()
272 fprintf(stderr, "yet got %d\n", nf); in doquery()
276 fprintf(stderr, " returning with %d\n", nf); in doquery()
283 for (g = 0; g < nf; g++) in doquery()
289 return (nf); in doquery()