Coverage Report

Created: 2026-09-06 07:18

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/zlib-1.3.2/inflate.c
Line
Count
Source
1
/* inflate.c -- zlib decompression
2
 * Copyright (C) 1995-2026 Mark Adler
3
 * For conditions of distribution and use, see copyright notice in zlib.h
4
 */
5
6
/*
7
 * Change history:
8
 *
9
 * 1.2.beta0    24 Nov 2002
10
 * - First version -- complete rewrite of inflate to simplify code, avoid
11
 *   creation of window when not needed, minimize use of window when it is
12
 *   needed, make inffast.c even faster, implement gzip decoding, and to
13
 *   improve code readability and style over the previous zlib inflate code
14
 *
15
 * 1.2.beta1    25 Nov 2002
16
 * - Use pointers for available input and output checking in inffast.c
17
 * - Remove input and output counters in inffast.c
18
 * - Change inffast.c entry and loop from avail_in >= 7 to >= 6
19
 * - Remove unnecessary second byte pull from length extra in inffast.c
20
 * - Unroll direct copy to three copies per loop in inffast.c
21
 *
22
 * 1.2.beta2    4 Dec 2002
23
 * - Change external routine names to reduce potential conflicts
24
 * - Correct filename to inffixed.h for fixed tables in inflate.c
25
 * - Make hbuf[] unsigned char to match parameter type in inflate.c
26
 * - Change strm->next_out[-state->offset] to *(strm->next_out - state->offset)
27
 *   to avoid negation problem on Alphas (64 bit) in inflate.c
28
 *
29
 * 1.2.beta3    22 Dec 2002
30
 * - Add comments on state->bits assertion in inffast.c
31
 * - Add comments on op field in inftrees.h
32
 * - Fix bug in reuse of allocated window after inflateReset()
33
 * - Remove bit fields--back to byte structure for speed
34
 * - Remove distance extra == 0 check in inflate_fast()--only helps for lengths
35
 * - Change post-increments to pre-increments in inflate_fast(), PPC biased?
36
 * - Add compile time option, POSTINC, to use post-increments instead (Intel?)
37
 * - Make MATCH copy in inflate() much faster for when inflate_fast() not used
38
 * - Use local copies of stream next and avail values, as well as local bit
39
 *   buffer and bit count in inflate()--for speed when inflate_fast() not used
40
 *
41
 * 1.2.beta4    1 Jan 2003
42
 * - Split ptr - 257 statements in inflate_table() to avoid compiler warnings
43
 * - Move a comment on output buffer sizes from inffast.c to inflate.c
44
 * - Add comments in inffast.c to introduce the inflate_fast() routine
45
 * - Rearrange window copies in inflate_fast() for speed and simplification
46
 * - Unroll last copy for window match in inflate_fast()
47
 * - Use local copies of window variables in inflate_fast() for speed
48
 * - Pull out common wnext == 0 case for speed in inflate_fast()
49
 * - Make op and len in inflate_fast() unsigned for consistency
50
 * - Add FAR to lcode and dcode declarations in inflate_fast()
51
 * - Simplified bad distance check in inflate_fast()
52
 * - Added inflateBackInit(), inflateBack(), and inflateBackEnd() in new
53
 *   source file infback.c to provide a call-back interface to inflate for
54
 *   programs like gzip and unzip -- uses window as output buffer to avoid
55
 *   window copying
56
 *
57
 * 1.2.beta5    1 Jan 2003
58
 * - Improved inflateBack() interface to allow the caller to provide initial
59
 *   input in strm.
60
 * - Fixed stored blocks bug in inflateBack()
61
 *
62
 * 1.2.beta6    4 Jan 2003
63
 * - Added comments in inffast.c on effectiveness of POSTINC
64
 * - Typecasting all around to reduce compiler warnings
65
 * - Changed loops from while (1) or do {} while (1) to for (;;), again to
66
 *   make compilers happy
67
 * - Changed type of window in inflateBackInit() to unsigned char *
68
 *
69
 * 1.2.beta7    27 Jan 2003
70
 * - Changed many types to unsigned or unsigned short to avoid warnings
71
 * - Added inflateCopy() function
72
 *
73
 * 1.2.0        9 Mar 2003
74
 * - Changed inflateBack() interface to provide separate opaque descriptors
75
 *   for the in() and out() functions
76
 * - Changed inflateBack() argument and in_func typedef to swap the length
77
 *   and buffer address return values for the input function
78
 * - Check next_in and next_out for Z_NULL on entry to inflate()
79
 *
80
 * The history for versions after 1.2.0 are in ChangeLog in zlib distribution.
81
 */
82
83
#include "zutil.h"
84
#include "inftrees.h"
85
#include "inflate.h"
86
#include "inffast.h"
87
88
2.96M
local int inflateStateCheck(z_streamp strm) {
89
2.96M
    struct inflate_state FAR *state;
90
2.96M
    if (strm == Z_NULL ||
91
2.96M
        strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0)
92
0
        return 1;
93
2.96M
    state = (struct inflate_state FAR *)strm->state;
94
2.96M
    if (state == Z_NULL || state->strm != strm ||
95
2.96M
        state->mode < HEAD || state->mode > SYNC)
96
0
        return 1;
97
2.96M
    return 0;
98
2.96M
}
99
100
320k
int ZEXPORT inflateResetKeep(z_streamp strm) {
101
320k
    struct inflate_state FAR *state;
102
103
320k
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
104
320k
    state = (struct inflate_state FAR *)strm->state;
105
320k
    strm->total_in = strm->total_out = state->total = 0;
106
320k
    strm->msg = Z_NULL;
107
320k
    strm->data_type = 0;
108
320k
    if (state->wrap)        /* to support ill-conceived Java test suite */
109
131k
        strm->adler = state->wrap & 1;
110
320k
    state->mode = HEAD;
111
320k
    state->last = 0;
112
320k
    state->havedict = 0;
113
320k
    state->flags = -1;
114
320k
    state->dmax = 32768U;
115
320k
    state->head = Z_NULL;
116
320k
    state->hold = 0;
117
320k
    state->bits = 0;
118
320k
    state->lencode = state->distcode = state->next = state->codes;
119
320k
    state->sane = 1;
120
320k
    state->back = -1;
121
320k
    Tracev((stderr, "inflate: reset\n"));
122
320k
    return Z_OK;
123
320k
}
124
125
320k
int ZEXPORT inflateReset(z_streamp strm) {
126
320k
    struct inflate_state FAR *state;
127
128
320k
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
129
320k
    state = (struct inflate_state FAR *)strm->state;
130
320k
    state->wsize = 0;
131
320k
    state->whave = 0;
132
320k
    state->wnext = 0;
133
320k
    return inflateResetKeep(strm);
134
320k
}
135
136
320k
int ZEXPORT inflateReset2(z_streamp strm, int windowBits) {
137
320k
    int wrap;
138
320k
    struct inflate_state FAR *state;
139
140
    /* get the state */
141
320k
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
142
320k
    state = (struct inflate_state FAR *)strm->state;
143
144
    /* extract wrap request from windowBits parameter */
145
320k
    if (windowBits < 0) {
146
189k
        if (windowBits < -15)
147
0
            return Z_STREAM_ERROR;
148
189k
        wrap = 0;
149
189k
        windowBits = -windowBits;
150
189k
    }
151
131k
    else {
152
131k
        wrap = (windowBits >> 4) + 5;
153
131k
#ifdef GUNZIP
154
131k
        if (windowBits < 48)
155
131k
            windowBits &= 15;
156
131k
#endif
157
131k
    }
158
159
    /* set number of window bits, free window if different */
160
320k
    if (windowBits && (windowBits < 8 || windowBits > 15))
161
0
        return Z_STREAM_ERROR;
162
320k
    if (state->window != Z_NULL && state->wbits != (unsigned)windowBits) {
163
0
        ZFREE(strm, state->window);
164
0
        state->window = Z_NULL;
165
0
    }
166
167
    /* update state and reset the rest of it */
168
320k
    state->wrap = wrap;
169
320k
    state->wbits = (unsigned)windowBits;
170
320k
    return inflateReset(strm);
171
320k
}
172
173
int ZEXPORT inflateInit2_(z_streamp strm, int windowBits,
174
320k
                          const char *version, int stream_size) {
175
320k
    int ret;
176
320k
    struct inflate_state FAR *state;
177
178
320k
    if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
179
320k
        stream_size != (int)(sizeof(z_stream)))
