File Coverage

infback.c
Criterion Covered Total %
statement 0 270 0.0
branch 0 216 0.0
condition n/a
subroutine n/a
pod n/a
total 0 486 0.0


line stmt bran cond sub pod time code
1             /* infback.c -- inflate using a call-back interface
2             * Copyright (C) 1995-2022 Mark Adler
3             * For conditions of distribution and use, see copyright notice in zlib.h
4             */
5              
6             /*
7             This code is largely copied from inflate.c. Normally either infback.o or
8             inflate.o would be linked into an application--not both. The interface
9             with inffast.c is retained so that optimized assembler-coded versions of
10             inflate_fast() can be used with either inflate.c or infback.c.
11             */
12              
13             #include "zutil.h"
14             #include "inftrees.h"
15             #include "inflate.h"
16             #include "inffast.h"
17              
18             /* function prototypes */
19             local void fixedtables OF((struct inflate_state FAR *state));
20              
21             /*
22             strm provides memory allocation functions in zalloc and zfree, or
23             Z_NULL to use the library memory allocation functions.
24              
25             windowBits is in the range 8..15, and window is a user-supplied
26             window and output buffer that is 2**windowBits bytes.
27             */
28 0           int ZEXPORT inflateBackInit_(
29             z_streamp strm,
30             int windowBits,
31             unsigned char FAR *window,
32             const char *version,
33             int stream_size)
34             {
35             struct inflate_state FAR *state;
36              
37 0 0         if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
    0          
    0          
38             stream_size != (int)(sizeof(z_stream)))
39 0           return Z_VERSION_ERROR;
40 0 0         if (strm == Z_NULL || window == Z_NULL ||
    0          
    0          
41 0 0         windowBits < 8 || windowBits > 15)
42 0           return Z_STREAM_ERROR;
43 0           strm->msg = Z_NULL; /* in case we return an error */
44 0 0         if (strm->zalloc == (alloc_func)0) {
45             #ifdef Z_SOLO
46 0           return Z_STREAM_ERROR;
47             #else
48             strm->zalloc = zcalloc;
49             strm->opaque = (voidpf)0;
50             #endif
51             }
52 0 0         if (strm->zfree == (free_func)0)
53             #ifdef Z_SOLO
54 0           return Z_STREAM_ERROR;
55             #else
56             strm->zfree = zcfree;
57             #endif
58 0           state = (struct inflate_state FAR *)ZALLOC(strm, 1,
59             sizeof(struct inflate_state));
60 0 0         if (state == Z_NULL) return Z_MEM_ERROR;
61             Tracev((stderr, "inflate: allocated\n"));
62 0           strm->state = (struct internal_state FAR *)state;
63 0           state->dmax = 32768U;
64 0           state->wbits = (uInt)windowBits;
65 0           state->wsize = 1U << windowBits;
66 0           state->window = window;
67 0           state->wnext = 0;
68 0           state->whave = 0;
69 0           state->sane = 1;
70 0           return Z_OK;
71             }
72              
73             /*
74             Return state with length and distance decoding tables and index sizes set to
75             fixed code decoding. Normally this returns fixed tables from inffixed.h.
76             If BUILDFIXED is defined, then instead this routine builds the tables the
77             first time it's called, and returns those tables the first time and
78             thereafter. This reduces the size of the code by about 2K bytes, in
79             exchange for a little execution time. However, BUILDFIXED should not be
80             used for threaded applications, since the rewriting of the tables and virgin
81             may not be thread-safe.
82             */
83 0           local void fixedtables(
84             struct inflate_state FAR *state)
85             {
86             #ifdef BUILDFIXED
87             static int virgin = 1;
88             static code *lenfix, *distfix;
89             static code fixed[544];
90              
91             /* build fixed huffman tables if first call (may not be thread safe) */
92             if (virgin) {
93             unsigned sym, bits;
94             static code *next;
95              
96             /* literal/length table */
97             sym = 0;
98             while (sym < 144) state->lens[sym++] = 8;
99             while (sym < 256) state->lens[sym++] = 9;
100             while (sym < 280) state->lens[sym++] = 7;
101             while (sym < 288) state->lens[sym++] = 8;
102             next = fixed;
103             lenfix = next;
104             bits = 9;
105             inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
106              
107             /* distance table */
108             sym = 0;
109             while (sym < 32) state->lens[sym++] = 5;
110             distfix = next;
111             bits = 5;
112             inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
113              
114             /* do this just once */
115             virgin = 0;
116             }
117             #else /* !BUILDFIXED */
118             # include "inffixed.h"
119             #endif /* BUILDFIXED */
120 0           state->lencode = lenfix;
121 0           state->lenbits = 9;
122 0           state->distcode = distfix;
123 0           state->distbits = 5;
124 0           }
125              
126             /* Macros for inflateBack(): */
127              
128             /* Load returned state from inflate_fast() */
129             #define LOAD() \
130             do { \
131             put = strm->next_out; \
132             left = strm->avail_out; \
133             next = strm->next_in; \
134             have = strm->avail_in; \
135             hold = state->hold; \
136             bits = state->bits; \
137             } while (0)
138              
139             /* Set state from registers for inflate_fast() */
140             #define RESTORE() \
141             do { \
142             strm->next_out = put; \
143             strm->avail_out = left; \
144             strm->next_in = next; \
145             strm->avail_in = have; \
146             state->hold = hold; \
147             state->bits = bits; \
148             } while (0)
149              
150             /* Clear the input bit accumulator */
151             #define INITBITS() \
152             do { \
153             hold = 0; \
154             bits = 0; \
155             } while (0)
156              
157             /* Assure that some input is available. If input is requested, but denied,
158             then return a Z_BUF_ERROR from inflateBack(). */
159             #define PULL() \
160             do { \
161             if (have == 0) { \
162             have = in(in_desc, &next); \
163             if (have == 0) { \
164             next = Z_NULL; \
165             ret = Z_BUF_ERROR; \
166             goto inf_leave; \
167             } \
168             } \
169             } while (0)
170              
171             /* Get a byte of input into the bit accumulator, or return from inflateBack()
172             with an error if there is no input available. */
173             #define PULLBYTE() \
174             do { \
175             PULL(); \
176             have--; \
177             hold += (unsigned long)(*next++) << bits; \
178             bits += 8; \
179             } while (0)
180              
181             /* Assure that there are at least n bits in the bit accumulator. If there is
182             not enough available input to do that, then return from inflateBack() with
183             an error. */
184             #define NEEDBITS(n) \
185             do { \
186             while (bits < (unsigned)(n)) \
187             PULLBYTE(); \
188             } while (0)
189              
190             /* Return the low n bits of the bit accumulator (n < 16) */
191             #define BITS(n) \
192             ((unsigned)hold & ((1U << (n)) - 1))
193              
194             /* Remove n bits from the bit accumulator */
195             #define DROPBITS(n) \
196             do { \
197             hold >>= (n); \
198             bits -= (unsigned)(n); \
199             } while (0)
200              
201             /* Remove zero to seven bits as needed to go to a byte boundary */
202             #define BYTEBITS() \
203             do { \
204             hold >>= bits & 7; \
205             bits -= bits & 7; \
206             } while (0)
207              
208             /* Assure that some output space is available, by writing out the window
209             if it's full. If the write fails, return from inflateBack() with a
210             Z_BUF_ERROR. */
211             #define ROOM() \
212             do { \
213             if (left == 0) { \
214             put = state->window; \
215             left = state->wsize; \
216             state->whave = left; \
217             if (out(out_desc, put, left)) { \
218             ret = Z_BUF_ERROR; \
219             goto inf_leave; \
220             } \
221             } \
222             } while (0)
223              
224             /*
225             strm provides the memory allocation functions and window buffer on input,
226             and provides information on the unused input on return. For Z_DATA_ERROR
227             returns, strm will also provide an error message.
228              
229             in() and out() are the call-back input and output functions. When
230             inflateBack() needs more input, it calls in(). When inflateBack() has
231             filled the window with output, or when it completes with data in the
232             window, it calls out() to write out the data. The application must not
233             change the provided input until in() is called again or inflateBack()
234             returns. The application must not change the window/output buffer until
235             inflateBack() returns.
236              
237             in() and out() are called with a descriptor parameter provided in the
238             inflateBack() call. This parameter can be a structure that provides the
239             information required to do the read or write, as well as accumulated
240             information on the input and output such as totals and check values.
241              
242             in() should return zero on failure. out() should return non-zero on
243             failure. If either in() or out() fails, than inflateBack() returns a
244             Z_BUF_ERROR. strm->next_in can be checked for Z_NULL to see whether it
245             was in() or out() that caused in the error. Otherwise, inflateBack()
246             returns Z_STREAM_END on success, Z_DATA_ERROR for an deflate format
247             error, or Z_MEM_ERROR if it could not allocate memory for the state.
248             inflateBack() can also return Z_STREAM_ERROR if the input parameters
249             are not correct, i.e. strm is Z_NULL or the state was not initialized.
250             */
251 0           int ZEXPORT inflateBack(
252             z_streamp strm,
253             in_func in,
254             void FAR *in_desc,
255             out_func out,
256             void FAR *out_desc)
257             {
258             struct inflate_state FAR *state;
259             z_const unsigned char FAR *next; /* next input */
260             unsigned char FAR *put; /* next output */
261             unsigned have, left; /* available input and output */
262             unsigned long hold; /* bit buffer */
263             unsigned bits; /* bits in bit buffer */
264             unsigned copy; /* number of stored or match bytes to copy */
265             unsigned char FAR *from; /* where to copy match bytes from */
266             code here; /* current decoding table entry */
267             code last; /* parent table entry */
268             unsigned len; /* length to copy for repeats, bits to drop */
269             int ret; /* return code */
270             static const unsigned short order[19] = /* permutation of code lengths */
271             {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
272              
273             /* Check that the strm exists and that the state was initialized */
274 0 0         if (strm == Z_NULL || strm->state == Z_NULL)
    0          
275 0           return Z_STREAM_ERROR;
276 0           state = (struct inflate_state FAR *)strm->state;
277              
278             /* Reset the state */
279 0           strm->msg = Z_NULL;
280 0           state->mode = TYPE;
281 0           state->last = 0;
282 0           state->whave = 0;
283 0           next = strm->next_in;
284 0 0         have = next != Z_NULL ? strm->avail_in : 0;
285 0           hold = 0;
286 0           bits = 0;
287 0           put = state->window;
288 0           left = state->wsize;
289              
290             /* Inflate until end of block marked as last */
291             for (;;)
292 0           switch (state->mode) {
293             case TYPE:
294             /* determine and dispatch block type */
295 0 0         if (state->last) {
296 0           BYTEBITS();
297 0           state->mode = DONE;
298 0           break;
299             }
300 0 0         NEEDBITS(3);
    0          
    0          
301 0           state->last = BITS(1);
302 0           DROPBITS(1);
303 0           switch (BITS(2)) {
304             case 0: /* stored block */
305             Tracev((stderr, "inflate: stored block%s\n",
306             state->last ? " (last)" : ""));
307 0           state->mode = STORED;
308 0           break;
309             case 1: /* fixed block */
310 0           fixedtables(state);
311             Tracev((stderr, "inflate: fixed codes block%s\n",
312             state->last ? " (last)" : ""));
313 0           state->mode = LEN; /* decode codes */
314 0           break;
315             case 2: /* dynamic block */
316             Tracev((stderr, "inflate: dynamic codes block%s\n",
317             state->last ? " (last)" : ""));
318 0           state->mode = TABLE;
319 0           break;
320             case 3:
321 0           strm->msg = (char *)"invalid block type";
322 0           state->mode = BAD;
323             }
324 0           DROPBITS(2);
325 0           break;
326              
327             case STORED:
328             /* get and verify stored block length */
329 0           BYTEBITS(); /* go to byte boundary */
330 0 0         NEEDBITS(32);
    0          
    0          
331 0 0         if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
332 0           strm->msg = (char *)"invalid stored block lengths";
333 0           state->mode = BAD;
334 0           break;
335             }
336 0           state->length = (unsigned)hold & 0xffff;
337             Tracev((stderr, "inflate: stored length %u\n",
338             state->length));
339 0           INITBITS();
340              
341             /* copy stored block from input to output */
342 0 0         while (state->length != 0) {
343 0           copy = state->length;
344 0 0         PULL();
    0          
345 0 0         ROOM();
    0          
346 0 0         if (copy > have) copy = have;
347 0 0         if (copy > left) copy = left;
348 0           zmemcpy(put, next, copy);
349 0           have -= copy;
350 0           next += copy;
351 0           left -= copy;
352 0           put += copy;
353 0           state->length -= copy;
354             }
355             Tracev((stderr, "inflate: stored end\n"));
356 0           state->mode = TYPE;
357 0           break;
358              
359             case TABLE:
360             /* get dynamic table entries descriptor */
361 0 0         NEEDBITS(14);
    0          
    0          
362 0           state->nlen = BITS(5) + 257;
363 0           DROPBITS(5);
364 0           state->ndist = BITS(5) + 1;
365 0           DROPBITS(5);
366 0           state->ncode = BITS(4) + 4;
367 0           DROPBITS(4);
368             #ifndef PKZIP_BUG_WORKAROUND
369 0 0         if (state->nlen > 286 || state->ndist > 30) {
    0          
370 0           strm->msg = (char *)"too many length or distance symbols";
371 0           state->mode = BAD;
372 0           break;
373             }
374             #endif
375             Tracev((stderr, "inflate: table sizes ok\n"));
376              
377             /* get code length code lengths (not a typo) */
378 0           state->have = 0;
379 0 0         while (state->have < state->ncode) {
380 0 0         NEEDBITS(3);
    0          
    0          
381 0           state->lens[order[state->have++]] = (unsigned short)BITS(3);
382 0           DROPBITS(3);
383             }
384 0 0         while (state->have < 19)
385 0           state->lens[order[state->have++]] = 0;
386 0           state->next = state->codes;
387 0           state->lencode = (code const FAR *)(state->next);
388 0           state->lenbits = 7;
389 0           ret = inflate_table(CODES, state->lens, 19, &(state->next),
390 0           &(state->lenbits), state->work);
391 0 0         if (ret) {
392 0           strm->msg = (char *)"invalid code lengths set";
393 0           state->mode = BAD;
394 0           break;
395             }
396             Tracev((stderr, "inflate: code lengths ok\n"));
397              
398             /* get length and distance code code lengths */
399 0           state->have = 0;
400 0 0         while (state->have < state->nlen + state->ndist) {
401             for (;;) {
402 0           here = state->lencode[BITS(state->lenbits)];
403 0 0         if ((unsigned)(here.bits) <= bits) break;
404 0 0         PULLBYTE();
    0          
405 0           }
406 0 0         if (here.val < 16) {
407 0           DROPBITS(here.bits);
408 0           state->lens[state->have++] = here.val;
409             }
410             else {
411 0 0         if (here.val == 16) {
412 0 0         NEEDBITS(here.bits + 2);
    0          
    0          
413 0           DROPBITS(here.bits);
414 0 0         if (state->have == 0) {
415 0           strm->msg = (char *)"invalid bit length repeat";
416 0           state->mode = BAD;
417 0           break;
418             }
419 0           len = (unsigned)(state->lens[state->have - 1]);
420 0           copy = 3 + BITS(2);
421 0           DROPBITS(2);
422             }
423 0 0         else if (here.val == 17) {
424 0 0         NEEDBITS(here.bits + 3);
    0          
    0          
425 0           DROPBITS(here.bits);
426 0           len = 0;
427 0           copy = 3 + BITS(3);
428 0           DROPBITS(3);
429             }
430             else {
431 0 0         NEEDBITS(here.bits + 7);
    0          
    0          
432 0           DROPBITS(here.bits);
433 0           len = 0;
434 0           copy = 11 + BITS(7);
435 0           DROPBITS(7);
436             }
437 0 0         if (state->have + copy > state->nlen + state->ndist) {
438 0           strm->msg = (char *)"invalid bit length repeat";
439 0           state->mode = BAD;
440 0           break;
441             }
442 0 0         while (copy--)
443 0           state->lens[state->have++] = (unsigned short)len;
444             }
445             }
446              
447             /* handle error breaks in while */
448 0 0         if (state->mode == BAD) break;
449              
450             /* check for end-of-block code (better have one) */
451 0 0         if (state->lens[256] == 0) {
452 0           strm->msg = (char *)"invalid code -- missing end-of-block";
453 0           state->mode = BAD;
454 0           break;
455             }
456              
457             /* build code tables -- note: do not change the lenbits or distbits
458             values here (9 and 6) without reading the comments in inftrees.h
459             concerning the ENOUGH constants, which depend on those values */
460 0           state->next = state->codes;
461 0           state->lencode = (code const FAR *)(state->next);
462 0           state->lenbits = 9;
463 0           ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
464 0           &(state->lenbits), state->work);
465 0 0         if (ret) {
466 0           strm->msg = (char *)"invalid literal/lengths set";
467 0           state->mode = BAD;
468 0           break;
469             }
470 0           state->distcode = (code const FAR *)(state->next);
471 0           state->distbits = 6;
472 0           ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
473 0           &(state->next), &(state->distbits), state->work);
474 0 0         if (ret) {
475 0           strm->msg = (char *)"invalid distances set";
476 0           state->mode = BAD;
477 0           break;
478             }
479             Tracev((stderr, "inflate: codes ok\n"));
480 0           state->mode = LEN;
481             /* fallthrough */
482              
483             case LEN:
484             /* use inflate_fast() if we have enough input and output */
485 0 0         if (have >= 6 && left >= 258) {
    0          
486 0           RESTORE();
487 0 0         if (state->whave < state->wsize)
488 0           state->whave = state->wsize - left;
489 0           inflate_fast(strm, state->wsize);
490 0           LOAD();
491 0           break;
492             }
493              
494             /* get a literal, length, or end-of-block code */
495             for (;;) {
496 0           here = state->lencode[BITS(state->lenbits)];
497 0 0         if ((unsigned)(here.bits) <= bits) break;
498 0 0         PULLBYTE();
    0          
499 0           }
500 0 0         if (here.op && (here.op & 0xf0) == 0) {
    0          
501 0           last = here;
502             for (;;) {
503 0           here = state->lencode[last.val +
504 0           (BITS(last.bits + last.op) >> last.bits)];
505 0 0         if ((unsigned)(last.bits + here.bits) <= bits) break;
506 0 0         PULLBYTE();
    0          
507 0           }
508 0           DROPBITS(last.bits);
509             }
510 0           DROPBITS(here.bits);
511 0           state->length = (unsigned)here.val;
512              
513             /* process literal */
514 0 0         if (here.op == 0) {
515             Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
516             "inflate: literal '%c'\n" :
517             "inflate: literal 0x%02x\n", here.val));
518 0 0         ROOM();
    0          
