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

/osnet-11/usr/src/lib/libsqlite/src/
H A Dtable.c48 int need; local
53 ** we need to remember from this invocation of the callback.
56 need = nCol*2;
58 need = nCol;
60 if( p->nData + need >= p->nAlloc ){
62 p->nAlloc = p->nAlloc*2 + need + 1;
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/SDBM_File/sdbm/
H A Dpair.c48 fitpair(char *pag, int need) argument
57 need += 2 * sizeof(short);
59 debug(("free %d need %d\n", free, need));
61 return need <= free;
H A Dsdbm.c87 * need space for two seperate filenames
138 * need the dirfile size to establish max bit number.
227 int need; local
235 need = key.dsize + val.dsize;
239 if (need < 0 || need > PAIRMAX)
244 * if we need to replace, delete the key/data pair
256 if (!fitpair(db->pagbuf, need))
257 if (!makroom(db, hash, need))
283 makroom(register DBM *db, long int hash, int need) argument
[all...]
/osnet-11/usr/src/lib/libast/common/sfio/
H A Dsftable.c61 int argp, argn, maxp, need[FP_INDEX]; local
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_PRECI
[all...]
H A Dsfhdr.h412 #undef SF_MTSAFE /* no need to worry about thread-safety */
748 int need[FP_INDEX]; /* positions depending on */ member in struct:_fmtpos_s
/osnet-11/usr/src/lib/libpp/common/
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))
/osnet-11/usr/src/lib/libkmf/ber_der/common/
H A Dio.c46 * elements of the ber structure, those functions will need to be changed
72 ber_uint_t need, have, total; local
80 need = (len < EXBUFSIZ ? 1 : (len + (EXBUFSIZ - 1)) / EXBUFSIZ);
81 total = have * EXBUFSIZ + need * EXBUFSIZ;
114 * If the stinking thing was moved, we need to go through and
/osnet-11/usr/src/lib/libldap4/ber/
H A Dio.c281 size_t need, have, total; local
287 need = (len < EXBUFSIZ ? 1 : (len + (EXBUFSIZ - 1)) / EXBUFSIZ);
288 total = have * EXBUFSIZ + need * EXBUFSIZ;
302 * If the stinking thing was moved, we need to go through and
/osnet-11/usr/src/grub/grub-0.97/stage2/
H A Dtparm.c147 get_space(int need) argument
149 need += out_used;
150 if (need > out_size) {
364 * Analyze the string to see how many parameters we need from the varargs
/osnet-11/usr/src/cmd/sendmail/libsm/
H A Dmbdb.c498 int need; local
605 need = NEED_FULLNAME|NEED_HOMEDIR|NEED_SHELL|NEED_UID|NEED_GID;
643 if (!bitset(NEED_FULLNAME, need) ||
649 need &= ~NEED_FULLNAME;
653 if (!bitset(NEED_HOMEDIR, need) ||
659 need &= ~NEED_HOMEDIR;
663 if (!bitset(NEED_SHELL, need) ||
669 need &= ~NEED_SHELL;
675 if (!bitset(NEED_UID, need))
691 need
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/term/
H A Dtparm.c151 get_space(grub_size_t need) argument
153 need += out_used;
154 if (need > out_size) {
155 out_size = need * 2;
333 * Analyze the string to see how many parameters we need from the varargs list,
/osnet-11/usr/src/lib/libuvfs/common/
H A Dname.c158 * If that ever changes, we will need to be sure that info does
473 uint32_t need = 0; local
479 need = libuvfs_name_dirent_path(first, buffer, size);
482 if (need < size)
483 need = strlcat(buffer, "/", size);
485 if (need < size)
486 need = strlcat(buffer, de->de_name, size);
489 return (need);
503 uint32_t need = 0; local
518 need
[all...]
/osnet-11/usr/src/lib/libldap5/sources/ldap/ber/
H A Dio.c206 * the ber structure, those functions will need to be changed as well.
232 ber_uint_t need, have, total; local
240 need = (len < EXBUFSIZ ? 1 : (len + (EXBUFSIZ - 1)) / EXBUFSIZ);
241 total = have * EXBUFSIZ + need * EXBUFSIZ;
272 * If the stinking thing was moved, we need to go through and
/osnet-11/usr/src/lib/fm/topo/modules/common/pcibus/
H A Ddid_props.c175 * These props need to be put at the end of table. x86pi has its
185 * These props need to be put at the end of table. x86pi has its
204 * These props need to be put at the end of table. x86pi has its
337 int need; local
349 * In that case there's nothing we need do.
355 need = snprintf(NULL, 0, "%s@%x", path, devno);
357 need = snprintf(NULL, 0, "%s@%x,%x", path, devno, fnno);
358 need++;
360 if ((newpath = topo_mod_alloc(mp, need)) == NULL) {
366 (void) snprintf(newpath, need, "
[all...]
/osnet-11/usr/src/lib/libresolv2/common/irs/
H A Dirpmarshall.c136 size_t need = 1 ; /*%< for null byte */ local
172 need += strlen(pw->pw_name) + 1; /*%< one for fieldsep */
173 need += strlen(pw->pw_passwd) + 1;
174 need += strlen(pwUid) + 1;
175 need += strlen(pwGid) + 1;
176 need += strlen(pwClass) + 1;
177 need += strlen(pwChange) + 1;
178 need += strlen(pwExpire) + 1;
179 need += strlen(pw->pw_gecos) + 1;
180 need
411 size_t need = 1; /*%< for null byte */ local
580 size_t need = 1; /*%< for null byte */ local
740 size_t need = 1; /*%< for null byte */ local
886 size_t need = 1; /*%< for null byte */ local
1149 size_t need = 1; /*%< for nul byte */ local
1315 size_t need = 1; /*%< for null byte */ local
1489 size_t need = 1; /*%< for null byte */ local
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/
H A Dscope.c159 Perl_savestack_grow_cnt(pTHX_ I32 need) argument
161 PL_savestack_max = PL_savestack_ix + need;
H A Dpp_sys.c2180 STRLEN need; local
2182 need = IOCPARM_LEN(func);
2183 if (len < need) {
2184 s = Sv_Grow(argsv, need + 1);
2185 SvCUR_set(argsv, need);
3871 /* XXX does _anyone_ need this? --AD 2/20/1998 */
4662 #ifndef HAS_GETHOST_PROTOS /* XXX Do we need individual probes? */
4779 #ifndef HAS_GETNET_PROTOS /* XXX Do we need individual probes? */
4880 #ifndef HAS_GETPROTO_PROTOS /* XXX Do we need individual probes? */
4967 #ifndef HAS_GETSERV_PROTOS /* XXX Do we need individua
[all...]
H A Dtoke.c234 * if the surprise occurs at the start of the line. "do you need to
262 "\t(Do you need to predeclare %.*s?)\n",
367 /* hit a CR-LF, need to copy the rest */
731 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
1468 /* We need to map to chars to ASCII before doing the tests
1473 /* Might need to recode whatever we have
1654 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv)); local
1656 if (need > len) {
1657 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1659 d = SvGROW(sv, SvLEN(sv) + (need
[all...]
H A Dsv.c1620 if (newlen > SvLEN(sv)) { /* need more room? */
1832 i.e. need room for 8 chars */
1924 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2134 /* IV not precise. No need to convert from PV, as NV
2187 This means that if we cache such an IV, we need to cache the
2428 /* IV not precise. No need to convert from PV, as NV
2477 This means that if we cache such a UV, we need to cache the
3052 * find a newline, we need to add a newline
3054 * don't find '#' or '\n'), we don't need to add
3064 break; /* don't need anothe
8457 STRLEN need; local
[all...]
/osnet-11/usr/src/lib/sasl_plugins/gssapi/
H A Dgssapi.c64 /* we also need io.h for access() prototype */
480 /* first we need to extract a packet */
514 /* need more data ! */
1909 sasl_ssf_t need, allowed; local
1937 /* need bits of layer -- sasl_ssf_t is unsigned so be careful */
1944 need = secprops->min_ssf - external;
1947 need = 0;
1954 if (allowed >= 56 && need <= 56 && (serverhas & 4)) {
1960 } else if (allowed >= 1 && need <= 1 && (serverhas & 2)) {
1967 } else if (need
[all...]
/osnet-11/usr/src/lib/libc/port/i18n/
H A Dgettext_gnu.c1082 size_t mchunk_size, used, need; local
1116 need = used + mlen + dlen;
1117 if (need >= mchunk_size) {
1122 } while (n <= need);
/osnet-11/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c978 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1237 * at the end of the input file. We need MAX_MATCH bytes
1332 * at the end of the input file. We need MAX_MATCH bytes
1523 * need for the L_CODES extra codes used during heap construction. However
1928 * Generate the codes for a given tree and bit counts (which need not be
2756 uLong need; /* stream check value */ member in struct:internal_state::__anon10::__anon11
2927 z->state->sub.check.need = (uLong)NEXTBYTE << 24;
2931 z->state->sub.check.need += (uLong)NEXTBYTE << 16;
2935 z->state->sub.check.need += (uLong)NEXTBYTE << 8;
2939 z->state->sub.check.need
4104 uInt need; /* bits needed */ member in struct:inflate_codes_state::__anon17::__anon18
[all...]

Completed in 147 milliseconds