180
0
        return Z_VERSION_ERROR;
181
320k
    if (strm == Z_NULL) return Z_STREAM_ERROR;
182
320k
    strm->msg = Z_NULL;                 /* in case we return an error */
183
320k
    if (strm->zalloc == (alloc_func)0) {
184
#ifdef Z_SOLO
185
        return Z_STREAM_ERROR;
186
#else
187
320k
        strm->zalloc = zcalloc;
188
320k
        strm->opaque = (voidpf)0;
189
320k
#endif
190
320k
    }
191
320k
    if (strm->zfree == (free_func)0)
192
#ifdef Z_SOLO
193
        return Z_STREAM_ERROR;
194
#else
195
320k
        strm->zfree = zcfree;
196
320k
#endif
197
320k
    state = (struct inflate_state FAR *)
198
320k
            ZALLOC(strm, 1, sizeof(struct inflate_state));
199
320k
    if (state == Z_NULL) return Z_MEM_ERROR;
200
320k
    zmemzero(state, sizeof(struct inflate_state));
201
320k
    Tracev((stderr, "inflate: allocated\n"));
202
320k
    strm->state = (struct internal_state FAR *)state;
203
320k
    state->strm = strm;
204
320k
    state->window = Z_NULL;
205
320k
    state->mode = HEAD;     /* to pass state test in inflateReset2() */
206
320k
    ret = inflateReset2(strm, windowBits);
207
320k
    if (ret != Z_OK) {
208
0
        ZFREE(strm, state);
209
0
        strm->state = Z_NULL;
210
0
    }
211
320k
    return ret;
212
320k
}
213
214
int ZEXPORT inflateInit_(z_streamp strm, const char *version,
215
45.6k
                         int stream_size) {
216
45.6k
    return inflateInit2_(strm, DEF_WBITS, version, stream_size);
217
45.6k
}
218
219
0
int ZEXPORT inflatePrime(z_streamp strm, int bits, int value) {
220
0
    struct inflate_state FAR *state;
221
222
0
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
223
0
    if (bits == 0)
224
0
        return Z_OK;
225
0
    state = (struct inflate_state FAR *)strm->state;
226
0
    if (bits < 0) {
227
0
        state->hold = 0;
228
0
        state->bits = 0;
229
0
        return Z_OK;
230
0
    }
231
0
    if (bits > 16 || state->bits + (uInt)bits > 32) return Z_STREAM_ERROR;
232
0
    value &= (1L << bits) - 1;
233
0
    state->hold += (unsigned long)value << state->bits;
234
0
    state->bits += (uInt)bits;
235
0
    return Z_OK;
236
0
}
237
238
/*
239
   Update the window with the last wsize (normally 32K) bytes written before
240
   returning.  If window does not exist yet, create it.  This is only called
241
   when a window is already in use, or when output has been written during this
242
   inflate call, but the end of the deflate stream has not been reached yet.
243
   It is also called to create a window for dictionary data when a dictionary
244
   is loaded.
245
246
   Providing output buffers larger than 32K to inflate() should provide a speed
247
   advantage, since only the last 32K of output is copied to the sliding window
248
   upon return from inflate(), and since all distances after the first 32K of
249
   output will fall in the output data, making match copies simpler and faster.
250
   The advantage may be dependent on the size of the processor's data caches.
251
 */
252
1.53M
local int updatewindow(z_streamp strm, const Bytef *end, unsigned copy) {
253
1.53M
    struct inflate_state FAR *state;
254
1.53M
    unsigned dist;
255
256
1.53M
    state = (struct inflate_state FAR *)strm->state;
257
258
    /* if it hasn't been done already, allocate space for the window */
259
1.53M
    if (state->window == Z_NULL) {
260
173k
        state->window = (unsigned char FAR *)
261
173k
                        ZALLOC(strm, 1U << state->wbits,
262
173k
                               sizeof(unsigned char));
263
173k
        if (state->window == Z_NULL) return 1;
264
173k
    }
265
266
    /* if window not in use yet, initialize */
267
1.53M
    if (state->wsize == 0) {
268
173k
        state->wsize = 1U << state->wbits;
269
173k
        state->wnext = 0;
270
173k
        state->whave = 0;
271
173k
    }
272
273
    /* copy state->wsize or less output bytes into the circular window */
274
1.53M
    if (copy >= state->wsize) {
275
182k
        zmemcpy(state->window, end - state->wsize, state->wsize);
276
182k
        state->wnext = 0;
277
182k
        state->whave = state->wsize;
278
182k
    }
279
1.35M
    else {
280
1.35M
        dist = state->wsize - state->wnext;
281
1.35M
        if (dist > copy) dist = copy;
282
1.35M
        zmemcpy(state->window + state->wnext, end - copy, dist);
283
1.35M
        copy -= dist;
284
1.35M
        if (copy) {
285
137k
            zmemcpy(state->window, end - copy, copy);
286
137k
            state->wnext = copy;
287
137k
            state->whave = state->wsize;
288
137k
        }
289
1.21M
        else {
290
1.21M
            state->wnext += dist;
291
1.21M
            if (state->wnext == state->wsize) state->wnext = 0;
292
1.21M
            if (state->whave < state->wsize) state->whave += dist;
293
1.21M
        }
294
1.35M
    }
295
1.53M
    return 0;
296
1.53M
}
297
298
/* Macros for inflate(): */
299
300
/* check function to use adler32() for zlib or crc32() for gzip */
301
#ifdef GUNZIP
302
#  define UPDATE_CHECK(check, buf, len) \
303
790k
    (state->flags ? crc32(check, buf, len) : adler32(check, buf, len))
304
#else
305
#  define UPDATE_CHECK(check, buf, len) adler32(check, buf, len)
306
#endif
307
308
/* check macros for header crc */
309
#ifdef GUNZIP
310
#  define CRC2(check, word) \
311
3.44k
    do { \
312
3.44k
        hbuf[0] = (unsigned char)(word); \
313
3.44k
        hbuf[1] = (unsigned char)((word) >> 8); \
314
3.44k
        check = crc32(check, hbuf, 2); \
315
3.44k
    } while (0)
316
317
#  define CRC4(check, word) \
318
54
    do { \
319
54
        hbuf[0] = (unsigned char)(word); \
320
54
        hbuf[1] = (unsigned char)((word) >> 8); \
321
54
        hbuf[2] = (unsigned char)((word) >> 16); \
322
54
        hbuf[3] = (unsigned char)((word) >> 24); \
323
54
        check = crc32(check, hbuf, 4); \
324
54
    } while (0)
325
#endif
326
327
/* Load registers with state in inflate() for speed */
328
#define LOAD() \
329
3.19M
    do { \
330
3.19M
        put = strm->next_out; \
331
3.19M
        left = strm->avail_out; \
332
3.19M
        next = strm->next_in; \
333
3.19M
        have = strm->avail_in; \
334
3.19M
        hold = state->hold; \
335
3.19M
        bits = state->bits; \
336
3.19M
    } while (0)
337
338
/* Restore state from registers in inflate() */
339
#define RESTORE() \
340
3.19M
    do { \
341
3.19M
        strm->next_out = put; \
342
3.19M
        strm->avail_out = left; \
343
3.19M
        strm->next_in = next; \
344
3.19M
        strm->avail_in = have; \
345
3.19M
        state->hold = hold; \
346
3.19M
        state->bits = bits; \
347
3.19M
    } while (0)
348
349
/* Clear the input bit accumulator */
350
#define INITBITS() \
351
209k
    do { \
352
209k
        hold = 0; \
353
209k
        bits = 0; \
354
209k
    } while (0)
