| /onnv/onnv-gate/usr/src/cmd/tbl/ |
| t7.c | 21 void need(void);
28 if (boxflg || allflg || dboxflg) need();
94 need(void) function
108 * For nroff runs, we need to reserve space for the full height of the
|
| /onnv/onnv-gate/usr/src/common/crypto/modes/ |
| ecb.c | 47 size_t need; local
74 need = block_size - ctx->ecb_remainder_len;
76 if (need > remainder)
80 [ctx->ecb_remainder_len], need);
97 need);
116 datap += need;
|
| cbc.c | 49 size_t need; local
76 need = block_size - ctx->cbc_remainder_len;
78 if (need > remainder)
82 [ctx->cbc_remainder_len], need);
104 need);
133 datap += need;
176 size_t need; local
203 need = block_size - ctx->cbc_remainder_len;
205 if (need > remainder)
209 [ctx->cbc_remainder_len], need);
[all...] |
| ctr.c | 49 size_t need; local
77 need = block_size - ctx->ctr_remainder_len;
79 if (need > remainder)
83 [ctx->ctr_remainder_len], need);
126 need);
144 datap += need;
|
| gcm.c | 137 size_t need; local
166 need = block_size - ctx->gcm_remainder_len;
168 if (need > remainder)
172 [ctx->gcm_remainder_len], need);
201 need);
227 datap += need;
|
| ccm.c | 56 size_t need; local
87 need = block_size - ctx->ccm_remainder_len;
89 if (need > remainder)
93 [ctx->ccm_remainder_len], need);
137 need);
160 datap += need;
367 size_t need; local
411 * part of the input will be the MAC, need to isolate that
453 need = block_size - ctx->ccm_remainder_len;
455 if (need > remainder
[all...] |
| /onnv/onnv-gate/usr/src/cmd/fmli/qued/ |
| wrap.c | 84 register int i, need, pos, row; local
101 need = LASTCOL - pos + 1;
103 totallength = need + numblanks;
116 for (i = 0; i < need; i++) {
|
| /onnv/onnv-gate/usr/src/lib/libsqlite/src/ |
| table.c | 48 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;
|
| /onnv/onnv-gate/usr/src/cmd/refer/ |
| hunt6.c | 42 int i, g, j, need, got, na, len; local
108 need = colevel ? reached : nitem;
113 ar[na++] = (char *)need;
|
| glue5.c | 41 int need; variable
64 nsucc = need = inct = rflag = numwords = nfound = 0;
82 need = (int)xargv[1];
136 if (need == 0) need = numwords;
192 fprintf(stderr, " found: nfound %d need %d\n", nfound, need);
194 if (++nfound >= need) {
|
| /onnv/onnv-gate/usr/src/uts/common/io/audio/impl/ |
| audio_output.c | 217 * the conversion buffer is exhausted, and we need to refill it from the
287 int need; local
295 * We need/want a full fragment. If the client has
301 need = fragfr;
320 * We might have got more data than we need
322 * Take only what we need.
324 used = min(avail, need);
340 * have been all we need. This can happen
348 need -= used;
350 } while (need && avail)
[all...] |
| /onnv/onnv-gate/usr/src/lib/libkmf/ber_der/common/ |
| io.c | 46 * elements of the ber structure, those functions will need to be changed
72 ber_uint_t need, have, total; local
81 need = (len < EXBUFSIZ ? 1 : (len + (EXBUFSIZ - 1)) / EXBUFSIZ);
82 total = have * EXBUFSIZ + need * EXBUFSIZ;
116 * If the stinking thing was moved, we need to go through and
|
| /onnv/onnv-gate/usr/src/lib/libast/common/sfio/ |
| sftable.c | 61 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];
354 fp[n].need[v] = -1;
361 if((v = fp[n].need[FP_WIDTH]) >= 0 && v < n)
363 if((v = fp[n].need[FP_PRECIS]) >= 0 && v < n
[all...] |
| /onnv/onnv-gate/usr/src/lib/libpp/common/ |
| ppsearch.c | 119 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))
|
| /onnv/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/ext/SDBM_File/sdbm/ |
| sdbm.c | 87 * 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)
[all...] |
| /onnv/onnv-gate/usr/src/cmd/sendmail/libsm/ |
| mbdb.c | 500 int need; local
594 need = NEED_FULLNAME|NEED_HOMEDIR|NEED_SHELL|NEED_UID|NEED_GID;
632 if (!bitset(NEED_FULLNAME, need) ||
638 need &= ~NEED_FULLNAME;
642 if (!bitset(NEED_HOMEDIR, need) ||
648 need &= ~NEED_HOMEDIR;
652 if (!bitset(NEED_SHELL, need) ||
658 need &= ~NEED_SHELL;
664 if (!bitset(NEED_UID, need))
680 need &= ~NEED_UID
[all...] |
| /onnv/onnv-gate/usr/src/cmd/swap/ |
| swap.c | 721 off_t need; local
761 need = roundup(length, fs.f_bsize) / DEV_BSIZE;
764 * "need > f.st_blocks" to account for indirect blocks
774 if (need > f.st_blocks) {
|
| /onnv/onnv-gate/usr/src/cmd/vi/port/ |
| ex_vadj.c | 215 int need; local
221 need = p + vp->vdepth - (vp+1)->vliny;
222 if (need > 0) {
223 if (state == VISUAL && WTOP - ZERO >= need && insert_line && delete_line) {
225 WTOP -= need;
227 p -= need;
232 vdellin(WTOP, need, -1);
237 vinslin((vp+1)->vliny, need, l);
327 * We need to know if it was done ``physically'' since in this
|
| /onnv/onnv-gate/usr/src/lib/libldap4/ber/ |
| io.c | 284 size_t need, have, total; local
290 need = (len < EXBUFSIZ ? 1 : (len + (EXBUFSIZ - 1)) / EXBUFSIZ);
291 total = have * EXBUFSIZ + need * EXBUFSIZ;
305 * If the stinking thing was moved, we need to go through and
|
| /onnv/onnv-gate/usr/src/uts/common/io/ |
| pfmod.c | 240 int need; local
280 need = pfp->pf_PByteLen;
281 if (mbp && (MBLKL(mbp) < need)) {
285 if (pullupmsg(mbp, MIN(need, len)) == 0) {
356 * maintain backwards binary compatibility, we need to
476 * assumes that the header length is even, so that there's no need
|
| /onnv/onnv-gate/usr/src/cmd/sgs/elfedit/common/ |
| util_machelf.c | 52 * When you modify ELF constructs, you need to tell libelf that you've
1215 size_t need; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libldap5/sources/ldap/ber/ |
| io.c | 188 * the ber structure, those functions will need to be changed as well.
214 ber_uint_t need, have, total; local
222 need = (len < EXBUFSIZ ? 1 : (len + (EXBUFSIZ - 1)) / EXBUFSIZ);
223 total = have * EXBUFSIZ + need * EXBUFSIZ;
254 * If the stinking thing was moved, we need to go through and
[all...] |
| /onnv/onnv-gate/usr/src/psm/stand/cpr/sparcv9/sun4u/ |
| bitmap.c | 367 * and need to be moved before kernel pages are restored; a list
416 int len, glen, scnt, need, space; local
457 need = len + (sizeof (*arp) * (scnt + 1));
460 if (len == -1 || need > space) {
462 str, mem_prop, len, need, space);
|
| /onnv/onnv-gate/usr/src/cmd/sgs/rtld/common/ |
| a.out.c | 202 void *need; local
204 for (need = &TEXTBASE(clmp)[AOUTDYN(clmp)->v2->ld_need];
205 need != &TEXTBASE(clmp)[0];
206 need = &TEXTBASE(clmp)[((Lnk_obj *)(need))->lo_next]) {
210 name = &TEXTBASE(clmp)[((Lnk_obj *)(need))->lo_name];
212 if (((Lnk_obj *)(need))->lo_library) {
216 * Thus we need to rebuild the library name before
230 name, ((Lnk_obj *)(need))->lo_major,
231 ((Lnk_obj *)(need))->lo_minor)
[all...] |
| /onnv/onnv-gate/usr/src/cmd/ssh/libssh/common/ |
| kex.c | 473 int need; local
508 need = 0;
511 if (need < newkeys->enc.key_len)
512 need = newkeys->enc.key_len;
513 if (need < newkeys->enc.block_size)
514 need = newkeys->enc.block_size;
515 if (need < newkeys->mac.key_len)
516 need = newkeys->mac.key_len;
518 /* XXX need runden? */
519 kex->we_need = need;
[all...] |
