4 /* uncompress for busybox -- (c) 2002 Robert Griebl
6 * based on the original compress42.c source
7 * (see disclaimer below)
11 /* (N)compress42.c - File compression ala IEEE Computer, Mar 1992.
14 * Spencer W. Thomas (decvax!harpo!utah-cs!utah-gr!thomas)
15 * Jim McKie (decvax!mcvax!jim)
16 * Steve Davies (decvax!vax135!petsd!peora!srd)
17 * Ken Turkowski (decvax!decwrl!turtlevax!ken)
18 * James A. Woods (decvax!ihnp4!ames!jaw)
19 * Joe Orost (decvax!vax135!petsd!joe)
20 * Dave Mack (csu@alembic.acs.com)
21 * Peter Jannesen, Network Communication Systems
24 * marc@suse.de : a small security fix for a buffer overflow
26 * [... History snipped ...]
33 /* Defailt input buffer size */
36 /* Default output buffer size */
39 /* Defines for third byte of header */
40 #define MAGIC_1 (char_type)'\037' /* First byte of compressed file */
41 #define MAGIC_2 (char_type)'\235' /* Second byte of compressed file */
42 #define BIT_MASK 0x1f /* Mask for 'number of compresssion bits' */
43 /* Masks 0x20 and 0x40 are free. */
44 /* I think 0x20 should mean that there is */
45 /* a fourth header byte (for expansion). */
46 #define BLOCK_MODE 0x80 /* Block compresssion if table is full and */
47 /* compression rate is dropping flush tables */
48 /* the next two codes should not be changed lightly, as they must not */
49 /* lie within the contiguous general code space. */
50 #define FIRST 257 /* first free entry */
51 #define CLEAR 256 /* table clear output code */
53 #define INIT_BITS 9 /* initial number of bits/code */
56 /* machine variants which require cc -Dmachine: pdp11, z8000, DOS */
59 #define HBITS 17 /* 50% occupancy */
60 #define HSIZE (1<<HBITS)
61 #define HMASK (HSIZE-1)
65 #define MAXCODE(n) (1L << (n))
67 /* Block compress mode -C compatible with 2.0 */
68 int block_mode = BLOCK_MODE;
70 /* user settable max # bits/code */
73 /* Exitcode of compress (-1 no file compressed) */
77 unsigned char inbuf[IBUFSIZ + 64];
80 unsigned char outbuf[OBUFSIZ + 2048];
84 unsigned short codetab[HSIZE];
86 #define htabof(i) htab[i]
87 #define codetabof(i) codetab[i]
88 #define tab_prefixof(i) codetabof(i)
89 #define tab_suffixof(i) ((unsigned char *)(htab))[i]
90 #define de_stack ((unsigned char *)&(htab[HSIZE-1]))
91 #define clear_htab() memset(htab, -1, sizeof(htab))
92 #define clear_tab_prefixof() memset(codetab, 0, 256);
96 * Decompress stdin to stdout. This routine adapts to the codes in the
97 * file building the "string" table on-the-fly; requiring no table to
98 * be stored in the compressed file. The tables used herein are shared
99 * with those of the compress() routine. See the definitions above.
102 extern int uncompress(int fd_in, int fd_out)
104 unsigned char *stackp;
122 inbuf[0] = bb_xread_char(fd_in);
124 maxbits = inbuf[0] & BIT_MASK;
125 block_mode = inbuf[0] & BLOCK_MODE;
126 maxmaxcode = MAXCODE(maxbits);
128 if (maxbits > BITS) {
129 bb_error_msg("compressed with %d bits, can only handle %d bits", maxbits,
134 maxcode = MAXCODE(n_bits = INIT_BITS) - 1;
135 bitmask = (1 << n_bits) - 1;
141 free_ent = ((block_mode) ? FIRST : 256);
143 /* As above, initialize the first 256 entries in the table. */
144 clear_tab_prefixof();
146 for (code = 255; code >= 0; --code) {
147 tab_suffixof(code) = (unsigned char) code;
157 e = insize - (o = (posbits >> 3));
159 for (i = 0; i < e; ++i)
160 inbuf[i] = inbuf[i + o];
166 if (insize < (int) sizeof(inbuf) - IBUFSIZ) {
167 rsize = safe_read(fd_in, inbuf + insize, IBUFSIZ);
171 inbits = ((rsize > 0) ? (insize - insize % n_bits) << 3 :
172 (insize << 3) - (n_bits - 1));
174 while (inbits > posbits) {
175 if (free_ent > maxcode) {
179 (posbits - 1 + (n_bits << 3)) % (n_bits << 3)));
181 if (n_bits == maxbits) {
182 maxcode = maxmaxcode;
184 maxcode = MAXCODE(n_bits) - 1;
186 bitmask = (1 << n_bits) - 1;
190 unsigned char *p = &inbuf[posbits >> 3];
193 ((((long) (p[0])) | ((long) (p[1]) << 8) |
194 ((long) (p[2]) << 16)) >> (posbits & 0x7)) & bitmask;
200 outbuf[outpos++] = (unsigned char) (finchar =
201 (int) (oldcode = code));
205 if (code == CLEAR && block_mode) {
206 clear_tab_prefixof();
207 free_ent = FIRST - 1;
211 (posbits - 1 + (n_bits << 3)) % (n_bits << 3)));
212 maxcode = MAXCODE(n_bits = INIT_BITS) - 1;
213 bitmask = (1 << n_bits) - 1;
220 /* Special case for KwKwK string. */
221 if (code >= free_ent) {
222 if (code > free_ent) {
226 p = &inbuf[posbits >> 3];
229 ("insize:%d posbits:%d inbuf:%02X %02X %02X %02X %02X (%d)",
230 insize, posbits, p[-1], p[0], p[1], p[2], p[3],
232 bb_error_msg("uncompress: corrupt input");
236 *--stackp = (unsigned char) finchar;
240 /* Generate output characters in reverse order */
241 while ((long int) code >= (long int) 256) {
242 *--stackp = tab_suffixof(code);
243 code = tab_prefixof(code);
246 *--stackp = (unsigned char) (finchar = tab_suffixof(code));
248 /* And put them out in forward order */
252 if (outpos + (i = (de_stack - stackp)) >= OBUFSIZ) {
254 if (i > OBUFSIZ - outpos) {
255 i = OBUFSIZ - outpos;
259 memcpy(outbuf + outpos, stackp, i);
263 if (outpos >= OBUFSIZ) {
264 write(fd_out, outbuf, outpos);
268 } while ((i = (de_stack - stackp)) > 0);
270 memcpy(outbuf + outpos, stackp, i);
275 /* Generate the new entry. */
276 if ((code = free_ent) < maxmaxcode) {
277 tab_prefixof(code) = (unsigned short) oldcode;
278 tab_suffixof(code) = (unsigned char) finchar;
282 /* Remember previous code. */
289 write(fd_out, outbuf, outpos);