355
356
/* Get a byte of input into the bit accumulator, or return from inflate()
357
   if there is no input available. */
358
#define PULLBYTE() \
359
9.24M
    do { \
360
9.24M
        if (have == 0) goto inf_leave; \
361
9.24M
        have--; \
362
9.15M
        hold += (unsigned long)(*next++) << bits; \
363
9.15M
        bits += 8; \
364
9.15M
    } while (0)
365
366
/* Assure that there are at least n bits in the bit accumulator.  If there is
367
   not enough available input to do that, then return from inflate(). */
368
#define NEEDBITS(n) \
369
5.39M
    do { \
370
8.78M
        while (bits < (unsigned)(n)) \
371
5.39M
            PULLBYTE(); \
372
5.39M
    } while (0)
373
374
/* Return the low n bits of the bit accumulator (n < 16) */
375
#define BITS(n) \
376
28.2M
    ((unsigned)hold & ((1U << (n)) - 1))
377
378
/* Remove n bits from the bit accumulator */
379
#define DROPBITS(n) \
380
22.2M
    do { \
381
22.2M
        hold >>= (n); \
382
22.2M
        bits -= (unsigned)(n); \
383
22.2M
    } while (0)
384
385
/* Remove zero to seven bits as needed to go to a byte boundary */
386
#define BYTEBITS() \
387
236k
    do { \
388
236k
        hold >>= bits & 7; \
389
236k
        bits -= bits & 7; \
390
236k
    } while (0)
391
392
/*
393
   inflate() uses a state machine to process as much input data and generate as
394
   much output data as possible before returning.  The state machine is
395
   structured roughly as follows:
396
397
    for (;;) switch (state) {
398
    ...
399
    case STATEn:
400
        if (not enough input data or output space to make progress)
401
            return;
402
        ... make progress ...
403
        state = STATEm;
404
        break;
405
    ...
406
    }
407
408
   so when inflate() is called again, the same case is attempted again, and
409
   if the appropriate resources are provided, the machine proceeds to the
410
   next state.  The NEEDBITS() macro is usually the way the state evaluates
411
   whether it can proceed or should return.  NEEDBITS() does the return if
412
   the requested bits are not available.  The typical use of the BITS macros
413
   is:
414
415
        NEEDBITS(n);
416
        ... do something with BITS(n) ...
417
        DROPBITS(n);
418
419
   where NEEDBITS(n) either returns from inflate() if there isn't enough
420
   input left to load n bits into the accumulator, or it continues.  BITS(n)
421
   gives the low n bits in the accumulator.  When done, DROPBITS(n) drops
422
   the low n bits off the accumulator.  INITBITS() clears the accumulator
423
   and sets the number of available bits to zero.  BYTEBITS() discards just
424
   enough bits to put the accumulator on a byte boundary.  After BYTEBITS()
425
   and a NEEDBITS(8), then BITS(8) would return the next byte in the stream.
426
427
   NEEDBITS(n) uses PULLBYTE() to get an available byte of input, or to return
428
   if there is no input available.  The decoding of variable length codes uses
429
   PULLBYTE() directly in order to pull just enough bytes to decode the next
430
   code, and no more.
431
432
   Some states loop until they get enough input, making sure that enough
433
   state information is maintained to continue the loop where it left off
434
   if NEEDBITS() returns in the loop.  For example, want, need, and keep
435
   would all have to actually be part of the saved state in case NEEDBITS()
436
   returns:
437
438
    case STATEw:
439
        while (want < need) {
440
            NEEDBITS(n);
441
            keep[want++] = BITS(n);
442
            DROPBITS(n);
443
        }
444
        state = STATEx;
445
    case STATEx:
446
447
   As shown above, if the next state is also the next case, then the break
448
   is omitted.
449
450
   A state may also return if there is not enough output space available to
451
   complete that state.  Those states are copying stored data, writing a
452
   literal byte, and copying a matching string.
453
454
   When returning, a "goto inf_leave" is used to update the total counters,
455
   update the check value, and determine whether any progress has been made
456
   during that inflate() call in order to return the proper return code.
457
   Progress is defined as a change in either strm->avail_in or strm->avail_out.
458
   When there is a window, goto inf_leave will update the window with the last
459
   output written.  If a goto inf_leave occurs in the middle of decompression
460
   and there is no window currently, goto inf_leave will create one and copy
461
   output to the window for the next call of inflate().
462
463
   In this implementation, the flush parameter of inflate() only affects the
464
   return code (per zlib.h).  inflate() always writes as much as possible to
465
   strm->next_out, given the space available and the provided input--the effect
466
   documented in zlib.h of Z_SYNC_FLUSH.  Furthermore, inflate() always defers
467
   the allocation of and copying into a sliding window until necessary, which
468
   provides the effect documented in zlib.h for Z_FINISH when the entire input
469
   stream available.  So the only thing the flush parameter actually does is:
470
   when flush is set to Z_FINISH, inflate() cannot return Z_OK.  Instead it
471
   will return Z_BUF_ERROR if it has not reached the end of the stream.
472
 */
