/external/bzip2/ |
H A D | bzlib.h | 50 char *next_in; member in struct:__anon1050
|
/external/kernel-headers/original/linux/ |
H A D | zlib.h | 85 Byte *next_in; /* next input byte */ member in struct:z_stream_s 86 uInt avail_in; /* number of bytes available at next_in */ 106 The application must update next_in and avail_in when avail_in has 222 - Compress more input starting at next_in and update next_in and avail_in 224 enough room in the output buffer), next_in and avail_in are updated and 285 if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible 315 next_in, avail_in, and workspace must be initialized before by 316 the caller. If next_in is not NULL and avail_in is large enough (the exact 327 the zlib header if present: this will be done by inflate(). (So next_in an [all...] |
/external/zlib/contrib/dotzlib/DotZLib/ |
H A D | DotZLib.cs | 32 public IntPtr next_in;
field in struct:DotZLib.ZStream
|
/external/chromium/sdch/open-vcdiff/src/ |
H A D | zlib.h | 83 Bytef *next_in; /* next input byte */ member in struct:z_stream_s 84 uInt avail_in; /* number of bytes available at next_in */ 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 321 if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible 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 is large enough (the exact 358 the zlib header if present: this will be done by inflate(). (So next_in an [all...] |
/external/qemu/distrib/zlib-1.2.3/ |
H A D | zlib.h | 83 Bytef *next_in; /* next input byte */ member in struct:z_stream_s 84 uInt avail_in; /* number of bytes available at next_in */ 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 321 if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible 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 is large enough (the exact 358 the zlib header if present: this will be done by inflate(). (So next_in an [all...] |
/external/zlib/ |
H A D | zlib.h | 86 z_const Bytef *next_in; /* next input byte */ member in struct:z_stream_s 87 uInt avail_in; /* number of bytes available at next_in */ 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 346 if next_in or next_out was Z_NULL), Z_BUF_ERROR if no progress is possible 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 is large enough (the 385 will be done by inflate(). (So next_in an [all...] |
/external/valgrind/main/VEX/switchback/ |
H A D | test_bzip2.c | 165 char *next_in; member in struct:__anon12092 1393 (*((UChar*)(s->strm->next_in)))); \ 1395 s->strm->next_in++; \ 4653 ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 4654 s->strm->next_in++; 4671 ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 4672 s->strm->next_in++; 5320 bzf->strm.next_in = buf; 5470 bzf->strm.next_in = bzf->buf; 5531 bzf->strm.next_in [all...] |
/external/valgrind/main/exp-sgcheck/tests/ |
H A D | hackedbz2.c | 188 char *next_in; member in struct:__anon12546 1417 (*((UChar*)(s->strm->next_in)))); \ 1419 s->strm->next_in++; \ 4677 ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 4678 s->strm->next_in++; 4695 ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 4696 s->strm->next_in++; 5344 bzf->strm.next_in = buf; 5494 bzf->strm.next_in = bzf->buf; 5555 bzf->strm.next_in [all...] |
/external/valgrind/main/memcheck/tests/ |
H A D | origin5-bz2.c | 181 char *next_in; member in struct:__anon12739 1408 (*((UChar*)(s->strm->next_in)))); \ 1410 s->strm->next_in++; \ 4668 ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 4669 s->strm->next_in++; 4686 ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 4687 s->strm->next_in++; 5335 bzf->strm.next_in = buf; 5485 bzf->strm.next_in = bzf->buf; 5546 bzf->strm.next_in [all...] |
H A D | varinfo6.c | 219 char *next_in; member in struct:__anon12769 1446 (*((UChar*)(s->strm->next_in)))); \ 1448 s->strm->next_in++; \ 4706 ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 4707 s->strm->next_in++; 4724 ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 4725 s->strm->next_in++; 5373 bzf->strm.next_in = buf; 5523 bzf->strm.next_in = bzf->buf; 5584 bzf->strm.next_in [all...] |
/external/valgrind/main/perf/ |
H A D | bz2.c | 181 char *next_in; member in struct:__anon12857 1408 (*((UChar*)(s->strm->next_in)))); \ 1410 s->strm->next_in++; \ 4668 ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 4669 s->strm->next_in++; 4686 ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 4687 s->strm->next_in++; 5335 bzf->strm.next_in = buf; 5485 bzf->strm.next_in = bzf->buf; 5546 bzf->strm.next_in [all...] |
H A D | test_input_for_tinycc.c | 921 char *next_in; member in struct:__anon12870 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 == 0) { retVal = 0; goto save_state_and_return; };; s->bsBuff = (s->bsBuff << 8) | ((UInt32) (*((UChar*)(s->strm->next_in)))); [all...] |