Coverage Report

Created: 2026-10-28 06:34

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
4.62M
local int inflateStateCheck(z_streamp strm) {
89
4.62M
    struct inflate_state FAR *state;
90
4.62M
    if (strm == Z_NULL ||
91
4.62M
        strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0)
92
0
        return 1;
93
4.62M
    state = (struct inflate_state FAR *)strm->state;
94
4.62M
    if (state == Z_NULL || state->strm != strm ||
95
4.62M
        state->mode < HEAD || state->mode > SYNC)
96
0
        return 1;
97
4.62M
    return 0;
98
4.62M
}
99
100
713k
int ZEXPORT inflateResetKeep(z_streamp strm) {
101
713k
    struct inflate_state FAR *state;
102
103
713k
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
104
713k
    state = (struct inflate_state FAR *)strm->state;
105
713k
    strm->total_in = strm->total_out = state->total = 0;
106
713k
    strm->msg = Z_NULL;
107
713k
    strm->data_type = 0;
108
713k
    if (state->wrap)        /* to support ill-conceived Java test suite */
109
151k
        strm->adler = state->wrap & 1;
110
713k
    state->mode = HEAD;
111
713k
    state->last = 0;
112
713k
    state->havedict = 0;
113
713k
    state->flags = -1;
114
713k
    state->dmax = 32768U;
115
713k
    state->head = Z_NULL;
116
713k
    state->hold = 0;
117
713k
    state->bits = 0;
118
713k
    state->lencode = state->distcode = state->next = state->codes;
119
713k
    state->sane = 1;
120
713k
    state->back = -1;
121
713k
    Tracev((stderr, "inflate: reset\n"));
122
713k
    return Z_OK;
123
713k
}
124
125
713k
int ZEXPORT inflateReset(z_streamp strm) {
126
713k
    struct inflate_state FAR *state;
127
128
713k
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
129
713k
    state = (struct inflate_state FAR *)strm->state;
130
713k
    state->wsize = 0;
131
713k
    state->whave = 0;
132
713k
    state->wnext = 0;
133
713k
    return inflateResetKeep(strm);
134
713k
}
135
136
713k
int ZEXPORT inflateReset2(z_streamp strm, int windowBits) {
137
713k
    int wrap;
138
713k
    struct inflate_state FAR *state;
139
140
    /* get the state */
141
713k
    if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
142
713k
    state = (struct inflate_state FAR *)strm->state;
143
144
    /* extract wrap request from windowBits parameter */
145
713k
    if (windowBits < 0) {
146
562k
        if (windowBits < -15)
147
0
            return Z_STREAM_ERROR;
148
562k
        wrap = 0;
149
562k
        windowBits = -windowBits;
150
562k
    }
151
151k
    else {
152
151k
        wrap = (windowBits >> 4) + 5;
153
151k
#ifdef GUNZIP
154
151k
        if (windowBits < 48)
155
151k
            windowBits &= 15;
156
151k
#endif
157
151k
    }
158
159
    /* set number of window bits, free window if different */
160
713k
    if (windowBits && (windowBits < 8 || windowBits > 15))
161
0
        return Z_STREAM_ERROR;
162
713k
    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
713k
    state->wrap = wrap;
169
713k
    state->wbits = (unsigned)windowBits;
170
713k
    return inflateReset(strm);
171
713k
}
172
173
int ZEXPORT inflateInit2_(z_streamp strm, int windowBits,
174
713k
                          const char *version, int stream_size) {
175
713k
    int ret;
176
713k
    struct inflate_state FAR *state;
177
178
713k
    if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
179
713k
        stream_size != (int)(sizeof(z_stream)))
180
0
        return Z_VERSION_ERROR;
181
713k
    if (strm == Z_NULL) return Z_STREAM_ERROR;
182
713k
    strm->msg = Z_NULL;                 /* in case we return an error */
183
713k
    if (strm->zalloc == (alloc_func)0) {
184
#ifdef Z_SOLO
185
        return Z_STREAM_ERROR;
186
#else
187
713k
        strm->zalloc = zcalloc;
188
713k
        strm->opaque = (voidpf)0;
189
713k
#endif
190
713k
    }
191
713k
    if (strm->zfree == (free_func)0)
192
#ifdef Z_SOLO
193
        return Z_STREAM_ERROR;
194
#else
195
713k
        strm->zfree = zcfree;
196
713k
#endif
197
713k
    state = (struct inflate_state FAR *)
198
713k
            ZALLOC(strm, 1, sizeof(struct inflate_state));
199
713k
    if (state == Z_NULL) return Z_MEM_ERROR;
200
713k
    zmemzero(state, sizeof(struct inflate_state));
201
713k
    Tracev((stderr, "inflate: allocated\n"));
202
713k
    strm->state = (struct internal_state FAR *)state;
203
713k
    state->strm = strm;
204
713k
    state->window = Z_NULL;
205
713k
    state->mode = HEAD;     /* to pass state test in inflateReset2() */
206
713k
    ret = inflateReset2(strm, windowBits);