473
474
1.68M
int ZEXPORT inflate(z_streamp strm, int flush) {
475
1.68M
    struct inflate_state FAR *state;
476
1.68M
    z_const unsigned char FAR *next;    /* next input */
477
1.68M
    unsigned char FAR *put;     /* next output */
478
1.68M
    unsigned have, left;        /* available input and output */
479
1.68M
    unsigned long hold;         /* bit buffer */
480
1.68M
    unsigned bits;              /* bits in bit buffer */
481
1.68M
    unsigned in, out;           /* save starting available input and output */
482
1.68M
    unsigned copy;              /* number of stored or match bytes to copy */
483
1.68M
    unsigned char FAR *from;    /* where to copy match bytes from */
484
1.68M
    code here;                  /* current decoding table entry */
485
1.68M
    code last;                  /* parent table entry */
486
1.68M
    unsigned len;               /* length to copy for repeats, bits to drop */
487
1.68M
    int ret;                    /* return code */
488
1.68M
#ifdef GUNZIP
489
1.68M
    unsigned char hbuf[4];      /* buffer for gzip header crc calculation */
490
1.68M
#endif
491
1.68M
    static const unsigned short order[19] = /* permutation of code lengths */
492
1.68M
        {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
493
494
1.68M
    if (inflateStateCheck(strm) || strm->next_out == Z_NULL ||
495
1.68M
        (strm->next_in == Z_NULL && strm->avail_in != 0))
496
0
        return Z_STREAM_ERROR;
497
498
1.68M
    state = (struct inflate_state FAR *)strm->state;
499
1.68M
    if (state->mode == TYPE) state->mode = TYPEDO;      /* skip check */
500
1.68M
    LOAD();
501
1.68M
    in = have;
502
1.68M
    out = left;
503
1.68M
    ret = Z_OK;
504
1.68M
    for (;;)
505
11.7M
        switch (state->mode) {
506
320k
        case HEAD:
507
320k
            if (state->wrap == 0) {
508
189k
                state->mode = TYPEDO;
509
189k
                break;
510
189k
            }
511
131k
            NEEDBITS(16);
512
123k
#ifdef GUNZIP
513
123k
            if ((state->wrap & 2) && hold == 0x8b1f) {  /* gzip header */
514
3.31k
                if (state->wbits == 0)
515
0
                    state->wbits = 15;
516
3.31k
                state->check = crc32(0L, Z_NULL, 0);
517
3.31k
                CRC2(state->check, hold);
518
3.31k
                INITBITS();
519
3.31k
                state->mode = FLAGS;
520
3.31k
                break;
521
3.31k
            }
522
120k
            if (state->head != Z_NULL)
523
0
                state->head->done = -1;
524
120k
            if (!(state->wrap & 1) ||   /* check if zlib header allowed */
525
#else
526
            if (
527
#endif
528
120k
                ((BITS(8) << 8) + (hold >> 8)) % 31) {
529
5.63k
                strm->msg = (z_const char *)"incorrect header check";
530
5.63k
                state->mode = BAD;
531
5.63k
                break;
532
5.63k
            }
533
114k
            if (BITS(4) != Z_DEFLATED) {
534
4.90k
                strm->msg = (z_const char *)"unknown compression method";
535
4.90k
                state->mode = BAD;
536
4.90k
                break;
537
4.90k
            }
538
109k
            DROPBITS(4);
539
109k
            len = BITS(4) + 8;
540
109k
            if (state->wbits == 0)
541
0
                state->wbits = len;
542
109k
            if (len > 15 || len > state->wbits) {
543
267
                strm->msg = (z_const char *)"invalid window size";
544
267
                state->mode = BAD;
545
267
                break;
546
267
            }
547
109k
            state->dmax = 1U << len;
548
109k
            state->flags = 0;               /* indicate zlib header */
549
109k
            Tracev((stderr, "inflate:   zlib header ok\n"));
550
109k
            strm->adler = state->check = adler32(0L, Z_NULL, 0);
551
109k
            state->mode = hold & 0x200 ? DICTID : TYPE;
552
109k
            INITBITS();
553
109k
            break;
554
0
#ifdef GUNZIP
555
3.31k
        case FLAGS:
556
3.31k
            NEEDBITS(16);
557
3.31k
            state->flags = (int)(hold);
558
3.31k
            if ((state->flags & 0xff) != Z_DEFLATED) {
559
2
                strm->msg = (z_const char *)"unknown compression method";
560
2
                state->mode = BAD;
561
2
                break;
562
2
            }
563
3.30k
            if (state->flags & 0xe000) {
564
2
                strm->msg = (z_const char *)"unknown header flags set";
565
2
                state->mode = BAD;
566
2
                break;
567
2
            }
568
3.30k
            if (state->head != Z_NULL)
569
0
                state->head->text = (int)((hold >> 8) & 1);
570
3.30k
            if ((state->flags & 0x0200) && (state->wrap & 4))
571
56
                CRC2(state->check, hold);
572
3.30k
            INITBITS();
573
3.30k
            state->mode = TIME;
574
                /* fallthrough */
575
3.30k
        case TIME:
576
3.30k
            NEEDBITS(32);
577
3.30k
            if (state->head != Z_NULL)
578
0
                state->head->time = hold;
579
3.30k
            if ((state->flags & 0x0200) && (state->wrap & 4))
580
54
                CRC4(state->check, hold);
581
3.30k
            INITBITS();
582
3.30k
            state->mode = OS;
583
                /* fallthrough */
584
3.30k
        case OS:
585
3.30k
            NEEDBITS(16);
586
3.29k
            if (state->head != Z_NULL) {
587
0
                state->head->xflags = (int)(hold & 0xff);
588
0
                state->head->os = (int)(hold >> 8);
589
0
            }
590
3.29k
            if ((state->flags & 0x0200) && (state->wrap & 4))
591
53
                CRC2(state->check, hold);
592
3.29k
            INITBITS();
593
3.29k
            state->mode = EXLEN;
594
                /* fallthrough */
595
3.29k
        case EXLEN:
596
3.29k
            if (state->flags & 0x0400) {
597
30
                NEEDBITS(16);
598
28
                state->length = (unsigned)(hold);
599
28
                if (state->head != Z_NULL)
600
0
                    state->head->extra_len = (unsigned)hold;
601
28
                if ((state->flags & 0x0200) && (state->wrap & 4))
602
23
                    CRC2(state->check, hold);
603
28
                INITBITS();
604
28
            }
605
3.26k
            else if (state->head != Z_NULL)
606
0
                state->head->extra = Z_NULL;
607
3.29k
            state->mode = EXTRA;
608
                /* fallthrough */
609
3.29k
        case EXTRA:
610
3.29k
            if (state->flags & 0x0400) {
611
28
                copy = state->length;
612
28
                if (copy > have) copy = have;
613
28
                if (copy) {
614
13
                    if (state->head != Z_NULL &&
615
0
                        state->head->extra != Z_NULL &&
616
0
                        (len = state->head->extra_len - state->length) <
617
0
                            state->head->extra_max) {
618
0
                        zmemcpy(state->head->extra + len, next,
619
0
                                len + copy > state->head->extra_max ?
620
0
                                state->head->extra_max - len : copy);
621
0
                    }
622
13
                    if ((state->flags & 0x0200) && (state->wrap & 4))
623
11
                        state->check = crc32(state->check, next, copy);
624
13
                    have -= copy;
625
13
                    next += copy;
626
13
                    state->length -= copy;
627
13
                }
628
28
                if (state->length) goto inf_leave;
629
28
            }
630
3.27k
            state->length = 0;
631
3.27k
            state->mode = NAME;
632
                /* fallthrough */
633
3.27k
        case NAME:
634
3.27k
            if (state->flags & 0x0800) {
635
965
                if (have == 0) goto inf_leave;
636
963
                copy = 0;
637
1.71M
                do {
638
1.71M
                    len = (unsigned)(next[copy++]);
639
1.71M
                    if (state->head != Z_NULL &&
640
0
                            state->head->name != Z_NULL &&
641
0
                            state->length < state->head->name_max)
642
0
                        state->head->name[state->length++] = (Bytef)len;
643
1.71M
                } while (len && copy < have);
644
963
                if ((state->flags & 0x0200) && (state->wrap & 4))
645
9
                    state->check = crc32(state->check, next, copy);
646
963
                have -= copy;
647
963
                next += copy;
648
963
                if (len) goto inf_leave;
649
963
            }
650
2.31k
            else if (state->head != Z_NULL)
651
0
                state->head->name = Z_NULL;
652
3.25k
            state->length = 0;
653
3.25k
            state->mode = COMMENT;
654
                /* fallthrough */
655
3.25k
        case COMMENT:
656
3.25k
            if (state->flags & 0x1000) {
657
89
                if (have == 0) goto inf_leave;
658
88
                copy = 0;
659
1.14M
                do {
660
1.14M
                    len = (unsigned)(next[copy++]);
661
1.14M
                    if (state->head != Z_NULL &&
662
0
                            state->head->comment != Z_NULL &&
663
0
                            state->length < state->head->comm_max)
664
0
                        state->head->comment[state->length++] = (Bytef)len;
665
1.14M
                } while (len && copy < have);
666
88
                if ((state->flags & 0x0200) && (state->wrap & 4))
667
13
                    state->check = crc32(state->check, next, copy);
668
88
                have -= copy;
669
88
                next += copy;
670
88
                if (len) goto inf_leave;
671
88
            }
672
3.16k
            else if (state->head != Z_NULL)
673
0
                state->head->comment = Z_NULL;
674
3.23k
            state->mode = HCRC;
675
                /* fallthrough */
676
3.23k
        case HCRC:
677
3.23k
            if (state->flags & 0x0200) {
678
18
                NEEDBITS(16);
679
14
                if ((state->wrap & 4) && hold != (state->check & 0xffff)) {
680
13
                    strm->msg = (z_const char *)"header crc mismatch";
681
13
                    state->mode = BAD;
682
13
                    break;
683
13
                }
684
1
                INITBITS();
685
1
            }
686
3.21k
            if (state->head != Z_NULL) {
687
0
                state->head->hcrc = (int)((state->flags >> 9) & 1);
688
0
                state->head->done = 1;
689
0
            }
690
3.21k
            strm->adler = state->check = crc32(0L, Z_NULL, 0);
691
3.21k
            state->mode = TYPE;
692
3.21k
            break;
693
0
#endif
694
854
        case DICTID:
695
854
            NEEDBITS(32);
696
371
            strm->adler = state->check = ZSWAP32(hold);
697
371
            INITBITS();
698
371
            state->mode = DICT;
699
                /* fallthrough */
700
371
        case DICT:
701
371
            if (state->havedict == 0) {
702
371
                RESTORE();
703
371
                return Z_NEED_DICT;
704
371
            }
705
0
            strm->adler = state->check = adler32(0L, Z_NULL, 0);
706
0
            state->mode = TYPE;
707
                /* fallthrough */
708
445k
        case TYPE:
709
445k
            if (flush == Z_BLOCK || flush == Z_TREES) goto inf_leave;
710
                /* fallthrough */
711
635k
        case TYPEDO:
712
635k
            if (state->last) {
713
180k
                BYTEBITS();
714
180k
                state->mode = CHECK;
715
180k
                break;
716
180k
            }
717
454k
            NEEDBITS(3);
718
452k
            state->last = BITS(1);
719
452k
            DROPBITS(1);
720
452k
            switch (BITS(2)) {
721
54.3k
            case 0:                             /* stored block */
722
54.3k
                Tracev((stderr, "inflate:     stored block%s\n",
723
54.3k
                        state->last ? " (last)" : ""));
724
54.3k
                state->mode = STORED;
725
54.3k
                break;
726
237k
            case 1:                             /* fixed block */
727
237k
                inflate_fixed(state);
728
237k
                Tracev((stderr, "inflate:     fixed codes block%s\n",
729
237k
                        state->last ? " (last)" : ""));
730
237k
                state->mode = LEN_;             /* decode codes */
731
237k
                if (flush == Z_TREES) {
732
0
                    DROPBITS(2);
733
0
                    goto inf_leave;
734
0
                }
735
237k
                break;
736
237k
            case 2:                             /* dynamic block */
737
158k
                Tracev((stderr, "inflate:     dynamic codes block%s\n",
738
158k
                        state->last ? " (last)" : ""));
739
158k
                state->mode = TABLE;
740
158k
                break;
741
2.17k
            default:
742
2.17k
                strm->msg = (z_const char *)"invalid block type";
743
2.17k
                state->mode = BAD;
744
452k
            }
745
452k
            DROPBITS(2);
746
452k
            break;
747
55.6k
        case STORED:
748
55.6k
            BYTEBITS();                         /* go to byte boundary */
749
55.6k
            NEEDBITS(32);
750
51.2k
            if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
751
8.22k
                strm->msg = (z_const char *)"invalid stored block lengths";
752
8.22k
                state->mode = BAD;
753
8.22k
                break;
754
8.22k
            }
755
43.0k
            state->length = (unsigned)hold & 0xffff;
756
43.0k
            Tracev((stderr, "inflate:       stored length %u\n",
757
43.0k
                    state->length));
758
43.0k
            INITBITS();
759
43.0k
            state->mode = COPY_;
760
43.0k
            if (flush == Z_TREES) goto inf_leave;
761
                /* fallthrough */
762
43.0k
        case COPY_:
763
43.0k
            state->mode = COPY;
764
                /* fallthrough */
765
54.5k
        case COPY:
766
54.5k
            copy = state->length;
767
54.5k
            if (copy) {
768
15.1k
                if (copy > have) copy = have;
769
15.1k
                if (copy > left) copy = left;
770
15.1k
                if (copy == 0) goto inf_leave;
771
8.66k
                zmemcpy(put, next, copy);
772
8.66k
                have -= copy;
773
8.66k
                next += copy;
774
8.66k
                left -= copy;
775
8.66k
                put += copy;
776
8.66k
                state->length -= copy;
777
8.66k
                break;
778
15.1k
            }
779
39.4k
            Tracev((stderr, "inflate:       stored end\n"));
780
39.4k
            state->mode = TYPE;
781
39.4k
            break;
782
159k
        case TABLE:
783
159k
            NEEDBITS(14);
784
156k
            state->nlen = BITS(5) + 257;
785
156k
            DROPBITS(5);
786
156k
            state->ndist = BITS(5) + 1;
787
156k
            DROPBITS(5);
788
156k
            state->ncode = BITS(4) + 4;
789
156k
            DROPBITS(4);
790
156k
#ifndef PKZIP_BUG_WORKAROUND
791
156k
            if (state->nlen > 286 || state->ndist > 30) {
792
2.37k
                strm->msg = (z_const char *)
793
2.37k
                    "too many length or distance symbols";
794
2.37k
                state->mode = BAD;
795
2.37k
                break;
796
2.37k
            }
797
154k
#endif
798
154k
            Tracev((stderr, "inflate:       table sizes ok\n"));
799
154k
            state->have = 0;
800
154k
            state->mode = LENLENS;
801
                /* fallthrough */
802
155k
        case LENLENS:
803
2.53M
            while (state->have < state->ncode) {
804
2.37M
                NEEDBITS(3);
805
2.37M
                state->lens[order[state->have++]] = (unsigned short)BITS(3);
806
2.37M
                DROPBITS(3);
807
2.37M
            }
808
692k
            while (state->have < 19)
809
539k
                state->lens[order[state->have++]] = 0;
810
152k
            state->next = state->codes;
811
152k
            state->lencode = state->distcode = (const code FAR *)(state->next);
812
152k
            state->lenbits = 7;
813
152k
            ret = inflate_table(CODES, state->lens, 19, &(state->next),
814
152k
                                &(state->lenbits), state->work);
815
152k
            if (ret) {
816
19.9k
                strm->msg = (z_const char *)"invalid code lengths set";
817
19.9k
                state->mode = BAD;
818
19.9k
                break;
819
19.9k
            }
820
132k
            Tracev((stderr, "inflate:       code lengths ok\n"));
821
132k
            state->have = 0;
822
132k
            state->mode = CODELENS;
823
                /* fallthrough */
824
136k
        case CODELENS:
825
10.8M
            while (state->have < state->nlen + state->ndist) {
826
13.9M
                for (;;) {
827
13.9M
                    here = state->lencode[BITS(state->lenbits)];
828
13.9M
                    if ((unsigned)(here.bits) <= bits) break;
829
3.26M
                    PULLBYTE();
830
3.26M
                }
831
10.7M
                if (here.val < 16) {
832
9.50M
                    DROPBITS(here.bits);
833
9.50M
                    state->lens[state->have++] = here.val;
834
9.50M
                }
835
1.22M
                else {
836
1.22M
                    if (here.val == 16) {
837
323k
                        NEEDBITS(here.bits + 2);
838
321k
                        DROPBITS(here.bits);
839
321k
                        if (state->have == 0) {
840
1.09k
                            strm->msg = (z_const char *)
841
1.09k
                                "invalid bit length repeat";
842
1.09k
                            state->mode = BAD;
843
1.09k
                            break;
844
1.09k
                        }
845
320k
                        len = state->lens[state->have - 1];
846
320k
                        copy = 3 + BITS(2);
847
320k
                        DROPBITS(2);
848
320k
                    }
849
903k
                    else if (here.val == 17) {
850
458k
                        NEEDBITS(here.bits + 3);
851
455k
                        DROPBITS(here.bits);
852
455k
                        len = 0;
853
455k
                        copy = 3 + BITS(3);
854
455k
                        DROPBITS(3);
855
455k
                    }
856
445k
                    else {
857
445k
                        NEEDBITS(here.bits + 7);
858
443k
                        DROPBITS(here.bits);
859
443k
                        len = 0;
860
443k
                        copy = 11 + BITS(7);
861
443k
                        DROPBITS(7);
862
443k
                    }
863
1.22M
                    if (state->have + copy > state->nlen + state->ndist) {
864
5.26k
                        strm->msg = (z_const char *)
865
5.26k
                            "invalid bit length repeat";
866
5.26k
                        state->mode = BAD;
867
5.26k
                        break;
868
5.26k
                    }
869
29.0M
                    while (copy--)
870
27.7M
                        state->lens[state->have++] = (unsigned short)len;
871
1.21M
                }
872
10.7M
            }
873
874
            /* handle error breaks in while */
875
122k
            if (state->mode == BAD) break;
876
877
            /* check for end-of-block code (better have one) */
878
116k
            if (state->lens[256] == 0) {
879
5.61k
                strm->msg = (z_const char *)
880
5.61k
                    "invalid code -- missing end-of-block";
881
5.61k
                state->mode = BAD;
882
5.61k
                break;
883
5.61k
            }
884
885
            /* build code tables -- note: do not change the lenbits or distbits
886
               values here (9 and 6) without reading the comments in inftrees.h
887
               concerning the ENOUGH constants, which depend on those values */
888
110k
            state->next = state->codes;
889
110k
            state->lencode = (const code FAR *)(state->next);
890
110k
            state->lenbits = 9;
891
110k
            ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
892
110k
                                &(state->lenbits), state->work);
893
110k
            if (ret) {
894
5.64k
                strm->msg = (z_const char *)"invalid literal/lengths set";
895
5.64k
                state->mode = BAD;
896
5.64k
                break;
897
5.64k
            }
898
104k
            state->distcode = (const code FAR *)(state->next);
899
104k
            state->distbits = 6;
900
104k
            ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
901
104k
                            &(state->next), &(state->distbits), state->work);
902
104k
            if (ret) {
903
4.30k
                strm->msg = (z_const char *)"invalid distances set";
904
4.30k
                state->mode = BAD;
905
4.30k
                break;
906
4.30k
            }
907
100k
            Tracev((stderr, "inflate:       codes ok\n"));
908
100k
            state->mode = LEN_;
909
100k
            if (flush == Z_TREES) goto inf_leave;
910
                /* fallthrough */
911
337k
        case LEN_:
912
337k
            state->mode = LEN;
913
                /* fallthrough */
914
5.03M
        case LEN:
915
5.03M
            if (have >= 6 && left >= 258) {
916
1.50M
                RESTORE();
917
1.50M
                inflate_fast(strm, out);
918
1.50M
                LOAD();
919
1.50M
                if (state->mode == TYPE)
920
217k
                    state->back = -1;
921
1.50M
                break;
922
1.50M
            }
923
3.52M
            state->back = 0;
924
5.53M
            for (;;) {
925
5.53M
                here = state->lencode[BITS(state->lenbits)];
926
5.53M
                if ((unsigned)(here.bits) <= bits) break;
927
2.02M
                PULLBYTE();
928
2.02M
            }
929
3.50M
            if (here.op && (here.op & 0xf0) == 0) {
930
68.2k
                last = here;
931
93.0k
                for (;;) {
932
93.0k
                    here = state->lencode[last.val +
933
93.0k
                            (BITS(last.bits + last.op) >> last.bits)];
934
93.0k
                    if ((unsigned)(last.bits + here.bits) <= bits) break;
935
25.5k
                    PULLBYTE();
936
25.5k
                }
937
67.5k
                DROPBITS(last.bits);
938
67.5k
                state->back += last.bits;
939
67.5k
            }
940
3.50M
            DROPBITS(here.bits);
941
3.50M
            state->back += here.bits;
942
3.50M
            state->length = (unsigned)here.val;
943
3.50M
            if ((int)(here.op) == 0) {
944
1.54M
                Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
945
1.54M
                        "inflate:         literal '%c'\n" :
946
1.54M
                        "inflate:         literal 0x%02x\n", here.val));
