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

12

/illumos-gate/usr/src/boot/lib/libz/
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.c51 If strm->avail_in != 0, then the current data is moved to the beginning of
63 if (strm->avail_in) { /* copy what's there to the start */
66 unsigned n = strm->avail_in;
71 if (gz_load(state, state->in + strm->avail_in,
72 state->size - strm->avail_in, &got) == -1)
74 strm->avail_in += got;
113 state->strm.avail_in = 0;
125 if (strm->avail_in < 2) {
128 if (strm->avail_in == 0)
139 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.c67 /* Compress whatever is at avail_in and next_in and write to the output file.
87 got = write(state->fd, strm->next_in, strm->avail_in);
88 if (got < 0 || (unsigned)got != strm->avail_in) {
92 strm->avail_in = 0;
145 if (strm->avail_in && gz_comp(state, Z_NO_FLUSH) == -1)
157 strm->avail_in = n;
215 if (strm->avail_in == 0)
217 have = (unsigned)((strm->next_in + strm->avail_in) - state->in);
222 strm->avail_in += copy;
232 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.c90 state->strm.avail_in = 0; /* no input data yet */
407 state->strm.avail_in = 0;
499 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;
/illumos-gate/usr/src/uts/common/zmod/
H A Dzmod.c47 zs.avail_in = srclen;
78 zs.avail_in = srclen;
H A Dinffast.c45 strm->avail_in >= 6
61 Therefore if strm->avail_in >= 6, then there is enough input to avoid
102 last = in + (strm->avail_in - 5);
298 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
H A Dinflate.c25 * - Change inffast.c entry and loop from avail_in >= 7 to >= 6
415 have = strm->avail_in; \
426 strm->avail_in = have; \
544 Progress is defined as a change in either strm->avail_in or strm->avail_out.
585 (strm->next_in == Z_NULL && strm->avail_in != 0))
1167 in -= strm->avail_in;
1300 if (strm->avail_in == 0 && state->bits < 8) return Z_BUF_ERROR;
1318 len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1319 strm->avail_in -= len;
/illumos-gate/usr/src/boot/lib/libstand/
H A Dbzipfs.c90 req = BZ_BUFSIZE - bzf->bzf_bzstream.avail_in;
100 result = read(bzf->bzf_rawfd, bzf->bzf_buf + bzf->bzf_bzstream.avail_in, req);
103 bzf->bzf_bzstream.avail_in += result;
116 if ((bzf->bzf_bzstream.avail_in == 0) && (bzf_fill(bzf) == -1))
118 bzf->bzf_bzstream.avail_in--;
144 bzf->bzf_bzstream.avail_in += 4;
239 if ((bzf->bzf_bzstream.avail_in == 0) && (bzf_fill(bzf) == -1)) {
243 if (bzf->bzf_bzstream.avail_in == 0) { /* oops, unexpected EOF */
H A Dgzipfs.c71 req = Z_BUFSIZE - zf->zf_zstream.avail_in;
81 result = read(zf->zf_rawfd, zf->zf_buf + zf->zf_zstream.avail_in, req);
84 zf->zf_zstream.avail_in += result;
97 if ((zf->zf_zstream.avail_in == 0) && (zf_fill(zf) == -1))
99 zf->zf_zstream.avail_in--;
249 if ((zf->zf_zstream.avail_in == 0) && (zf_fill(zf) == -1)) {
253 if (zf->zf_zstream.avail_in == 0) { /* oops, unexpected EOF */
282 zf->zf_zstream.avail_in = 0;
H A Dpkgfs.c424 if (pkg->pkg_zs.avail_in == 0) {
428 pkg->pkg_zs.avail_in = c;
434 pkg->pkg_zs.avail_in--;
448 if (pkg->pkg_zs.avail_in == 0) {
454 pkg->pkg_zs.avail_in = c;
/illumos-gate/usr/src/boot/lib/libz/test/
H A Dinfcover.c294 strm.avail_in = 0;
314 strm.avail_in = step;
338 have += strm.avail_in;
339 strm.avail_in = step > have ? have : step;
340 have -= strm.avail_in;
341 } while (strm.avail_in);
356 strm.avail_in = 0;
374 strm.avail_in = 0;
380 strm.avail_in = 0;
414 strm.avail_in
[all...]
H A Dexample.c219 c_stream.avail_in = c_stream.avail_out = 1; /* force small buffers */
252 d_stream.avail_in = 0;
259 d_stream.avail_in = d_stream.avail_out = 1; /* force small buffers */
300 c_stream.avail_in = (uInt)uncomprLen;
303 if (c_stream.avail_in != 0) {
311 c_stream.avail_in = (uInt)comprLen/2;
318 c_stream.avail_in = (uInt)uncomprLen;
348 d_stream.avail_in = (uInt)comprLen;
392 c_stream.avail_in = 3;
398 c_stream.avail_in
[all...]
H A Dminigzip.c215 gz->strm.avail_in = Z_NULL;
248 strm->avail_in = len;
282 strm->avail_in = 1;
308 strm->avail_in = 0;
/illumos-gate/usr/src/boot/sys/boot/zfs/
H A Dgzip.c36 zs.avail_in = srclen;
/illumos-gate/usr/src/common/fs/
H A Ddecompress.c158 zsp->avail_in = 0;
196 zsp->avail_in = 0;
229 if (zsp->avail_in == 0 && filep->fi_cfoff < ip->i_size) {
242 zsp->avail_in = filep->fi_count;
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Ddeflate.c260 state->strm.avail_in = mi + inlen - rptr;
261 rlen = state->strm.avail_in + PPP_HDRLEN + DEFLATE_OVHD;
324 state->strm.avail_in = rlen;
H A Dzlib.h161 uInt avail_in; /* number of bytes available at next_in */ member in struct:z_stream_s
180 The application must update next_in and avail_in when avail_in has
274 - Compress more input starting at next_in and update next_in and avail_in
276 enough room in the output buffer), next_in and avail_in are updated and
287 more output, and updating avail_in or avail_out accordingly; avail_out
331 0.1% larger than avail_in plus 12 bytes. If deflate does not return
377 - Decompress more input starting at next_in and update next_in and avail_in
491 must provide more input only by increasing avail_in. next_in is always
595 This function adds the data at next_in (avail_in byte
[all...]
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Ddeflate.c433 state->strm.avail_in = mp->b_wptr - rptr;
451 if (state->strm.avail_in == 0) {
459 state->strm.avail_in = mp->b_wptr - mp->b_rptr;
580 state->strm.avail_in = rlen;
602 state->strm.avail_in = mp->b_wptr - mp->b_rptr;
604 rlen += state->strm.avail_in;
888 state->strm.avail_in = mi->b_wptr - rptr;
890 rlen = state->strm.avail_in + PPP_HDRLEN + DEFLATE_OVHD;
922 if (state->strm.avail_in == 0) {
933 state->strm.avail_in
[all...]
/illumos-gate/usr/src/common/bzip2/
H A Dbzlib.c439 if (s->strm->avail_in == 0) break;
443 s->strm->avail_in--;
455 if (s->strm->avail_in == 0) break;
461 s->strm->avail_in--;
534 if (s->strm->avail_in == 0) {
568 s->avail_in_expect = strm->avail_in;
574 s->avail_in_expect = strm->avail_in;
583 if (s->avail_in_expect != s->strm->avail_in)
593 if (s->avail_in_expect != s->strm->avail_in)
1131 bzf->strm.avail_in
[all...]
H A Dbzlib.h54 unsigned int avail_in; member in struct:__anon1947

Completed in 76 milliseconds

12