Lines Matching refs:g
42 int nf = 0, best = 0, nterm = 0, i, g, j;
142 g = j = 0;
181 assert(g < lmaster);
183 master.b[g] = prevdrop.b[j];
185 master.a[g] = prevdrop.a[j];
186 coord[g++] = prevcoord[j++];
189 fprintf(stderr, " not skip g "
191 "%d\n", g, master.b[g-1],
192 coord[g-1], master.b[j-1]);
194 fprintf(stderr, " not skip g "
196 "%d\n", g, master.a[g-1],
197 coord[g-1], nterm);
206 master.b[g] = k;
208 master.a[g] = k;
209 coord[g++] = prevcoord[j++]+1;
212 fprintf(stderr, " at g %d item %ld "
213 "coord %d note %ld\n", g,
214 master.b[g-1], coord[g-1],
217 fprintf(stderr, " at g %d item %d "
218 "coord %d note %d\n", g,
219 master.a[g-1], coord[g-1],
225 master.b[g] = k;
227 master.a[g] = k;
228 coord[g++] = 1;
232 fprintf(stderr, "now have %d items\n", g);
238 assert(g < lmaster);
240 master.b[g] = prevdrop.b[j];
242 master.a[g] = prevdrop.a[j];
243 coord[g++] = prevcoord[j];
248 master.b[g-1], coord[g-1]);
252 master.a[g-1], coord[g-1]);
255 nf = g;
265 for (g = j = 0; j < nf; j++)
268 master.b[g++] = master.b[j];
270 master.a[g++] = master.a[j];
272 nf = g;
285 for (g = 0; g < nf; g++)
287 fprintf(stderr, ":%ld\n", master.b[g]);
289 fprintf(stderr, ":%d\n", master.a[g]);