lzsbw_file_compression.pl 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782
  1. #!/usr/bin/perl
  2. # Author: Trizen
  3. # Date: 17 June 2023
  4. # Edit: 18 March 2024
  5. # https://github.com/trizen
  6. # Compress/decompress files using LZSS + Bzip2.
  7. # Encoding the literals and the pointers using a DEFLATE-like approach.
  8. # Reference:
  9. # Data Compression (Summer 2023) - Lecture 11 - DEFLATE (gzip)
  10. # https://youtube.com/watch?v=SJPvNi4HrWQ
  11. use 5.036;
  12. use Getopt::Std qw(getopts);
  13. use File::Basename qw(basename);
  14. use List::Util qw(max uniq);
  15. use POSIX qw(ceil log2);
  16. use constant {
  17. PKGNAME => 'LZSBW',
  18. VERSION => '0.01',
  19. FORMAT => 'lzsbw',
  20. CHUNK_SIZE => 1 << 16, # higher value = better compression
  21. };
  22. # Container signature
  23. use constant SIGNATURE => uc(FORMAT) . chr(1);
  24. # [distance value, offset bits]
  25. my @DISTANCE_SYMBOLS = map { [$_, 0] } (0 .. 4);
  26. until ($DISTANCE_SYMBOLS[-1][0] > CHUNK_SIZE) {
  27. push @DISTANCE_SYMBOLS, [int($DISTANCE_SYMBOLS[-1][0] * (4 / 3)), $DISTANCE_SYMBOLS[-1][1] + 1];
  28. push @DISTANCE_SYMBOLS, [int($DISTANCE_SYMBOLS[-1][0] * (3 / 2)), $DISTANCE_SYMBOLS[-1][1]];
  29. }
  30. # [length, offset bits]
  31. my @LENGTH_SYMBOLS = ((map { [$_, 0] } (3 .. 10)));
  32. {
  33. my $delta = 1;
  34. until ($LENGTH_SYMBOLS[-1][0] > 163) {
  35. push @LENGTH_SYMBOLS, [$LENGTH_SYMBOLS[-1][0] + $delta, $LENGTH_SYMBOLS[-1][1] + 1];
  36. $delta *= 2;
  37. push @LENGTH_SYMBOLS, [$LENGTH_SYMBOLS[-1][0] + $delta, $LENGTH_SYMBOLS[-1][1]];
  38. push @LENGTH_SYMBOLS, [$LENGTH_SYMBOLS[-1][0] + $delta, $LENGTH_SYMBOLS[-1][1]];
  39. push @LENGTH_SYMBOLS, [$LENGTH_SYMBOLS[-1][0] + $delta, $LENGTH_SYMBOLS[-1][1]];
  40. }
  41. push @LENGTH_SYMBOLS, [258, 0];
  42. }
  43. my @DISTANCE_INDICES;
  44. foreach my $i (0 .. $#DISTANCE_SYMBOLS) {
  45. my ($min, $bits) = @{$DISTANCE_SYMBOLS[$i]};
  46. foreach my $k ($min .. $min + (1 << $bits) - 1) {
  47. last if ($k > CHUNK_SIZE);
  48. $DISTANCE_INDICES[$k] = $i;
  49. }
  50. }
  51. my @LENGTH_INDICES;
  52. foreach my $i (0 .. $#LENGTH_SYMBOLS) {
  53. my ($min, $bits) = @{$LENGTH_SYMBOLS[$i]};
  54. foreach my $k ($min .. $min + (1 << $bits) - 1) {
  55. $LENGTH_INDICES[$k] = $i;
  56. }
  57. }
  58. sub usage {
  59. my ($code) = @_;
  60. print <<"EOH";
  61. usage: $0 [options] [input file] [output file]
  62. options:
  63. -e : extract
  64. -i <filename> : input filename
  65. -o <filename> : output filename
  66. -r : rewrite output
  67. -v : version number
  68. -h : this message
  69. examples:
  70. $0 document.txt
  71. $0 document.txt archive.${\FORMAT}
  72. $0 archive.${\FORMAT} document.txt
  73. $0 -e -i archive.${\FORMAT} -o document.txt
  74. EOH
  75. exit($code // 0);
  76. }
  77. sub version {
  78. printf("%s %s\n", PKGNAME, VERSION);
  79. exit;
  80. }
  81. sub valid_archive {
  82. my ($fh) = @_;
  83. if (read($fh, (my $sig), length(SIGNATURE), 0) == length(SIGNATURE)) {
  84. $sig eq SIGNATURE || return;
  85. }
  86. return 1;
  87. }
  88. sub main {
  89. my %opt;
  90. getopts('ei:o:vhr', \%opt);
  91. $opt{h} && usage(0);
  92. $opt{v} && version();
  93. my ($input, $output) = @ARGV;
  94. $input //= $opt{i} // usage(2);
  95. $output //= $opt{o};
  96. my $ext = qr{\.${\FORMAT}\z}io;
  97. if ($opt{e} || $input =~ $ext) {
  98. if (not defined $output) {
  99. ($output = basename($input)) =~ s{$ext}{}
  100. || die "$0: no output file specified!\n";
  101. }
  102. if (not $opt{r} and -e $output) {
  103. print "'$output' already exists! -- Replace? [y/N] ";
  104. <STDIN> =~ /^y/i || exit 17;
  105. }
  106. decompress_file($input, $output)
  107. || die "$0: error: decompression failed!\n";
  108. }
  109. elsif ($input !~ $ext || (defined($output) && $output =~ $ext)) {
  110. $output //= basename($input) . '.' . FORMAT;
  111. compress_file($input, $output)
  112. || die "$0: error: compression failed!\n";
  113. }
  114. else {
  115. warn "$0: don't know what to do...\n";
  116. usage(1);
  117. }
  118. }
  119. sub lz77_compression ($str, $uncompressed, $indices, $lengths) {
  120. my $la = 0;
  121. my $prefix = '';
  122. my @chars = split(//, $str);
  123. my $end = $#chars;
  124. my $min_len = $LENGTH_SYMBOLS[0][0];
  125. my $max_len = $LENGTH_SYMBOLS[-1][0];
  126. my %literal_freq;
  127. my %distance_freq;
  128. my $literal_count = 0;
  129. my $distance_count = 0;
  130. while ($la <= $end) {
  131. my $n = 1;
  132. my $p = length($prefix);
  133. my $tmp;
  134. my $token = $chars[$la];
  135. while ( $n <= $max_len
  136. and $la + $n <= $end
  137. and ($tmp = rindex($prefix, $token, $p)) >= 0) {
  138. $p = $tmp;
  139. $token .= $chars[$la + $n];
  140. ++$n;
  141. }
  142. my $enc_bits_len = 0;
  143. my $literal_bits_len = 0;
  144. if ($n > $min_len) {
  145. my $dist = $DISTANCE_SYMBOLS[$DISTANCE_INDICES[$la - $p]];
  146. $enc_bits_len += $dist->[1] + ceil(log2((1 + $distance_count) / (1 + ($distance_freq{$dist->[0]} // 0))));
  147. my $len_idx = $LENGTH_INDICES[$n - 1];
  148. my $len = $LENGTH_SYMBOLS[$len_idx];
  149. $enc_bits_len += $len->[1] + ceil(log2((1 + $literal_count) / (1 + ($literal_freq{$len_idx + 256} // 0))));
  150. my %freq;
  151. foreach my $c (unpack('C*', substr($prefix, $p, $n - 1) . $chars[$la + $n - 1])) {
  152. ++$freq{$c};
  153. $literal_bits_len += ceil(log2(($n + $literal_count) / ($freq{$c} + ($literal_freq{$c} // 0))));
  154. }
  155. }
  156. if ($n > $min_len and $enc_bits_len < $literal_bits_len) {
  157. push @$lengths, $n - 1;
  158. push @$indices, $la - $p;
  159. push @$uncompressed, undef;
  160. my $dist_idx = $DISTANCE_INDICES[$la - $p];
  161. my $dist = $DISTANCE_SYMBOLS[$dist_idx];
  162. ++$distance_count;
  163. ++$distance_freq{$dist->[0]};
  164. ++$literal_count;
  165. ++$literal_freq{$LENGTH_INDICES[$n - 1] + 256};
  166. $la += $n - 1;
  167. $prefix .= substr($token, 0, -1);
  168. }
  169. else {
  170. my @bytes = unpack('C*', substr($prefix, $p, $n - 1) . $chars[$la + $n - 1]);
  171. push @$uncompressed, @bytes;
  172. push @$lengths, (0) x scalar(@bytes);
  173. push @$indices, (0) x scalar(@bytes);
  174. ++$literal_freq{$_} for @bytes;
  175. $literal_count += $n;
  176. $la += $n;
  177. $prefix .= $token;
  178. }
  179. }
  180. return;
  181. }
  182. sub lz77_decompression ($literals, $distances, $lengths) {
  183. my $chunk = '';
  184. my $offset = 0;
  185. foreach my $i (0 .. $#$literals) {
  186. if ($lengths->[$i] != 0) {
  187. $chunk .= substr($chunk, $offset - $distances->[$i], $lengths->[$i]);
  188. $offset += $lengths->[$i];
  189. }
  190. else {
  191. $chunk .= chr($literals->[$i]);
  192. $offset += 1;
  193. }
  194. }
  195. return $chunk;
  196. }
  197. sub read_bit ($fh, $bitstring) {
  198. if (($$bitstring // '') eq '') {
  199. $$bitstring = unpack('b*', getc($fh) // return undef);
  200. }
  201. chop($$bitstring);
  202. }
  203. sub read_bits ($fh, $bits_len) {
  204. my $data = '';
  205. read($fh, $data, $bits_len >> 3);
  206. $data = unpack('B*', $data);
  207. while (length($data) < $bits_len) {
  208. $data .= unpack('B*', getc($fh) // return undef);
  209. }
  210. if (length($data) > $bits_len) {
  211. $data = substr($data, 0, $bits_len);
  212. }
  213. return $data;
  214. }
  215. sub delta_encode ($integers, $double = 0) {
  216. my @deltas;
  217. my $prev = 0;
  218. unshift(@$integers, scalar(@$integers));
  219. while (@$integers) {
  220. my $curr = shift(@$integers);
  221. push @deltas, $curr - $prev;
  222. $prev = $curr;
  223. }
  224. my $bitstring = '';
  225. foreach my $d (@deltas) {
  226. if ($d == 0) {
  227. $bitstring .= '0';
  228. }
  229. elsif ($double) {
  230. my $t = sprintf('%b', abs($d) + 1);
  231. my $l = sprintf('%b', length($t));
  232. $bitstring .= '1' . (($d < 0) ? '0' : '1') . ('1' x (length($l) - 1)) . '0' . substr($l, 1) . substr($t, 1);
  233. }
  234. else {
  235. my $t = sprintf('%b', abs($d));
  236. $bitstring .= '1' . (($d < 0) ? '0' : '1') . ('1' x (length($t) - 1)) . '0' . substr($t, 1);
  237. }
  238. }
  239. pack('B*', $bitstring);
  240. }
  241. sub delta_decode ($fh, $double = 0) {
  242. my @deltas;
  243. my $buffer = '';
  244. my $len = 0;
  245. for (my $k = 0 ; $k <= $len ; ++$k) {
  246. my $bit = read_bit($fh, \$buffer);
  247. if ($bit eq '0') {
  248. push @deltas, 0;
  249. }
  250. elsif ($double) {
  251. my $bit = read_bit($fh, \$buffer);
  252. my $bl = 0;
  253. ++$bl while (read_bit($fh, \$buffer) eq '1');
  254. my $bl2 = oct('0b1' . join('', map { read_bit($fh, \$buffer) } 1 .. $bl));
  255. my $int = oct('0b1' . join('', map { read_bit($fh, \$buffer) } 1 .. ($bl2 - 1)));
  256. push @deltas, ($bit eq '1' ? 1 : -1) * ($int - 1);
  257. }
  258. else {
  259. my $bit = read_bit($fh, \$buffer);
  260. my $n = 0;
  261. ++$n while (read_bit($fh, \$buffer) eq '1');
  262. my $d = oct('0b1' . join('', map { read_bit($fh, \$buffer) } 1 .. $n));
  263. push @deltas, ($bit eq '1' ? $d : -$d);
  264. }
  265. if ($k == 0) {
  266. $len = pop(@deltas);
  267. }
  268. }
  269. my @acc;
  270. my $prev = $len;
  271. foreach my $d (@deltas) {
  272. $prev += $d;
  273. push @acc, $prev;
  274. }
  275. return \@acc;
  276. }
  277. sub mtf_encode ($bytes, $alphabet = [0 .. 255]) {
  278. my @C;
  279. my @table;
  280. @table[@$alphabet] = (0 .. $#{$alphabet});
  281. foreach my $c (@$bytes) {
  282. push @C, (my $index = $table[$c]);
  283. unshift(@$alphabet, splice(@$alphabet, $index, 1));
  284. @table[@{$alphabet}[0 .. $index]] = (0 .. $index);
  285. }
  286. return \@C;
  287. }
  288. sub mtf_decode ($encoded, $alphabet = [0 .. 255]) {
  289. my @S;
  290. foreach my $p (@$encoded) {
  291. push @S, $alphabet->[$p];
  292. unshift(@$alphabet, splice(@$alphabet, $p, 1));
  293. }
  294. return \@S;
  295. }
  296. sub bwt_sort_symbolic ($s) { # O(n) space (slowish)
  297. my @cyclic = @$s;
  298. my $len = scalar(@cyclic);
  299. my $rle = 1;
  300. foreach my $i (1 .. $len - 1) {
  301. if ($cyclic[$i] != $cyclic[$i - 1]) {
  302. $rle = 0;
  303. last;
  304. }
  305. }
  306. $rle && return [0 .. $len - 1];
  307. [
  308. sort {
  309. my ($i, $j) = ($a, $b);
  310. while ($cyclic[$i] == $cyclic[$j]) {
  311. $i %= $len if (++$i >= $len);
  312. $j %= $len if (++$j >= $len);
  313. }
  314. $cyclic[$i] <=> $cyclic[$j];
  315. } 0 .. $len - 1
  316. ];
  317. }
  318. sub bwt_encode_symbolic ($s) {
  319. my $bwt = bwt_sort_symbolic($s);
  320. my @ret = map { $s->[$_ - 1] } @$bwt;
  321. my $idx = 0;
  322. foreach my $i (@$bwt) {
  323. $i || last;
  324. ++$idx;
  325. }
  326. return (\@ret, $idx);
  327. }
  328. sub bwt_decode_symbolic ($bwt, $idx) { # fast inversion
  329. my @tail = @$bwt;
  330. my @head = sort { $a <=> $b } @tail;
  331. my @indices;
  332. foreach my $i (0 .. $#tail) {
  333. push @{$indices[$tail[$i]]}, $i;
  334. }
  335. my @table;
  336. foreach my $v (@head) {
  337. push @table, shift(@{$indices[$v]});
  338. }
  339. my @dec;
  340. my $i = $idx;
  341. for (1 .. scalar(@head)) {
  342. push @dec, $head[$i];
  343. $i = $table[$i];
  344. }
  345. return \@dec;
  346. }
  347. sub rle_encode ($bytes) { # RLE2
  348. my @rle;
  349. my $end = $#{$bytes};
  350. for (my $i = 0 ; $i <= $end ; ++$i) {
  351. my $run = 0;
  352. while ($i <= $end and $bytes->[$i] == 0) {
  353. ++$run;
  354. ++$i;
  355. }
  356. if ($run >= 1) {
  357. my $t = sprintf('%b', $run + 1);
  358. push @rle, split(//, substr($t, 1));
  359. }
  360. if ($i <= $end) {
  361. push @rle, $bytes->[$i] + 1;
  362. }
  363. }
  364. return \@rle;
  365. }
  366. sub rle_decode ($rle) { # RLE2
  367. my @dec;
  368. my $end = $#{$rle};
  369. for (my $i = 0 ; $i <= $end ; ++$i) {
  370. my $k = $rle->[$i];
  371. if ($k == 0 or $k == 1) {
  372. my $run = 1;
  373. while (($i <= $end) and ($k == 0 or $k == 1)) {
  374. ($run <<= 1) |= $k;
  375. $k = $rle->[++$i];
  376. }
  377. push @dec, (0) x ($run - 1);
  378. }
  379. if ($i <= $end) {
  380. push @dec, $k - 1;
  381. }
  382. }
  383. return \@dec;
  384. }
  385. sub encode_alphabet_symbolic ($alphabet) {
  386. return delta_encode([@$alphabet]);
  387. }
  388. sub decode_alphabet_symbolic ($fh) {
  389. return [@{delta_decode($fh)}];
  390. }
  391. sub bz2_compression_symbolic ($symbols, $out_fh) {
  392. my ($bwt, $idx) = bwt_encode_symbolic($symbols);
  393. say "BWT index = $idx";
  394. my @bytes = @$bwt;
  395. my @alphabet = sort { $a <=> $b } uniq(@bytes);
  396. my $alphabet_enc = encode_alphabet_symbolic(\@alphabet);
  397. my $mtf = mtf_encode(\@bytes, [@alphabet]);
  398. my $rle = rle_encode($mtf);
  399. print $out_fh pack('N', $idx);
  400. print $out_fh $alphabet_enc;
  401. create_huffman_entry($rle, $out_fh);
  402. }
  403. sub bz2_decompression_symbolic ($fh) {
  404. my $idx = unpack('N', join('', map { getc($fh) // die "error" } 1 .. 4));
  405. my $alphabet = decode_alphabet_symbolic($fh);
  406. say "BWT index = $idx";
  407. say "Alphabet size: ", scalar(@$alphabet);
  408. my $rle = decode_huffman_entry($fh);
  409. my $mtf = rle_decode($rle);
  410. my $bwt = mtf_decode($mtf, $alphabet);
  411. my $data = bwt_decode_symbolic($bwt, $idx);
  412. return $data;
  413. }
  414. # produce encode and decode dictionary from a tree
  415. sub walk ($node, $code, $h, $rev_h) {
  416. my $c = $node->[0] // return ($h, $rev_h);
  417. if (ref $c) { walk($c->[$_], $code . $_, $h, $rev_h) for ('0', '1') }
  418. else { $h->{$c} = $code; $rev_h->{$code} = $c }
  419. return ($h, $rev_h);
  420. }
  421. # make a tree, and return resulting dictionaries
  422. sub mktree_from_freq ($freq) {
  423. my @nodes = map { [$_, $freq->{$_}] } sort { $a <=> $b } keys %$freq;
  424. do { # poor man's priority queue
  425. @nodes = sort { $a->[1] <=> $b->[1] } @nodes;
  426. my ($x, $y) = splice(@nodes, 0, 2);
  427. if (defined($x)) {
  428. if (defined($y)) {
  429. push @nodes, [[$x, $y], $x->[1] + $y->[1]];
  430. }
  431. else {
  432. push @nodes, [[$x], $x->[1]];
  433. }
  434. }
  435. } while (@nodes > 1);
  436. walk($nodes[0], '', {}, {});
  437. }
  438. sub huffman_encode ($bytes, $dict) {
  439. join('', @{$dict}{@$bytes});
  440. }
  441. sub huffman_decode ($bits, $hash) {
  442. local $" = '|';
  443. [split(' ', $bits =~ s/(@{[sort { length($a) <=> length($b) } keys %{$hash}]})/$hash->{$1} /gr)]; # very fast
  444. }
  445. sub create_huffman_entry ($bytes, $out_fh) {
  446. my %freq;
  447. ++$freq{$_} for @$bytes;
  448. my ($h, $rev_h) = mktree_from_freq(\%freq);
  449. my $enc = huffman_encode($bytes, $h);
  450. my $max_symbol = max(keys %freq) // 0;
  451. my @freqs;
  452. foreach my $i (0 .. $max_symbol) {
  453. push @freqs, $freq{$i} // 0;
  454. }
  455. print $out_fh delta_encode(\@freqs);
  456. print $out_fh pack("N", length($enc));
  457. print $out_fh pack("B*", $enc);
  458. }
  459. sub decode_huffman_entry ($fh) {
  460. my @freqs = @{delta_decode($fh)};
  461. my %freq;
  462. foreach my $i (0 .. $#freqs) {
  463. if ($freqs[$i]) {
  464. $freq{$i} = $freqs[$i];
  465. }
  466. }
  467. my (undef, $rev_dict) = mktree_from_freq(\%freq);
  468. my $enc_len = unpack('N', join('', map { getc($fh) // die "error" } 1 .. 4));
  469. if ($enc_len > 0) {
  470. return huffman_decode(read_bits($fh, $enc_len), $rev_dict);
  471. }
  472. return [];
  473. }
  474. sub deflate_encode ($literals, $distances, $lengths, $out_fh) {
  475. my @len_symbols;
  476. my @dist_symbols;
  477. my $offset_bits = '';
  478. foreach my $j (0 .. $#{$literals}) {
  479. if ($lengths->[$j] == 0) {
  480. push @len_symbols, $literals->[$j];
  481. next;
  482. }
  483. my $len = $lengths->[$j];
  484. my $dist = $distances->[$j];
  485. {
  486. my $len_idx = $LENGTH_INDICES[$len];
  487. my ($min, $bits) = @{$LENGTH_SYMBOLS[$len_idx]};
  488. push @len_symbols, $len_idx + 256;
  489. if ($bits > 0) {
  490. $offset_bits .= sprintf('%0*b', $bits, $len - $min);
  491. }
  492. }
  493. {
  494. my $dist_idx = $DISTANCE_INDICES[$dist];
  495. my ($min, $bits) = @{$DISTANCE_SYMBOLS[$dist_idx]};
  496. push @dist_symbols, $dist_idx;
  497. if ($bits > 0) {
  498. $offset_bits .= sprintf('%0*b', $bits, $dist - $min);
  499. }
  500. }
  501. }
  502. bz2_compression_symbolic(\@len_symbols, $out_fh);
  503. bz2_compression_symbolic(\@dist_symbols, $out_fh);
  504. print $out_fh pack('B*', $offset_bits);
  505. }
  506. sub deflate_decode ($fh) {
  507. my $len_symbols = bz2_decompression_symbolic($fh);
  508. my $dist_symbols = bz2_decompression_symbolic($fh);
  509. my $bits_len = 0;
  510. foreach my $i (@$dist_symbols) {
  511. $bits_len += $DISTANCE_SYMBOLS[$i][1];
  512. }
  513. foreach my $i (@$len_symbols) {
  514. if ($i >= 256) {
  515. $bits_len += $LENGTH_SYMBOLS[$i - 256][1];
  516. }
  517. }
  518. my $bits = read_bits($fh, $bits_len);
  519. my @literals;
  520. my @lengths;
  521. my @distances;
  522. my $j = 0;
  523. foreach my $i (@$len_symbols) {
  524. if ($i >= 256) {
  525. my $dist = $dist_symbols->[$j++];
  526. push @literals, undef;
  527. push @lengths, $LENGTH_SYMBOLS[$i - 256][0] + oct('0b' . substr($bits, 0, $LENGTH_SYMBOLS[$i - 256][1], ''));
  528. push @distances, $DISTANCE_SYMBOLS[$dist][0] + oct('0b' . substr($bits, 0, $DISTANCE_SYMBOLS[$dist][1], ''));
  529. }
  530. else {
  531. push @literals, $i;
  532. push @lengths, 0;
  533. push @distances, 0;
  534. }
  535. }
  536. return (\@literals, \@distances, \@lengths);
  537. }
  538. # Compress file
  539. sub compress_file ($input, $output) {
  540. open my $fh, '<:raw', $input
  541. or die "Can't open file <<$input>> for reading: $!";
  542. my $header = SIGNATURE;
  543. # Open the output file for writing
  544. open my $out_fh, '>:raw', $output
  545. or die "Can't open file <<$output>> for write: $!";
  546. # Print the header
  547. print $out_fh $header;
  548. # Compress data
  549. while (read($fh, (my $chunk), CHUNK_SIZE)) {
  550. my (@uncompressed, @indices, @lengths);
  551. lz77_compression($chunk, \@uncompressed, \@indices, \@lengths);
  552. my $est_ratio = length($chunk) / (scalar(@uncompressed) + scalar(@lengths) + 2 * scalar(@indices));
  553. say scalar(@uncompressed), ' -> ', $est_ratio;
  554. deflate_encode(\@uncompressed, \@indices, \@lengths, $out_fh);
  555. }
  556. # Close the file
  557. close $out_fh;
  558. }
  559. # Decompress file
  560. sub decompress_file ($input, $output) {
  561. # Open and validate the input file
  562. open my $fh, '<:raw', $input
  563. or die "Can't open file <<$input>> for reading: $!";
  564. valid_archive($fh) || die "$0: file `$input' is not a \U${\FORMAT}\E v${\VERSION} archive!\n";
  565. # Open the output file
  566. open my $out_fh, '>:raw', $output
  567. or die "Can't open file <<$output>> for writing: $!";
  568. while (!eof($fh)) {
  569. my ($uncompressed, $indices, $lengths) = deflate_decode($fh);
  570. print $out_fh lz77_decompression($uncompressed, $indices, $lengths);
  571. }
  572. # Close the file
  573. close $fh;
  574. close $out_fh;
  575. }
  576. main();
  577. exit(0);