Searched refs:avail_in (Results 1 - 13 of 13) sorted by relevance
/ast/src/lib/libz/ |
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 | 130 s->stream.avail_in = s->stream.avail_out = 0; 200 s->stream.avail_in = len; 326 Read a byte from a gz_stream; update next_in and avail_in. Return EOF 334 if (s->stream.avail_in == 0) { 336 s->stream.avail_in = (uInt)fread(s->inbuf, 1, Z_BUFSIZE, s->file); 337 if (s->stream.avail_in == 0) { 344 s->stream.avail_in--; 354 s->stream.avail_in is zero for the first time, but may be non-zero 370 if (len != 0) s->stream.avail_in++, s->stream.next_in--; 372 s->stream.avail_in [all...] |
H A D | example.c | 188 c_stream.avail_in = c_stream.avail_out = 1; /* force small buffers */ 221 d_stream.avail_in = 0; 228 d_stream.avail_in = d_stream.avail_out = 1; /* force small buffers */ 269 c_stream.avail_in = (uInt)uncomprLen; 272 if (c_stream.avail_in != 0) { 280 c_stream.avail_in = (uInt)comprLen/2; 287 c_stream.avail_in = (uInt)uncomprLen; 317 d_stream.avail_in = (uInt)comprLen; 361 c_stream.avail_in = 3; 367 c_stream.avail_in [all...] |
H A D | inffast.c | 44 strm->avail_in >= 6 60 Therefore if strm->avail_in >= 6, then there is enough input to avoid 101 last = in + (strm->avail_in - 5); 297 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...] |
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...] |
/ast/src/lib/libbz/ |
H A D | bzlib.c | 302 if (s->strm->avail_in == 0) break; 306 s->strm->avail_in--; 317 if (s->strm->avail_in == 0) break; 323 s->strm->avail_in--; 395 if (s->strm->avail_in == 0) { 429 s->avail_in_expect = strm->avail_in; 435 s->avail_in_expect = strm->avail_in; 444 if (s->avail_in_expect != s->strm->avail_in) return BZ_SEQUENCE_ERROR; 453 if (s->avail_in_expect != s->strm->avail_in) return BZ_SEQUENCE_ERROR; 920 bzf->strm.avail_in [all...] |
H A D | bzlib.h | 86 unsigned int avail_in; member in struct:__anon329
|
H A D | decompress.c | 95 if (s->strm->avail_in == 0) RETURN(BZ_OK); \ 102 s->strm->avail_in--; \
|
/ast/src/cmd/INIT/ |
H A D | ratz.c | 507 uInt avail_in; /* number of bytes available at next_in */ member in struct:z_stream_s 2040 strm->avail_in >= 6 2056 Therefore if strm->avail_in >= 6, then there is enough input to avoid 2097 last = in + (strm->avail_in - 5); 2293 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last)); 2627 have = strm->avail_in; \ 2638 strm->avail_in = have; \ 2756 Progress is defined as a change in either strm->avail_in or strm->avail_out. 2797 (strm->next_in == Z_NULL && strm->avail_in != 0)) 3359 in -= strm->avail_in; [all...] |
Completed in 310 milliseconds