519 0           *put++ = (unsigned char)(state->length);
520 0           left--;
521 0           state->mode = LEN;
522 0           break;
523             }
524              
525             /* process end of block */
526 0 0         if (here.op & 32) {
527             Tracevv((stderr, "inflate: end of block\n"));
528 0           state->mode = TYPE;
529 0           break;
530             }
531              
532             /* invalid code */
533 0 0         if (here.op & 64) {
534 0           strm->msg = (char *)"invalid literal/length code";
535 0           state->mode = BAD;
536 0           break;
537             }
538              
539             /* length code -- get extra bits, if any */
540 0           state->extra = (unsigned)(here.op) & 15;
541 0 0         if (state->extra != 0) {
542 0 0         NEEDBITS(state->extra);
    0          
    0          
543 0           state->length += BITS(state->extra);
544 0           DROPBITS(state->extra);
545             }
546             Tracevv((stderr, "inflate: length %u\n", state->length));
547              
548             /* get distance code */
549             for (;;) {
550 0           here = state->distcode[BITS(state->distbits)];
551 0 0         if ((unsigned)(here.bits) <= bits) break;
552 0 0         PULLBYTE();
    0          
553 0           }
554 0 0         if ((here.op & 0xf0) == 0) {
555 0           last = here;
556             for (;;) {
557 0           here = state->distcode[last.val +
558 0           (BITS(last.bits + last.op) >> last.bits)];
559 0 0         if ((unsigned)(last.bits + here.bits) <= bits) break;
560 0 0         PULLBYTE();
    0          
561 0           }
562 0           DROPBITS(last.bits);
563             }
564 0           DROPBITS(here.bits);
565 0 0         if (here.op & 64) {
566 0           strm->msg = (char *)"invalid distance code";
567 0           state->mode = BAD;
568 0           break;
569             }
570 0           state->offset = (unsigned)here.val;
571              
572             /* get distance extra bits, if any */
573 0           state->extra = (unsigned)(here.op) & 15;
574 0 0         if (state->extra != 0) {
575 0 0         NEEDBITS(state->extra);
    0          
    0          
576 0           state->offset += BITS(state->extra);
577 0           DROPBITS(state->extra);
578             }
579 0 0         if (state->offset > state->wsize - (state->whave < state->wsize ?
580 0 0         left : 0)) {
581 0           strm->msg = (char *)"invalid distance too far back";
582 0           state->mode = BAD;
583 0           break;
584             }
585             Tracevv((stderr, "inflate: distance %u\n", state->offset));
586              
587             /* copy match from window to output */
588             do {
589 0 0         ROOM();
    0          
590 0           copy = state->wsize - state->offset;
591 0 0         if (copy < left) {
592 0           from = put + copy;
593 0           copy = left - copy;
594             }
595             else {
596 0           from = put - state->offset;
597 0           copy = left;
598             }
599 0 0         if (copy > state->length) copy = state->length;
600 0           state->length -= copy;
601 0           left -= copy;
602             do {
603 0           *put++ = *from++;
604 0 0         } while (--copy);
605 0 0         } while (state->length != 0);
606 0           break;
607              
608             case DONE:
609             /* inflate stream terminated properly */
610 0           ret = Z_STREAM_END;
611 0           goto inf_leave;
612              
613             case BAD:
614 0           ret = Z_DATA_ERROR;
615 0           goto inf_leave;
616              
617             default:
618             /* can't happen, but makes compilers happy */
619 0           ret = Z_STREAM_ERROR;
620 0           goto inf_leave;
621             }
622              
623             /* Write leftover output and return unused input */
624 0           inf_leave:
625 0 0         if (left < state->wsize) {
626 0 0         if (out(out_desc, state->window, state->wsize - left) &&
    0          
627             ret == Z_STREAM_END)
628 0           ret = Z_BUF_ERROR;
629             }
630 0           strm->next_in = next;
631 0           strm->avail_in = have;
632 0           return ret;
633             }
634              
635 0           int ZEXPORT inflateBackEnd(
636             z_streamp strm)
637             {
638 0 0         if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
    0          
    0          
639 0           return Z_STREAM_ERROR;
640 0           ZFREE(strm, strm->state);
641 0           strm->state = Z_NULL;
642             Tracev((stderr, "inflate: end\n"));
643 0           return Z_OK;
644             }