947
1.54M
                state->mode = LIT;
948
1.54M
                break;
949
1.54M
            }
950
1.96M
            if (here.op & 32) {
951
76.8k
                Tracevv((stderr, "inflate:         end of block\n"));
952
76.8k
                state->back = -1;
953
76.8k
                state->mode = TYPE;
954
76.8k
                break;
955
76.8k
            }
956
1.88M
            if (here.op & 64) {
957
1.00k
                strm->msg = (z_const char *)"invalid literal/length code";
958
1.00k
                state->mode = BAD;
959
1.00k
                break;
960
1.00k
            }
961
1.88M
            state->extra = (unsigned)(here.op) & 15;
962
1.88M
            state->mode = LENEXT;
963
                /* fallthrough */
964
1.88M
        case LENEXT:
965
1.88M
            if (state->extra) {
966
255k
                NEEDBITS(state->extra);
967
252k
                state->length += BITS(state->extra);
968
252k
                DROPBITS(state->extra);
969
252k
                state->back += state->extra;
970
252k
            }
971
1.88M
            Tracevv((stderr, "inflate:         length %u\n", state->length));
972
1.88M
            state->was = state->length;
973
1.88M
            state->mode = DIST;
974
                /* fallthrough */
975
1.88M
        case DIST:
976
2.36M
            for (;;) {
977
2.36M
                here = state->distcode[BITS(state->distbits)];
978
2.36M
                if ((unsigned)(here.bits) <= bits) break;
979
484k
                PULLBYTE();
980
484k
            }
