/src/zlib/inffast.c

Source
/* inffast.c -- fast decoding
 * Copyright (C) 1995-2025 Mark Adler
 * For conditions of distribution and use, see copyright notice in zlib.h
 */

#include "zutil.h"
#include "inftrees.h"
#include "inflate.h"
#include "inffast.h"

#ifdef ASMINF
#  pragma message("Assembler code may have bugs -- use at your own risk")
#else

/*
   Decode literal, length, and distance codes and write out the resulting
   literal and match bytes until either not enough input or output is
   available, an end-of-block is encountered, or a data error is encountered.
   When large enough input and output buffers are supplied to inflate(), for
   example, a 16K input buffer and a 64K output buffer, more than 95% of the
   inflate execution time is spent in this routine.

   Entry assumptions:

        state->mode == LEN
        strm->avail_in >= 6
        strm->avail_out >= 258
        start >= strm->avail_out
        state->bits < 8

   On return, state->mode is one of:

        LEN -- ran out of enough output space or enough available input
        TYPE -- reached end of block code, inflate() to interpret next block
        BAD -- error in block data

   Notes:

    - The maximum input bits used by a length/distance pair is 15 bits for the
      length code, 5 bits for the length extra, 15 bits for the distance code,
      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.
      Therefore if strm->avail_in >= 6, then there is enough input to avoid
      checking for available input while decoding.

    - The maximum bytes that a single length/distance pair can output is 258
      bytes, which is the maximum length that can be coded.  inflate_fast()
      requires strm->avail_out >= 258 for each loop to avoid checking for
      output space.
 */