207
713k
    if (ret != Z_OK) {
208
0
        ZFREE(strm, state);
209
0
        strm->state = Z_NULL;
210
0
    }
211
713k
    return ret;
212
713k
}
213
214
int ZEXPORT inflateInit_(z_streamp strm, const char *version,
215
49.8k
                         int stream_size) {
216
49.8k
    return inflateInit2_(strm, DEF_WBITS, version, stream_size);
217
49.8k
}
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.55M
local int updatewindow(z_streamp strm, const Bytef *end, unsigned copy) {
253
1.55M
    struct inflate_state FAR *state;
254
1.55M
    unsigned dist;
255
256
1.55M
    state = (struct inflate_state FAR *)strm->state;
257
258
    /* if it hasn't been done already, allocate space for the window */
259
1.55M
    if (state->window == Z_NULL) {
260
512k
        state->window = (unsigned char FAR *)
261
512k
                        ZALLOC(strm, 1U << state->wbits,
262
512k
                               sizeof(unsigned char));
263
512k
        if (state->window == Z_NULL) return 1;
264
512k
    }
265
266
    /* if window not in use yet, initialize */
267
1.55M
    if (state->wsize == 0) {
268
512k
        state->wsize = 1U << state->wbits;
269
512k
        state->wnext = 0;
270
512k
        state->whave = 0;
271
512k
    }
272
273
    /* copy state->wsize or less output bytes into the circular window */
274
1.55M
    if (copy >= state->wsize) {
275
114k
        zmemcpy(state->window, end - state->wsize, state->wsize);
276
114k
        state->wnext = 0;
277
114k
        state->whave = state->wsize;
278
114k
    }
279
1.44M
    else {
280
1.44M
        dist = state->wsize - state->wnext;
281
1.44M
        if (dist > copy) dist = copy;
282
1.44M
        zmemcpy(state->window + state->wnext, end - copy, dist);
283
1.44M
        copy -= dist;
284
1.44M
        if (copy) {
285
140k
            zmemcpy(state->window, end - copy, copy);
286
140k
            state->wnext = copy;
287
140k
            state->whave = state->wsize;
288
140k
        }
289
1.30M
        else {
290
1.30M
            state->wnext += dist;
291
1.30M
            if (state->wnext == state->wsize) state->wnext = 0;
292
1.30M
            if (state->whave < state->wsize) state->whave += dist;
293
1.30M
        }
294
1.44M
    }
295
1.55M
    return 0;
296
1.55M
}
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
278k
    (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
1.29k
    do { \
312
1.29k
        hbuf[0] = (unsigned char)(word); \
313
1.29k
        hbuf[1] = (unsigned char)((word) >> 8); \
314
1.29k
        check = crc32(check, hbuf, 2); \
315
1.29k
    } while (0)
316
317
#  define CRC4(check, word) \
318
62
    do { \
319
62
        hbuf[0] = (unsigned char)(word); \
320
62
        hbuf[1] = (unsigned char)((word) >> 8); \
321
62
        hbuf[2] = (unsigned char)((word) >> 16); \
322
62
        hbuf[3] = (unsigned char)((word) >> 24); \
323
62
        check = crc32(check, hbuf, 4); \
324
62
    } while (0)
325
#endif
326
327
/* Load registers with state in inflate() for speed */
328
#define LOAD() \
329
3.49M
    do { \
330
3.49M
        put = strm->next_out; \
331
3.49M
        left = strm->avail_out; \
332
3.49M
        next = strm->next_in; \
333
3.49M
        have = strm->avail_in; \
334
3.49M
        hold = state->hold; \
335
3.49M
        bits = state->bits; \
336
3.49M
    } while (0)
337
338
/* Restore state from registers in inflate() */
339
#define RESTORE() \
340
3.49M
    do { \
341
3.49M
        strm->next_out = put; \
342
3.49M
        strm->avail_out = left; \
343
3.49M
        strm->next_in = next; \
344
3.49M
        strm->avail_in = have; \
345
3.49M
        state->hold = hold; \
346
3.49M
        state->bits = bits; \
347
3.49M
    } while (0)
348
349
/* Clear the input bit accumulator */
350
#define INITBITS() \
351
226k
    do { \
352
226k
        hold = 0; \
353
226k
        bits = 0; \
354
226k
    } 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
14.2M
    do { \
360
14.2M
        if (have == 0) goto inf_leave; \
361
14.2M
        have--; \
362
14.1M
        hold += (unsigned long)(*next++) << bits; \
363
14.1M
        bits += 8; \
364
14.1M
    } 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
7.97M
    do { \
370
13.1M
        while (bits < (unsigned)(n)) \
371
7.97M
            PULLBYTE(); \
372
7.97M
    } while (0)
373
374
/* Return the low n bits of the bit accumulator (n < 16) */
375
#define BITS(n) \
376
43.1M
    ((unsigned)hold & ((1U << (n)) - 1))
377
378
/* Remove n bits from the bit accumulator */
379
#define DROPBITS(n) \
380
33.8M
    do { \
381
33.8M
        hold >>= (n); \
382
33.8M
        bits -= (unsigned)(n); \
383
33.8M
    } while (0)
384
385
/* Remove zero to seven bits as needed to go to a byte boundary */
386
#define BYTEBITS() \
387
611k
    do { \
388
611k
        hold >>= bits & 7; \
389
611k
        bits -= bits & 7; \
390
611k
    } 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.76M
int ZEXPORT inflate(z_streamp strm, int flush) {
475
1.76M
    struct inflate_state FAR *state;
476
1.76M
    z_const unsigned char FAR *next;    /* next input */
477
1.76M
    unsigned char FAR *put;     /* next output */
478
1.76M
    unsigned have, left;        /* available input and output */
479
1.76M
    unsigned long hold;         /* bit buffer */
480
1.76M
    unsigned bits;              /* bits in bit buffer */
481
1.76M
    unsigned in, out;           /* save starting available input and output */
482
1.76M
    unsigned copy;              /* number of stored or match bytes to copy */
483
1.76M
    unsigned char FAR *from;    /* where to copy match bytes from */
484
1.76M
    code here;                  /* current decoding table entry */
485
1.76M
    code last;                  /* parent table entry */
486
1.76M
    unsigned len;               /* length to copy for repeats, bits to drop */
487
1.76M
    int ret;                    /* return code */
488
1.76M
#ifdef GUNZIP
489
1.76M
    unsigned char hbuf[4];      /* buffer for gzip header crc calculation */
490
1.76M
#endif
491
1.76M
    static const unsigned short order[19] = /* permutation of code lengths */
492
1.76M
        {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
493
494
1.76M
    if (inflateStateCheck(strm) || strm->next_out == Z_NULL ||
495
1.76M
        (strm->next_in == Z_NULL && strm->avail_in != 0))
496
0
        return Z_STREAM_ERROR;
497
498
1.76M
    state = (struct inflate_state FAR *)strm->state;
499
1.76M
    if (state->mode == TYPE) state->mode = TYPEDO;      /* skip check */
500
1.76M
    LOAD();
501
1.76M
    in = have;
502
1.76M
    out = left;
503
1.76M
    ret = Z_OK;
504
1.76M
    for (;;)
505
13.3M
        switch (state->mode) {
506
713k
        case HEAD:
507
713k
            if (state->wrap == 0) {
508
562k
                state->mode = TYPEDO;
509
562k
                break;
510
562k
            }
511
151k
            NEEDBITS(16);
512
136k
#ifdef GUNZIP
513
136k
            if ((state->wrap & 2) && hold == 0x8b1f) {  /* gzip header */
514
1.13k
                if (state->wbits == 0)
515
0
                    state->wbits = 15;
516
1.13k
                state->check = crc32(0L, Z_NULL, 0);
517
1.13k
                CRC2(state->check, hold);
518
1.13k
                INITBITS();
519
1.13k
                state->mode = FLAGS;
520
1.13k
                break;
521
1.13k
            }
522
135k
            if (state->head != Z_NULL)
523
0
                state->head->done = -1;
524
135k
            if (!(state->wrap & 1) ||   /* check if zlib header allowed */
525
#else
526
            if (
527
#endif
528
102k
                ((BITS(8) << 8) + (hold >> 8)) % 31) {
529
37.2k
                strm->msg = (z_const char *)"incorrect header check";
530
37.2k
                state->mode = BAD;
531
37.2k
                break;
532
37.2k
            }
533
97.7k
            if (BITS(4) != Z_DEFLATED) {
534
4.32k
                strm->msg = (z_const char *)"unknown compression method";
535
4.32k
                state->mode = BAD;
536
4.32k
                break;
537
4.32k
            }
538
93.4k
            DROPBITS(4);
539
93.4k
            len = BITS(4) + 8;
540
93.4k
            if (state->wbits == 0)
541
0
                state->wbits = len;
542
93.4k
            if (len > 15 || len > state->wbits) {
543
261
                strm->msg = (z_const char *)"invalid window size";
544
261
                state->mode = BAD;
545
261
                break;
546
261
            }
547
93.1k
            state->dmax = 1U << len;
548
93.1k
            state->flags = 0;               /* indicate zlib header */
549
93.1k
            Tracev((stderr, "inflate:   zlib header ok\n"));
550
93.1k
            strm->adler = state->check = adler32(0L, Z_NULL, 0);
551
93.1k
            state->mode = hold & 0x200 ? DICTID : TYPE;
552
93.1k
            INITBITS();
553
93.1k
            break;
554
0
#ifdef GUNZIP
555
1.13k
        case FLAGS:
556
1.13k
            NEEDBITS(16);
557
1.13k
            state->flags = (int)(hold);
558
1.13k
            if ((state->flags & 0xff) != Z_DEFLATED) {
559
5
                strm->msg = (z_const char *)"unknown compression method";
560
5
                state->mode = BAD;
561
5
                break;
562
5
            }
563
1.12k
            if (state->flags & 0xe000) {
564
3
                strm->msg = (z_const char *)"unknown header flags set";
565
3
                state->mode = BAD;
566
3
                break;
567
3
            }
568
1.12k
            if (state->head != Z_NULL)
569
0
                state->head->text = (int)((hold >> 8) & 1);
570
1.12k
            if ((state->flags & 0x0200) && (state->wrap & 4))
571
63
                CRC2(state->check, hold);
572
1.12k
            INITBITS();
573
1.12k
            state->mode = TIME;
574
                /* fallthrough */
575
1.12k
        case TIME:
576
1.12k
            NEEDBITS(32);
577
1.11k
            if (state->head != Z_NULL)
578
0
                state->head->time = hold;
579
1.11k
            if ((state->flags & 0x0200) && (state->wrap & 4))
580
62
                CRC4(state->check, hold);
581
1.11k
            INITBITS();
582
1.11k
            state->mode = OS;
583
                /* fallthrough */
584
1.11k
        case OS:
585
1.11k
            NEEDBITS(16);
586
1.11k
            if (state->head != Z_NULL) {
587
0
                state->head->xflags = (int)(hold & 0xff);
588
0
                state->head->os = (int)(hold >> 8);
589
0
            }
590
1.11k
            if ((state->flags & 0x0200) && (state->wrap & 4))
591
61
                CRC2(state->check, hold);
592
1.11k
            INITBITS();
593
1.11k
            state->mode = EXLEN;
594
                /* fallthrough */
595
1.11k
        case EXLEN:
596
1.11k
            if (state->flags & 0x0400) {
597
65
                NEEDBITS(16);
598
63
                state->length = (unsigned)(hold);
599
63
                if (state->head != Z_NULL)
600
0
                    state->head->extra_len = (unsigned)hold;
601
63
                if ((state->flags & 0x0200) && (state->wrap & 4))
602
36
                    CRC2(state->check, hold);
603
63
                INITBITS();
604
63
            }
605
1.05k
            else if (state->head != Z_NULL)
606
0
                state->head->extra = Z_NULL;
607
1.11k
            state->mode = EXTRA;
608
                /* fallthrough */
609
1.13k
        case EXTRA:
610
1.13k
            if (state->flags & 0x0400) {
611
81
                copy = state->length;
612
81
                if (copy > have) copy = have;
613
81
                if (copy) {
614
73
                    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
73
                    if ((state->flags & 0x0200) && (state->wrap & 4))
623
43
                        state->check = crc32(state->check, next, copy);
624
73
                    have -= copy;
625
73
                    next += copy;
626
73
                    state->length -= copy;
627
73
                }
628
81
                if (state->length) goto inf_leave;
629
81
            }
630
1.09k
            state->length = 0;
631
1.09k
            state->mode = NAME;
632
                /* fallthrough */
633
1.27k
        case NAME:
634
1.27k
            if (state->flags & 0x0800) {
635
272
                if (have == 0) goto inf_leave;
636
270
                copy = 0;
637
4.05M
                do {
638
4.05M
                    len = (unsigned)(next[copy++]);
639
4.05M
                    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
4.05M
                } while (len && copy < have);
644
270
                if ((state->flags & 0x0200) && (state->wrap & 4))
645
128
                    state->check = crc32(state->check, next, copy);
646
270
                have -= copy;
647
270
                next += copy;
648
270
                if (len) goto inf_leave;
649
270
            }
650
1.00k
            else if (state->head != Z_NULL)
651
0
                state->head->name = Z_NULL;
652
1.06k
            state->length = 0;
653
1.06k
            state->mode = COMMENT;
654
                /* fallthrough */
655
1.24k
        case COMMENT:
656
1.24k
            if (state->flags & 0x1000) {
657
346
                if (have == 0) goto inf_leave;
658
343
                copy = 0;
659
3.89M
                do {
660
3.89M
                    len = (unsigned)(next[copy++]);
661
3.89M
                    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
3.89M
                } while (len && copy < have);
666
343
                if ((state->flags & 0x0200) && (state->wrap & 4))
667
103
                    state->check = crc32(state->check, next, copy);
668
343
                have -= copy;
669
343
                next += copy;
670
343
                if (len) goto inf_leave;
671
343
            }
672
902
            else if (state->head != Z_NULL)
673
0
                state->head->comment = Z_NULL;
674
1.02k
            state->mode = HCRC;
675
                /* fallthrough */
676
1.02k
        case HCRC:
677
1.02k
            if (state->flags & 0x0200) {
678
11
                NEEDBITS(16);
679
5
                if ((state->wrap & 4) && hold != (state->check & 0xffff)) {
680
4
                    strm->msg = (z_const char *)"header crc mismatch";
681
4
                    state->mode = BAD;
682
4
                    break;
683
4
                }
684
1
                INITBITS();
685
1
            }
686
1.01k
            if (state->head != Z_NULL) {
687
0
                state->head->hcrc = (int)((state->flags >> 9) & 1);
688
0
                state->head->done = 1;
689
0
            }
690
1.01k
            strm->adler = state->check = crc32(0L, Z_NULL, 0);
691
1.01k
            state->mode = TYPE;
692
1.01k
            break;
693
0
#endif
694
787
        case DICTID:
695
787
            NEEDBITS(32);
696
399
            strm->adler = state->check = ZSWAP32(hold);
697
399
            INITBITS();
698
399
            state->mode = DICT;
699
                /* fallthrough */
700
399
        case DICT:
701
399
            if (state->havedict == 0) {
702
399
                RESTORE();
703
399
                return Z_NEED_DICT;
704
399
            }
705
0
            strm->adler = state->check = adler32(0L, Z_NULL, 0);
706
0
            state->mode = TYPE;
707
                /* fallthrough */
708
883k
        case TYPE:
709
883k
            if (flush == Z_BLOCK || flush == Z_TREES) goto inf_leave;
710
                /* fallthrough */
711
1.44M
        case TYPEDO:
712
1.44M
            if (state->last) {
713
502k
                BYTEBITS();
714
502k
                state->mode = CHECK;
715
502k
                break;
716
502k
            }
717
944k
            NEEDBITS(3);
718
940k
            state->last = BITS(1);
719
940k
            DROPBITS(1);
720
940k
            switch (BITS(2)) {
721
106k
            case 0:                             /* stored block */
722
106k
                Tracev((stderr, "inflate:     stored block%s\n",
723
106k
                        state->last ? " (last)" : ""));
724
106k
                state->mode = STORED;
725
106k
                break;
726
605k
            case 1:                             /* fixed block */
727
605k
                inflate_fixed(state);
728
605k
                Tracev((stderr, "inflate:     fixed codes block%s\n",
729
605k
                        state->last ? " (last)" : ""));
730
605k
                state->mode = LEN_;             /* decode codes */
731
605k
                if (flush == Z_TREES) {
732
0
                    DROPBITS(2);
733
0
                    goto inf_leave;
734
0
                }
735
605k
                break;
736
605k
            case 2:                             /* dynamic block */
737
225k
                Tracev((stderr, "inflate:     dynamic codes block%s\n",
738
225k
                        state->last ? " (last)" : ""));
739
225k
                state->mode = TABLE;
740
225k
                break;
741
3.51k
            default:
742
3.51k
                strm->msg = (z_const char *)"invalid block type";
743
3.51k
                state->mode = BAD;
744
940k
            }
745
940k
            DROPBITS(2);
746
940k
            break;
747
108k
        case STORED:
748
108k
            BYTEBITS();                         /* go to byte boundary */
749
108k
            NEEDBITS(32);
750
102k
            if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
751
11.6k
                strm->msg = (z_const char *)"invalid stored block lengths";
752
11.6k
                state->mode = BAD;
753
11.6k
                break;
754
11.6k
            }
755
90.3k
            state->length = (unsigned)hold & 0xffff;
756
90.3k
            Tracev((stderr, "inflate:       stored length %u\n",
757
90.3k
                    state->length));
758
90.3k
            INITBITS();
759
90.3k
            state->mode = COPY_;
760
90.3k
            if (flush == Z_TREES) goto inf_leave;
761
                /* fallthrough */
762
90.3k
        case COPY_:
763
90.3k
            state->mode = COPY;
764
                /* fallthrough */
765
105k
        case COPY:
766
105k
            copy = state->length;
767
105k
            if (copy) {
768
20.3k
                if (copy > have) copy = have;
769
20.3k
                if (copy > left) copy = left;
770
20.3k
                if (copy == 0) goto inf_leave;
771
10.3k
                zmemcpy(put, next, copy);
772
10.3k
                have -= copy;
773
10.3k
                next += copy;
774
10.3k
                left -= copy;
775
10.3k
                put += copy;
776
10.3k
                state->length -= copy;
777
10.3k
                break;
778
20.3k
            }
779
85.3k
            Tracev((stderr, "inflate:       stored end\n"));
780
85.3k
            state->mode = TYPE;
781
85.3k
            break;
782
226k
        case TABLE:
783
226k
            NEEDBITS(14);
784
223k
            state->nlen = BITS(5) + 257;
785
223k
            DROPBITS(5);
786
223k
            state->ndist = BITS(5) + 1;
787
223k
            DROPBITS(5);
788
223k
            state->ncode = BITS(4) + 4;
789
223k
            DROPBITS(4);
790
223k
#ifndef PKZIP_BUG_WORKAROUND
791
223k
            if (state->nlen > 286 || state->ndist > 30) {
792
5.67k
                strm->msg = (z_const char *)
793
5.67k
                    "too many length or distance symbols";
794
5.67k
                state->mode = BAD;
795
5.67k
                break;
796
5.67k
            }
797
217k
#endif
798
217k
            Tracev((stderr, "inflate:       table sizes ok\n"));
799
217k
            state->have = 0;
800
217k
            state->mode = LENLENS;
801
                /* fallthrough */
802
219k
        case LENLENS:
803
3.40M
            while (state->have < state->ncode) {
804
3.18M
                NEEDBITS(3);
805
3.18M
                state->lens[order[state->have++]] = (unsigned short)BITS(3);
806
3.18M
                DROPBITS(3);
807
3.18M
            }
808
1.13M
            while (state->have < 19)
809
920k
                state->lens[order[state->have++]] = 0;
810
215k
            state->next = state->codes;
811
215k
            state->lencode = state->distcode = (const code FAR *)(state->next);
812
215k
            state->lenbits = 7;
813
215k
            ret = inflate_table(CODES, state->lens, 19, &(state->next),
814
215k
                                &(state->lenbits), state->work);
815
215k
            if (ret) {
816
22.1k
                strm->msg = (z_const char *)"invalid code lengths set";
817
22.1k
                state->mode = BAD;
818
22.1k
                break;
819
22.1k
            }
820
193k
            Tracev((stderr, "inflate:       code lengths ok\n"));
821
193k
            state->have = 0;
822
193k
            state->mode = CODELENS;
823
                /* fallthrough */
824
199k
        case CODELENS:
825
19.1M
            while (state->have < state->nlen + state->ndist) {
826
24.9M
                for (;;) {
827
24.9M
                    here = state->lencode[BITS(state->lenbits)];
828
24.9M
                    if ((unsigned)(here.bits) <= bits) break;
829
5.99M
                    PULLBYTE();
830
5.99M
                }
831
18.9M
                if (here.val < 16) {
832
17.0M
                    DROPBITS(here.bits);
833
17.0M
                    state->lens[state->have++] = here.val;
834
17.0M
                }
835
1.89M
                else {
836
1.89M
                    if (here.val == 16) {
837
541k
                        NEEDBITS(here.bits + 2);
838
539k
                        DROPBITS(here.bits);
839
539k
                        if (state->have == 0) {
840
1.74k
                            strm->msg = (z_const char *)
841
1.74k
                                "invalid bit length repeat";
842
1.74k
                            state->mode = BAD;
843
1.74k
                            break;
844
1.74k
                        }
845
537k
                        len = state->lens[state->have - 1];
846
537k
                        copy = 3 + BITS(2);
847
537k
                        DROPBITS(2);
848
537k
                    }
849
1.35M
                    else if (here.val == 17) {
850
757k
                        NEEDBITS(here.bits + 3);
851
754k
                        DROPBITS(here.bits);
852
754k
                        len = 0;
853
754k
                        copy = 3 + BITS(3);
854
754k
                        DROPBITS(3);
855
754k
                    }
856
599k
                    else {
857
599k
                        NEEDBITS(here.bits + 7);
858
597k
                        DROPBITS(here.bits);
859
597k
                        len = 0;
860
597k
                        copy = 11 + BITS(7);
861
597k
                        DROPBITS(7);
862
597k
                    }
863
1.88M
                    if (state->have + copy > state->nlen + state->ndist) {
864
5.17k
                        strm->msg = (z_const char *)
865
5.17k
                            "invalid bit length repeat";
866
5.17k
                        state->mode = BAD;
867
5.17k
                        break;
868
5.17k
                    }
869
39.7M
                    while (copy--)
870
37.8M
                        state->lens[state->have++] = (unsigned short)len;
871
1.88M
                }
872
18.9M
            }
873
874
            /* handle error breaks in while */
875
181k
            if (state->mode == BAD) break;
876
877
            /* check for end-of-block code (better have one) */
878
174k
            if (state->lens[256] == 0) {
879
5.13k
                strm->msg = (z_const char *)
880
5.13k
                    "invalid code -- missing end-of-block";
881
5.13k
                state->mode = BAD;
882
5.13k
                break;
883
5.13k
            }
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
169k
            state->next = state->codes;
889
169k
            state->lencode = (const code FAR *)(state->next);
890
169k
            state->lenbits = 9;
891
169k
            ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
892
169k
                                &(state->lenbits), state->work);
893
169k
            if (ret) {
894
5.73k
                strm->msg = (z_const char *)"invalid literal/lengths set";
895
5.73k
                state->mode = BAD;
896
5.73k
                break;
897
5.73k
            }
898
163k
            state->distcode = (const code FAR *)(state->next);
899
163k
            state->distbits = 6;
900
163k
            ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
901
163k
                            &(state->next), &(state->distbits), state->work);
902
163k
            if (ret) {
903
5.83k
                strm->msg = (z_const char *)"invalid distances set";
904
5.83k
                state->mode = BAD;
905
5.83k
                break;
906
5.83k
            }
907
157k
            Tracev((stderr, "inflate:       codes ok\n"));
908
157k
            state->mode = LEN_;
909
157k
            if (flush == Z_TREES) goto inf_leave;
910
                /* fallthrough */
911
763k
        case LEN_:
912
763k
            state->mode = LEN;
913
                /* fallthrough */
914
5.62M
        case LEN:
915
5.62M
            if (have >= 6 && left >= 258) {
916
1.73M
                RESTORE();
917
1.73M
                inflate_fast(strm, out);
918
1.73M
                LOAD();
919
1.73M
                if (state->mode == TYPE)
920
566k
                    state->back = -1;
921
1.73M
                break;
922
1.73M
            }
923
3.89M
            state->back = 0;
924
6.24M
            for (;;) {
925
6.24M
                here = state->lencode[BITS(state->lenbits)];
926
6.24M
                if ((unsigned)(here.bits) <= bits) break;
927
2.38M
                PULLBYTE();
928
2.38M
            }
929
3.86M
            if (here.op && (here.op & 0xf0) == 0) {
930
94.5k
                last = here;
931
136k
                for (;;) {
932
136k
                    here = state->lencode[last.val +
933
136k
                            (BITS(last.bits + last.op) >> last.bits)];
934
136k
                    if ((unsigned)(last.bits + here.bits) <= bits) break;
935
43.1k
                    PULLBYTE();
936
43.1k
                }
937
93.4k
                DROPBITS(last.bits);
938
93.4k
                state->back += last.bits;
939
93.4k
            }
940
3.86M
            DROPBITS(here.bits);
941
3.86M
            state->back += here.bits;
942
3.86M
            state->length = (unsigned)here.val;
943
3.86M
            if ((int)(here.op) == 0) {
944
1.90M
                Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
945
1.90M
                        "inflate:         literal '%c'\n" :
946
1.90M
                        "inflate:         literal 0x%02x\n", here.val));
947
1.90M
                state->mode = LIT;
948
1.90M
                break;
949
1.90M
            }
