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