Lines Matching defs:need
61 int argp, argn, maxp, need[FP_INDEX];
110 need[n] = -1;
143 need[FP_STR] = n;
200 need[dot] = n;
237 need[FP_SIZE] = n;
330 fp[argp].need[n] = need[n];
356 fp[n].need[v] = -1;
363 if((v = fp[n].need[FP_WIDTH]) >= 0 && v < n)
365 if((v = fp[n].need[FP_PRECIS]) >= 0 && v < n)
367 if((v = fp[n].need[FP_BASE]) >= 0 && v < n)
369 if((v = fp[n].need[FP_STR]) >= 0 && v < n)
371 if((v = fp[n].need[FP_SIZE]) >= 0 && v < n)