950
1.96M
            if (here.op & 32) {
951
138k
                Tracevv((stderr, "inflate:         end of block\n"));
952
138k
                state->back = -1;
953
138k
                state->mode = TYPE;
954
138k
                break;
955
138k
            }
956
1.82M
            if (here.op & 64) {
957
1.51k
                strm->msg = (z_const char *)"invalid literal/length code";
958
1.51k
                state->mode = BAD;
959
1.51k
                break;
960
1.51k
            }
961
1.82M
            state->extra = (unsigned)(here.op) & 15;
962
1.82M
            state->mode = LENEXT;
963
                /* fallthrough */
964
1.82M
        case LENEXT:
965
1.82M
            if (state->extra) {
966
456k
                NEEDBITS(state->extra);
967
450k
                state->length += BITS(state->extra);
968
450k
                DROPBITS(state->extra);
969
450k
                state->back += state->extra;
970
450k
            }
971
1.82M
            Tracevv((stderr, "inflate:         length %u\n", state->length));
972
1.82M
            state->was = state->length;
973
1.82M
            state->mode = DIST;
974
                /* fallthrough */
975
1.82M
        case DIST:
976
2.44M
            for (;;) {
977
2.44M
                here = state->distcode[BITS(state->distbits)];
978
2.44M
                if ((unsigned)(here.bits) <= bits) break;
979
633k
                PULLBYTE();
980
633k
            }
