-
Notifications
You must be signed in to change notification settings - Fork 4
/
compress.c
481 lines (436 loc) · 11.6 KB
/
compress.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
/*
* compress/uncompress archive
*
* Authors: Spencer W. Thomas (decvax!utah-cs!thomas)
* Jim McKie (decvax!mcvax!jim)
* Steve Davies (decvax!vax135!petsd!peora!srd)
* Ken Turkowski (decvax!decwrl!turtlevax!ken)
* James A. Woods (decvax!ihnp4!ames!jaw)
* Joe Orost (decvax!vax135!petsd!joe)
*
* NOTE: these functions also support "squash" (which is just a
* 13-bit compress), and "crunch" (which is a 12-bit compress
* with additional run-length encoding). AJD
*
* $Header: compress.c 1.11 95/08/01 $
* $Log: compress.c,v $
* Revision 1.11 95/08/01 xx:xx:xx BB
* Quite a few changes for Borland C/C++
* Made htab and codetab arrays dynamic.
* (Compile with -DBB_HUGE_STATIC_ARRAYS if you DO want these
* huge static arrays in your executable.)
* Changed pointers to normalized or huge pointers because
* arrays span more than 64k.
* Changed a few types from int to long because 32bits integers
* are needed.
*
* Revision 1.10 95/01/25 12:49:43 arb
* Bug fixes caused by 1.9
*
* Revision 1.9 95/01/06 12:00:06 arb
* Fixes for Alpha.
*
* Revision 1.8 94/02/28 23:57:55 arb
* Fixed number of compression bits for ArcFS format archives
*
* Revision 1.7 93/08/20 11:35:20 arb
* Prevent printing of "uncompressed" etc. if quiet flag is set
*
* Revision 1.6 92/12/07 17:17:28 duplain
* reformatted source.
*
* Revision 1.5 92/11/09 14:48:00 duplain
* Initialised offset and size from getcode() each time uncompress() called.
*
* Revision 1.4 92/11/02 11:43:14 duplain
* Correct comment about crunch/squash in header.
*
* Revision 1.3 92/10/23 14:08:13 duplain
* Minor changes to printf's at end of uncompress.
*
* Revision 1.2 92/10/01 11:20:19 duplain
* Added check for EOF.
*
* Revision 1.1 92/09/29 18:02:14 duplain
* Initial revision
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "spark.h"
#include "pack.h"
#include "main.h"
#include "crc.h"
#include "garble.h"
#include "error.h"
/* BB changed next line because of conflict with Borland's io.h */
/* #include "io.h" */
#include "nsparkio.h"
#include "arcfs.h"
#if defined(__MSDOS__) && !defined(MSDOS32)
#ifdef __WATCOMC__
#include <malloc.h>
#define farcalloc halloc
#else
#include <alloc.h> /* for farcalloc() */
#endif
#else
#define farcalloc calloc
#endif /* __MSDOS__ */
#define PBITS 16
#define CRUNCHBITS 12
#define SQUASHBITS 13
#define COMPRESSBITS 16
/* BB changed constant in next line to long: 16bits 65536 == 0 ! */
#define HSIZE 65536L
#define INIT_BITS 9 /* initial number of bits/code */
/* BB changed next macros.
* Arrays htab and codetab both exceed 64k. To prevent wraparound
at the 64k boundary, normalized or huge pointers have to be used.
Since subscripts are 16 bit ints under the Borland compiler,
subscripts have to be made explicitely long.
And finally COMPRESSBITS == 16, but 1 << 16 == 0 for 16 bits
integers! */
/* #define MAXCODE(n_bits) ((1 << (n_bits)) - 1) */
/* #define htabof(i) htab[i] */
/* #define codetabof(i) codetab[i] */
/* #define tab_prefixof(i) codetabof(i) */
/* #define tab_suffixof(i) ((char_type *)(htab))[i] */
/* #define de_stack ((char_type *)&tab_suffixof(1<<COMPRESSBITS)) */
#if defined(__MSDOS__) && !defined(MSDOS32)
#define MAXCODE(n_bits) ((long)(1L << (n_bits)) - 1L)
#define htabof(i) htab[(long)(i)]
#define codetabof(i) codetab[(long)(i)]
#define tab_prefixof(i) codetabof(i)
#define tab_suffixof(i) ((char_type huge *)(htab))[(long)(i)]
#define de_stack \
((char_type huge *)&tab_suffixof(1L<<COMPRESSBITS))
#else
#define MAXCODE(n_bits) ((1 << (n_bits)) - 1)
#define htabof(i) htab[i]
#define codetabof(i) codetab[i]
#define tab_prefixof(i) codetabof(i)
#define tab_suffixof(i) ((char_type *)(htab))[i]
#define de_stack ((char_type *)&tab_suffixof(1<<COMPRESSBITS))
#endif /* __MSDOS__ */
#define FIRST 257 /* first free entry */
#define CLEAR 256 /* table clear output code */
/* BB changed next two lines. For 16 bits, the maximum code_int
becomes zero again! (1 << 16 == 0).
Debugging the un*x version shows that
count_int should be a 32bits integer! */
/* typedef int code_int; */
/* typedef int count_int; */
#if defined(__MSDOS__) && !defined(MSDOS32)
#define NSHUGE huge
typedef long code_int;
typedef long count_int;
#else
#define NSHUGE
typedef int count_int;
typedef int code_int;
#endif /* __MSDOS__ */
typedef unsigned char char_type;
static int n_bits; /* number of bits/code */
static int maxbits; /* user settable max # bits/code */
static code_int maxcode; /* maximum code, given n_bits */
static code_int maxmaxcode; /* should NEVER generate this code */
/* BB changed next two lines.
Under Borland C/C++ static arrays are REALLY static, i.e. they
clog the executable with some 384k of `empty space'. So use
dynamic arrays instead. */
/* static count_int htab[HSIZE]; */
/* static unsigned short codetab[HSIZE]; */
#if !defined(__MSDOS__) || defined(MSDOS32)
#define BB_HUGE_STATIC_ARRAYS
#else
/* For those that do want to use static arrays:
define BB_HUGE_STATIC_ARRAYS. */
#endif
#ifdef BB_HUGE_STATIC_ARRAYS
static count_int NSHUGE htab[HSIZE];
static unsigned short NSHUGE codetab[HSIZE];
#else /* BB_HUGE_STATIC_ARRAYS */
static count_int NSHUGE *htab = NULL;
static unsigned short NSHUGE *codetab = NULL;
#endif /* BB_HUGE_STATIC_ARRAYS */
static char_type rmask[9] =
{ 0x00, 0x01, 0x03, 0x07, 0x0f, 0x1f, 0x3f, 0x7f, 0xff };
static code_int free_ent; /* first unused entry */
static int clear_flg;
static long readsize; /* number of bytes left to read */
static code_int offset; /* from getcode() */
static size_t size;
static code_int getcode(FILE * ifp);
Status
uncompress(Header *header, FILE *ifp, FILE *ofp, CompType type)
{
/* BB changed next line. stackp points to huge pointers. */
register char_type NSHUGE *stackp;
register code_int finchar;
register code_int code, oldcode, incode;
char *message;
init_garble();
#if !defined(BB_HUGE_STATIC_ARRAYS)
if (!htab)
htab = (count_int NSHUGE *) farcalloc(HSIZE, sizeof(count_int));
if (!codetab)
codetab =
(unsigned short NSHUGE *) farcalloc(HSIZE,
sizeof(unsigned short));
if (!htab || !codetab)
{
error("%s: uncompress: out of memory", ourname);
exit(1);
}
#endif /* ! BB_HUGE_STATIC_ARRAYS */
crc = 0;
clear_flg = 0;
offset = 0;
size = 0;
readsize = header->complen;
if (type == SQUASH)
maxbits = SQUASHBITS;
else if (type == UNIX_COMPRESS)
{
/* Read the unix compress header */
read_byte(ifp);
read_byte(ifp);
maxbits = read_byte(ifp) & 0x1f;
readsize -= 3;
}
else
{
if (arcfs)
{
maxbits = arcfs_maxbits;
ungarble('\0'); // Need to consume one byte of password.
}
else
{
maxbits = read_byte(ifp);
readsize--;
}
}
maxmaxcode = MAXCODE(maxbits);
/*
* As above, initialize the first 256 entries in the table.
*/
maxcode = MAXCODE(n_bits = INIT_BITS);
for (code = 255; code >= 0; code--)
{
tab_prefixof(code) = 0;
tab_suffixof(code) = (char_type) code;
}
free_ent = FIRST;
finchar = oldcode = getcode(ifp);
if (oldcode == -1) /* EOF already? */
goto compress_exit; /* Get out of here */
/* first code must be 8 bits = char */
if (type == CRUNCH)
{
putc_init();
/* BB changed next line for Borland C/C++ 4 */
putc_ncr(ofp, (Byte) finchar);
}
else
{
/* BB changed next three lines for Borland C/C++ 4 */
if (!testing)
write_byte(ofp, (Byte) finchar);
calccrc((Byte) finchar);
}
stackp = de_stack;
while ((code = getcode(ifp)) != -1)
{
if (check_stream(ifp) != FNOERR)
break;
if (code == CLEAR)
{
for (code = 255; code >= 0; code--)
tab_prefixof(code) = 0;
clear_flg = 1;
free_ent = FIRST - 1;
if ((code = getcode(ifp)) == -1) /* O, untimely death! */
break;
}
incode = code;
/*
* Special case for KwKwK string.
*/
if (code >= free_ent)
{
/* BB changed next line for Borland C/C++ 4 */
*stackp++ = (char_type) finchar;
code = oldcode;
}
/*
* Generate output characters in reverse order
*/
while (code >= 256)
{
if ((char NSHUGE *)(stackp+1) > (char NSHUGE *)(&htab[0] + HSIZE))
{
error("%s: uncompress: corrupt or garbled archive file", ourname);
exit(1);
}
*stackp++ = tab_suffixof(code);
code = tab_prefixof(code);
}
if ((char NSHUGE *)(stackp+1) > (char NSHUGE *)(&htab[0] + HSIZE))
{
error("%s: uncompress: corrupt or garbled archive file", ourname);
exit(1);
}
/* BB changed next line for Borland C/C++ 4 */
/* *stackp++ = finchar = tab_suffixof(code); */
finchar = tab_suffixof(code);
*stackp++ = (char_type) finchar;
/*
* And put them out in forward order
*/
while (stackp > de_stack)
{
stackp--;
if (type == CRUNCH)
putc_ncr(ofp, *stackp);
else
{
if (!testing)
write_byte(ofp, *stackp);
calccrc(*stackp);
}
}
/*
* Generate the new entry.
*/
if ((code = free_ent) < maxmaxcode)
{
/* BB changed next two lines for Borland C/C++ 4 */
tab_prefixof(code) = (unsigned short) oldcode;
tab_suffixof(code) = (char_type) finchar;
free_ent = code + 1;
}
/*
* Remember previous code.
*/
oldcode = incode;
}
compress_exit:
if (check_stream(ifp) == FRWERR)
return (RERR);
if (!testing && check_stream(ofp) == FRWERR)
return (WERR);
if ((Halfword) crc != header->crc)
return (CRCERR);
if (testing)
switch (type)
{
case COMPRESS:
case UNIX_COMPRESS:
message = "OK (compressed)";
break;
case CRUNCH:
message = "OK (crunched)";
break;
case SQUASH:
message = "OK (squashed)";
break;
default:
message = "internal error";
break;
}
else
switch (type)
{
case COMPRESS:
case UNIX_COMPRESS:
message = "uncompressed";
break;
case CRUNCH:
message = "uncrunched";
break;
case SQUASH:
message = "unsquashed";
break;
default:
message = "internal error";
break;
}
if (!quiet)
msg("%s", message);
return (NOERR);
}
/*
* Read one code from the input. If EOF, return -1.
*/
static code_int
getcode(FILE *ifp)
{
register code_int code;
static char_type buf[COMPRESSBITS];
register int r_off, bits;
size_t i;
/* BB changed next line. We are doing pointer-artithmatics
and that can be dangerous if other than normalized (huge)
pointers are being used. */
register char_type NSHUGE *bp = buf;
assert(offset >= 0);
if (clear_flg > 0 || (size_t) offset >= size || free_ent > maxcode)
{
int tmp_size;
/*
* If the next entry will be too big for the current code
* size, then we must increase the size. This implies
* reading a new buffer full, too.
*/
if (free_ent > maxcode)
{
n_bits++;
maxcode = n_bits == maxbits ? maxmaxcode : MAXCODE(n_bits);
}
if (clear_flg > 0)
{
maxcode = MAXCODE(n_bits = INIT_BITS);
clear_flg = 0;
}
if (readsize == 0)
return (-1);
tmp_size = readsize < n_bits ? readsize : n_bits;
assert(tmp_size >= 0);
size = fread(buf, 1, tmp_size, ifp);
if (size == 0)
return (-1); /* end of file */
for (i = 0; i < size; i++)
{
buf[i] = ungarble(buf[i]);
}
readsize -= size;
offset = 0;
/* Round size down to integral number of codes */
size = (size << 3) - (n_bits - 1);
}
r_off = (int)offset;
bits = n_bits;
/*
* Get to the first byte.
*/
bp += (r_off >> 3);
r_off &= 7;
/* Get first part (low order bits) */
code = (*bp++ >> r_off);
bits -= (8 - r_off);
r_off = 8 - r_off; /* now, offset into code word */
/* Get any 8 bit parts in the middle (<=1 for up to 16 bits). */
if (bits >= 8)
{
code |= *bp++ << r_off;
r_off += 8;
bits -= 8;
}
/* high order bits. */
code |= (*bp & rmask[bits]) << r_off;
offset += n_bits;
return (code);
}