981
1.88M
            if ((here.op & 0xf0) == 0) {
982
47.4k
                last = here;
983
61.2k
                for (;;) {
984
61.2k
                    here = state->distcode[last.val +
985
61.2k
                            (BITS(last.bits + last.op) >> last.bits)];
986
61.2k
                    if ((unsigned)(last.bits + here.bits) <= bits) break;
987
14.8k
                    PULLBYTE();
988
14.8k
                }
989
46.3k
                DROPBITS(last.bits);
990
46.3k
                state->back += last.bits;
991
46.3k
            }
992
1.87M
            DROPBITS(here.bits);
993
1.87M
            state->back += here.bits;
994
1.87M
            if (here.op & 64) {
995
1.62k
                strm->msg = (z_const char *)"invalid distance code";
996
1.62k
                state->mode = BAD;
997
1.62k
                break;
998
1.62k
            }
999
1.87M
            state->offset = (unsigned)here.val;
1000
1.87M
            state->extra = (unsigned)(here.op) & 15;
1001
1.87M
            state->mode = DISTEXT;
1002
                /* fallthrough */
1003
1.88M
        case DISTEXT:
1004
1.88M
            if (state->extra) {
1005
670k
                NEEDBITS(state->extra);
1006
663k
                state->offset += BITS(state->extra);
1007
663k
                DROPBITS(state->extra);
1008
663k
                state->back += state->extra;
1009
663k
            }
1010
#ifdef INFLATE_STRICT
1011
            if (state->offset > state->dmax) {
1012
                strm->msg = (z_const char *)"invalid distance too far back";
1013
                state->mode = BAD;
1014
                break;
1015
            }
1016
#endif
1017
1.87M
            Tracevv((stderr, "inflate:         distance %u\n", state->offset));
1018
1.87M
            state->mode = MATCH;
1019
                /* fallthrough */
1020
5.71M
        case MATCH:
1021
5.71M
            if (left == 0) goto inf_leave;
1022
4.38M
            copy = out - left;
1023
4.38M
            if (state->offset > copy) {         /* copy from window */
1024
1.39M
                copy = state->offset - copy;
1025
1.39M
                if (copy > state->whave) {
1026
2.34k
                    if (state->sane) {
1027
2.34k
                        strm->msg = (z_const char *)
1028
2.34k
                            "invalid distance too far back";
1029
2.34k
                        state->mode = BAD;
1030
2.34k
                        break;
1031
2.34k
                    }
1032
#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
1033
                    Trace((stderr, "inflate.c too far\n"));
1034
                    copy -= state->whave;
1035
                    if (copy > state->length) copy = state->length;
1036
                    if (copy > left) copy = left;
1037
                    left -= copy;
1038
                    state->length -= copy;
1039
                    do {
1040
                        *put++ = 0;
1041
                    } while (--copy);
1042
                    if (state->length == 0) state->mode = LEN;
1043
                    break;
1044
#endif
1045
2.34k
                }
1046
1.39M
                if (copy > state->wnext) {
1047
241k
                    copy -= state->wnext;
1048
241k
                    from = state->window + (state->wsize - copy);
1049
241k
                }
1050
1.14M
                else
1051
1.14M
                    from = state->window + (state->wnext - copy);
1052
1.39M
                if (copy > state->length) copy = state->length;
1053
1.39M
            }
1054
2.98M
            else {                              /* copy from output */
1055
2.98M
                from = put - state->offset;
1056
2.98M
                copy = state->length;
1057
2.98M
            }
1058
4.38M
            if (copy > left) copy = left;
1059
4.38M
            left -= copy;