981
1.81M
            if ((here.op & 0xf0) == 0) {
982
59.0k
                last = here;
983
77.9k
                for (;;) {
984
77.9k
                    here = state->distcode[last.val +
985
77.9k
                            (BITS(last.bits + last.op) >> last.bits)];
986
77.9k
                    if ((unsigned)(last.bits + here.bits) <= bits) break;
987
20.3k
                    PULLBYTE();
988
20.3k
                }
989
57.5k
                DROPBITS(last.bits);
990
57.5k
                state->back += last.bits;
991
57.5k
            }
992
1.81M
            DROPBITS(here.bits);
993
1.81M
            state->back += here.bits;
994
1.81M
            if (here.op & 64) {
995
2.32k
                strm->msg = (z_const char *)"invalid distance code";
996
2.32k
                state->mode = BAD;
997
2.32k
                break;
998
2.32k
            }
999
1.81M
            state->offset = (unsigned)here.val;
1000
1.81M
            state->extra = (unsigned)(here.op) & 15;
1001
1.81M
            state->mode = DISTEXT;
1002
                /* fallthrough */
1003
1.81M
        case DISTEXT:
1004
1.81M
            if (state->extra) {
1005
951k
                NEEDBITS(state->extra);
1006
941k
                state->offset += BITS(state->extra);
1007
941k
                DROPBITS(state->extra);
1008
941k
                state->back += state->extra;
1009
941k
            }
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.80M
            Tracevv((stderr, "inflate:         distance %u\n", state->offset));
