-
Notifications
You must be signed in to change notification settings - Fork 34
/
Copy pathrlh_file_compression.pl
422 lines (315 loc) · 9.3 KB
/
rlh_file_compression.pl
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
#!/usr/bin/perl
# Author: Trizen
# Date: 13 August 2023
# https://github.com/trizen
# Compress/decompress files using Run-length encoding + Huffman coding.
use 5.036;
use Getopt::Std qw(getopts);
use File::Basename qw(basename);
use List::Util qw(max uniq);
use constant {
PKGNAME => 'RLH',
VERSION => '0.01',
FORMAT => 'rlh',
CHUNK_SIZE => 1 << 15,
};
# Container signature
use constant SIGNATURE => uc(FORMAT) . chr(1);
sub usage {
my ($code) = @_;
print <<"EOH";
usage: $0 [options] [input file] [output file]
options:
-e : extract
-i <filename> : input filename
-o <filename> : output filename
-r : rewrite output
-v : version number
-h : this message
examples:
$0 document.txt
$0 document.txt archive.${\FORMAT}
$0 archive.${\FORMAT} document.txt
$0 -e -i archive.${\FORMAT} -o document.txt
EOH
exit($code // 0);
}
sub version {
printf("%s %s\n", PKGNAME, VERSION);
exit;
}
sub valid_archive {
my ($fh) = @_;
if (read($fh, (my $sig), length(SIGNATURE), 0) == length(SIGNATURE)) {
$sig eq SIGNATURE || return;
}
return 1;
}
sub main {
my %opt;
getopts('ei:o:vhr', \%opt);
$opt{h} && usage(0);
$opt{v} && version();
my ($input, $output) = @ARGV;
$input //= $opt{i} // usage(2);
$output //= $opt{o};
my $ext = qr{\.${\FORMAT}\z}io;
if ($opt{e} || $input =~ $ext) {
if (not defined $output) {
($output = basename($input)) =~ s{$ext}{}
|| die "$0: no output file specified!\n";
}
if (not $opt{r} and -e $output) {
print "'$output' already exists! -- Replace? [y/N] ";
<STDIN> =~ /^y/i || exit 17;
}
decompress_file($input, $output)
|| die "$0: error: decompression failed!\n";
}
elsif ($input !~ $ext || (defined($output) && $output =~ $ext)) {
$output //= basename($input) . '.' . FORMAT;
compress_file($input, $output)
|| die "$0: error: compression failed!\n";
}
else {
warn "$0: don't know what to do...\n";
usage(1);
}
}
sub read_bit ($fh, $bitstring) {
if (($$bitstring // '') eq '') {
$$bitstring = unpack('b*', getc($fh) // return undef);
}
chop($$bitstring);
}
sub read_bits ($fh, $bits_len) {
my $data = '';
read($fh, $data, $bits_len >> 3);
$data = unpack('B*', $data);
while (length($data) < $bits_len) {
$data .= unpack('B*', getc($fh) // return undef);
}
if (length($data) > $bits_len) {
$data = substr($data, 0, $bits_len);
}
return $data;
}
sub delta_encode ($integers, $double = 0) {
my @deltas;
my $prev = 0;
unshift(@$integers, scalar(@$integers));
while (@$integers) {
my $curr = shift(@$integers);
push @deltas, $curr - $prev;
$prev = $curr;
}
my $bitstring = '';
foreach my $d (@deltas) {
if ($d == 0) {
$bitstring .= '0';
}
elsif ($double) {
my $t = sprintf('%b', abs($d) + 1);
my $l = sprintf('%b', length($t));
$bitstring .= '1' . (($d < 0) ? '0' : '1') . ('1' x (length($l) - 1)) . '0' . substr($l, 1) . substr($t, 1);
}
else {
my $t = sprintf('%b', abs($d));
$bitstring .= '1' . (($d < 0) ? '0' : '1') . ('1' x (length($t) - 1)) . '0' . substr($t, 1);
}
}
pack('B*', $bitstring);
}
sub delta_decode ($fh, $double = 0) {
my @deltas;
my $buffer = '';
my $len = 0;
for (my $k = 0 ; $k <= $len ; ++$k) {
my $bit = read_bit($fh, \$buffer);
if ($bit eq '0') {
push @deltas, 0;
}
elsif ($double) {
my $bit = read_bit($fh, \$buffer);
my $bl = 0;
++$bl while (read_bit($fh, \$buffer) eq '1');
my $bl2 = oct('0b1' . join('', map { read_bit($fh, \$buffer) } 1 .. $bl));
my $int = oct('0b1' . join('', map { read_bit($fh, \$buffer) } 1 .. ($bl2 - 1)));
push @deltas, ($bit eq '1' ? 1 : -1) * ($int - 1);
}
else {
my $bit = read_bit($fh, \$buffer);
my $n = 0;
++$n while (read_bit($fh, \$buffer) eq '1');
my $d = oct('0b1' . join('', map { read_bit($fh, \$buffer) } 1 .. $n));
push @deltas, ($bit eq '1' ? $d : -$d);
}
if ($k == 0) {
$len = pop(@deltas);
}
}
my @acc;
my $prev = $len;
foreach my $d (@deltas) {
$prev += $d;
push @acc, $prev;
}
return \@acc;
}
# produce encode and decode dictionary from a tree
sub walk ($node, $code, $h, $rev_h) {
my $c = $node->[0] // return ($h, $rev_h);
if (ref $c) { walk($c->[$_], $code . $_, $h, $rev_h) for ('0', '1') }
else { $h->{$c} = $code; $rev_h->{$code} = $c }
return ($h, $rev_h);
}
# make a tree, and return resulting dictionaries
sub mktree_from_freq ($freq) {
my @nodes = map { [$_, $freq->{$_}] } sort { $a <=> $b } keys %$freq;
do { # poor man's priority queue
@nodes = sort { $a->[1] <=> $b->[1] } @nodes;
my ($x, $y) = splice(@nodes, 0, 2);
if (defined($x)) {
if (defined($y)) {
push @nodes, [[$x, $y], $x->[1] + $y->[1]];
}
else {
push @nodes, [[$x], $x->[1]];
}
}
} while (@nodes > 1);
walk($nodes[0], '', {}, {});
}
sub huffman_encode ($bytes, $dict) {
join('', @{$dict}{@$bytes});
}
sub huffman_decode ($bits, $hash) {
local $" = '|';
[split(' ', $bits =~ s/(@{[sort { length($a) <=> length($b) } keys %{$hash}]})/$hash->{$1} /gr)]; # very fast
}
sub create_huffman_entry ($bytes, $out_fh) {
my %freq;
++$freq{$_} for @$bytes;
my ($h, $rev_h) = mktree_from_freq(\%freq);
my $enc = huffman_encode($bytes, $h);
my @symbols = sort { $a <=> $b } keys(%freq);
print $out_fh delta_encode([@symbols]);
print $out_fh delta_encode([map { $freq{$_} } @symbols], 1);
print $out_fh pack("N", length($enc));
print $out_fh pack("B*", $enc);
}
sub decode_huffman_entry ($fh) {
my $symbols = delta_decode($fh);
my $freqs = delta_decode($fh, 1);
my %freq;
foreach my $i (0 .. $#{$symbols}) {
$freq{$symbols->[$i]} = $freqs->[$i];
}
my (undef, $rev_dict) = mktree_from_freq(\%freq);
my $enc_len = unpack('N', join('', map { getc($fh) // die "error" } 1 .. 4));
say "Encoded length: $enc_len";
if ($enc_len > 0) {
return huffman_decode(read_bits($fh, $enc_len), $rev_dict);
}
return [];
}
sub rle4_encode ($bytes) { # RLE1
my @rle;
my $end = $#{$bytes};
my $prev = -1;
my $run = 0;
for (my $i = 0 ; $i <= $end ; ++$i) {
if ($bytes->[$i] == $prev) {
++$run;
}
else {
$run = 1;
}
push @rle, $bytes->[$i];
$prev = $bytes->[$i];
if ($run >= 4) {
$run = 0;
$i += 1;
while ($i <= $end and $bytes->[$i] == $prev) {
++$run;
++$i;
}
push @rle, $run;
$run = 1;
if ($i <= $end) {
$prev = $bytes->[$i];
push @rle, $bytes->[$i];
}
}
}
return \@rle;
}
sub rle4_decode ($bytes) { # RLE1
my @dec = $bytes->[0];
my $end = $#{$bytes};
my $prev = $bytes->[0];
my $run = 1;
for (my $i = 1 ; $i <= $end ; ++$i) {
if ($bytes->[$i] == $prev) {
++$run;
}
else {
$run = 1;
}
push @dec, $bytes->[$i];
$prev = $bytes->[$i];
if ($run >= 4) {
if (++$i <= $end) {
$run = $bytes->[$i];
push @dec, (($prev) x $run);
}
$run = 0;
}
}
return \@dec;
}
sub compression ($chunk, $out_fh) {
my $bytes = [unpack('C*', $chunk)];
$bytes = rle4_encode($bytes);
create_huffman_entry($bytes, $out_fh);
}
sub decompression ($fh, $out_fh) {
my $bytes = decode_huffman_entry($fh);
$bytes = rle4_decode($bytes);
print $out_fh pack('C*', @$bytes);
}
# Compress file
sub compress_file ($input, $output) {
open my $fh, '<:raw', $input
or die "Can't open file <<$input>> for reading: $!";
my $header = SIGNATURE;
# Open the output file for writing
open my $out_fh, '>:raw', $output
or die "Can't open file <<$output>> for write: $!";
# Print the header
print $out_fh $header;
# Compress data
while (read($fh, (my $chunk), CHUNK_SIZE)) {
compression($chunk, $out_fh);
}
# Close the file
close $out_fh;
}
# Decompress file
sub decompress_file ($input, $output) {
# Open and validate the input file
open my $fh, '<:raw', $input
or die "Can't open file <<$input>> for reading: $!";
valid_archive($fh) || die "$0: file `$input' is not a \U${\FORMAT}\E v${\VERSION} archive!\n";
# Open the output file
open my $out_fh, '>:raw', $output
or die "Can't open file <<$output>> for writing: $!";
while (!eof($fh)) {
decompression($fh, $out_fh);
}
# Close the file
close $fh;
close $out_fh;
}
main();
exit(0);