Searched refs:avail_in (Results 1 - 12 of 12) sorted by relevance

/forgerock/web-agents-v4/zlib/
H A Duncompr.c34 stream.avail_in = (uInt)sourceLen;
36 if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR;
51 if (err == Z_NEED_DICT || (err == Z_BUF_ERROR && stream.avail_in == 0))
H A Dgzread.c48 If strm->avail_in != 0, then the current data is moved to the beginning of
60 if (strm->avail_in) { /* copy what's there to the start */
63 unsigned n = strm->avail_in;
68 if (gz_load(state, state->in + strm->avail_in,
69 state->size - strm->avail_in, &got) == -1)
71 strm->avail_in += got;
110 state->strm.avail_in = 0;
122 if (strm->avail_in < 2) {
125 if (strm->avail_in == 0)
136 if (strm->avail_in >
[all...]
H A Dcompress.c33 stream.avail_in = (uInt)sourceLen;
36 if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR;
H A Dgzwrite.c64 /* Compress whatever is at avail_in and next_in and write to the output file.
84 got = write(state->fd, strm->next_in, strm->avail_in);
85 if (got < 0 || (unsigned)got != strm->avail_in) {
89 strm->avail_in = 0;
142 if (strm->avail_in && gz_comp(state, Z_NO_FLUSH) == -1)
154 strm->avail_in = n;
212 if (strm->avail_in == 0)
214 have = (unsigned)((strm->next_in + strm->avail_in) - state->in);
219 strm->avail_in += copy;
229 if (strm->avail_in
[all...]
H A Dinffast.c43 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);
318 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
H A Dgzlib.c87 state->strm.avail_in = 0; /* no input data yet */
404 state->strm.avail_in = 0;
496 offset -= state->strm.avail_in; /* don't count buffered input */
H A Dinfback.c133 have = strm->avail_in; \
144 strm->avail_in = have; \
283 have = next != Z_NULL ? strm->avail_in : 0;
627 strm->avail_in = have;
H A Ddeflate.c359 avail = strm->avail_in;
361 strm->avail_in = dictLength;
386 strm->avail_in = avail;
679 (strm->next_in == Z_NULL && strm->avail_in != 0) ||
875 * avail_in equal to zero. There won't be anything to do,
887 } else if (strm->avail_in == 0 && RANK(flush) <= RANK(old_flush) &&
893 if (s->status == FINISH_STATE && strm->avail_in != 0) {
899 if (strm->avail_in != 0 || s->lookahead != 0 ||
1081 unsigned len = strm->avail_in;
1086 strm->avail_in
[all...]
H A Dinflate.c18 * - Change inffast.c entry and loop from avail_in >= 7 to >= 6
464 have = strm->avail_in; \
475 strm->avail_in = have; \
588 Progress is defined as a change in either strm->avail_in or strm->avail_out.
629 (strm->next_in == Z_NULL && strm->avail_in != 0))
1238 in -= strm->avail_in;
1388 if (strm->avail_in == 0 && state->bits < 8) return Z_BUF_ERROR;
1406 len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1407 strm->avail_in -= len;
H A Dzip.c1194 zi->ci.bstream.avail_in = (uInt)0;
1203 zi->ci.stream.avail_in = (uInt)0;
1424 zi->ci.bstream.avail_in = len;
1427 while ((err==BZ_RUN_OK) && (zi->ci.bstream.avail_in>0))
1458 zi->ci.stream.avail_in = len;
1460 while ((err==ZIP_OK) && (zi->ci.stream.avail_in>0))
1489 if (zi->ci.stream.avail_in < zi->ci.stream.avail_out)
1490 copy_this = zi->ci.stream.avail_in;
1498 zi->ci.stream.avail_in -= copy_this;
1532 zi->ci.stream.avail_in
[all...]
H A Dzlib.h87 uInt avail_in; /* number of bytes available at next_in */ member in struct:z_stream_s
132 The application must update next_in and avail_in when avail_in has dropped
256 - Compress more input starting at next_in and update next_in and avail_in
258 enough room in the output buffer), next_in and avail_in are updated and
269 output, and updating avail_in or avail_out accordingly; avail_out should
283 particular avail_in is zero after the call if enough output space has been
347 (for example avail_in or avail_out was zero). Note that Z_BUF_ERROR is not
371 next_in, avail_in, zalloc, zfree and opaque must be initialized before by
372 the caller. If next_in is not Z_NULL and avail_in i
[all...]
/forgerock/web-agents-v4/source/
H A Dutility.c670 strm.avail_in = (uInt) * compressed_sz;
731 strm.avail_in = ucomp_length;

Completed in 657 milliseconds