1018
1.80M
            state->mode = MATCH;
1019
                /* fallthrough */
1020
4.60M
        case MATCH:
1021
4.60M
            if (left == 0) goto inf_leave;
1022
3.60M
            copy = out - left;
1023
3.60M
            if (state->offset > copy) {         /* copy from window */
1024
1.08M
                copy = state->offset - copy;
1025
1.08M
                if (copy > state->whave) {
1026
3.67k
                    if (state->sane) {
1027
3.67k
                        strm->msg = (z_const char *)
1028
3.67k
                            "invalid distance too far back";
1029
3.67k
                        state->mode = BAD;
1030
3.67k
                        break;
1031
3.67k
                    }
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
3.67k
                }
1046
1.07M
                if (copy > state->wnext) {
1047
202k
                    copy -= state->wnext;
1048
202k
                    from = state->window + (state->wsize - copy);
1049
202k
                }
1050
875k
                else
1051
875k
                    from = state->window + (state->wnext - copy);
1052
1.07M
                if (copy > state->length) copy = state->length;
1053
1.07M
            }
1054
2.52M
            else {                              /* copy from output */
1055
2.52M
                from = put - state->offset;
1056
2.52M
                copy = state->length;
1057
2.52M
            }
1058
3.60M
            if (copy > left) copy = left;
