| /external/libxml2/ |
| D | xzlib.c | 132 state->strm.avail_in = 0; /* no input data yet */ in xz_reset()
134 state->zstrm.avail_in = 0; /* no input data yet */ in xz_reset()
263 unsigned tmp = strm->avail_in; in xz_avail()
266 strm->avail_in = tmp; in xz_avail()
269 strm->avail_in = tmp; in xz_avail()
280 state->strm.avail_in = state->zstrm.avail_in; in xz_avail_zstrm()
283 state->zstrm.avail_in = (uInt) state->strm.avail_in; in xz_avail_zstrm()
294 return strm->avail_in >= 6 && memcmp(state->in, "\3757zXZ", 6) == 0; in is_format_xz()
308 if (strm->avail_in < 13) in is_format_lzma()
355 #define NEXT() ((strm->avail_in == 0 && xz_avail(state) == -1) ? -1 : \
[all …]
|
| /external/brotli/c/dec/ |
| D | bit_reader.h | 48 size_t avail_in; member
55 size_t avail_in; member
73 to->avail_in = from->avail_in; in BrotliBitReaderSaveState()
81 to->avail_in = from->avail_in; in BrotliBitReaderRestoreState()
92 return br->avail_in + (BrotliGetAvailableBits(br) >> 3); in BrotliGetRemainingBytes()
99 return TO_BROTLI_BOOL(br->avail_in >= num); in BrotliCheckInputAmount()
114 br->avail_in -= 7; in BrotliFillBitWindow()
123 br->avail_in -= 6; in BrotliFillBitWindow()
131 br->avail_in -= BROTLI_SHORT_FILL_BIT_WINDOW_READ; in BrotliFillBitWindow()
141 br->avail_in -= 3; in BrotliFillBitWindow()
[all …]
|
| /external/zlib/src/ |
| D | gzwrite.c | 87 while (strm->avail_in) {
88 put = strm->avail_in > max ? max : strm->avail_in;
94 strm->avail_in -= (unsigned)writ;
154 if (strm->avail_in && gz_comp(state, Z_NO_FLUSH) == -1)
166 strm->avail_in = n;
206 if (state->strm.avail_in == 0)
208 have = (unsigned)((state->strm.next_in + state->strm.avail_in) -
214 state->strm.avail_in += copy;
224 if (state->strm.avail_in && gz_comp(state, Z_NO_FLUSH) == -1)
233 state->strm.avail_in = n;
[all …]
|
| D | gzread.c | 65 if (strm->avail_in) { /* copy what's there to the start */
68 unsigned n = strm->avail_in;
73 if (gz_load(state, state->in + strm->avail_in,
74 state->size - strm->avail_in, &got) == -1)
76 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 > 1 &&
150 strm->avail_in = 0;
[all …]
|
| D | uncompr.c | 50 stream.avail_in = 0;
66 if (stream.avail_in == 0) {
67 stream.avail_in = len > (uLong)max ? max : (uInt)len;
68 len -= stream.avail_in;
73 *sourceLen -= len + stream.avail_in;
|
| D | compress.c | 47 stream.avail_in = 0;
54 if (stream.avail_in == 0) {
55 stream.avail_in = sourceLen > (uLong)max ? max : (uInt)sourceLen;
56 sourceLen -= stream.avail_in;
|
| /external/python/cpython2/Modules/zlib/ |
| D | gzwrite.c | 87 while (strm->avail_in) {
88 put = strm->avail_in > max ? max : strm->avail_in;
94 strm->avail_in -= (unsigned)writ;
154 if (strm->avail_in && gz_comp(state, Z_NO_FLUSH) == -1)
166 strm->avail_in = n;
206 if (state->strm.avail_in == 0)
208 have = (unsigned)((state->strm.next_in + state->strm.avail_in) -
214 state->strm.avail_in += copy;
224 if (state->strm.avail_in && gz_comp(state, Z_NO_FLUSH) == -1)
233 state->strm.avail_in = n;
[all …]
|
| D | gzread.c | 65 if (strm->avail_in) { /* copy what's there to the start */
68 unsigned n = strm->avail_in;
73 if (gz_load(state, state->in + strm->avail_in,
74 state->size - strm->avail_in, &got) == -1)
76 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 > 1 &&
150 strm->avail_in = 0;
[all …]
|
| D | uncompr.c | 50 stream.avail_in = 0;
66 if (stream.avail_in == 0) {
67 stream.avail_in = len > (uLong)max ? max : (uInt)len;
68 len -= stream.avail_in;
73 *sourceLen -= len + stream.avail_in;
|
| D | example.c | 219 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 = len - 3;
[all …]
|
| D | compress.c | 47 stream.avail_in = 0;
54 if (stream.avail_in == 0) {
55 stream.avail_in = sourceLen > (uLong)max ? max : (uInt)sourceLen;
56 sourceLen -= stream.avail_in;
|
| /external/tensorflow/tensorflow/core/lib/io/ |
| D | zlib_outputbuffer.cc | 66 z_stream_->avail_in = 0; in Init()
72 return input_buffer_capacity_ - z_stream_->avail_in; in AvailableInputSpace()
98 int32 unread_bytes = z_stream_->avail_in; in AddToInputBuffer()
102 memmove(z_stream_input_.get(), z_stream_->next_in, z_stream_->avail_in); in AddToInputBuffer()
105 memcpy(z_stream_->next_in + z_stream_->avail_in, data.data(), bytes_to_write); in AddToInputBuffer()
106 z_stream_->avail_in += bytes_to_write; in AddToInputBuffer()
127 DCHECK(z_stream_->avail_in == 0); in DeflateBuffered()
175 z_stream_->avail_in = bytes_to_write; in Append()
186 DCHECK(z_stream_->avail_in == 0); // All input will be used up. in Append()
|
| D | zlib_inputstream.cc | 102 z_stream_def_->stream->avail_in = 0; in InitZlibBuffer()
112 z_stream_def_->stream->avail_in = 0; in InitZlibBuffer()
122 if (z_stream_def_->stream->avail_in > 0) { in ReadFromStream()
129 z_stream_def_->stream->avail_in); in ReadFromStream()
132 bytes_to_read -= z_stream_def_->stream->avail_in; in ReadFromStream()
133 read_location += z_stream_def_->stream->avail_in; in ReadFromStream()
147 z_stream_def_->stream->avail_in += data.size(); in ReadFromStream()
205 if (z_stream_def_->stream->avail_in == 0) { in ReadNBytes()
|
| /external/bsdiff/ |
| D | brotli_compressor.cc | 49 size_t avail_in = size; in Write() local
50 while (avail_in > 0) { in Write()
54 brotli_encoder_state_, BROTLI_OPERATION_PROCESS, &avail_in, in Write()
56 LOG(ERROR) << "BrotliCompressor failed to compress " << avail_in in Write()
74 size_t avail_in = 0; in Finish() local
79 brotli_encoder_state_, BROTLI_OPERATION_FINISH, &avail_in, &next_in, in Finish()
|
| /external/protobuf/src/google/protobuf/io/ |
| D | gzip_stream.cc | 58 zcontext_.avail_in = 0; in GzipInputStream()
91 } else if (zcontext_.avail_in == 0) { in Inflate()
102 zcontext_.avail_in = in_size; in Inflate()
225 zcontext_.avail_in = 0; in Init()
279 if (zcontext_.avail_in != 0) { in Next()
285 if (zcontext_.avail_in == 0) { in Next()
288 zcontext_.avail_in = input_buffer_length_; in Next()
298 GOOGLE_CHECK_GE(zcontext_.avail_in, count); in BackUp()
299 zcontext_.avail_in -= count; in BackUp()
302 return zcontext_.total_in + zcontext_.avail_in; in ByteCount()
[all …]
|
| /external/zlib/src/test/ |
| D | infcover.c | 294 strm.avail_in = 0; in inf()
314 strm.avail_in = step; in inf()
338 have += strm.avail_in; in inf()
339 strm.avail_in = step > have ? have : step; in inf()
340 have -= strm.avail_in; in inf()
341 } while (strm.avail_in); in inf()
356 strm.avail_in = 0; in cover_support()
374 strm.avail_in = 0; in cover_support()
380 strm.avail_in = 0; in cover_support()
414 strm.avail_in = 0; in cover_wrap()
[all …]
|
| D | example.c | 219 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 = len - 3;
[all …]
|
| /external/zlib/src/examples/ |
| D | zran.c | 158 strm.avail_in = 0; in build_index()
172 strm.avail_in = fread(input, 1, CHUNK, in); in build_index()
177 if (strm.avail_in == 0) { in build_index()
193 totin += strm.avail_in; in build_index()
196 totin -= strm.avail_in; in build_index()
224 } while (strm.avail_in != 0); in build_index()
272 strm.avail_in = 0; in extract()
292 strm.avail_in = 0; in extract()
314 if (strm.avail_in == 0) { in extract()
315 strm.avail_in = fread(input, 1, CHUNK, in); in extract()
[all …]
|
| D | zpipe.c | 54 strm.avail_in = fread(in, 1, CHUNK, source); in def()
75 assert(strm.avail_in == 0); /* all input will be used */ in def()
104 strm.avail_in = 0; in inf()
112 strm.avail_in = fread(in, 1, CHUNK, source); in inf()
117 if (strm.avail_in == 0) in inf()
|
| /external/curl/lib/ |
| D | content_encoding.c | 140 uInt len = z->avail_in < zp->trailerlen? z->avail_in: zp->trailerlen; in process_trailer()
146 z->avail_in -= len; in process_trailer()
148 if(z->avail_in) in process_trailer()
164 uInt nread = z->avail_in; in inflate_stream()
234 z->avail_in = nread; in inflate_stream()
289 z->avail_in = (uInt) nbytes; in deflate_unencode_write()
444 z->avail_in = (uInt) nbytes; in gzip_unencode_write()
475 z->avail_in = (uInt) (nbytes - hlen); in gzip_unencode_write()
487 z->avail_in = (uInt) nbytes; in gzip_unencode_write()
488 z->next_in = malloc(z->avail_in); in gzip_unencode_write()
[all …]
|
| /external/zlib/src/contrib/pascal/ |
| D | example.pas | 205 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 := len - 3;
[all …]
|
| /external/zlib/src/contrib/delphi/ |
| D | ZLib.pas | 25 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 = 0 then
[all …]
|
| /external/squashfs-tools/squashfs-tools/ |
| D | lzma_xz_wrapper.c | 58 strm.avail_in = size; in lzma_compress()
128 strm.avail_in = LZMA_HEADER_SIZE; in lzma_uncompress()
132 if(res != LZMA_OK || strm.avail_in != 0) { in lzma_uncompress()
138 strm.avail_in = size - LZMA_HEADER_SIZE; in lzma_uncompress()
144 strm.total_out >= uncompressed_size && strm.avail_in == 0)) in lzma_uncompress()
|
| /external/pdfium/third_party/libtiff/ |
| D | tif_zip.c | 139 assert(sizeof(sp->stream.avail_in)==4); /* if this assert gets raised, in ZIPPreDecode()
143 sp->stream.avail_in = (uInt) tif->tif_rawcc; in ZIPPreDecode()
144 if ((tmsize_t)sp->stream.avail_in != tif->tif_rawcc) in ZIPPreDecode()
163 sp->stream.avail_in = (uInt) tif->tif_rawcc; in ZIPDecode()
202 tif->tif_rawcc = sp->stream.avail_in; in ZIPDecode()
270 assert(sizeof(sp->stream.avail_in)==4); /* if this assert gets raised, in ZIPEncode()
274 sp->stream.avail_in = (uInt) cc; in ZIPEncode()
275 if ((tmsize_t)sp->stream.avail_in != cc) in ZIPEncode()
293 } while (sp->stream.avail_in > 0); in ZIPEncode()
308 sp->stream.avail_in = 0; in ZIPPostEncode()
|
| /external/libevent/test/ |
| D | regress_zlib.c | 145 p->avail_in = v_in[0].iov_len; in zlib_input_filter()
148 p->avail_in = 0; in zlib_input_filter()
160 nread = v_in[0].iov_len - p->avail_in; in zlib_input_filter()
199 p->avail_in = v_in[0].iov_len; in zlib_output_filter()
202 p->avail_in = 0; in zlib_output_filter()
214 nread = v_in[0].iov_len - p->avail_in; in zlib_output_filter()
|