1060
4.38M
            state->length -= copy;
1061
344M
            do {
1062
344M
                *put++ = *from++;
1063
344M
            } while (--copy);
1064
4.38M
            if (state->length == 0) state->mode = LEN;
1065
4.38M
            break;
1066
1.54M
        case LIT:
1067
1.54M
            if (left == 0) goto inf_leave;
1068
1.54M
            *put++ = (unsigned char)(state->length);
1069
1.54M
            left--;
1070
1.54M
            state->mode = LEN;
1071
1.54M
            break;
1072
184k
        case CHECK:
1073
184k
            if (state->wrap) {
1074
54.6k
                NEEDBITS(32);
1075
46.3k
                out -= left;
1076
46.3k
                strm->total_out += out;
1077
46.3k
                state->total += out;
1078
46.3k
                if ((state->wrap & 4) && out)
1079
44.1k
                    strm->adler = state->check =
1080
44.1k
                        UPDATE_CHECK(state->check, put - out, out);
1081
46.3k
                out = left;
1082
46.3k
                if ((state->wrap & 4) && (
1083
46.3k
#ifdef GUNZIP
1084
46.3k
                     state->flags ? hold :
1085
46.3k
#endif
1086
46.3k
                     ZSWAP32(hold)) != state->check) {
1087
3.61k
                    strm->msg = (z_const char *)"incorrect data check";
1088
3.61k
                    state->mode = BAD;
1089
3.61k
                    break;
1090
3.61k
                }
1091
42.7k
                INITBITS();
1092
42.7k
                Tracev((stderr, "inflate:   check matches trailer\n"));
1093
42.7k
            }
1094
172k
#ifdef GUNZIP
1095
172k
            state->mode = LENGTH;
1096
                /* fallthrough */
1097
172k
        case LENGTH:
1098
172k
            if (state->wrap && state->flags) {
1099
43
                NEEDBITS(32);
1100
39
                if ((state->wrap & 4) && hold != (state->total & 0xffffffff)) {
1101
38
                    strm->msg = (z_const char *)"incorrect length check";
1102
38
                    state->mode = BAD;
1103
38
                    break;
1104
38
                }
1105
1
                INITBITS();
1106
1
                Tracev((stderr, "inflate:   length matches trailer\n"));
1107
1
            }
1108
172k
#endif
1109
172k
            state->mode = DONE;
1110
                /* fallthrough */
1111
172k
        case DONE:
1112
172k
            ret = Z_STREAM_END;
1113
172k
            goto inf_leave;
1114
84.9k
        case BAD:
1115
84.9k
            ret = Z_DATA_ERROR;
1116
84.9k
            goto inf_leave;
1117
0
        case MEM:
1118
0
            return Z_MEM_ERROR;
1119
0
        case SYNC:
1120
                /* fallthrough */
1121
0
        default:
1122
0
            return Z_STREAM_ERROR;
1123
11.7M
        }
1124
1125
    /*
1126
       Return from inflate(), updating the total counts and the check value.
1127
       If there was no progress during the inflate() call, return a buffer
1128
       error.  Call updatewindow() to create and/or update the window state.
1129
       Note: a memory error from inflate() is non-recoverable.
1130
     */
1131
1.68M
  inf_leave:
1132
1.68M
    RESTORE();
1133
1.68M
    if (state->wsize || (out != strm->avail_out && state->mode < BAD &&
1134
174k
            (state->mode < CHECK || flush != Z_FINISH)))
1135
1.53M
        if (updatewindow(strm, strm->next_out, out - strm->avail_out)) {
1136
0
            state->mode = MEM;
1137
0
            return Z_MEM_ERROR;
1138
0
        }
1139
1.68M
    in -= strm->avail_in;
1140
1.68M
    out -= strm->avail_out;
1141
1.68M
    strm->total_in += in;
1142
1.68M
    strm->total_out += out;
1143
1.68M
    state->total += out;
1144
1.68M
    if ((state->wrap & 4) && out)
1145
746k
        strm->adler = state->check =
1146
746k
            UPDATE_CHECK(state->check, strm->next_out - out, out);
1147
1.68M
    strm->data_type = (int)state->bits + (state->last ? 64 : 0) +
1148
1.68M
                      (state->mode == TYPE ? 128 : 0) +
1149
1.68M
                      (state->mode == LEN_ || state->mode == COPY_ ? 256 : 0);
1150
1.68M
    if (((in == 0 && out == 0) || flush == Z_FINISH) && ret == Z_OK)
1151
42.4k
        ret = Z_BUF_ERROR;
1152
1.68M
    return ret;
1153
1.68M
}
1154
1155
320k
int ZEXPORT inflateEnd(z_streamp strm) {
1156
320k
    struct inflate_state FAR *state;
1157
320k
    if (inflateStateCheck(strm))
1158
0
        return Z_STREAM_ERROR;
1159
320k
    state = (struct inflate_state FAR *)strm->state;
1160
320k
    if (state->window != Z_NULL) ZFREE(strm, state->window);
1161
320k
    ZFREE(strm, strm->state);
1162
320k
    strm->state = Z_NULL;
1163
320k
    Tracev((stderr, "inflate: end\n"));
1164
320k
    return Z_OK;
1165
320k
}
1166
1167
int ZEXPORT inflateGetDictionary(z_streamp strm, Bytef *dictionary,
1168
0
                                 uInt *dictLength) {
1169
0
    struct inflate_state FAR *state;
1170
1171
    /* check state */
1172
0
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
1173
0
    state = (struct inflate_state FAR *)strm->state;
1174
1175
    /* copy dictionary */
1176
0
    if (state->whave && dictionary != Z_NULL) {
1177
0
        zmemcpy(dictionary, state->window + state->wnext,
1178
0
                state->whave - state->wnext);
1179
0
        zmemcpy(dictionary + state->whave - state->wnext,
1180
0
                state->window, state->wnext);
1181
0
    }
1182
0
    if (dictLength != Z_NULL)
1183
0
        *dictLength = state->whave;
1184
0
    return Z_OK;
1185
0
}
1186
1187
int ZEXPORT inflateSetDictionary(z_streamp strm, const Bytef *dictionary,
1188
0
                                 uInt dictLength) {
1189
0
    struct inflate_state FAR *state;
1190
0
    unsigned long dictid;
1191
0
    int ret;
1192
1193
    /* check state */
1194
0
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
1195
0
    state = (struct inflate_state FAR *)strm->state;
1196
0
    if (state->wrap != 0 && state->mode != DICT)
1197
0
        return Z_STREAM_ERROR;
1198
1199
    /* check for correct dictionary identifier */
1200
0
    if (state->mode == DICT) {
1201
0
        dictid = adler32(0L, Z_NULL, 0);
1202
0
        dictid = adler32(dictid, dictionary, dictLength);
1203
0
        if (dictid != state->check)
1204
0
            return Z_DATA_ERROR;
1205
0
    }
1206
1207
    /* copy dictionary to window using updatewindow(), which will amend the
1208
       existing dictionary if appropriate */
1209
0
    ret = updatewindow(strm, dictionary + dictLength, dictLength);
1210
0
    if (ret) {
1211
0
        state->mode = MEM;
1212
0
        return Z_MEM_ERROR;
1213
0
    }
1214
0
    state->havedict = 1;
1215
0
    Tracev((stderr, "inflate:   dictionary set\n"));
1216
0
    return Z_OK;
1217
0
}
1218
1219
0
int ZEXPORT inflateGetHeader(z_streamp strm, gz_headerp head) {
1220
0
    struct inflate_state FAR *state;
1221
1222
    /* check state */
1223
0
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
1224
0
    state = (struct inflate_state FAR *)strm->state;
1225
0
    if ((state->wrap & 2) == 0) return Z_STREAM_ERROR;
1226
1227
    /* save header structure */
1228
0
    state->head = head;
1229
0
    head->done = 0;
1230
0
    return Z_OK;
1231
0
}
1232
1233
/*
1234
   Search buf[0..len-1] for the pattern: 0, 0, 0xff, 0xff.  Return when found
1235
   or when out of input.  When called, *have is the number of pattern bytes
1236
   found in order so far, in 0..3.  On return *have is updated to the new
1237
   state.  If on return *have equals four, then the pattern was found and the
1238
   return value is how many bytes were read including the last byte of the
1239
   pattern.  If *have is less than four, then the pattern has not been found
1240
   yet and the return value is len.  In the latter case, syncsearch() can be
1241
   called again with more data and the *have state.  *have is initialized to
1242
   zero for the first call.
1243
 */
