1 /* vi: set sw=4 ts=4: */
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 /* Default 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 #define htabof(i) htab[i]
68 #define codetabof(i) codetab[i]
69 #define tab_prefixof(i) codetabof(i)
70 #define tab_suffixof(i) ((unsigned char *)(htab))[i]
71 #define de_stack ((unsigned char *)&(htab[HSIZE-1]))
72 #define clear_htab() memset(htab, -1, HSIZE)
73 #define clear_tab_prefixof() memset(codetab, 0, 256);
77 * Decompress stdin to stdout. This routine adapts to the codes in the
78 * file building the "string" table on-the-fly; requiring no table to
79 * be stored in the compressed file. The tables used herein are shared
80 * with those of the compress() routine. See the definitions above.
83 USE_DESKTOP(long long) int
84 uncompress(int fd_in, int fd_out)
86 USE_DESKTOP(long long total_written = 0;)
87 unsigned char *stackp;
102 RESERVE_CONFIG_UBUFFER(inbuf, IBUFSIZ + 64);
103 RESERVE_CONFIG_UBUFFER(outbuf, OBUFSIZ + 2048);
104 unsigned char htab[HSIZE];
105 unsigned short codetab[HSIZE];
107 /* Hmm, these were statics - why?! */
108 /* user settable max # bits/code */
109 int maxbits; /* = BITS; */
110 /* block compress mode -C compatible with 2.0 */
111 int block_mode; /* = BLOCK_MODE; */
113 memset(inbuf, 0, IBUFSIZ + 64);
114 memset(outbuf, 0, OBUFSIZ + 2048);
118 /* xread isn't good here, we have to return - caller may want
119 * to do some cleanup (e.g. delete incomplete unpacked file etc) */
120 if (full_read(fd_in, inbuf, 1) != 1) {
121 bb_error_msg("short read");
125 maxbits = inbuf[0] & BIT_MASK;
126 block_mode = inbuf[0] & BLOCK_MODE;
127 maxmaxcode = MAXCODE(maxbits);
129 if (maxbits > BITS) {
130 bb_error_msg("compressed with %d bits, can only handle "
131 "%d bits", maxbits, BITS);
136 maxcode = MAXCODE(INIT_BITS) - 1;
137 bitmask = (1 << INIT_BITS) - 1;
143 free_ent = ((block_mode) ? FIRST : 256);
145 /* As above, initialize the first 256 entries in the table. */
146 clear_tab_prefixof();
148 for (code = 255; code >= 0; --code) {
149 tab_suffixof(code) = (unsigned char) code;
162 for (i = 0; i < e; ++i)
163 inbuf[i] = inbuf[i + o];
169 if (insize < (int) (IBUFSIZ + 64) - IBUFSIZ) {
170 rsize = safe_read(fd_in, inbuf + insize, IBUFSIZ);
175 inbits = ((rsize > 0) ? (insize - insize % n_bits) << 3 :
176 (insize << 3) - (n_bits - 1));
178 while (inbits > posbits) {
179 if (free_ent > maxcode) {
183 (posbits - 1 + (n_bits << 3)) % (n_bits << 3)));
185 if (n_bits == maxbits) {
186 maxcode = maxmaxcode;
188 maxcode = MAXCODE(n_bits) - 1;
190 bitmask = (1 << n_bits) - 1;
194 unsigned char *p = &inbuf[posbits >> 3];
196 code = ((((long) (p[0])) | ((long) (p[1]) << 8) |
197 ((long) (p[2]) << 16)) >> (posbits & 0x7)) & bitmask;
204 finchar = (int) oldcode;
205 outbuf[outpos++] = (unsigned char) finchar;
209 if (code == CLEAR && block_mode) {
210 clear_tab_prefixof();
211 free_ent = FIRST - 1;
215 (posbits - 1 + (n_bits << 3)) % (n_bits << 3)));
217 maxcode = MAXCODE(INIT_BITS) - 1;
218 bitmask = (1 << INIT_BITS) - 1;
225 /* Special case for KwKwK string. */
226 if (code >= free_ent) {
227 if (code > free_ent) {
231 p = &inbuf[posbits >> 3];
234 ("insize:%d posbits:%d inbuf:%02X %02X %02X %02X %02X (%d)",
235 insize, posbits, p[-1], p[0], p[1], p[2], p[3],
237 bb_error_msg("uncompress: corrupt input");
241 *--stackp = (unsigned char) finchar;
245 /* Generate output characters in reverse order */
246 while ((long int) code >= (long int) 256) {
247 *--stackp = tab_suffixof(code);
248 code = tab_prefixof(code);
251 finchar = tab_suffixof(code);
252 *--stackp = (unsigned char) finchar;
254 /* And put them out in forward order */
258 i = de_stack - stackp;
259 if (outpos + i >= OBUFSIZ) {
261 if (i > OBUFSIZ - outpos) {
262 i = OBUFSIZ - outpos;
266 memcpy(outbuf + outpos, stackp, i);
270 if (outpos >= OBUFSIZ) {
271 full_write(fd_out, outbuf, outpos);
273 USE_DESKTOP(total_written += outpos;)
277 i = de_stack - stackp;
280 memcpy(outbuf + outpos, stackp, i);
285 /* Generate the new entry. */
287 if (code < maxmaxcode) {
288 tab_prefixof(code) = (unsigned short) oldcode;
289 tab_suffixof(code) = (unsigned char) finchar;
293 /* Remember previous code. */
300 full_write(fd_out, outbuf, outpos);
302 USE_DESKTOP(total_written += outpos;)
305 RELEASE_CONFIG_BUFFER(inbuf);
306 RELEASE_CONFIG_BUFFER(outbuf);
307 return USE_DESKTOP(total_written) + 0;