Searched defs:need (Results 1 - 5 of 5) sorted by relevance

/ast/src/lib/libast/sfio/
H A Dsftable.c61 int argp, argn, maxp, need[FP_INDEX]; local
108 need[n] = -1;
141 need[FP_STR] = n;
198 need[dot] = n;
235 need[FP_SIZE] = n;
328 fp[argp].need[n] = need[n];
354 fp[n].need[v] = -1;
361 if((v = fp[n].need[FP_WIDTH]) >= 0 && v < n)
363 if((v = fp[n].need[FP_PRECI
[all...]
H A Dsfhdr.h412 #undef SF_MTSAFE /* no need to worry about thread-safety */
758 int need[FP_INDEX]; /* positions depending on */ member in struct:_fmtpos_s
/ast/src/lib/libpp/
H A Dppsearch.c119 int need; local
156 need = TYPE_HOSTED;
158 need = TYPE_VENDOR;
160 need = TYPE_INCLUDE;
162 if (dp->type & need)
164 message((-3, "search: fp=%s need=%02x index=%d dp=%s type=%02x index=%d", fp->name, need, index, dp->name, dp->type, dp->index));
359 if (!(flags & SEARCH_NEXT) && index != dp->index && (!(need & TYPE_HOSTED) || dp->index == INC_STANDARD) && (!(need & TYPE_VENDOR) || dp->index == INC_VENDOR))
/ast/src/lib/libtk/generic/
H A DtkGrid.c1431 * sizes at each slot boundary, without the need to re-sort the slaves.
1545 int need = 0; /* The minimum space needed to layout
1578 need += layoutPtr[slot].minSize;
1609 (diff*totalWeight/weight) < (have-need)) {
1610 have = diff * totalWeight / weight + need;
1622 (int)((double) (have-need) * weight/totalWeight + 0.5);
1812 * If we need to allocate more space, allocate a little extra to avoid
1813 * repeated re-alloc's for large tables. We need enough space to
1538 int need = 0; /* The minimum space needed to layout local
/ast/src/cmd/nmake/
H A Dexpand.c1143 unsigned long need; local
1145 need = 0;
1159 if (!need)
1161 need = 1;
1168 if (need)
1170 need = 0;
1180 else if (need < a->complink)
1181 need = a->complink;
1196 if (sfstrtell(xp) != here || mark == need)

Completed in 82 milliseconds