| line |
true |
false |
branch |
|
30
|
0 |
0 |
if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
|
|
|
0 |
0 |
if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
|
|
|
0 |
0 |
if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
|
|
33
|
0 |
0 |
if (strm == Z_NULL || window == Z_NULL ||
|
|
|
0 |
0 |
if (strm == Z_NULL || window == Z_NULL ||
|
|
|
0 |
0 |
if (strm == Z_NULL || window == Z_NULL ||
|
|
34
|
0 |
0 |
windowBits < 8 || windowBits > 15)
|
|
37
|
0 |
0 |
if (strm->zalloc == (alloc_func)0) {
|
|
45
|
0 |
0 |
if (strm->zfree == (free_func)0)
|
|
53
|
0 |
0 |
if (state == Z_NULL) return Z_MEM_ERROR;
|
|
209
|
0 |
0 |
if (strm == Z_NULL || strm->state == Z_NULL)
|
|
|
0 |
0 |
if (strm == Z_NULL || strm->state == Z_NULL)
|
|
219
|
0 |
0 |
have = next != Z_NULL ? strm->avail_in : 0;
|
|
230
|
0 |
0 |
if (state->last) {
|
|
235
|
0 |
0 |
NEEDBITS(3);
|
|
|
0 |
0 |
NEEDBITS(3);
|
|
|
0 |
0 |
NEEDBITS(3);
|
|
265
|
0 |
0 |
NEEDBITS(32);
|
|
|
0 |
0 |
NEEDBITS(32);
|
|
|
0 |
0 |
NEEDBITS(32);
|
|
266
|
0 |
0 |
if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
|
|
277
|
0 |
0 |
while (state->length != 0) {
|
|
279
|
0 |
0 |
PULL();
|
|
|
0 |
0 |
PULL();
|
|
280
|
0 |
0 |
ROOM();
|
|
|
0 |
0 |
ROOM();
|
|
281
|
0 |
0 |
if (copy > have) copy = have;
|
|
282
|
0 |
0 |
if (copy > left) copy = left;
|
|
296
|
0 |
0 |
NEEDBITS(14);
|
|
|
0 |
0 |
NEEDBITS(14);
|
|
|
0 |
0 |
NEEDBITS(14);
|
|
304
|
0 |
0 |
if (state->nlen > 286 || state->ndist > 30) {
|
|
|
0 |
0 |
if (state->nlen > 286 || state->ndist > 30) {
|
|
315
|
0 |
0 |
while (state->have < state->ncode) {
|
|
316
|
0 |
0 |
NEEDBITS(3);
|
|
|
0 |
0 |
NEEDBITS(3);
|
|
|
0 |
0 |
NEEDBITS(3);
|
|
320
|
0 |
0 |
while (state->have < 19)
|
|
327
|
0 |
0 |
if (ret) {
|
|
336
|
0 |
0 |
while (state->have < state->nlen + state->ndist) {
|
|
339
|
0 |
0 |
if ((unsigned)(here.bits) <= bits) break;
|
|
340
|
0 |
0 |
PULLBYTE();
|
|
|
0 |
0 |
PULLBYTE();
|
|
342
|
0 |
0 |
if (here.val < 16) {
|
|
347
|
0 |
0 |
if (here.val == 16) {
|
|
348
|
0 |
0 |
NEEDBITS(here.bits + 2);
|
|
|
0 |
0 |
NEEDBITS(here.bits + 2);
|
|
|
0 |
0 |
NEEDBITS(here.bits + 2);
|
|
350
|
0 |
0 |
if (state->have == 0) {
|
|
360
|
0 |
0 |
else if (here.val == 17) {
|
|
361
|
0 |
0 |
NEEDBITS(here.bits + 3);
|
|
|
0 |
0 |
NEEDBITS(here.bits + 3);
|
|
|
0 |
0 |
NEEDBITS(here.bits + 3);
|
|
368
|
0 |
0 |
NEEDBITS(here.bits + 7);
|
|
|
0 |
0 |
NEEDBITS(here.bits + 7);
|
|
|
0 |
0 |
NEEDBITS(here.bits + 7);
|
|
374
|
0 |
0 |
if (state->have + copy > state->nlen + state->ndist) {
|
|
380
|
0 |
0 |
while (copy--)
|
|
386
|
0 |
0 |
if (state->mode == BAD) break;
|
|
389
|
0 |
0 |
if (state->lens[256] == 0) {
|
|
404
|
0 |
0 |
if (ret) {
|
|
413
|
0 |
0 |
if (ret) {
|
|
424
|
0 |
0 |
if (have >= 6 && left >= 258) {
|
|
|
0 |
0 |
if (have >= 6 && left >= 258) {
|
|
426
|
0 |
0 |
if (state->whave < state->wsize)
|
|
436
|
0 |
0 |
if ((unsigned)(here.bits) <= bits) break;
|
|
437
|
0 |
0 |
PULLBYTE();
|
|
|
0 |
0 |
PULLBYTE();
|
|
439
|
0 |
0 |
if (here.op && (here.op & 0xf0) == 0) {
|
|
|
0 |
0 |
if (here.op && (here.op & 0xf0) == 0) {
|
|
444
|
0 |
0 |
if ((unsigned)(last.bits + here.bits) <= bits) break;
|
|
445
|
0 |
0 |
PULLBYTE();
|
|
|
0 |
0 |
PULLBYTE();
|
|
453
|
0 |
0 |
if (here.op == 0) {
|
|
457
|
0 |
0 |
ROOM();
|
|
|
0 |
0 |
ROOM();
|
|
465
|
0 |
0 |
if (here.op & 32) {
|
|
472
|
0 |
0 |
if (here.op & 64) {
|
|
480
|
0 |
0 |
if (state->extra != 0) {
|
|
481
|
0 |
0 |
NEEDBITS(state->extra);
|
|
|
0 |
0 |
NEEDBITS(state->extra);
|
|
|
0 |
0 |
NEEDBITS(state->extra);
|
|
490
|
0 |
0 |
if ((unsigned)(here.bits) <= bits) break;
|
|
491
|
0 |
0 |
PULLBYTE();
|
|
|
0 |
0 |
PULLBYTE();
|
|
493
|
0 |
0 |
if ((here.op & 0xf0) == 0) {
|
|
498
|
0 |
0 |
if ((unsigned)(last.bits + here.bits) <= bits) break;
|
|
499
|
0 |
0 |
PULLBYTE();
|
|
|
0 |
0 |
PULLBYTE();
|
|
504
|
0 |
0 |
if (here.op & 64) {
|
|
513
|
0 |
0 |
if (state->extra != 0) {
|
|
514
|
0 |
0 |
NEEDBITS(state->extra);
|
|
|
0 |
0 |
NEEDBITS(state->extra);
|
|
|
0 |
0 |
NEEDBITS(state->extra);
|
|
518
|
0 |
0 |
if (state->offset > state->wsize - (state->whave < state->wsize ?
|
|
519
|
0 |
0 |
left : 0)) {
|
|
528
|
0 |
0 |
ROOM();
|
|
|
0 |
0 |
ROOM();
|
|
530
|
0 |
0 |
if (copy < left) {
|
|
538
|
0 |
0 |
if (copy > state->length) copy = state->length;
|
|
543
|
0 |
0 |
} while (--copy);
|
|
544
|
0 |
0 |
} while (state->length != 0);
|
|
564
|
0 |
0 |
if (left < state->wsize) {
|
|
565
|
0 |
0 |
if (out(out_desc, state->window, state->wsize - left) &&
|
|
|
0 |
0 |
if (out(out_desc, state->window, state->wsize - left) &&
|
|
575
|
0 |
0 |
if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
|
|
|
0 |
0 |
if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
|
|
|
0 |
0 |
if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
|