Searched defs:have (Results 1 - 25 of 51) sorted by relevance

123

/freebsd-head/lib/librpcsvc/
H A Drstat.c59 long have; local
63 (xdrproc_t)xdr_long, (char *) &have) != 0)
66 return (have);
/freebsd-head/sys/contrib/zstd/zlibWrapper/
H A Dgzcompatibility.h33 unsigned have; member in struct:gzFile_s
H A Dgzwrite.c83 unsigned have, put, max = ((unsigned)-1 >> 2) + 1; local
130 have = strm->avail_out;
137 have -= strm->avail_out;
138 } while (have);
209 z_size_t have, copy; local
213 have = (unsigned)((state.state->strm.next_in + state.state->strm.avail_in) -
215 copy = state.state->size - have;
218 memcpy(state.state->in + have, buf, copy);
314 unsigned have; local
341 have
[all...]
/freebsd-head/contrib/ncurses/ncurses/trace/
H A Dtrace_buf.c109 size_t have = strlen(buffer); local
110 size_t need = strlen(value) + have;
114 _nc_STRCPY(buffer + have, value, need);
/freebsd-head/contrib/ncurses/ncurses/base/
H A Dlib_instr.c88 int have = (int) n3 + i; local
91 if (have > n || (int) need <= 0) {
H A Dnew_pair.c106 size_t have = sizeof(bigbuf); local
108 _nc_STRCPY(p, tag, have);
112 if ((size_t) (p - bigbuf) + 50 > have)
114 _nc_SPRINTF(p, _nc_SLIMIT(have - (p - bigbuf))
241 * If we reallocate the color-pair array, we have to adjust the fast-index.
266 * Check if all of the slots have been used. If not, find one and
/freebsd-head/sys/contrib/zstd/zlibWrapper/examples/
H A Dfitblk_original.c131 unsigned have; /* bytes written by deflate() call */ local
165 have = size + EXCESS - def.avail_out;
166 if (fwrite(blk, 1, have, stdout) != have || ferror(stdout))
175 size - have, size);
218 have = size - def.avail_out;
219 if (fwrite(blk, 1, have, stdout) != have || ferror(stdout))
231 size - have, size, def.total_in);
H A Dfitblk.c143 unsigned have; /* bytes written by deflate() call */ local
182 have = size + EXCESS - def.avail_out;
183 /* if (fwrite(blk, 1, have, stdout) != have || ferror(stdout))
192 size - have, size);
239 have = size - def.avail_out;
240 /* if (fwrite(blk, 1, have, stdout) != have || ferror(stdout))
252 size - have, size, def.total_in);
/freebsd-head/contrib/ncurses/ncurses/tinfo/
H A Dhashed_db.c201 * FIXME: the FreeBSD cap_mkdb program assumes the database could have
291 char *have = (char *) data->data; local
294 if (*have++ == 2) {
300 *buffer = have;
314 char *have = (char *) data->data; local
316 if (*have++ == 0) {
318 && IS_TIC_MAGIC(have)) {
326 *buffer = have;
H A Dcaptoinfo.c137 size_t have = (size_t) (d - my_string); local
138 size_t need = have + strlen(s) + 2;
143 d = my_string + have;
145 _nc_STRCPY(d, s, my_length - have);
636 /* we may have to move some trailing mandatory padding up front */
919 syntax_error = TRUE; /* termcap doesn't have octal, hex */
/freebsd-head/crypto/openssh/openbsd-compat/
H A Dmd5.c71 size_t have, need; local
73 /* Check how many bytes we already have and how many more we need. */
74 have = (size_t)((ctx->count >> 3) & (MD5_BLOCK_LENGTH - 1));
75 need = MD5_BLOCK_LENGTH - have;
81 if (have != 0) {
82 memcpy(ctx->buffer + have, input, need);
86 have = 0;
99 memcpy(ctx->buffer + have, input, len);
H A Drmd160.c112 size_t have, off, need; local
114 have = (ctx->count / 8) % RMD160_BLOCK_LENGTH;
115 need = RMD160_BLOCK_LENGTH - have;
120 if (have) {
121 memcpy(ctx->buffer + have, input, need);
124 have = 0;
133 memcpy(ctx->buffer + have, input+off, len-off);
/freebsd-head/contrib/wpa/src/crypto/
H A Dmd4-internal.c113 size_t have, need; local
115 /* Check how many bytes we already have and how many more we need. */
116 have = (size_t)((ctx->count >> 3) & (MD4_BLOCK_LENGTH - 1));
117 need = MD4_BLOCK_LENGTH - have;
123 if (have != 0) {
124 os_memcpy(ctx->buffer + have, input, need);
128 have = 0;
141 os_memcpy(ctx->buffer + have, input, len);
/freebsd-head/sys/contrib/zlib/
H A Dgzwrite.c81 unsigned have, put, max = ((unsigned)-1 >> 2) + 1; local
128 have = strm->avail_out;
135 have -= strm->avail_out;
136 } while (have);
207 unsigned have, copy; local
211 have = (unsigned)((state->strm.next_in + state->strm.avail_in) -
213 copy = state->size - have;
216 memcpy(state->in + have, buf, copy);
311 unsigned have; local
338 have
[all...]
H A Dinfback.c133 have = strm->avail_in; \
144 strm->avail_in = have; \
160 if (have == 0) { \
161 have = in(in_desc, &next); \
162 if (have == 0) { \
175 have--; \
260 unsigned have, left; /* available input and output */ local
283 have = next != Z_NULL ? strm->avail_in : 0;
345 if (copy > have) copy = have;
[all...]
H A Dinflate.c102 local unsigned syncsearch OF((unsigned FAR *have, const unsigned char FAR *buf,
481 have = strm->avail_in; \
492 strm->avail_in = have; \
508 if (have == 0) goto inf_leave; \
509 have--; \
583 would all have to actually be part of the saved state in case NEEDBITS()
629 unsigned have, left; /* available input and output */ local
652 in = have;
759 if (copy > have) copy = have;
[all...]
H A Dinflate.h117 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
/freebsd-head/sys/opencrypto/
H A Drmd160.c111 u_int32_t have, off, need; local
113 have = (ctx->count/8) % 64;
114 need = 64 - have;
119 if (have) {
120 memcpy(ctx->buffer + have, input, need);
123 have = 0;
132 memcpy(ctx->buffer + have, input+off, len-off);
/freebsd-head/libexec/rpc.rstatd/
H A Drstat_proc.c142 static u_int have; local
147 have = haveadisk();
148 return(&have);
297 * returns true if have a disk
383 * amount we can fit in a signed integer. I have a
/freebsd-head/contrib/dialog/
H A Darrows.c17 * You should have received a copy of the GNU Lesser General Public
67 * If we have help-line text, e.g., from "--hline", draw it between the other
119 int have = (limit_x - dlg_count_columns(dialog_vars.title)) / 2; local
121 if (need > have)
H A Dprogressbox.c19 * You should have received a copy of the GNU Lesser General Public
155 /* SIGWINCH may have interrupted this - try to ignore if resizable */
264 int have = wrote_size(obj, want); local
266 for (n = 0; n < have; ++n) {
267 print_line(obj, wrote_data(obj, have - n), n);
270 return have;
H A Drc.c17 * You should have received a copy of the GNU Lesser General Public
214 size_t have; local
227 have = strlen(str);
228 if (have > MAX_LEN) {
229 have = MAX_LEN - 1;
231 have -= 2;
233 memcpy(tempstr, str + 1, have);
234 tempstr[have] = '\0';
267 get_fg = 0; /* next we have to get the background */
/freebsd-head/sys/contrib/zlib/test/
H A Dinfcover.c264 if (val > 255) { /* have two digits */
288 unsigned have; local
311 in = h2b(hex, &have); assert(in != NULL);
312 if (step == 0 || step > have)
313 step = have;
315 have -= step;
338 have += strm.avail_in;
339 strm.avail_in = step > have ? have : step;
340 have
[all...]
/freebsd-head/sys/security/mac_veriexec/
H A Dveriexec_metadata.c78 * have fingerprint validation available.
407 * The device can have entries on both lists.
553 char have[MAXFINGERPRINTLEN * 2 + 1]; local
561 sprintf(&have[i * 2], "%02x",
570 have, want);
677 * We may have been past here before...
695 * We now have to repeat our search!
/freebsd-head/contrib/mandoc/
H A Dmansearch.c531 * in the NUL-terminated string list *have, or 0 otherwise.
536 lstmatch(const char *want, const char *have) argument
538 if (want == NULL || have == NULL || *have == '\0')
540 while (*have != '\0') {
541 if (strcasestr(have, want) != NULL)
543 have = strchr(have, '\0') + 1;

Completed in 162 milliseconds

123