forked from mist64/pucrunch
-
Notifications
You must be signed in to change notification settings - Fork 0
/
pucrunch.c
3418 lines (3004 loc) · 81.9 KB
/
pucrunch.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
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
#include <time.h>
#define DELTA
#define DELTA_OP +
/* Pucrunch ©1997-2008 by Pasi 'Albert' Ojala, a1bert@iki.fi */
/* Pucrunch is now under LGPL: see the doc for details. */
/* #define BIG */
/*
Define BIG for >64k files.
It will use even more *huge* amounts of memory.
Note:
Although this version uses memory proportionally to the file length,
it is possible to use fixed-size buffers. The LZ77 history buffer
(and backSkip) needs to be as long as is needed, the other buffers
minimally need to be about three times the length of the maximum
LZ77 match. Writing the compressor this way would probably make it a
little slower, and automatic selection of e.g. escape bits might not be
practical.
Adjusting the number of escape bits to adapt to local
changes in the data would be worth investigating.
Also, the memory needed for rle/elr tables could probably be reduced
by using a sparse table implementation. Because of the RLE property
only the starting and ending points (or lengths) need be saved. The
speed should not decrease too much, because the tables are used in
LZ77 string match also.... Wait! Actually no, because the RLE/LZ77
optimize needs to change the RLE lengths inside RLE's...
The elr array can be reduced to half by storing only the byte that
is before a run of bytes if we have the full backSkip table..
Because the lzlen maximum value is 256, we could reduce the table
from unsigned short to unsigned char by encoding 0->0, 2->1, .. 256->255.
lzlen of the value 1 is never used anyway..
*/
#define ENABLE_VERBOSE /* -v outputs the lz77/rle data to stdout */
#define HASH_STAT /* gives statistics about the hash compares */
#define BACKSKIP_FULL /* full backSkip table - enables RESCAN. If */
/* not defined, backSkip only uses max 128kB */
#define RESCAN /* rescans LZ77 matches for a closer match. */
#define HASH_COMPARE /* Use a 3-to-1 hash to skip impossible matches */
/* takes "inbytes" bytes, reduces string compares from 16% to 8% */
const char version[] = "\0$VER: pucrunch 1.14 22-Nov-2008\n";
static int maxGamma = 7, reservedBytes = 2;
static int escBits = 2, escMask = 0xc0;
static int extraLZPosBits = 0, rleUsed = 15;
static int memConfig = 0x37, intConfig = 0x58; /* cli */
/*
-------->
z..zx.....x normal (zz != ee)
e..e value(LEN) value(POSHI+1) 8+b(POSLO) LZ77
e..e 0 (2) 0 (2-256) 8b(POSLO) LZ77
e..e 100 (3) 111111 111111 END of FILE
#ifdef DELTA
e..e 101 (4..) 111111 111111 8b(add) 8b(POSLO) DLZ
#endif
e..e010 n..ne.....e escape + new esc
e..e011 value(LEN) bytecode Short RLE 2..
e..e011 111..111 8b(LENLO) value(LENHI+1) bytecode Long RLE
(values 64.. not used (may not be available) in bytecode)
e..e011 0 0 RLE=2, rank 1 (saves 11.. bit)
e..e011 0 10 x RLE=2, rank 2-3 (saves 9.. bit)
e..e011 0 11 0xx RLE=2, rank 4-7 (saves 7.. bit)
e..e011 0 11 10xxx RLE=2, rank 8-15 (saves 5.. bit)
e..e011 0 11 110xxxx xxxx RLE=2, not ranked
LZ77, len=2 (pos<=256) saves 4 bits (2-bit escape)
LZ77, len=3 saves 10..1 bits (pos 2..15616)
LZ77, len=4 saves 18..9 bits
LZ77, len=5 saves 24..15 bits
RLE, len=2 saves 11..1(..-5) bits (bytecode rank 1..not ranked)
RLE, len=3 saves 15..2 bits
RLE, len=4 saves 23..10 bits
RLE, len=5 saves 29..16 bits
bs: 3505 LZ reference points, 41535 bytes -> 11.85, i.e. 8.4% referenced
1) Short RLE -> gamma + 1 linear bit -> ivanova.run -29 bytes
2) ?? .. no
esc = RLE, with value 1
e..e01 value(1) n..ne.....e escape + new esc
e..e01 value(LEN) bytecode Short RLE 2..
e..e01 111..111 8b(LENLO) value(LENHI+1) bytecode Long RLE
(values 64.. not used (may not be available) in bytecode)
*/
/*
Value:
Elias Gamma Code rediscovered, just the prefix bits are reversed, plus
there is a length limit (1 bit gained for each value in the last group)
; 0000000 not possible
; 0000001 0 1 -6 bits
; 000001x 10 x 2-3 -4 bits
; 00001xx 110 xx 4-7 -2 bits
; 0001xxx 1110 xxx 8-15 +0 bits
; 001xxxx 11110 xxxx 16-31 +2 bits
; 01xxxxx 111110 xxxxx 32-63 +4 bits
; 1xxxxxx 111111 xxxxxx 64-127 +5 bits
*/
#include "pucrunch.h" /* Include the decompressors */
void ListDecompressors(FILE *fp) {
struct FixStruct *dc = &fixStruct[0];
while (dc && dc->code) {
fprintf(fp, "%s\n", dc->name);
dc++;
}
}
struct FixStruct *BestMatch(int type) {
struct FixStruct *dc = &fixStruct[0], *best = NULL;
while (dc && dc->code) {
if ((dc->flags & FIXF_MACHMASK) == (type & FIXF_MACHMASK)) {
/* machine is correct */
/* Require wrap if necessary, allow wrap if not */
/* Require delta matches */
if (((dc->flags & type) & FIXF_MUSTMASK) ==
(type & FIXF_MUSTMASK)) {
/* Haven't found any match or this is better */
if (!best ||
((type & FIXF_WRAP) == (dc->flags & FIXF_WRAP) &&
(!(type & (FIXF_FAST | FIXF_SHORT)) ||
(dc->flags & type & (FIXF_FAST | FIXF_SHORT)))))
best = dc;
/* If requirements match exactly, can return */
/* Assumes that non-wraps are located before wrap versions */
if ((type & (FIXF_FAST | FIXF_SHORT)) ==
(dc->flags & (FIXF_FAST | FIXF_SHORT))) {
return dc;
}
}
}
dc++;
}
return best;
}
int GetHeaderSize(int type, int *deCall) {
struct FixStruct *best;
if (deCall)
*deCall = 0;
if ((type & FIXF_MACHMASK) == 0) {
return 47; /* standalone */
}
best = BestMatch(type);
if (best && deCall) {
int i;
for (i=0; best->fixes[i].type != ftEnd; i++) {
if (best->fixes[i].type == ftDeCall) {
*deCall = best->fixes[i].offset;
break;
}
}
}
return best?best->codeSize:0;
}
int SavePack(int type, unsigned char *data, int size, char *target,
int start, int exec, int escape, unsigned char *rleValues,
int endAddr, int progEnd, int extraLZPosBits, int enable2MHz,
int memStart, int memEnd) {
FILE *fp = NULL;
struct FixStruct *dc;
unsigned char *header;
int i, overlap = 0, stackUsed = 0, ibufferUsed = 0;
if (!data)
return 10;
if (!target)
fp = stdout;
if ((type & FIXF_MACHMASK) == 0) {
/* Save without decompressor */
if (fp || (fp = fopen(target, "wb"))) {
unsigned char head[64];
int cnt = 0;
head[cnt++] = (endAddr + overlap - size) & 0xff; /* INPOS */
head[cnt++] = ((endAddr + overlap - size) >> 8);
head[cnt++] = 'p';
head[cnt++] = 'u';
head[cnt++] = (endAddr - 0x100) & 0xff;
head[cnt++] = ((endAddr - 0x100) >> 8);
head[cnt++] = (escape>>(8-escBits));
head[cnt++] = (start & 0xff); /* OUTPOS */
head[cnt++] = (start >> 8);
head[cnt++] = escBits;
/* head[cnt++] = 8-escBits; */
head[cnt++] = maxGamma + 1;
/* head[cnt++] = (8-maxGamma); */ /* Long RLE */
head[cnt++] = (1<<maxGamma); /* Short/Long RLE */
/* head[cnt++] = (2<<maxGamma)-1; */ /* EOF (maxGammaValue) */
head[cnt++] = extraLZPosBits;
head[cnt++] = (exec & 0xff);
head[cnt++] = (exec >> 8);
head[cnt++] = rleUsed;
for(i = 1; i <= rleUsed; i++) {
head[cnt++] = rleValues[i];
}
fwrite(head, 1, cnt, fp);
fwrite(data, size, 1, fp);
if(fp != stdout)
fclose(fp);
return 0;
}
fprintf(stderr, "Could not open %s for writing\n", target);
return 10;
}
if ((memStart & 0xff) != 1) {
fprintf(stderr, "Misaligned basic start 0x%04x\n", memStart);
return 10;
} else if (memStart > 9999) {
/* The basic line only holds 4 digits.. */
fprintf(stderr, "Too high basic start 0x%04x\n", memStart);
return 10;
}
if (endAddr > memEnd) {
overlap = endAddr - memEnd;
endAddr = memEnd;
/*
Make the decrunch code wrap from $ffff to $004b.
The decrunch code first copies the data that would exceed
$ffff to $004b and then copy the rest of it to end at $ffff.
*/
if (overlap > 22) {
fprintf(stderr, "Warning: data overlap is %d, but only 22 "
"is totally safe!\n", overlap);
fprintf(stderr, "The data from $61 to $%02x is overwritten.\n",
0x4b + overlap);
}
}
if (overlap) {
type |= FIXF_WRAP;
} else {
type &= ~FIXF_WRAP;
}
dc = BestMatch(type);
if (!dc) {
fprintf(stderr, "No matching decompressor found\n");
return 10;
}
header = dc->code;
if (!memStart)
memStart = 0x801;
#ifndef BIG
if (memStart + dc->codeSize - 2 + size > 0xfe00) {
fprintf(stderr, "Packed file's max size is 0x%04x (0x%04x)!\n",
0xfe00-memStart-(dc->codeSize-2), size);
return 10;
}
#endif /* BIG */
for (i=0; dc->fixes[i].type != ftEnd; i++) {
switch (dc->fixes[i].type) {
case ftFastDisable:
if (!enable2MHz) {
header[dc->fixes[i].offset] = 0x2c;
}
break;
case ftOverlap:
header[dc->fixes[i].offset] = overlap ? (overlap-1) : 0;
break;
case ftOverlapLo:
header[dc->fixes[i].offset] =
(memStart+dc->codeSize-2+rleUsed-15+size - overlap) & 0xff;
break;
case ftOverlapHi:
header[dc->fixes[i].offset] =
(memStart+dc->codeSize-2+rleUsed-15+size - overlap) >> 8;
break;
case ftWrapCount:
header[dc->fixes[i].offset] =
(memEnd>>8) - ((endAddr + overlap - size) >> 8); /* wrap point.. */
break;
case ftSizePages:
header[dc->fixes[i].offset] = (size>>8) + 1;
break;
case ftSizeLo:
header[dc->fixes[i].offset] =
(memStart+dc->codeSize-2+rleUsed-15+size-0x100 - overlap) & 0xff;
break;
case ftSizeHi:
header[dc->fixes[i].offset] =
(memStart+dc->codeSize-2+rleUsed-15+size-0x100 - overlap) >> 8;
break;
case ftEndLo:
header[dc->fixes[i].offset] = (endAddr - 0x100) & 0xff;
break;
case ftEndHi:
header[dc->fixes[i].offset] = ((endAddr - 0x100) >> 8);
break;
case ftEscValue:
header[dc->fixes[i].offset] = (escape>>(8-escBits));
break;
case ftOutposLo:
header[dc->fixes[i].offset] = (start & 0xff); /* OUTPOS */
break;
case ftOutposHi:
header[dc->fixes[i].offset] = (start >> 8);
break;
case ftEscBits:
header[dc->fixes[i].offset] = escBits;
break;
case ftEsc8Bits:
header[dc->fixes[i].offset] = 8-escBits;
break;
case ft1MaxGamma:
header[dc->fixes[i].offset] = (1<<maxGamma); /* Short/Long RLE */
break;
case ft8MaxGamma:
header[dc->fixes[i].offset] = (8-maxGamma); /* Long RLE */
break;
case ft2MaxGamma:
header[dc->fixes[i].offset] = (2<<maxGamma)-1; /* EOF (maxGammaValue) */
break;
case ftExtraBits:
header[dc->fixes[i].offset] = extraLZPosBits;
break;
case ftMemConfig:
header[dc->fixes[i].offset] = memConfig;
break;
case ftCli:
header[dc->fixes[i].offset] = intConfig; /* $58/$78 cli/sei; */
break;
case ftExecLo:
header[dc->fixes[i].offset] = (exec & 0xff);
break;
case ftExecHi:
header[dc->fixes[i].offset] = (exec >> 8);
break;
case ftInposLo:
header[dc->fixes[i].offset] = (endAddr + overlap - size) & 0xff; /* INPOS */
break;
case ftInposHi:
header[dc->fixes[i].offset] = ((endAddr + overlap - size) >> 8);
break;
case ftMaxGamma:
header[dc->fixes[i].offset] = maxGamma + 1;
break;
case ftReloc:
if (header[1] != (memStart>>8)) {
header[dc->fixes[i].offset] -= (header[1] - (memStart >> 8));
}
break;
case ftBEndLo:
header[dc->fixes[i].offset] = (progEnd & 0xff);
break;
case ftBEndHi:
header[dc->fixes[i].offset] = (progEnd >> 8);
break;
case ftStackSize:
stackUsed = header[dc->fixes[i].offset];
break;
case ftIBufferSize:
ibufferUsed = header[dc->fixes[i].offset];
break;
default:
break;
}
}
for (i=1; i<=15; i++)
header[dc->codeSize - 15 + i-1] = rleValues[i];
if (header[1] != (memStart>>8)) {
header[1] = (memStart>>8); /* Load address */
header[3] = (memStart>>8); /* Line link */
header[7] = 0x30 + (memStart+12)/1000;
header[8] = 0x30 + ((memStart+12)/100 % 10);
header[9] = 0x30 + ((memStart+12)/10 % 10);
header[10] = 0x30 + ((memStart+12) % 10);
}
fprintf(stderr, "Saving %s\n", dc->name);
if (fp || (fp = fopen(target, "wb"))) {
fwrite(header, 1, dc->codeSize+rleUsed-15, fp);
fwrite(data, size, 1, fp);
if (fp != stdout)
fclose(fp);
} else {
fprintf(stderr, "Could not open %s for writing\n", target);
return 10;
}
if (dc->flags & FIXF_SHORT) {
fprintf(stderr, "%s uses the memory $2d-$30, ", target?target:"");
} else {
fprintf(stderr, "%s uses the memory $2d/$2e, ", target?target:"");
}
if (overlap)
fprintf(stderr, "$4b-$%02x, ", 0x4b + overlap);
else if ((dc->flags & FIXF_WRAP))
fprintf(stderr, "$4b, ");
if (stackUsed)
fprintf(stderr, "$f7-$%x, ", 0xf7 + stackUsed);
if (ibufferUsed)
fprintf(stderr, "$200-$%x, ", 0x200 + ibufferUsed);
fprintf(stderr, "and $%04x-$%04x.\n",
(start < memStart+1) ? start : memStart+1, endAddr-1);
return 0;
}
#ifdef ENABLE_VERBOSE
#define F_VERBOSE (1<<0)
#endif
#define F_STATS (1<<1)
#define F_AUTO (1<<2)
#define F_NOOPT (1<<3)
#define F_AUTOEX (1<<4)
#define F_SKIP (1<<5)
#define F_2MHZ (1<<6)
#define F_AVOID (1<<7)
#define F_DELTA (1<<8)
#define F_NORLE (1<<9)
#define F_UNPACK (1<<14)
#define F_ERROR (1<<15)
#ifndef min
#define min(a,b) ((a<b)?(a):(b))
#endif
#define LRANGE (((2<<maxGamma)-3)*256) /* 0..125, 126 -> 1..127 */
#define MAXLZLEN (2<<maxGamma)
#define MAXRLELEN (((2<<maxGamma)-2)*256) /* 0..126 -> 1..127 */
#define DEFAULT_LZLEN LRANGE
static int lrange, maxlzlen, maxrlelen;
#ifdef BIG
#define OUT_SIZE 2000000
#else
#define OUT_SIZE 65536
#endif /* BIG */
static unsigned char outBuffer[OUT_SIZE];
static int outPointer = 0;
static int bitMask = 0x80;
static void FlushBits(void) {
if (bitMask != 0x80)
outPointer++;
}
static void PutBit(int bit) {
if (bit && outPointer < OUT_SIZE)
outBuffer[outPointer] |= bitMask;
bitMask >>= 1;
if (!bitMask) {
bitMask = 0x80;
outPointer++;
}
}
void PutValue(int value) {
int bits = 0, count = 0;
while (value>1) {
bits = (bits<<1) | (value & 1); /* is reversed compared to value */
value >>= 1;
count++;
PutBit(1);
}
if (count<maxGamma)
PutBit(0);
while (count--) {
PutBit((bits & 1)); /* output is reversed again -> same as value */
bits >>= 1;
}
}
#if 0
int LenValue(int value) {
int count = 0;
while (value>1) {
value >>= 1;
count += 2;
}
if (count<maxGamma)
return count + 1;
return count;
}
void InitValueLen(void) {
}
#else
int RealLenValue(int value) {
int count = 0;
if (value<2) /* 1 */
count = 0;
else if (value<4) /* 2-3 */
count = 1;
else if (value<8) /* 4-7 */
count = 2;
else if (value<16) /* 8-15 */
count = 3;
else if (value<32) /* 16-31 */
count = 4;
else if (value<64) /* 32-63 */
count = 5;
else if (value<128) /* 64-127 */
count = 6;
else if (value<256) /* 128-255 */
count = 7;
if (count<maxGamma)
return 2*count + 1;
return 2*count;
}
static int lenValue[256];
void InitValueLen(void);
void InitValueLen() {
int i;
for (i=1; i<256; i++)
lenValue[i] = RealLenValue(i);
}
#define LenValue(a) (lenValue[a])
#endif
void PutNBits(int byte, int bits) {
while (bits--)
PutBit((byte & (1<<bits)));
}
static int gainedEscaped = 0;
static int gainedRle = 0, gainedSRle = 0, gainedLRle = 0;
static int gainedLz = 0, gainedRlecode = 0;
#ifdef DELTA
static int gainedDLz = 0, timesDLz = 0;
#endif
static int timesEscaped = 0, timesNormal = 0;
static int timesRle = 0, timesSRle = 0, timesLRle = 0;
static int timesLz = 0;
static int lenStat[8][4];
int OutputNormal(int *esc, unsigned char *data, int newesc) {
timesNormal++;
if ((data[0] & escMask) == *esc) {
PutNBits((*esc>>(8-escBits)), escBits); /* escBits>=0 */
PutValue(2-1);
PutBit(1);
PutBit(0);
#if 0
*esc = (*esc + (1<<(8-escBits))) & escMask;
PutNBits(data[0], 8-escBits);
gainedEscaped += 3;
#else
*esc = newesc;
PutNBits((*esc>>(8-escBits)), escBits); /* escBits>=0 */
PutNBits(data[0], 8-escBits);
gainedEscaped += escBits + 3;
#endif
timesEscaped++;
return 1;
}
PutNBits(data[0], 8);
return 0;
}
void OutputEof(int *esc);
void OutputEof(int *esc) {
/* EOF marker */
PutNBits((*esc>>(8-escBits)), escBits); /* escBits>=0 */
PutValue(3-1); /* >1 */
PutValue((2<<maxGamma)-1); /* Maximum value */
/* flush */
FlushBits();
}
static unsigned char rleValues[32] = {1, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0};
static int rleHist[256];
void PutRleByte(int data) {
int index;
for (index = 1; index < 16/*32*/; index++) {
if (data == rleValues[index]) {
if (index==1)
lenStat[0][3]++;
else if (index<=3)
lenStat[1][3]++;
else if (index<=7)
lenStat[2][3]++;
else if (index<=15)
lenStat[3][3]++;
/*else if (index<=31)
lenStat[4][3]++;*/
gainedRlecode += 8 - LenValue(index);
PutValue(index);
return;
}
}
/*fprintf(stderr, "RLECode n: 0x%02x\n", data);*/
PutValue(16/*32*/ + (data>>4/*3*/));
gainedRlecode -= LenValue(16/*32*/+(data>>4/*3*/)) + 4/*3*/;
PutNBits(data, 4/*3*/);
lenStat[4/*5*/][3]++;
/* Note: values 64..127 are not used if maxGamma>5 */
}
#if 0
int LenRleByte(unsigned char data) {
int index;
for (index = 1; index < 16/*32*/; index++) {
if (data == rleValues[index]) {
return LenValue(index);
}
}
return LenValue(16/*32*/ + 0) + 4/*3*/;
}
#else
static unsigned char rleLen[256];
void InitRleLen(void);
void InitRleLen() {
int i;
for (i=0; i<256; i++)
rleLen[i] = LenValue(16/*32*/ + 0) + 4/*3*/;
for (i=1; i<16 /*32*/; i++)
rleLen[rleValues[i]] = LenValue(i);
}
#define LenRleByte(d) (rleLen[d])
#endif
int LenRle(int len, int data) {
int out = 0;
do {
if (len == 1) {
out += escBits + 3 + 8;
len = 0;
} else if (len <= (1<<maxGamma)) {
out += escBits + 3 + LenValue(len-1) + LenRleByte(data);
len = 0;
} else {
int tmp = min(len, maxrlelen);
out += escBits + 3 + maxGamma + 8 +
LenValue(((tmp-1)>>8)+1) + LenRleByte(data);
len -= tmp;
}
} while (len);
return out;
}
int OutputRle(int *esc, unsigned char *data, int rlelen) {
int len = rlelen, tmp;
while (len) {
if (len >= 2 && len <= (1<<maxGamma)) {
/* Short RLE */
if (len==2)
lenStat[0][2]++;
else if (len<=4)
lenStat[1][2]++;
else if (len<=8)
lenStat[2][2]++;
else if (len<=16)
lenStat[3][2]++;
else if (len<=32)
lenStat[4][2]++;
else if (len<=64)
lenStat[5][2]++;
else if (len<=128)
lenStat[6][2]++;
else if (len<=256)
lenStat[6][2]++;
PutNBits((*esc>>(8-escBits)), escBits); /* escBits>=0 */
PutValue(2-1);
PutBit(1);
PutBit(1);
PutValue(len-1);
PutRleByte(*data);
tmp = 8*len -escBits -3 -LenValue(len-1) -LenRleByte(*data);
gainedRle += tmp;
gainedSRle += tmp;
timesRle++;
timesSRle++;
return 0;
}
if (len<3) {
while (len--)
OutputNormal(esc, data, *esc);
return 0;
}
if (len <= maxrlelen) {
/* Run-length encoding */
PutNBits((*esc>>(8-escBits)), escBits); /* escBits>=0 */
PutValue(2-1);
PutBit(1);
PutBit(1);
PutValue((1<<maxGamma) + (((len-1)&0xff)>>(8-maxGamma)));
PutNBits((len-1), 8-maxGamma);
PutValue(((len-1)>>8) + 1);
PutRleByte(*data);
tmp = 8*len -escBits -3 -maxGamma -8 -LenValue(((len-1)>>8)+1)
-LenRleByte(*data);
gainedRle += tmp;
gainedLRle += tmp;
timesRle++;
timesLRle++;
return 0;
}
/* Run-length encoding */
PutNBits((*esc>>(8-escBits)), escBits); /* escBits>=0 */
PutValue(2-1);
PutBit(1);
PutBit(1);
PutValue((1<<maxGamma) + (((maxrlelen-1)&0xff)>>(8-maxGamma)));
PutNBits((maxrlelen-1) & 0xff, 8-maxGamma);
PutValue(((maxrlelen-1)>>8)+1);
PutRleByte(*data);
tmp = 8*maxrlelen -escBits -3 -maxGamma -8
-LenValue(((maxrlelen-1)>>8)+1) -LenRleByte(*data);
gainedRle += tmp;
gainedLRle += tmp;
timesRle++;
timesLRle++;
len -= maxrlelen;
data += maxrlelen;
}
return 0;
}
#ifdef DELTA
/* e..e 101 (4..) 111111 111111 8b(add) 8b(POSLO) DLZ*/
static int LenDLz(int lzlen, int lzpos) {
return escBits + 2*maxGamma + 8 + 8 + LenValue(lzlen-1);
}
static int OutputDLz(int *esc, int lzlen, int lzpos, int add) {
PutNBits((*esc>>(8-escBits)), escBits); /* escBits>=0 */
PutValue(lzlen-1);
PutValue((2<<maxGamma)-1); /* Maximum value */
PutNBits(add, 8);
PutNBits(((lzpos-1) & 0xff) ^ 0xff, 8);
gainedDLz += 8*lzlen -(escBits + LenValue(lzlen-1) + 2*maxGamma + 16);
timesDLz++;
return 4;
}
#endif
static int LenLz(int lzlen, int lzpos) {
if (lzlen==2) {
#if 0
if (lzpos <= 16)
return escBits + 2 + 5;
if (lzpos <= 128)
return escBits + 2 + 8;
#else
if (lzpos <= 256)
return escBits + 2 + 8;
#endif
return 100000;
}
return escBits + 8 + extraLZPosBits +
LenValue(((lzpos-1)>>(8+extraLZPosBits))+1) +
LenValue(lzlen-1);
}
static int OutputLz(int *esc, int lzlen, int lzpos, char *data, int curpos) {
if (lzlen==2)
lenStat[0][1]++;
else if (lzlen<=4)
lenStat[1][1]++;
else if (lzlen<=8)
lenStat[2][1]++;
else if (lzlen<=16)
lenStat[3][1]++;
else if (lzlen<=32)
lenStat[4][1]++;
else if (lzlen<=64)
lenStat[5][1]++;
else if (lzlen<=128)
lenStat[6][1]++;
else if (lzlen<=256)
lenStat[7][1]++;
if (lzlen >= 2 && lzlen <= maxlzlen) {
int tmp;
PutNBits((*esc>>(8-escBits)), escBits); /* escBits>=0 */
tmp = ((lzpos-1)>>(8+extraLZPosBits))+2;
if (tmp==2)
lenStat[0][0]++;
else if (tmp<=4)
lenStat[1][0]++;
else if (tmp<=8)
lenStat[2][0]++;
else if (tmp<=16)
lenStat[3][0]++;
else if (tmp<=32)
lenStat[4][0]++;
else if (tmp<=64)
lenStat[5][0]++;
else if (tmp<=128)
lenStat[6][0]++;
else if (tmp<=256)
lenStat[6][0]++;
if (lzlen==2) {
PutValue(lzlen-1);
PutBit(0);
if (lzpos > 256)
fprintf(stderr,
"Error at %d: lzpos too long (%d) for lzlen==2\n",
curpos, lzpos);
#if 0
if (lzpos <= 16) {
PutBit(0);
PutNBits(((lzpos-1) & 0xff) ^ 0xff, 4);
} else {
PutBit(1);
PutNBits(((lzpos-1) & 0xff) ^ 0xff, 8);
}
#else
PutNBits(((lzpos-1) & 0xff) ^ 0xff, 8);
#endif
} else {
PutValue(lzlen-1);
PutValue( ((lzpos-1) >> (8+extraLZPosBits)) +1);
PutNBits( ((lzpos-1) >> 8), extraLZPosBits);
PutNBits(((lzpos-1) & 0xff) ^ 0xff, 8);
}
gainedLz += 8*lzlen -LenLz(lzlen, lzpos);
timesLz++;
return 3;
}
fprintf(stderr, "Error: lzlen too short/long (%d)\n", lzlen);
return lzlen;
}
static unsigned short *rle, *elr, *lzlen, *lzpos, *lzmlen, *lzmpos;
#ifdef DELTA
static unsigned short *lzlen2, *lzpos2;
#endif
static int *length, inlen;
static unsigned char *indata, *mode, *newesc;
unsigned short *backSkip;
enum MODE {
LITERAL = 0,
LZ77 = 1,
RLE = 2,
#ifdef DELTA
DLZ = 3,
#endif
MMARK = 4
};
static int lzopt = 0;
/* Non-recursive version */
/* NOTE! IMPORTANT! the "length" array length must be inlen+1 */
int OptimizeLength(int optimize) {
int i;
length[inlen] = 0; /* one off the end, our 'target' */
for (i=inlen-1; i>=0; i--) {
int r1 = 8 + length[i+1], r2, r3;
if (!lzlen[i] && !rle[i]
#ifdef DELTA
&& (!lzlen2 || !lzlen2[i])
#endif
) {
length[i] = r1;
mode[i] = LITERAL;
continue;
}
/* If rle>maxlzlen, skip to the start of the rle-maxlzlen.. */
if (rle[i] > maxlzlen && elr[i] > 1) {
int z = elr[i];
i -= elr[i];
r2 = LenRle(rle[i], indata[i]) + length[i+ rle[i]];
if (optimize) {
int ii, mini = rle[i], minv = r2;
int bot = rle[i] - (1<<maxGamma);
if (bot < 2)