void ZLIB_INTERNAL inflate_fast(z_streamp strm, unsigned start) {
    struct inflate_state FAR *state;
    z_const unsigned char FAR *in;      /* local strm->next_in */
    z_const unsigned char FAR *last;    /* have enough input while in < last */
    unsigned char FAR *out;     /* local strm->next_out */
    unsigned char FAR *beg;     /* inflate()'s initial strm->next_out */
    unsigned char FAR *end;     /* while out < end, enough space available */
#ifdef INFLATE_STRICT
    unsigned dmax;              /* maximum distance from zlib header */
#endif
    unsigned wsize;             /* window size or zero if not using window */
    unsigned whave;             /* valid bytes in the window */
    unsigned wnext;             /* window write index */
    unsigned char FAR *window;  /* allocated sliding window, if wsize != 0 */
    unsigned long hold;         /* local strm->hold */
    unsigned bits;              /* local strm->bits */
    code const FAR *lcode;      /* local strm->lencode */
    code const FAR *dcode;      /* local strm->distcode */
    unsigned lmask;             /* mask for first level of length codes */
    unsigned dmask;             /* mask for first level of distance codes */
    code const *here;           /* retrieved table entry */
    unsigned op;                /* code bits, operation, extra bits, or */
                                /*  window position, window bytes to copy */
    unsigned len;               /* match length, unused bytes */
    unsigned dist;              /* match distance */
    unsigned char FAR *from;    /* where to copy match from */

    /* copy state to local variables */
    state = (struct inflate_state FAR *)strm->state;
    in = strm->next_in;
    last = in + (strm->avail_in - 5);
    out = strm->next_out;
    beg = out - (start - strm->avail_out);
    end = out + (strm->avail_out - 257);
#ifdef INFLATE_STRICT
    dmax = state->dmax;
#endif
    wsize = state->wsize;
    whave = state->whave;
    wnext = state->wnext;
    window = state->window;
    hold = state->hold;
    bits = state->bits;
    lcode = state->lencode;
    dcode = state->distcode;
    lmask = (1U << state->lenbits) - 1;
    dmask = (1U << state->distbits) - 1;

    /* decode literals and length/distances until end-of-block or not enough
       input data or output space */
    do {
        if (bits < 15) {
            hold += (unsigned long)(*in++) << bits;
            bits += 8;
            hold += (unsigned long)(*in++) << bits;
            bits += 8;
        }
        here = lcode + (hold & lmask);
      dolen:
        op = (unsigned)(here->bits);
        hold >>= op;
        bits -= op;
        op = (unsigned)(here->op);
        if (op == 0) {                          /* literal */
            Tracevv((stderr, here->val >= 0x20 && here->val < 0x7f ?
                    "inflate:         literal '%c'\n" :
                    "inflate:         literal 0x%02x\n", here->val));
            *out++ = (unsigned char)(here->val);
        }
        else if (op & 16) {                     /* length base */
            len = (unsigned)(here->val);
            op &= 15;                           /* number of extra bits */
            if (op) {
                if (bits < op) {
                    hold += (unsigned long)(*in++) << bits;
                    bits += 8;
                }
                len += (unsigned)hold & ((1U << op) - 1);
                hold >>= op;
                bits -= op;
            }
            Tracevv((stderr, "inflate:         length %u\n", len));
            if (bits < 15) {
                hold += (unsigned long)(*in++) << bits;
                bits += 8;
                hold += (unsigned long)(*in++) << bits;
                bits += 8;
            }
            here = dcode + (hold & dmask);
          dodist:
            op = (unsigned)(here->bits);
            hold >>= op;
            bits -= op;
            op = (unsigned)(here->op);
            if (op & 16) {                      /* distance base */
                dist = (unsigned)(here->val);
                op &= 15;                       /* number of extra bits */
                if (bits < op) {
                    hold += (unsigned long)(*in++) << bits;
                    bits += 8;
                    if (bits < op) {
                        hold += (unsigned long)(*in++) << bits;
                        bits += 8;
                    }
                }
                dist += (unsigned)hold & ((1U << op) - 1);
#ifdef INFLATE_STRICT
                if (dist > dmax) {
                    strm->msg = (z_const char *)
                        "invalid distance too far back";
                    state->mode = BAD;
                    break;
                }
#endif
                hold >>= op;
                bits -= op;
                Tracevv((stderr, "inflate:         distance %u\n", dist));
                op = (unsigned)(out - beg);     /* max distance in output */
                if (dist > op) {                /* see if copy from window */
                    op = dist - op;             /* distance back in window */
                    if (op > whave) {
                        if (state->sane) {
                            strm->msg = (z_const char *)
                                "invalid distance too far back";
                            state->mode = BAD;
                            break;
                        }
#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
                        if (len <= op - whave) {
                            do {
                                *out++ = 0;
                            } while (--len);
                            continue;
                        }
                        len -= op - whave;
                        do {
                            *out++ = 0;
                        } while (--op > whave);
                        if (op == 0) {
                            from = out - dist;
                            do {
                                *out++ = *from++;
                            } while (--len);
                            continue;
                        }
#endif
                    }
                    from = window;
                    if (wnext == 0) {           /* very common case */
                        from += wsize - op;
                        if (op < len) {         /* some from window */
                            len -= op;
                            do {
                                *out++ = *from++;
                            } while (--op);
                            from = out - dist;  /* rest from output */
                        }
                    }
                    else if (wnext < op) {      /* wrap around window */
                        from += wsize + wnext - op;
                        op -= wnext;
                        if (op < len) {         /* some from end of window */
                            len -= op;
                            do {
                                *out++ = *from++;
                            } while (--op);
                            from = window;
                            if (wnext < len) {  /* some from start of window */
                                op = wnext;
                                len -= op;
                                do {
                                    *out++ = *from++;
                                } while (--op);
                                from = out - dist;      /* rest from output */
                            }
                        }
                    }
                    else {                      /* contiguous in window */
                        from += wnext - op;
                        if (op < len) {         /* some from window */
                            len -= op;
                            do {
                                *out++ = *from++;
                            } while (--op);
                            from = out - dist;  /* rest from output */
                        }
                    }
                    while (len > 2) {
                        *out++ = *from++;
                        *out++ = *from++;
                        *out++ = *from++;
                        len -= 3;
                    }
                    if (len) {
                        *out++ = *from++;
                        if (len > 1)
                            *out++ = *from++;
                    }
                }
                else {
                    from = out - dist;          /* copy direct from output */
                    do {                        /* minimum length is three */
                        *out++ = *from++;
                        *out++ = *from++;
                        *out++ = *from++;
                        len -= 3;
                    } while (len > 2);
                    if (len) {
                        *out++ = *from++;
                        if (len > 1)
                            *out++ = *from++;
                    }
                }
            }
            else if ((op & 64) == 0) {          /* 2nd level distance code */
                here = dcode + here->val + (hold & ((1U << op) - 1));
                goto dodist;
            }
            else {
                strm->msg = (z_const char *)"invalid distance code";
                state->mode = BAD;
                break;
            }
        }
        else if ((op & 64) == 0) {              /* 2nd level length code */
            here = lcode + here->val + (hold & ((1U << op) - 1));
            goto dolen;
        }
        else if (op & 32) {                     /* end-of-block */
            Tracevv((stderr, "inflate:         end of block\n"));
            state->mode = TYPE;
            break;
        }
        else {
            strm->msg = (z_const char *)"invalid literal/length code";
            state->mode = BAD;
            break;
        }
    } while (in < last && out < end);

    /* return unused bytes (on entry, bits < 8, so in won't go too far back) */
    len = bits >> 3;
    in -= len;
    bits -= len << 3;
    hold &= (1U << bits) - 1;

    /* update state and return */
    strm->next_in = in;
    strm->next_out = out;
    strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
    strm->avail_out = (unsigned)(out < end ?
                                 257 + (end - out) : 257 - (out - end));
    state->hold = hold;
    state->bits = bits;
    return;
}

