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

1234

/external/qemu/distrib/zlib-1.2.3/
H A Duncompr.c36 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 Dcompress.c33 stream.avail_in = (uInt)sourceLen;
36 if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR;
H A Dgzio.c116 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...]
/external/zlib/src/
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 */
62 unsigned n = strm->avail_in;
67 if (gz_load(state, state->in + strm->avail_in,
68 state->size - strm->avail_in, &got) == -1)
70 strm->avail_in += got;
109 state->strm.avail_in = 0;
121 if (strm->avail_in < 2) {
124 if (strm->avail_in == 0)
135 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;
211 if (strm->avail_in == 0)
213 n = state->size - strm->avail_in;
216 memcpy(strm->next_in + strm->avail_in, buf, n);
217 strm->avail_in
[all...]
/external/skia/src/core/
H A DSkFlate.cpp41 flateData.avail_in = 0;
57 flateData.avail_in = 0;
60 flateData.avail_in = inputLength;
75 if (flateData.avail_in == 0) {
82 flateData.avail_in = read;
/external/protobuf/src/google/protobuf/io/
H A Dgzip_stream.cc57 zcontext_.avail_in = 0;
79 } else if (zcontext_.avail_in == 0) {
90 zcontext_.avail_in = in_size;
213 zcontext_.avail_in = 0;
270 if (zcontext_.avail_in != 0) {
276 if (zcontext_.avail_in == 0) {
279 zcontext_.avail_in = input_buffer_length_;
283 // The loop in Deflate should consume all avail_in
289 GOOGLE_CHECK_GE(zcontext_.avail_in, count);
290 zcontext_.avail_in
[all...]
/external/zlib/src/examples/
H A Dzran.c153 strm.avail_in = 0;
167 strm.avail_in = fread(input, 1, CHUNK, in);
172 if (strm.avail_in == 0) {
188 totin += strm.avail_in;
191 totin -= strm.avail_in;
219 } while (strm.avail_in != 0);
267 strm.avail_in = 0;
287 strm.avail_in = 0;
309 if (strm.avail_in == 0) {
310 strm.avail_in
[all...]
H A Dfitblk.c80 def->avail_in = fread(raw, 1, RAWLEN, in);
113 def->avail_in = RAWLEN - inf->avail_out;
183 inf.avail_in = 0;
193 inf.avail_in = size + EXCESS;
208 inf.avail_in = size - MARGIN; /* assure stream will complete */
H A Dzpipe.c54 strm.avail_in = fread(in, 1, CHUNK, source);
75 assert(strm.avail_in == 0); /* all input will be used */
104 strm.avail_in = 0;
112 strm.avail_in = fread(in, 1, CHUNK, source);
117 if (strm.avail_in == 0)
H A Dgzjoin.c259 strm->avail_in = in->left;
302 strm.avail_in = 0;
318 if (strm.avail_in == 0 && strm.avail_out != 0) {
358 if (strm.avail_in == 0) {
373 in->left = strm.avail_in;
H A Dgzappend.c291 strm->avail_in = gz.left;
297 if (strm->avail_in == 0) {
299 strm->avail_in = gz.left;
329 lastoff = lseek(gz.fd, 0L, SEEK_CUR) - strm->avail_in;
334 gz.left = strm->avail_in;
416 strm->avail_in = (unsigned)len;
/external/chromium/chrome/common/
H A Dbzip2_unittest.cc38 stream.avail_in = arraysize(input) - 1;
59 stream.avail_in = written;
/external/zlib/src/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...]
/external/openssh/
H A Dcompress.c101 outgoing_stream.avail_in = buffer_len(input_buffer);
141 incoming_stream.avail_in = buffer_len(input_buffer);
/external/openssl/crypto/comp/
H A Dc_zlib.c153 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...]
/external/libppp/src/
H A Ddeflate.c107 state->cx.avail_in = mi->m_len;
126 if (state->cx.avail_in == 0 && mi->m_next != NULL) {
129 state->cx.avail_in = mi->m_len;
247 state->cx.avail_in = mi->m_len;
271 if (state->cx.avail_in == 0 && mi && (mi = m_free(mi)) != NULL) {
274 ilen += (state->cx.avail_in = mi->m_len);
330 state->cx.avail_in = sizeof EMPTY_BLOCK;
373 state->cx.avail_in = mi->m_len;
387 log_Printf(LogCCP, "DeflateDictSetup: avail_in %d, avail_out %d\n",
388 state->cx.avail_in, stat
[all...]
/external/chromium/net/base/
H A Dgzip_filter.cc213 zlib_stream_.get()->avail_in = stream_data_len_;
226 stream_data_len_ = zlib_stream_.get()->avail_in;
249 stream_data_len_ = zlib_stream_.get()->avail_in;
279 zlib_stream_.get()->avail_in = sizeof(dummy_head);
/external/zlib/src/contrib/pascal/
H A Dexample.pas205 c_stream.avail_in := 1;
241 d_stream.avail_in := 0;
251 d_stream.avail_in := 1;
291 c_stream.avail_in := Integer(uncomprLen);
294 if c_stream.avail_in <> 0 then
300 c_stream.avail_in := Integer(comprLen div 2);
307 c_stream.avail_in := Integer(uncomprLen);
336 d_stream.avail_in := Integer(comprLen);
384 c_stream.avail_in := 3;
390 c_stream.avail_in
[all...]
/external/zlib/src/contrib/delphi/
H A DZLib.pas25 avail_in: Integer; // number of bytes available at next_in
299 strm.avail_in := InBytes;
342 strm.avail_in := InBytes;
375 strm.avail_in := InBytes;
421 FZRec.avail_in := 0;
447 FZRec.avail_in := Count;
449 while (FZRec.avail_in > 0) do
487 FZRec.avail_in := 0;
493 FStrm.Seek(-FZRec.avail_in, 1);
505 if FZRec.avail_in
[all...]
/external/bzip2/
H A Dbzlib.c300 if (s->strm->avail_in == 0) break;
304 s->strm->avail_in--;
316 if (s->strm->avail_in == 0) break;
322 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)
454 if (s->avail_in_expect != s->strm->avail_in)
956 bzf->strm.avail_in
[all...]
/external/valgrind/main/perf/
H A Dtest_input_for_tinycc.c922 unsigned int avail_in; member in struct:__anon14232
1519 case 10: s->state = 10; while (((Bool)1)) { if (s->bsLive >= 8) { UInt32 v; v = (s->bsBuff >> (s->bsLive-8)) & ((1 << 8)-1); s->bsLive -= 8; uc = v; break; } if (s->strm->avail_in == 0) { retVal = 0; goto save_state_and_return; };; s->bsBuff = (s->bsBuff << 8) | ((UInt32) (*((UChar*)(s->strm->next_in)))); s->bsLive += 8; s->strm->next_in++; s->strm->avail_in--; s->strm->total_in_lo32++; if (s->strm->total_in_lo32 == 0) s->strm->total_in_hi32++; };
1522 case 11: s->state = 11; while (((Bool)1)) { if (s->bsLive >= 8) { UInt32 v; v = (s->bsBuff >> (s->bsLive-8)) & ((1 << 8)-1); s->bsLive -= 8; uc = v; break; } if (s->strm->avail_in == 0) { retVal = 0; goto save_state_and_return; };; s->bsBuff = (s->bsBuff << 8) | ((UInt32) (*((UChar*)(s->strm->next_in)))); s->bsLive += 8; s->strm->next_in++; s->strm->avail_in--; s->strm->total_in_lo32++; if (s->strm->total_in_lo32 == 0) s->strm->total_in_hi32++; };
1525 case 12: s->state = 12; while (((Bool)1)) { if (s->bsLive >= 8) { UInt32 v; v = (s->bsBuff >> (s->bsLive-8)) & ((1 << 8)-1); s->bsLive -= 8; uc = v; break; } if (s->strm->avail_in == 0) { retVal = 0; goto save_state_and_return; };; s->bsBuff = (s->bsBuff << 8) | ((UInt32) (*((UChar*)(s->strm->next_in)))); s->bsLive += 8; s->strm->next_in++; s->strm->avail_in--; s->strm->total_in_lo32++; if (s->strm->total_in_lo32 == 0) s->strm->total_in_hi32++; }
1528 case 13: s->state = 13; while (((Bool)1)) { if (s->bsLive >= 8) { UInt32 v; v = (s->bsBuff >> (s->bsLive-8)) & ((1 << 8)-1); s->bsLive -= 8; s->blockSize100k = v; break; } if (s->strm->avail_in == 0) { retVal = 0; goto save_state_and_return; };; s->bsBuff = (s->bsBuff << 8) | ((UInt32) (*((UChar*)(s->strm->next_in)))); s->bsLive += 8; s->strm->next_in++; s->strm->avail_in--; s->strm->total_in_lo32++; if (s->strm->total_in_lo32 == 0) s->strm->total_in_hi32++; }
1544 case 14: s->state = 14; while (((Bool)1)) { if (s->bsLive >= 8) { UInt32 v; v = (s->bsBuff >> (s->bsLive-8)) & ((1 << 8)-1); s->bsLive -= 8; uc = v; break; } if (s->strm->avail_in
[all...]

Completed in 709 milliseconds

1234