1244
local unsigned syncsearch(unsigned FAR *have, const unsigned char FAR *buf,
1245
0
                          unsigned len) {
1246
0
    unsigned got;
1247
0
    unsigned next;
1248
1249
0
    got = *have;
1250
0
    next = 0;
1251
0
    while (next < len && got < 4) {
1252
0
        if ((int)(buf[next]) == (got < 2 ? 0 : 0xff))
1253
0
            got++;
1254
0
        else if (buf[next])
1255
0
            got = 0;
1256
0
        else
1257
0
            got = 4 - got;
1258
0
        next++;
1259
0
    }
1260
0
    *have = got;
1261
0
    return next;
1262
0
}
1263
1264
0
int ZEXPORT inflateSync(z_streamp strm) {
1265
0
    unsigned len;               /* number of bytes to look at or looked at */
1266
0
    int flags;                  /* temporary to save header status */
1267
0
    unsigned long in, out;      /* temporary to save total_in and total_out */
1268
0
    unsigned char buf[4];       /* to restore bit buffer to byte string */
1269
0
    struct inflate_state FAR *state;
1270
1271
    /* check parameters */
1272
0
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
1273
0
    state = (struct inflate_state FAR *)strm->state;
1274
0
    if (strm->avail_in == 0 && state->bits < 8) return Z_BUF_ERROR;
1275
1276
    /* if first time, start search in bit buffer */
1277
0
    if (state->mode != SYNC) {
1278
0
        state->mode = SYNC;
1279
0
        state->hold >>= state->bits & 7;
1280
0
        state->bits -= state->bits & 7;
1281
0
        len = 0;
1282
0
        while (state->bits >= 8) {
1283
0
            buf[len++] = (unsigned char)(state->hold);
1284
0
            state->hold >>= 8;
1285
0
            state->bits -= 8;
1286
0
        }
1287
0
        state->have = 0;
1288
0
        syncsearch(&(state->have), buf, len);
1289
0
    }
1290
1291
    /* search available input */
1292
0
    len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1293
0
    strm->avail_in -= len;
1294
0
    strm->next_in += len;
1295
0
    strm->total_in += len;
1296
1297
    /* return no joy or set up to restart inflate() on a new block */
1298
0
    if (state->have != 4) return Z_DATA_ERROR;
1299
0
    if (state->flags == -1)
1300
0
        state->wrap = 0;    /* if no header yet, treat as raw */
1301
0
    else
1302
0
        state->wrap &= ~4;  /* no point in computing a check value now */
1303
0
    flags = state->flags;
1304
0
    in = strm->total_in;  out = strm->total_out;
1305
0
    inflateReset(strm);
1306
0
    strm->total_in = in;  strm->total_out = out;
1307
0
    state->flags = flags;
1308
0
    state->mode = TYPE;
1309
0
    return Z_OK;
1310
0
}
1311
1312
/*
1313
   Returns true if inflate is currently at the end of a block generated by
1314
   Z_SYNC_FLUSH or Z_FULL_FLUSH. This function is used by one PPP
1315
   implementation to provide an additional safety check. PPP uses
1316
   Z_SYNC_FLUSH but removes the length bytes of the resulting empty stored
1317
   block. When decompressing, PPP checks that at the end of input packet,
1318
   inflate is waiting for these length bytes.
1319
 */
1320
0
int ZEXPORT inflateSyncPoint(z_streamp strm) {
1321
0
    struct inflate_state FAR *state;
1322
1323
0
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
1324
0
    state = (struct inflate_state FAR *)strm->state;
1325
0
    return state->mode == STORED && state->bits == 0;
1326
0
}
1327
1328
0
int ZEXPORT inflateCopy(z_streamp dest, z_streamp source) {
1329
0
    struct inflate_state FAR *state;
1330
0
    struct inflate_state FAR *copy;
1331
0
    unsigned char FAR *window;
1332
1333
    /* check input */
1334
0
    if (inflateStateCheck(source) || dest == Z_NULL)
1335
0
        return Z_STREAM_ERROR;
1336
0
    state = (struct inflate_state FAR *)source->state;
1337
1338
    /* allocate space */
1339
0
    copy = (struct inflate_state FAR *)
1340
0
           ZALLOC(source, 1, sizeof(struct inflate_state));
1341
0
    if (copy == Z_NULL) return Z_MEM_ERROR;
1342
0
    zmemzero(copy, sizeof(struct inflate_state));
1343
0
    window = Z_NULL;
1344
0
    if (state->window != Z_NULL) {
1345
0
        window = (unsigned char FAR *)
1346
0
                 ZALLOC(source, 1U << state->wbits, sizeof(unsigned char));
1347
0
        if (window == Z_NULL) {
1348
0
            ZFREE(source, copy);
1349
0
            return Z_MEM_ERROR;
1350
0
        }
1351
0
    }
1352
1353
    /* copy state */
1354
0
    zmemcpy(dest, source, sizeof(z_stream));
1355
0
    zmemcpy(copy, state, sizeof(struct inflate_state));
1356
0
    copy->strm = dest;
1357
0
    if (state->lencode >= state->codes &&
1358
0
        state->lencode <= state->codes + ENOUGH - 1) {
1359
0
        copy->lencode = copy->codes + (state->lencode - state->codes);
1360
0
        copy->distcode = copy->codes + (state->distcode - state->codes);
1361
0
    }
1362
0
    copy->next = copy->codes + (state->next - state->codes);
1363
0
    if (window != Z_NULL)
1364
0
        zmemcpy(window, state->window, state->whave);
1365
0
    copy->window = window;
1366
0
    dest->state = (struct internal_state FAR *)copy;
1367
0
    return Z_OK;
1368
0
}
1369
1370
0
int ZEXPORT inflateUndermine(z_streamp strm, int subvert) {
1371
0
    struct inflate_state FAR *state;
1372
1373
0
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
1374
0
    state = (struct inflate_state FAR *)strm->state;
1375
#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
1376
    state->sane = !subvert;
1377
    return Z_OK;
1378
#else
1379
0
    (void)subvert;
1380
0
    state->sane = 1;
1381
0
    return Z_DATA_ERROR;
1382
0
#endif
1383
0
}
1384
1385
0
int ZEXPORT inflateValidate(z_streamp strm, int check) {
1386
0
    struct inflate_state FAR *state;
1387
1388
0
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
1389
0
    state = (struct inflate_state FAR *)strm->state;
1390
0
    if (check && state->wrap)
1391
0
        state->wrap |= 4;
1392
0
    else
1393
0
        state->wrap &= ~4;
1394
0
    return Z_OK;
1395
0
}
1396
1397
0
long ZEXPORT inflateMark(z_streamp strm) {
1398
0
    struct inflate_state FAR *state;
1399
1400
0
    if (inflateStateCheck(strm))
1401
0
        return -(1L << 16);
1402
0
    state = (struct inflate_state FAR *)strm->state;
1403
0
    return (long)(((unsigned long)((long)state->back)) << 16) +
1404
0
        (state->mode == COPY ? state->length :
1405
0
            (state->mode == MATCH ? state->was - state->length : 0));
1406
0
}
1407
1408
0
unsigned long ZEXPORT inflateCodesUsed(z_streamp strm) {
1409
0
    struct inflate_state FAR *state;
1410
0
    if (inflateStateCheck(strm)) return (unsigned long)-1;
1411
0
    state = (struct inflate_state FAR *)strm->state;
1412
0
    return (unsigned long)(state->next - state->codes);
1413
0
}