1059
3.60M
            left -= copy;
1060
3.60M
            state->length -= copy;
1061
272M
            do {
1062
272M
                *put++ = *from++;
1063
272M
            } while (--copy);
1064
3.60M
            if (state->length == 0) state->mode = LEN;
1065
3.60M
            break;
1066
1.90M
        case LIT:
1067
1.90M
            if (left == 0) goto inf_leave;
1068
1.90M
            *put++ = (unsigned char)(state->length);
1069
1.90M
            left--;
1070
1.90M
            state->mode = LEN;
1071
1.90M
            break;
1072
504k
        case CHECK:
1073
504k
            if (state->wrap) {
1074
45.5k
                NEEDBITS(32);
1075
41.7k
                out -= left;
1076
41.7k
                strm->total_out += out;
1077
41.7k
                state->total += out;
1078
41.7k
                if ((state->wrap & 4) && out)
1079
39.8k
                    strm->adler = state->check =
1080
39.8k
                        UPDATE_CHECK(state->check, put - out, out);
1081
41.7k
                out = left;
1082
41.7k
                if ((state->wrap & 4) && (
1083
41.7k
#ifdef GUNZIP
1084
41.7k
                     state->flags ? hold :
1085
41.7k
#endif
1086
41.7k
                     ZSWAP32(hold)) != state->check) {
1087
3.35k
                    strm->msg = (z_const char *)"incorrect data check";
1088
3.35k
                    state->mode = BAD;
1089
3.35k
                    break;
1090
3.35k
                }
1091
38.3k
                INITBITS();
1092
38.3k
                Tracev((stderr, "inflate:   check matches trailer\n"));
1093
38.3k
            }
