Lines Matching refs:j
42 int nf = 0, best = 0, nterm = 0, i, g, j;
128 for (j = 0; j < nf; j++) {
130 prevdrop.b[j] = master.b[j];
132 prevdrop.a[j] = master.a[j];
133 prevcoord[j] = coord[j];
142 g = j = 0;
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 &&
163 (iflong ? prevdrop.b[j] : prevdrop.a[j]) < k) {
166 fprintf(stderr, "j %d nf %d prevdrop "
168 "%d k %ld\n", j, nf, prevdrop.b[j],
169 prevcoord[j], colevel, nterm,
172 fprintf(stderr, "j %d nf %d prevdrop "
174 "%d k %ld\n", j, nf, prevdrop.a[j],
175 prevcoord[j], colevel, nterm,
178 if (prevcoord[j] + colevel <= nterm)
179 j++;
183 master.b[g] = prevdrop.b[j];
185 master.a[g] = prevdrop.a[j];
186 coord[g++] = prevcoord[j++];
192 coord[g-1], master.b[j-1]);
202 if (colevel == 0 && j >= nf) break;
203 if (j < nf &&
204 (iflong ? prevdrop.b[j] : prevdrop.a[j]) == k) {
209 coord[g++] = prevcoord[j++]+1;
215 master.b[j-1]);
220 master.a[j-1]);
235 for (; j < nf; j++)
236 if ((iflong ? prevdrop.b[j] : prevdrop.a[j]) +
240 master.b[g] = prevdrop.b[j];
242 master.a[g] = prevdrop.a[j];
243 coord[g++] = prevcoord[j];
259 for (j = 0; j < nf; j++)
260 if (coord[j] > best) best = coord[j];
265 for (g = j = 0; j < nf; j++)
266 if (coord[j] == best) {
268 master.b[g++] = master.b[j];
270 master.a[g++] = master.a[j];