release/src/router/busybox/archival/libarchive/decompress_uncompress.c

   1 /* vi: set sw=4 ts=4: */
   2 /* uncompress for busybox -- (c) 2002 Robert Griebl
   3  *
   4  * based on the original compress42.c source
   5  * (see disclaimer below)
   6  */
   7
   8 /* (N)compress42.c - File compression ala IEEE Computer, Mar 1992.
   9  *
  10  * Authors:
  11  *   Spencer W. Thomas   (decvax!harpo!utah-cs!utah-gr!thomas)
  12  *   Jim McKie           (decvax!mcvax!jim)
  13  *   Steve Davies        (decvax!vax135!petsd!peora!srd)
  14  *   Ken Turkowski       (decvax!decwrl!turtlevax!ken)
  15  *   James A. Woods      (decvax!ihnp4!ames!jaw)
  16  *   Joe Orost           (decvax!vax135!petsd!joe)
  17  *   Dave Mack           (csu@alembic.acs.com)
  18  *   Peter Jannesen, Network Communication Systems
  19  *                       (peter@ncs.nl)
  20  *
  21  * marc@suse.de : a small security fix for a buffer overflow
  22  *
  23  * [... History snipped ...]
  24  *
  25  */
  26
  27 #include "libbb.h"
  28 #include "bb_archive.h"
  29
  30
  31 /* Default input buffer size */
  32 #define IBUFSIZ 2048
  33
  34 /* Default output buffer size */
  35 #define OBUFSIZ 2048
  36
  37 /* Defines for third byte of header */
  38 #define BIT_MASK        0x1f    /* Mask for 'number of compresssion bits'       */
  39                                 /* Masks 0x20 and 0x40 are free.                */
  40                                 /* I think 0x20 should mean that there is       */
  41                                 /* a fourth header byte (for expansion).        */
  42 #define BLOCK_MODE      0x80    /* Block compression if table is full and       */
  43                                 /* compression rate is dropping flush tables    */
  44                                 /* the next two codes should not be changed lightly, as they must not   */
  45                                 /* lie within the contiguous general code space.                        */
  46 #define FIRST   257     /* first free entry */
  47 #define CLEAR   256     /* table clear output code */
  48
  49 #define INIT_BITS 9     /* initial number of bits/code */
  50
  51
  52 /* machine variants which require cc -Dmachine:  pdp11, z8000, DOS */
  53 #define HBITS      17   /* 50% occupancy */
  54 #define HSIZE      (1<<HBITS)
  55 #define HMASK      (HSIZE-1)    /* unused */
  56 #define HPRIME     9941         /* unused */
  57 #define BITS       16
  58 #define BITS_STR   "16"
  59 #undef  MAXSEG_64K              /* unused */
  60 #define MAXCODE(n) (1L << (n))
  61
  62 #define htabof(i)               htab[i]
  63 #define codetabof(i)            codetab[i]
  64 #define tab_prefixof(i)         codetabof(i)
  65 #define tab_suffixof(i)         ((unsigned char *)(htab))[i]
  66 #define de_stack                ((unsigned char *)&(htab[HSIZE-1]))
  67 #define clear_tab_prefixof()    memset(codetab, 0, 256)
  68
  69 /*
  70  * Decompress stdin to stdout.  This routine adapts to the codes in the
  71  * file building the "string" table on-the-fly; requiring no table to
  72  * be stored in the compressed file.
  73  */
  74
  75 IF_DESKTOP(long long) int FAST_FUNC
  76 unpack_Z_stream(transformer_aux_data_t *aux, int src_fd, int dst_fd)
  77 {
  78         IF_DESKTOP(long long total_written = 0;)
  79         IF_DESKTOP(long long) int retval = -1;
  80         unsigned char *stackp;
  81         long code;
  82         int finchar;
  83         long oldcode;
  84         long incode;
  85         int inbits;
  86         int posbits;
  87         int outpos;
  88         int insize;
  89         int bitmask;
  90         long free_ent;
  91         long maxcode;
  92         long maxmaxcode;
  93         int n_bits;
  94         int rsize = 0;
  95         unsigned char *inbuf; /* were eating insane amounts of stack - */
  96         unsigned char *outbuf; /* bad for some embedded targets */
  97         unsigned char *htab;
  98         unsigned short *codetab;
  99
 100         /* Hmm, these were statics - why?! */
 101         /* user settable max # bits/code */
 102         int maxbits; /* = BITS; */
 103         /* block compress mode -C compatible with 2.0 */
 104         int block_mode; /* = BLOCK_MODE; */
 105
 106         if (check_signature16(aux, src_fd, COMPRESS_MAGIC))
 107                 return -1;
 108
 109         inbuf = xzalloc(IBUFSIZ + 64);
 110         outbuf = xzalloc(OBUFSIZ + 2048);
 111         htab = xzalloc(HSIZE);  /* wasn't zeroed out before, maybe can xmalloc? */
 112         codetab = xzalloc(HSIZE * sizeof(codetab[0]));
 113
 114         insize = 0;
 115
 116         /* xread isn't good here, we have to return - caller may want
 117          * to do some cleanup (e.g. delete incomplete unpacked file etc) */
 118         if (full_read(src_fd, inbuf, 1) != 1) {
 119                 bb_error_msg("short read");
 120                 goto err;
 121         }
 122
 123         maxbits = inbuf[0] & BIT_MASK;
 124         block_mode = inbuf[0] & BLOCK_MODE;
 125         maxmaxcode = MAXCODE(maxbits);
 126
 127         if (maxbits > BITS) {
 128                 bb_error_msg("compressed with %d bits, can only handle "
 129                                 BITS_STR" bits", maxbits);
 130                 goto err;
 131         }
 132
 133         n_bits = INIT_BITS;
 134         maxcode = MAXCODE(INIT_BITS) - 1;
 135         bitmask = (1 << INIT_BITS) - 1;
 136         oldcode = -1;
 137         finchar = 0;
 138         outpos = 0;
 139         posbits = 0 << 3;
 140
 141         free_ent = ((block_mode) ? FIRST : 256);
 142
 143         /* As above, initialize the first 256 entries in the table. */
 144         /*clear_tab_prefixof(); - done by xzalloc */
 145
 146         for (code = 255; code >= 0; --code) {
 147                 tab_suffixof(code) = (unsigned char) code;
 148         }
 149
 150         do {
 151  resetbuf:
 152                 {
 153                         int i;
 154                         int e;
 155                         int o;
 156
 157                         o = posbits >> 3;
 158                         e = insize - o;
 159
 160                         for (i = 0; i < e; ++i)
 161                                 inbuf[i] = inbuf[i + o];
 162
 163                         insize = e;
 164                         posbits = 0;
 165                 }
 166
 167                 if (insize < (int) (IBUFSIZ + 64) - IBUFSIZ) {
 168                         rsize = safe_read(src_fd, inbuf + insize, IBUFSIZ);
 169                         if (rsize < 0)
 170                                 bb_error_msg_and_die(bb_msg_read_error);
 171                         insize += rsize;
 172                 }
 173
 174                 inbits = ((rsize > 0) ? (insize - insize % n_bits) << 3 :
 175                                   (insize << 3) - (n_bits - 1));
 176
 177                 while (inbits > posbits) {
 178                         if (free_ent > maxcode) {
 179                                 posbits =
 180                                         ((posbits - 1) +
 181                                          ((n_bits << 3) -
 182                                           (posbits - 1 + (n_bits << 3)) % (n_bits << 3)));
 183                                 ++n_bits;
 184                                 if (n_bits == maxbits) {
 185                                         maxcode = maxmaxcode;
 186                                 } else {
 187                                         maxcode = MAXCODE(n_bits) - 1;
 188                                 }
 189                                 bitmask = (1 << n_bits) - 1;
 190                                 goto resetbuf;
 191                         }
 192                         {
 193                                 unsigned char *p = &inbuf[posbits >> 3];
 194
 195                                 code = ((((long) (p[0])) | ((long) (p[1]) << 8) |
 196                                          ((long) (p[2]) << 16)) >> (posbits & 0x7)) & bitmask;
 197                         }
 198                         posbits += n_bits;
 199
 200
 201                         if (oldcode == -1) {
 202                                 if (code >= 256)
 203                                         bb_error_msg_and_die("corrupted data"); /* %ld", code); */
 204                                 oldcode = code;
 205                                 finchar = (int) oldcode;
 206                                 outbuf[outpos++] = (unsigned char) finchar;
 207                                 continue;
 208                         }
 209
 210                         if (code == CLEAR && block_mode) {
 211                                 clear_tab_prefixof();
 212                                 free_ent = FIRST - 1;
 213                                 posbits =
 214                                         ((posbits - 1) +
 215                                          ((n_bits << 3) -
 216                                           (posbits - 1 + (n_bits << 3)) % (n_bits << 3)));
 217                                 n_bits = INIT_BITS;
 218                                 maxcode = MAXCODE(INIT_BITS) - 1;
 219                                 bitmask = (1 << INIT_BITS) - 1;
 220                                 goto resetbuf;
 221                         }
 222
 223                         incode = code;
 224                         stackp = de_stack;
 225
 226                         /* Special case for KwKwK string. */
 227                         if (code >= free_ent) {
 228                                 if (code > free_ent) {
 229                                         unsigned char *p;
 230
 231                                         posbits -= n_bits;
 232                                         p = &inbuf[posbits >> 3];
 233
 234                                         bb_error_msg
 235                                                 ("insize:%d posbits:%d inbuf:%02X %02X %02X %02X %02X (%d)",
 236                                                  insize, posbits, p[-1], p[0], p[1], p[2], p[3],
 237                                                  (posbits & 07));
 238                                         bb_error_msg("corrupted data");
 239                                         goto err;
 240                                 }
 241
 242                                 *--stackp = (unsigned char) finchar;
 243                                 code = oldcode;
 244                         }
 245
 246                         /* Generate output characters in reverse order */
 247                         while ((long) code >= (long) 256) {
 248                                 if (stackp <= &htabof(0))
 249                                         bb_error_msg_and_die("corrupted data");
 250                                 *--stackp = tab_suffixof(code);
 251                                 code = tab_prefixof(code);
 252                         }
 253
 254                         finchar = tab_suffixof(code);
 255                         *--stackp = (unsigned char) finchar;
 256
 257                         /* And put them out in forward order */
 258                         {
 259                                 int i;
 260
 261                                 i = de_stack - stackp;
 262                                 if (outpos + i >= OBUFSIZ) {
 263                                         do {
 264                                                 if (i > OBUFSIZ - outpos) {
 265                                                         i = OBUFSIZ - outpos;
 266                                                 }
 267
 268                                                 if (i > 0) {
 269                                                         memcpy(outbuf + outpos, stackp, i);
 270                                                         outpos += i;
 271                                                 }
 272
 273                                                 if (outpos >= OBUFSIZ) {
 274                                                         xwrite(dst_fd, outbuf, outpos);
 275                                                         IF_DESKTOP(total_written += outpos;)
 276                                                         outpos = 0;
 277                                                 }
 278                                                 stackp += i;
 279                                                 i = de_stack - stackp;
 280                                         } while (i > 0);
 281                                 } else {
 282                                         memcpy(outbuf + outpos, stackp, i);
 283                                         outpos += i;
 284                                 }
 285                         }
 286
 287                         /* Generate the new entry. */
 288                         code = free_ent;
 289                         if (code < maxmaxcode) {
 290                                 tab_prefixof(code) = (unsigned short) oldcode;
 291                                 tab_suffixof(code) = (unsigned char) finchar;
 292                                 free_ent = code + 1;
 293                         }
 294
 295                         /* Remember previous code.  */
 296                         oldcode = incode;
 297                 }
 298
 299         } while (rsize > 0);
 300
 301         if (outpos > 0) {
 302                 xwrite(dst_fd, outbuf, outpos);
 303                 IF_DESKTOP(total_written += outpos;)
 304         }
 305
 306         retval = IF_DESKTOP(total_written) + 0;
 307  err:
 308         free(inbuf);
 309         free(outbuf);
 310         free(htab);
 311         free(codetab);
 312         return retval;
 313 }