1094
497k
#ifdef GUNZIP
1095
497k
            state->mode = LENGTH;
1096
                /* fallthrough */
1097
497k
        case LENGTH:
1098
497k
            if (state->wrap && state->flags) {
1099
38
                NEEDBITS(32);
1100
33
                if ((state->wrap & 4) && hold != (state->total & 0xffffffff)) {
1101
30
                    strm->msg = (z_const char *)"incorrect length check";
1102
30
                    state->mode = BAD;
1103
30
                    break;
1104
30
                }
1105
3
                INITBITS();
1106
3
                Tracev((stderr, "inflate:   length matches trailer\n"));
1107
3
            }
1108
496k
#endif
1109
496k
            state->mode = DONE;
1110
                /* fallthrough */
1111
496k
        case DONE:
1112
496k
            ret = Z_STREAM_END;
1113
496k
            goto inf_leave;
1114
135k
        case BAD:
1115
135k
            ret = Z_DATA_ERROR;
1116
135k
            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
13.3M
        }
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.76M
  inf_leave:
1132
1.76M
    RESTORE();
1133
1.76M
    if (state->wsize || (out != strm->avail_out && state->mode < BAD &&
1134
513k
            (state->mode < CHECK || flush != Z_FINISH)))
1135
1.55M
        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.76M
    in -= strm->avail_in;
