Coverage Report

Created: 2026-06-16 06:28

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