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
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <unistd.h>
#include <limits.h>
#include <sys/stat.h>
#include <time.h>
#include "self.h"
#ifndef u8
#define u8 unsigned char
#define u16 unsigned short
#endif
#define INITIAL_BITS 9
#define MAX_BITS 12
#define MAX_TOKENS (1 << MAX_BITS)
#define TOK_RESET 256
#define TOK_END 257
#define INIT_TOKEN 258 /* 256 = reset dict, 257 = token_bits++ */
#define MAX_INPUT_SIZE (1 << 24)
u8 input_buf[MAX_INPUT_SIZE];
u8 output_buf[MAX_INPUT_SIZE];
u8 byte_tokens[256];
unsigned int input_len, output_len, out_bitpos;
int opt_append = 0;
int opt_overwrite = 0;
struct stat in_file_stat;
typedef struct s_token {
u8 *start;
u16 length;
} token_t;
token_t tokentab[MAX_TOKENS];
FILE *out_file, *in_file;
const char *out_filename, *in_filename;
int token_bits;
int max_token;
int curr_token;
long hdr_compsize_pos;
int in_pos;
void init_table(void) {
int i;
memset(tokentab, 0, sizeof(tokentab));
token_bits = INITIAL_BITS;
max_token = 1 << INITIAL_BITS;
curr_token = INIT_TOKEN;
for(i = 0; i < 256; i++) {
byte_tokens[i] = (u8)i;
tokentab[i].start = &byte_tokens[i];
tokentab[i].length = 1;
}
}
void store_quad(int pos, unsigned long data) {
int i;
for(i = 0; i < 4; i++) {
output_buf[pos++] = data & 0xff;
data >>= 8;
}
}
void store_cksum(void) {
int i;
u16 cksum = 0;
for(i = 0; i < input_len; i++)
cksum += input_buf[i];
output_buf[23] = cksum & 0xff;
output_buf[24] = cksum >> 8;
}
/* examples:
foo => FOO.
toolongfile => TOOLONGF. (really should be TOOLONGF.ILE)
regular.txt => REGULAR.TXT
too.many.dots => TOO.MAN
*/
void atarify_filename(char *result) {
int i;
char name[9] = { 0 }, ext[4] = { 0 }, *p;
p = strrchr(in_filename, '/');
if(p)
p++;
else
p = (char *)in_filename;
strncpy(name, p, 8);
for(i = 0; i < 8; i++) {
if(!name[i]) break;
if(name[i] == '.') {
name[i] = '\0';
break;
}
}
strcpy(result, name);
strcat(result, ".");
p = strchr(in_filename, '.');
if(p) {
p++;
strncpy(ext, p, 3);
for(p = ext; *p; p++)
if(*p == '.') *p = 0;
strcat(result, ext);
}
for(p = result; *p; p++)
*p = toupper(*p);
}
/* see Arcinfo for the gory details. */
unsigned long get_msdos_date_time(void) {
time_t t = in_file_stat.st_mtime;
struct tm *tm;
int msdos_year;
u16 ms_date, ms_time;
tm = localtime(&t);
msdos_year = tm->tm_year + 1900 - 1980;
ms_date = tm->tm_mday | (tm->tm_mon << 5) | (msdos_year << 9);
ms_time = (tm->tm_min << 5) | (tm->tm_hour << 11);
return ms_date | (ms_time << 16);
}
void create_header(void) {
char hdr_filename[13];
atarify_filename(hdr_filename);
printf("Crunching %s\n", hdr_filename);
output_buf[0] = 0x1a;
output_buf[1] = 0x0f;
strncat((char *)&output_buf[2], hdr_filename, 13);
output_buf[14] = 0x00;
store_quad(15, 0); /* compressed size, fill in later */
store_quad(19, get_msdos_date_time());
store_cksum();
store_quad(25, input_len);
output_len = 29;
}
void update_header(void) {
store_quad(15, output_len - 29);
}
void open_input(const char *filename) {
in_filename = filename;
if(!(in_file = fopen(in_filename, "rb"))) {
perror(in_filename);
exit(1);
}
}
void inc_output_len(void) {
if(++output_len == MAX_INPUT_SIZE) {
fprintf(stderr, "%s: fatal: compressed file would be >16MB.\n", self);
exit(1);
}
}
void append_bit(int bit) {
output_buf[output_len] |= (bit << (7 - out_bitpos));
out_bitpos++;
if(out_bitpos == 8) {
out_bitpos = 0;
inc_output_len();
}
}
void store_token(int tok) {
int mask;
for(mask = 1 << (token_bits - 1); mask; mask >>= 1) {
append_bit(tok & mask ? 1 : 0);
}
}
/* match_token() is a brute-force search, which is why alf is so slow.
I'll do something smarter at some point.
search backwards, the tokens are stored with longer ones later
in the list. */
int match_token(int pos) {
int i, len, maxlen;
token_t *t;
u8 *p, *q;
maxlen = input_len - pos;
for(i = curr_token - 1; i >= INIT_TOKEN; i--) {
t = &tokentab[i];
/* don't search past the end of the input */
if(t->length > maxlen) continue;
/* if the first char doesn't match, don't bother with memcmp.
this is a 5x speedup (!) */
if(input_buf[pos] != *(t->start)) continue;
/* this is where alf spends most of its time.
using memcmp is noticeably slower than the code below. */
/*
if(memcmp(&input_buf[pos], t->start, t->length) == 0)
return i;
*/
/* inline memcmp replacement of sorts. I don't think it's really
faster than memcmp(), it only seems that way because there's
no function call overhead. ~20% speedup. */
len = t->length;
p = &input_buf[pos];
q = t->start;
while(len) {
if(*p != *q) break;
p++; q++;
len--;
}
if(!len) return i;
}
/* hard-coded single character tokens map to their values, no need
to search. */
return input_buf[pos];
}
void make_token(int start, int end) {
/* if the token table is full, reset it. basically start over like
we would with a new file. */
if(curr_token == max_token) {
if(token_bits == MAX_BITS) {
store_token(TOK_RESET); /* stored at the *old* token size! */
token_bits = INITIAL_BITS;
init_table();
return; /* since we're starting over, *don't* make a token */
} else {
token_bits++;
}
max_token = 1 << token_bits;
}
tokentab[curr_token].start = &input_buf[start];
tokentab[curr_token].length = end - start + 1;
curr_token++;
}
void crunch(void) {
int new_pos;
in_pos = 0;
int token;
out_bitpos = 0;
store_token(TOK_RESET);
while(in_pos < input_len) {
token = match_token(in_pos);
store_token(token);
new_pos = in_pos + tokentab[token].length;
// printf(" in_pos %d, new_pos %d\n", in_pos, new_pos);
if(new_pos < input_len)
make_token(in_pos, new_pos);
in_pos = new_pos;
}
store_token(TOK_END);
if(out_bitpos) inc_output_len();
update_header();
}
void make_backup(void) {
char bak[PATH_MAX + 2];
strncpy(bak, out_filename, PATH_MAX);
strcat(bak, "~");
rename(out_filename, bak);
}
void crunch_file(const char *filename) {
init_table();
open_input(filename);
/* read in entire input, couldn't do it this way on the Atari */
input_len = fread(input_buf, 1, MAX_INPUT_SIZE - 1, in_file);
if(!feof(in_file)) {
fprintf(stderr, "%s: %s: this file is too large; only compressing the first 16MB.\n", self, filename);
}
if(!input_len) {
fprintf(stderr, "%s: %s: can't compress a 0-byte (empty) file, skipping.\n", self, filename);
return;
}
output_len = 0;
fstat(fileno(in_file), &in_file_stat); /* for timestamp */
fclose(in_file);
memset(output_buf, 0, sizeof(output_buf));
create_header();
/* crunches the entire input to memory! */
crunch();
/* don't open the output file until crunch() has succeeded once.
this avoids leaving 0-byte turds */
if(!out_file) {
if(!opt_overwrite) make_backup();
out_file = fopen(out_filename, opt_append ? "ab" : "wb");
if(!out_file) {
fprintf(stderr, "%s: fatal: ", self);
perror(out_filename);
exit(1);
}
}
fwrite(output_buf, 1, output_len, out_file);
}
void usage(void) {
extern char *usage_msg[];
char **line;
puts("alf (ALF compressor) v" VERSION " by B. Watson, WTFPL.");
printf("Usage: %s [-a|-o] archive.alf file [file ...]\n", self);
puts("Options:");
for(line = usage_msg; *line; line++)
puts(*line);
exit(0);
}
int main(int argc, char **argv) {
int opt;
set_self(argv[0]);
if(argc < 2 || !strcmp(argv[1], "--help") || !strcmp(argv[1], "-h")) {
usage();
}
if(!strcmp(argv[1], "--version")) {
puts(VERSION);
exit(0);
}
/* don't let getopt() print error message for us. */
opterr = 0;
while((opt = getopt(argc, argv, "aoV")) != -1) {
switch(opt) {
case 'a': opt_append = 1; opt_overwrite = 1; break;
case 'o': opt_overwrite = 1; opt_append = 0; break;
case 'V': puts(VERSION); exit(0); break;
default:
fprintf(stderr, "%s: fatal: invalid option '-%c' (try -h or --help)\n", self, optopt);
exit(1);
}
}
if(optind >= argc) {
fprintf(stderr, "%s: fatal: missing alf file argument (try -h or --help)\n", self);
exit(1);
}
out_filename = argv[optind];
optind++;
if(optind >= argc) {
fprintf(stderr, "%s: fatal: no filenames (nothing to compress) (try -h or --help)\n", self);
exit(1);
}
while(optind < argc) {
crunch_file(argv[optind++]);
}
if(out_file) fclose(out_file);
exit(0);
}
|