1140
1.76M
    out -= strm->avail_out;
1141
1.76M
    strm->total_in += in;
1142
1.76M
    strm->total_out += out;
1143
1.76M
    state->total += out;
1144
1.76M
    if ((state->wrap & 4) && out)
1145
238k
        strm->adler = state->check =
1146
238k
            UPDATE_CHECK(state->check, strm->next_out - out, out);
1147
1.76M
    strm->data_type = (int)state->bits + (state->last ? 64 : 0) +
1148
1.76M
                      (state->mode == TYPE ? 128 : 0) +
1149
1.76M
                      (state->mode == LEN_ || state->mode == COPY_ ? 256 : 0);
1150
1.76M
    if (((in == 0 && out == 0) || flush == Z_FINISH) && ret == Z_OK)
1151
63.3k
        ret = Z_BUF_ERROR;
1152
1.76M
    return ret;
1153
1.76M
}
1154
1155
713k
int ZEXPORT inflateEnd(z_streamp strm) {
1156
713k
    struct inflate_state FAR *state;
1157
713k
    if (inflateStateCheck(strm))
1158
0
        return Z_STREAM_ERROR;
1159
713k
    state = (struct inflate_state FAR *)strm->state;
1160
713k
    if (state->window != Z_NULL) ZFREE(strm, state->window);
1161
713k
    ZFREE(strm, strm->state);
1162
713k
    strm->state = Z_NULL;
1163
713k
    Tracev((stderr, "inflate: end\n"));
1164
713k
    return Z_OK;
1165
713k
}
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
}