Searched refs:avail_in (Results 1 - 11 of 11) sorted by relevance
/barrelfish-master/lib/zlib/ |
H A D | uncompr.c | 36 stream.avail_in = (uInt)sourceLen; 38 if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR; 53 if (err == Z_NEED_DICT || (err == Z_BUF_ERROR && stream.avail_in == 0))
|
H A D | compress.c | 33 stream.avail_in = (uInt)sourceLen; 36 if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR;
|
H A D | gzio.c | 116 s->stream.avail_in = s->stream.avail_out = 0; 199 s->start = ftell(s->file) - s->stream.avail_in; 257 Read a byte from a gz_stream; update next_in and avail_in. Return EOF 265 if (s->stream.avail_in == 0) { 267 s->stream.avail_in = (uInt)fread(s->inbuf, 1, Z_BUFSIZE, s->file); 268 if (s->stream.avail_in == 0) { 275 s->stream.avail_in--; 285 s->stream.avail_in is zero for the first time, but may be non-zero 299 len = s->stream.avail_in; 305 s->stream.avail_in [all...] |
H A D | inffast.c | 43 strm->avail_in >= 6 59 Therefore if strm->avail_in >= 6, then there is enough input to avoid 100 last = in + (strm->avail_in - 5); 296 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
|
H A D | infback.c | 124 have = strm->avail_in; \ 135 strm->avail_in = have; \ 274 have = next != Z_NULL ? strm->avail_in : 0; 610 strm->avail_in = have;
|
H A D | inflate.c | 18 * - Change inffast.c entry and loop from avail_in >= 7 to >= 6 408 have = strm->avail_in; \ 419 strm->avail_in = have; \ 537 Progress is defined as a change in either strm->avail_in or strm->avail_out. 578 (strm->next_in == Z_NULL && strm->avail_in != 0)) 1140 in -= strm->avail_in; 1273 if (strm->avail_in == 0 && state->bits < 8) return Z_BUF_ERROR; 1291 len = syncsearch(&(state->have), strm->next_in, strm->avail_in); 1292 strm->avail_in -= len;
|
H A D | deflate.c | 566 (strm->next_in == Z_NULL && strm->avail_in != 0) || 762 * avail_in equal to zero. There won't be anything to do, 774 } else if (strm->avail_in == 0 && flush <= old_flush && 780 if (s->status == FINISH_STATE && strm->avail_in != 0) { 786 if (strm->avail_in != 0 || s->lookahead != 0 || 961 unsigned len = strm->avail_in; 966 strm->avail_in -= len; 1262 * At least one byte has been read, or avail_in == 0; reads are 1327 if (s->strm->avail_in == 0) return; 1357 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in ! [all...] |
/barrelfish-master/lib/openssl-1.0.0d/crypto/comp/ |
H A D | c_zlib.c | 153 state->istream.avail_in = 0; 165 state->ostream.avail_in = 0; 203 state->ostream.avail_in = ilen; 231 state->istream.avail_in = ilen; 312 stream.avail_in = (uInt)sourceLen; 314 if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR; 495 ctx->zin.avail_in = 0; 501 ctx->zout.avail_in = 0; 555 zin->avail_in = 0; 564 while(zin->avail_in) [all...] |
/barrelfish-master/usr/slideshow/ |
H A D | zlib_load.c | 34 d_stream.avail_in = srcsize;
|
/barrelfish-master/include/ |
H A D | zlib.h | 84 uInt avail_in; /* number of bytes available at next_in */ member in struct:z_stream_s 129 The application must update next_in and avail_in when avail_in has 252 - Compress more input starting at next_in and update next_in and avail_in 254 enough room in the output buffer), next_in and avail_in are updated and 265 more output, and updating avail_in or avail_out accordingly; avail_out 279 avail_in is zero after the call if enough output space has been provided 322 (for example avail_in or avail_out was zero). Note that Z_BUF_ERROR is not 346 next_in, avail_in, zalloc, zfree and opaque must be initialized before by 347 the caller. If next_in is not Z_NULL and avail_in i [all...] |
/barrelfish-master/usr/ramfsd/ |
H A D | main.c | 81 d_stream.avail_in = len;
|
Completed in 127 milliseconds