Lines Matching refs:j
40 int nf = 0, best = 0, nterm = 0, i, g, j; in doquery() local
126 for (j = 0; j < nf; j++) { in doquery()
128 prevdrop.b[j] = master.b[j]; in doquery()
130 prevdrop.a[j] = master.a[j]; in doquery()
131 prevcoord[j] = coord[j]; in doquery()
140 g = j = 0; 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()
161 (iflong ? prevdrop.b[j] : prevdrop.a[j]) < k) { in doquery()
166 "%d k %ld\n", j, nf, prevdrop.b[j], in doquery()
167 prevcoord[j], colevel, nterm, in doquery()
172 "%d k %ld\n", j, nf, prevdrop.a[j], in doquery()
173 prevcoord[j], colevel, nterm, in doquery()
176 if (prevcoord[j] + colevel <= nterm) in doquery()
177 j++; in doquery()
181 master.b[g] = prevdrop.b[j]; in doquery()
183 master.a[g] = prevdrop.a[j]; in doquery()
184 coord[g++] = prevcoord[j++]; in doquery()
190 coord[g-1], master.b[j-1]); in doquery()
200 if (colevel == 0 && j >= nf) break; in doquery()
201 if (j < nf && in doquery()
202 (iflong ? prevdrop.b[j] : prevdrop.a[j]) == k) { in doquery()
207 coord[g++] = prevcoord[j++]+1; in doquery()
213 master.b[j-1]); in doquery()
218 master.a[j-1]); in doquery()
233 for (; j < nf; j++) in doquery()
234 if ((iflong ? prevdrop.b[j] : prevdrop.a[j]) + in doquery()
238 master.b[g] = prevdrop.b[j]; in doquery()
240 master.a[g] = prevdrop.a[j]; in doquery()
241 coord[g++] = prevcoord[j]; in doquery()
257 for (j = 0; j < nf; j++) in doquery()
258 if (coord[j] > best) best = coord[j]; in doquery()
263 for (g = j = 0; j < nf; j++) in doquery()
264 if (coord[j] == best) { in doquery()
266 master.b[g++] = master.b[j]; in doquery()
268 master.a[g++] = master.a[j]; in doquery()