/*
   inflate_fast() speedups that turned out slower (on a PowerPC G3 750CXe):
   - Using bit fields for code structure
   - Different op definition to avoid & for extra bits (do & for table bits)
   - Three separate decoding do-loops for direct, window, and wnext == 0
   - Special case for distance > 1 copies to do overlapped load and store copy
   - Explicit branch predictions (based on measured branch probabilities)
   - Deferring match copy and interspersed it with decoding subsequent codes
   - Swapping literal/length else
   - Swapping window/direct else
   - Larger unrolled copy loops (three is about right)
   - Moving len -= 3 statement into middle of loop
 */

#endif /* !ASMINF */

Coverage Report

Created: 2025-12-31 07:53

Line	Count	Source
1		/* inffast.c -- fast decoding
2		* Copyright (C) 1995-2025 Mark Adler
3		* For conditions of distribution and use, see copyright notice in zlib.h
4		*/
5
6		#include "zutil.h"
7		#include "inftrees.h"
8		#include "inflate.h"
9		#include "inffast.h"
10
11		#ifdef ASMINF
12		# pragma message("Assembler code may have bugs -- use at your own risk")
13		#else
14
15		/*
16		Decode literal, length, and distance codes and write out the resulting
17		literal and match bytes until either not enough input or output is
18		available, an end-of-block is encountered, or a data error is encountered.
19		When large enough input and output buffers are supplied to inflate(), for
20		example, a 16K input buffer and a 64K output buffer, more than 95% of the
21		inflate execution time is spent in this routine.
22
23		Entry assumptions:
24
25		state->mode == LEN
26		strm->avail_in >= 6
27		strm->avail_out >= 258
28		start >= strm->avail_out
29		state->bits < 8
30
31		On return, state->mode is one of:
32
33		LEN -- ran out of enough output space or enough available input
34		TYPE -- reached end of block code, inflate() to interpret next block
35		BAD -- error in block data
36
37		Notes:
38
39		- The maximum input bits used by a length/distance pair is 15 bits for the
40		length code, 5 bits for the length extra, 15 bits for the distance code,
41		and 13 bits for the distance extra. This totals 48 bits, or six bytes.
42		Therefore if strm->avail_in >= 6, then there is enough input to avoid
43		checking for available input while decoding.
44
45		- The maximum bytes that a single length/distance pair can output is 258
46		bytes, which is the maximum length that can be coded. inflate_fast()
47		requires strm->avail_out >= 258 for each loop to avoid checking for
48		output space.
49		*/
50	3.02M	void ZLIB_INTERNAL inflate_fast(z_streamp strm, unsigned start) {
51	3.02M	struct inflate_state FAR *state;
52	3.02M	z_const unsigned char FAR in; / local strm->next_in */
53	3.02M	z_const unsigned char FAR last; / have enough input while in < last */
54	3.02M	unsigned char FAR out; / local strm->next_out */
55	3.02M	unsigned char FAR beg; / inflate()'s initial strm->next_out */
56	3.02M	unsigned char FAR end; / while out < end, enough space available */
57		#ifdef INFLATE_STRICT
58		unsigned dmax; /* maximum distance from zlib header */
59		#endif
60	3.02M	unsigned wsize; /* window size or zero if not using window */
61	3.02M	unsigned whave; /* valid bytes in the window */
62	3.02M	unsigned wnext; /* window write index */
63	3.02M	unsigned char FAR window; / allocated sliding window, if wsize != 0 */
64	3.02M	unsigned long hold; /* local strm->hold */
65	3.02M	unsigned bits; /* local strm->bits */
66	3.02M	code const FAR lcode; / local strm->lencode */
67	3.02M	code const FAR dcode; / local strm->distcode */
68	3.02M	unsigned lmask; /* mask for first level of length codes */
69	3.02M	unsigned dmask; /* mask for first level of distance codes */
70	3.02M	code const here; / retrieved table entry */
71	3.02M	unsigned op; /* code bits, operation, extra bits, or */
72		/* window position, window bytes to copy */
73	3.02M	unsigned len; /* match length, unused bytes */
74	3.02M	unsigned dist; /* match distance */
75	3.02M	unsigned char FAR from; / where to copy match from */
76
77		/* copy state to local variables */
78	3.02M	state = (struct inflate_state FAR *)strm->state;
79	3.02M	in = strm->next_in;
80	3.02M	last = in + (strm->avail_in - 5);
81	3.02M	out = strm->next_out;
82	3.02M	beg = out - (start - strm->avail_out);
83	3.02M	end = out + (strm->avail_out - 257);
84		#ifdef INFLATE_STRICT
85		dmax = state->dmax;
86		#endif
87	3.02M	wsize = state->wsize;
88	3.02M	whave = state->whave;
89	3.02M	wnext = state->wnext;
90	3.02M	window = state->window;
91	3.02M	hold = state->hold;
92	3.02M	bits = state->bits;
93	3.02M	lcode = state->lencode;
94	3.02M	dcode = state->distcode;
95	3.02M	lmask = (1U << state->lenbits) - 1;
96	3.02M	dmask = (1U << state->distbits) - 1;
97
98		/* decode literals and length/distances until end-of-block or not enough
99		input data or output space */
100	127M	do {
101	127M	if (bits < 15) {
102	62.1M	hold += (unsigned long)(*in++) << bits;
103	62.1M	bits += 8;
104	62.1M	hold += (unsigned long)(*in++) << bits;
105	62.1M	bits += 8;
106	62.1M	}
107	127M	here = lcode + (hold & lmask);
108	135M	dolen:
109	135M	op = (unsigned)(here->bits);
110	135M	hold >>= op;
111	135M	bits -= op;
112	135M	op = (unsigned)(here->op);
113	135M	if (op == 0) { /* literal */
114	70.5M	Tracevv((stderr, here->val >= 0x20 && here->val < 0x7f ?
115	70.5M	"inflate: literal '%c'\n" :
116	70.5M	"inflate: literal 0x%02x\n", here->val));
117	70.5M	*out++ = (unsigned char)(here->val);
118	70.5M	}
119	65.2M	else if (op & 16) { /* length base */
120	56.9M	len = (unsigned)(here->val);
121	56.9M	op &= 15; /* number of extra bits */
122	56.9M	if (op) {
123	18.8M	if (bits < op) {
124	75.7k	hold += (unsigned long)(*in++) << bits;
125	75.7k	bits += 8;
126	75.7k	}
127	18.8M	len += (unsigned)hold & ((1U << op) - 1);
128	18.8M	hold >>= op;
129	18.8M	bits -= op;
130	18.8M	}
131	56.9M	Tracevv((stderr, "inflate: length %u\n", len));
132	56.9M	if (bits < 15) {
133	25.0M	hold += (unsigned long)(*in++) << bits;
134	25.0M	bits += 8;
135	25.0M	hold += (unsigned long)(*in++) << bits;
136	25.0M	bits += 8;
137	25.0M	}
138	56.9M	here = dcode + (hold & dmask);
139	64.9M	dodist:
140	64.9M	op = (unsigned)(here->bits);
141	64.9M	hold >>= op;
142	64.9M	bits -= op;
143	64.9M	op = (unsigned)(here->op);
144	64.9M	if (op & 16) { /* distance base */
145	56.9M	dist = (unsigned)(here->val);
146	56.9M	op &= 15; /* number of extra bits */
147	56.9M	if (bits < op) {
148	342k	hold += (unsigned long)(*in++) << bits;
149	342k	bits += 8;
150	342k	if (bits < op) {
151	5.19k	hold += (unsigned long)(*in++) << bits;
152	5.19k	bits += 8;
153	5.19k	}
154	342k	}
155	56.9M	dist += (unsigned)hold & ((1U << op) - 1);
156		#ifdef INFLATE_STRICT
157		if (dist > dmax) {
158		strm->msg = (z_const char *)
159		"invalid distance too far back";
160		state->mode = BAD;
161		break;
162		}
163		#endif
164	56.9M	hold >>= op;
165	56.9M	bits -= op;
166	56.9M	Tracevv((stderr, "inflate: distance %u\n", dist));
167	56.9M	op = (unsigned)(out - beg); /* max distance in output */
168	56.9M	if (dist > op) { /* see if copy from window */
169	24.8M	op = dist - op; /* distance back in window */
170	24.8M	if (op > whave) {
171	25.1k	if (state->sane) {
172	25.1k	strm->msg = (z_const char *)
173	25.1k	"invalid distance too far back";
174	25.1k	state->mode = BAD;
175	25.1k	break;
176	25.1k	}
177		#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
178		if (len <= op - whave) {
179		do {
180		*out++ = 0;
181		} while (--len);
182		continue;
183		}
184		len -= op - whave;
185		do {
186		*out++ = 0;
187		} while (--op > whave);
188		if (op == 0) {
189		from = out - dist;
190		do {
191		out++ = from++;
192		} while (--len);
193		continue;
194		}
195		#endif
196	25.1k	}
197	24.7M	from = window;
198	24.7M	if (wnext == 0) { /* very common case */
199	180k	from += wsize - op;
200	180k	if (op < len) { /* some from window */
201	26.6k	len -= op;
202	2.41M	do {
203	2.41M	out++ = from++;
204	2.41M	} while (--op);
205	26.6k	from = out - dist; /* rest from output */
206	26.6k	}
207	180k	}
208	24.6M	else if (wnext < op) { /* wrap around window */
209	1.64M	from += wsize + wnext - op;
210	1.64M	op -= wnext;
211	1.64M	if (op < len) { /* some from end of window */
212	31.0k	len -= op;
213	3.02M	do {
214	3.02M	out++ = from++;
215	3.02M	} while (--op);
216	31.0k	from = window;
217	31.0k	if (wnext < len) { /* some from start of window */
218	9.13k	op = wnext;
219	9.13k	len -= op;
220	512k	do {
221	512k	out++ = from++;
222	512k	} while (--op);
223	9.13k	from = out - dist; /* rest from output */
224	9.13k	}
225	31.0k	}
226	1.64M	}
227	22.9M	else { /* contiguous in window */
228	22.9M	from += wnext - op;
229	22.9M	if (op < len) { /* some from window */
230	668k	len -= op;
231	64.7M	do {
232	64.7M	out++ = from++;
233	64.7M	} while (--op);
234	668k	from = out - dist; /* rest from output */
235	668k	}
236	22.9M	}
237	297M	while (len > 2) {
238	272M	out++ = from++;
239	272M	out++ = from++;
240	272M	out++ = from++;
241	272M	len -= 3;
242	272M	}
243	24.7M	if (len) {
244	4.50M	out++ = from++;
245	4.50M	if (len > 1)
246	2.46M	out++ = from++;
247	4.50M	}
248	24.7M	}
249	32.1M	else {
250	32.1M	from = out - dist; /* copy direct from output */
251	842M	do { /* minimum length is three */
252	842M	out++ = from++;
253	842M	out++ = from++;
254	842M	out++ = from++;
255	842M	len -= 3;
256	842M	} while (len > 2);
257	32.1M	if (len) {
258	7.77M	out++ = from++;
259	7.77M	if (len > 1)
260	5.54M	out++ = from++;
261	7.77M	}
262	32.1M	}
263	56.9M	}
264	7.95M	else if ((op & 64) == 0) { /* 2nd level distance code */
265	7.93M	here = dcode + here->val + (hold & ((1U << op) - 1));
266	7.93M	goto dodist;
267	7.93M	}
268	12.1k	else {
269	12.1k	strm->msg = (z_const char *)"invalid distance code";
270	12.1k	state->mode = BAD;
271	12.1k	break;
272	12.1k	}
273	64.9M	}
274	8.32M	else if ((op & 64) == 0) { /* 2nd level length code */
275	8.22M	here = lcode + here->val + (hold & ((1U << op) - 1));
276	8.22M	goto dolen;
277	8.22M	}
278	103k	else if (op & 32) { /* end-of-block */
279	98.9k	Tracevv((stderr, "inflate: end of block\n"));
280	98.9k	state->mode = TYPE;
281	98.9k	break;
282	98.9k	}
283	4.71k	else {
284	4.71k	strm->msg = (z_const char *)"invalid literal/length code";
285	4.71k	state->mode = BAD;
286	4.71k	break;
287	4.71k	}
288	135M	} while (in < last && out < end);
289
290		/* return unused bytes (on entry, bits < 8, so in won't go too far back) */
291	3.02M	len = bits >> 3;
292	3.02M	in -= len;
293	3.02M	bits -= len << 3;
294	3.02M	hold &= (1U << bits) - 1;
295
296		/* update state and return */
297	3.02M	strm->next_in = in;
298	3.02M	strm->next_out = out;
299	3.02M	strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
300	3.02M	strm->avail_out = (unsigned)(out < end ?
301	2.64M	257 + (end - out) : 257 - (out - end));
302	3.02M	state->hold = hold;
303	3.02M	state->bits = bits;
304	3.02M	return;
305	3.02M	}
306
307		/*
308		inflate_fast() speedups that turned out slower (on a PowerPC G3 750CXe):
309		- Using bit fields for code structure
310		- Different op definition to avoid & for extra bits (do & for table bits)
311		- Three separate decoding do-loops for direct, window, and wnext == 0
312		- Special case for distance > 1 copies to do overlapped load and store copy
313		- Explicit branch predictions (based on measured branch probabilities)
314		- Deferring match copy and interspersed it with decoding subsequent codes
315		- Swapping literal/length else
316		- Swapping window/direct else
317		- Larger unrolled copy loops (three is about right)
318		- Moving len -= 3 statement into middle of loop
319		*/
320
321		#endif /* !ASMINF */