forked from IronLanguages/main
/
Deflate.cs
2161 lines (1843 loc) · 77.9 KB
/
Deflate.cs
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
// Copyright (c) 2006, ComponentAce
// http://www.componentace.com
// All rights reserved.
// Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
// Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
// Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
// Neither the name of ComponentAce nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
/*
Copyright (c) 2000,2001,2002,2003 ymnk, JCraft,Inc. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the distribution.
3. The names of the authors may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*
* This program is based on zlib-1.1.3, so all credit should go authors
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
* and contributors of zlib.
*/
using System;
namespace ComponentAce.Compression.Libs.ZLib
{
/// <summary>
/// Implementation of the Deflate compression algorithm.
/// </summary>
public sealed class Deflate
{
#region Nested class
/// <summary>
/// Deflate algorithm configuration parameters class
/// </summary>
internal class Config
{
/// <summary>
/// reduce lazy search above this match length
/// </summary>
internal int good_length;
/// <summary>
/// do not perform lazy search above this match length
/// </summary>
internal int max_lazy;
/// <summary>
/// quit search above this match length
/// </summary>
internal int nice_length;
internal int max_chain;
internal int func;
/// <summary>
/// Constructor which initializes class inner fields
/// </summary>
internal Config(int good_length, int max_lazy, int nice_length, int max_chain, int func)
{
this.good_length = good_length;
this.max_lazy = max_lazy;
this.nice_length = nice_length;
this.max_chain = max_chain;
this.func = func;
}
}
#endregion
#region Constants
/// <summary>
/// Maximum memory level
/// </summary>
private const int MAX_MEM_LEVEL = 9;
/// <summary>
/// Defalult compression method
/// </summary>
public const int Z_DEFAULT_COMPRESSION = -1;
/// <summary>
/// Default memory level
/// </summary>
public const int DEF_MEM_LEVEL = 8;
//Compression methods
private const int STORED = 0;
private const int FAST = 1;
private const int SLOW = 2;
/// <summary>
/// Deflate class congiration table
/// </summary>
private static Config[] config_table;
/// <summary>
/// block not completed, need more input or more output
/// </summary>
private const int NeedMore = 0;
/// <summary>
/// Block internalFlush performed
/// </summary>
private const int BlockDone = 1;
/// <summary>
/// Finish started, need only more output at next deflate
/// </summary>
private const int FinishStarted = 2;
/// <summary>
/// finish done, accept no more input or output
/// </summary>
private const int FinishDone = 3;
/// <summary>
/// preset dictionary flag in zlib header
/// </summary>
private const int PRESET_DICT = 0x20;
/// <summary>
/// The deflate compression method
/// </summary>
private const int Z_DEFLATED = 8;
private const int STORED_BLOCK = 0;
private const int STATIC_TREES = 1;
private const int DYN_TREES = 2;
/// <summary>
/// The size of the buffer
/// </summary>
private const int Buf_size = 8 * 2;
/// <summary>
/// repeat previous bit length 3-6 times (2 bits of repeat count)
/// </summary>
private const int REP_3_6 = 16;
/// <summary>
/// repeat a zero length 3-10 times (3 bits of repeat count)
/// </summary>
private const int REPZ_3_10 = 17;
/// <summary>
/// repeat a zero length 11-138 times (7 bits of repeat count)
/// </summary>
private const int REPZ_11_138 = 18;
private const int MIN_MATCH = 3;
private const int MAX_MATCH = 258;
private const int MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);
private const int MAX_BITS = 15;
private const int D_CODES = 30;
private const int BL_CODES = 19;
private const int LENGTH_CODES = 29;
private const int LITERALS = 256;
private const int L_CODES = (LITERALS + 1 + LENGTH_CODES);
private const int HEAP_SIZE = (2 * L_CODES + 1);
private const int END_BLOCK = 256;
#endregion
#region Properties
/// <summary>
/// Compression level
/// </summary>
public int level
{
get { return _level; }
set { _level = value; }
}
/// <summary>
/// Number of bytes in the pending buffer
/// </summary>
public int Pending
{
get { return pending; }
set { pending = value; }
}
/// <summary>
/// Output still pending
/// </summary>
public byte[] Pending_buf
{
get { return pending_buf; }
set { pending_buf = value; }
}
/// <summary>
/// Next pending byte to output to the stream
/// </summary>
public int Pending_out
{
get { return pending_out; }
set { pending_out = value; }
}
/// <summary>
/// suppress zlib header and adler32
/// </summary>
public int NoHeader
{
get { return noheader; }
set { noheader = value; }
}
#endregion
#region Fields
/// <summary>
/// Pointer back to this zlib stream
/// </summary>
private ZStream strm;
/// <summary>
/// As the name implies
/// </summary>
private DeflateState status;
/// <summary>
/// Output still pending
/// </summary>
private byte[] pending_buf;
/// <summary>
/// Size of Pending_buf
/// </summary>
private int pending_buf_size;
/// <summary>
/// Next pending byte to output to the stream
/// </summary>
private int pending_out;
/// <summary>
/// Number of bytes in the pending buffer
/// </summary>
private int pending;
/// <summary>
/// suppress zlib header and adler32
/// </summary>
private int noheader;
/// <summary>
/// UNKNOWN, BINARY or ASCII
/// </summary>
private BlockType data_type;
#pragma warning disable 414 // TODO: unused field
/// <summary>
/// STORED (for zip only) or DEFLATED
/// </summary>
private byte method;
#pragma warning restore
/// <summary>
/// Value of internalFlush parameter for previous deflate call
/// </summary>
private int last_flush;
/// <summary>
/// LZ77 Window size (32K by default)
/// </summary>
private int w_size;
/// <summary>
/// log2(w_size) (8..16)
/// </summary>
private int w_bits;
/// <summary>
/// w_size - 1
/// </summary>
private int w_mask;
/// <summary>
/// Sliding Window. Input bytes are ReadPos into the second half of the Window,
/// and move to the first half later to keep a dictionary of at least wSize
/// bytes. With this organization, matches are limited to a distance of
/// wSize-MAX_MATCH bytes, but this ensures that IO is always
/// performed with a length multiple of the block size. Also, it limits
/// the Window size to 64K, which is quite useful on MSDOS.
/// To do: use the user input buffer as sliding Window.
/// </summary>
private byte[] window;
/// <summary>
/// Actual size of Window: 2*wSize, except when the user input buffer is directly used as sliding Window.
/// </summary>
private int window_size;
/// <summary>
/// Link to older string with same hash index. To limit the size of this
/// array to 64K, this link is maintained only for the last 32K strings.
/// An index in this array is thus a Window index modulo 32K.
/// </summary>
private short[] prev;
/// <summary>
/// Heads of the hash chains or NIL.
/// </summary>
private short[] head;
/// <summary>
/// hash index of string to be inserted
/// </summary>
private int ins_h;
/// <summary>
/// number of elements in hash table
/// </summary>
private int hash_size;
/// <summary>
/// log2(hash_size)
/// </summary>
private int hash_bits;
/// <summary>
/// hash_size-1
/// </summary>
private int hash_mask;
/// <summary>
/// Number of bits by which ins_h must be shifted at each input
/// step. It must be such that after MIN_MATCH steps, the oldest
/// byte no longer takes part in the hash key, that is:
/// hash_shift * MIN_MATCH >= hash_bits
/// </summary>
private int hash_shift;
/// <summary>
/// Window position at the beginning of the current output block. Gets negative when the Window is moved backwards.
/// </summary>
private int block_start;
/// <summary>
/// length of best match
/// </summary>
private int match_length;
/// <summary>
/// previous match
/// </summary>
private int prev_match;
/// <summary>
/// set if previous match exists
/// </summary>
private int match_available;
/// <summary>
/// start of string to insert
/// </summary>
private int strstart;
/// <summary>
/// start of matching string
/// </summary>
private int match_start;
/// <summary>
/// number of valid bytes ahead in Window
/// </summary>
private int lookahead;
/// <summary>
/// Length of the best match at previous step. Matches not greater than this
/// are discarded. This is used in the lazy match evaluation.
/// </summary>
private int prev_length;
/// <summary>
/// To speed up deflation, hash chains are never searched beyond this
/// length. A higher limit improves compression ratio but degrades the speed.
/// </summary>
private int max_chain_length;
/// <summary>
/// Attempt to find a better match only when the current match is strictly
/// smaller than this value. This mechanism is used only for compression
/// levels >= 4.
/// </summary>
private int max_lazy_match;
// Insert new strings in the hash table only if the match length is not
// greater than this length. This saves time but degrades compression.
// max_insert_length is used only for compression levels <= 3.
/// <summary>
/// compression level (1..9)
/// </summary>
private int _level;
/// <summary>
/// favor or force Huffman coding
/// </summary>
private CompressionStrategy strategy;
/// <summary>
/// Use a faster search when the previous match is longer than this
/// </summary>
private int good_match;
/// <summary>
/// Stop searching when current match exceeds this
/// </summary>
private int nice_match;
/// <summary>
/// literal and length tree
/// </summary>
private short[] dyn_ltree;
/// <summary>
/// distance tree
/// </summary>
private short[] dyn_dtree;
/// <summary>
/// Huffman tree for bit lengths
/// </summary>
private short[] bl_tree;
/// <summary>
/// Desc for literal tree
/// </summary>
private Tree l_desc = new Tree();
/// <summary>
/// desc for distance tree
/// </summary>
private Tree d_desc = new Tree();
/// <summary>
/// desc for bit length tree
/// </summary>
private Tree bl_desc = new Tree();
/// <summary>
/// number of codes at each bit length for an optimal tree
/// </summary>
internal short[] bl_count = new short[MAX_BITS + 1];
/// <summary>
/// heap used to build the Huffman trees
/// </summary>
internal int[] heap = new int[2 * L_CODES + 1];
/// <summary>
/// number of elements in the heap
/// </summary>
internal int heap_len;
/// <summary>
/// element of largest frequency
/// </summary>
internal int heap_max;
// The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
// The same heap array is used to build all trees.
/// <summary>
/// Depth of each subtree used as tie breaker for trees of equal frequency
/// </summary>
internal byte[] depth = new byte[2 * L_CODES + 1];
/// <summary>
/// index for literals or lengths
/// </summary>
internal int l_buf;
///<summary>
/// Size of match buffer for literals/lengths. There are 4 reasons for
/// limiting lit_bufsize to 64K:
/// - frequencies can be kept in 16 bit counters
/// - if compression is not successful for the first block, all input
/// data is still in the Window so we can still emit a stored block even
/// when input comes from standard input. (This can also be done for
/// all blocks if lit_bufsize is not greater than 32K.)
/// - if compression is not successful for a file smaller than 64K, we can
/// even emit a stored file instead of a stored block (saving 5 bytes).
/// This is applicable only for zip (not gzip or zlib).
/// - creating new Huffman trees less frequently may not provide fast
/// adaptation to changes in the input data statistics. (Take for
/// example a binary file with poorly compressible code followed by
/// a highly compressible string table.) Smaller buffer sizes give
/// fast adaptation but have of course the overhead of transmitting
/// trees more frequently.
/// - I can't count above 4
///</summary>
private int lit_bufsize;
/// <summary>
/// running index in l_buf
/// </summary>
private int last_lit;
// Buffer for distances. To simplify the code, d_buf and l_buf have
// the same number of elements. To use different lengths, an extra flag
// array would be necessary.
/// <summary>
/// index of pendig_buf
/// </summary>
private int d_buf;
/// <summary>
/// bit length of current block with optimal trees
/// </summary>
internal int opt_len;
/// <summary>
/// bit length of current block with static trees
/// </summary>
internal int static_len;
/// <summary>
/// number of string matches in current block
/// </summary>
internal int matches;
/// <summary>
/// bit length of EOB code for last block
/// </summary>
internal int last_eob_len;
/// <summary>
/// Output buffer. bits are inserted starting at the bottom (least
/// significant bits).
/// </summary>
private short bi_buf;
/// <summary>
/// Number of valid bits in bi_buf. All bits above the last valid bit
/// are always zero.
/// </summary>
private int bi_valid;
#endregion
#region Methods
/// <summary>
/// Default constructor
/// </summary>
internal Deflate()
{
dyn_ltree = new short[HEAP_SIZE * 2];
dyn_dtree = new short[(2 * D_CODES + 1) * 2]; // distance tree
bl_tree = new short[(2 * BL_CODES + 1) * 2]; // Huffman tree for bit lengths
}
/// <summary>
/// Initialization
/// </summary>
private void lm_init()
{
window_size = 2 * w_size;
Array.Clear(head, 0, hash_size);
// Set the default configuration parameters:
max_lazy_match = Deflate.config_table[level].max_lazy;
good_match = Deflate.config_table[level].good_length;
nice_match = Deflate.config_table[level].nice_length;
max_chain_length = Deflate.config_table[level].max_chain;
strstart = 0;
block_start = 0;
lookahead = 0;
match_length = prev_length = MIN_MATCH - 1;
match_available = 0;
ins_h = 0;
}
/// <summary>
/// Initialize the tree data structures for a new zlib stream.
/// </summary>
private void tr_init()
{
l_desc.DynTree = dyn_ltree;
l_desc.StatDesc = StaticTree.static_l_desc;
d_desc.DynTree = dyn_dtree;
d_desc.StatDesc = StaticTree.static_d_desc;
bl_desc.DynTree = bl_tree;
bl_desc.StatDesc = StaticTree.static_bl_desc;
bi_buf = 0;
bi_valid = 0;
last_eob_len = 8; // enough lookahead for inflate
// Initialize the first block of the first file:
init_block();
}
/// <summary>
/// Initializes block
/// </summary>
private void init_block()
{
// Initialize the trees.
for (int i = 0; i < L_CODES; i++)
dyn_ltree[i * 2] = 0;
for (int i = 0; i < D_CODES; i++)
dyn_dtree[i * 2] = 0;
for (int i = 0; i < BL_CODES; i++)
bl_tree[i * 2] = 0;
dyn_ltree[END_BLOCK * 2] = 1;
opt_len = static_len = 0;
last_lit = matches = 0;
}
///<summary>
/// Restore the heap property by moving down the tree starting at node k,
/// exchanging a node with the smallest of its two sons if necessary, stopping
/// when the heap property is re-established (each father smaller than its
/// two sons).
/// </summary>
internal void pqdownheap(short[] tree, int k)
{
int v = heap[k];
int j = k << 1; // left son of k
while (j <= heap_len)
{
// Set j to the smallest of the two sons:
if (j < heap_len && smaller(tree, heap[j + 1], heap[j], depth))
{
j++;
}
// Exit if v is smaller than both sons
if (smaller(tree, v, heap[j], depth))
break;
// Exchange v with the smallest son
heap[k] = heap[j]; k = j;
// And continue down the tree, setting j to the left son of k
j <<= 1;
}
heap[k] = v;
}
internal static bool smaller(short[] tree, int n, int m, byte[] depth)
{
return (tree[n * 2] < tree[m * 2] || (tree[n * 2] == tree[m * 2] && depth[n] <= depth[m]));
}
///<summary>
/// Scan a literal or distance tree to determine the frequencies of the codes
/// in the bit length tree.
/// </summary>
private void scan_tree(short[] tree, int max_code)
{
int n; // iterates over all tree elements
int prevlen = -1; // last emitted length
int curlen; // length of current code
int nextlen = tree[0 * 2 + 1]; // length of next code
int count = 0; // repeat count of the current code
int max_count = 7; // max repeat count
int min_count = 4; // min repeat count
if (nextlen == 0)
{
max_count = 138; min_count = 3;
}
tree[(max_code + 1) * 2 + 1] = (short)ZLibUtil.Identity(0xffff); // guard
for (n = 0; n <= max_code; n++)
{
curlen = nextlen; nextlen = tree[(n + 1) * 2 + 1];
if (++count < max_count && curlen == nextlen)
{
continue;
}
else if (count < min_count)
{
bl_tree[curlen * 2] = (short)(bl_tree[curlen * 2] + count);
}
else if (curlen != 0)
{
if (curlen != prevlen)
bl_tree[curlen * 2]++;
bl_tree[REP_3_6 * 2]++;
}
else if (count <= 10)
{
bl_tree[REPZ_3_10 * 2]++;
}
else
{
bl_tree[REPZ_11_138 * 2]++;
}
count = 0; prevlen = curlen;
if (nextlen == 0)
{
max_count = 138; min_count = 3;
}
else if (curlen == nextlen)
{
max_count = 6; min_count = 3;
}
else
{
max_count = 7; min_count = 4;
}
}
}
///<summary>
/// Construct the Huffman tree for the bit lengths and return the index in
/// bl_order of the last bit length code to send.
/// </summary>
private int build_bl_tree()
{
int max_blindex; // index of last bit length code of non zero freq
// Determine the bit length frequencies for literal and distance trees
scan_tree(dyn_ltree, l_desc.MaxCode);
scan_tree(dyn_dtree, d_desc.MaxCode);
// Build the bit length tree:
bl_desc.build_tree(this);
// opt_len now includes the length of the tree representations, except
// the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
// Determine the number of bit length codes to send. The pkzip format
// requires that at least 4 bit length codes be sent. (appnote.txt says
// 3 but the actual value used is 4.)
for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--)
{
if (bl_tree[ZLibUtil.bl_order[max_blindex] * 2 + 1] != 0)
break;
}
// Update opt_len to include the bit length tree and counts
opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
return max_blindex;
}
///<summary>
/// Send the header for a block using dynamic Huffman trees: the counts, the
/// lengths of the bit length codes, the literal tree and the distance tree.
/// IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
/// </summary>
private void send_all_trees(int lcodes, int dcodes, int blcodes)
{
int rank; // index in bl_order
send_bits(lcodes - 257, 5); // not +255 as stated in appnote.txt
send_bits(dcodes - 1, 5);
send_bits(blcodes - 4, 4); // not -3 as stated in appnote.txt
for (rank = 0; rank < blcodes; rank++)
{
send_bits(bl_tree[ZLibUtil.bl_order[rank] * 2 + 1], 3);
}
send_tree(dyn_ltree, lcodes - 1); // literal tree
send_tree(dyn_dtree, dcodes - 1); // distance tree
}
///<summary>
/// Send a literal or distance tree in compressed form, using the codes in
/// bl_tree.
/// </summary>
private void send_tree(short[] tree, int max_code)
{
int n; // iterates over all tree elements
int prevlen = -1; // last emitted length
int curlen; // length of current code
int nextlen = tree[0 * 2 + 1]; // length of next code
int count = 0; // repeat count of the current code
int max_count = 7; // max repeat count
int min_count = 4; // min repeat count
if (nextlen == 0)
{
max_count = 138; min_count = 3;
}
for (n = 0; n <= max_code; n++)
{
curlen = nextlen; nextlen = tree[(n + 1) * 2 + 1];
if (++count < max_count && curlen == nextlen)
{
continue;
}
else if (count < min_count)
{
do
{
send_code(curlen, bl_tree);
}
while (--count != 0);
}
else if (curlen != 0)
{
if (curlen != prevlen)
{
send_code(curlen, bl_tree); count--;
}
send_code(REP_3_6, bl_tree);
send_bits(count - 3, 2);
}
else if (count <= 10)
{
send_code(REPZ_3_10, bl_tree);
send_bits(count - 3, 3);
}
else
{
send_code(REPZ_11_138, bl_tree);
send_bits(count - 11, 7);
}
count = 0; prevlen = curlen;
if (nextlen == 0)
{
max_count = 138; min_count = 3;
}
else if (curlen == nextlen)
{
max_count = 6; min_count = 3;
}
else
{
max_count = 7; min_count = 4;
}
}
}
///<summary>
/// Output a byte on the stream.
/// IN assertion: there is enough room in Pending_buf.
/// </summary>
private void put_byte(byte[] p, int start, int len)
{
Array.Copy(p, start, Pending_buf, pending, len);
pending += len;
}
/// <summary>
/// Adds a byte to the buffer
/// </summary>
private void put_byte(byte c)
{
Pending_buf[pending++] = c;
}
private void put_short(int w)
{
put_byte((byte)(w));
put_byte((byte)(ZLibUtil.URShift(w, 8)));
}
private void putShortMSB(int b)
{
put_byte((byte)(b >> 8));
put_byte((byte)(b));
}
private void send_code(int c, short[] tree)
{
send_bits((tree[c * 2] & 0xffff), (tree[c * 2 + 1] & 0xffff));
}
private void send_bits(int value_Renamed, int length)
{
int len = length;
if (bi_valid > (int)Buf_size - len)
{
int val = value_Renamed;
// bi_buf |= (val << bi_valid);
bi_buf = (short)((ushort)bi_buf | (ushort)(((val << bi_valid) & 0xffff)));
put_short(bi_buf);
bi_buf = (short)(ZLibUtil.URShift(val, (Buf_size - bi_valid)));
bi_valid += len - Buf_size;
}
else
{
// bi_buf |= (value) << bi_valid;
bi_buf = (short)((ushort)bi_buf | (ushort)((((value_Renamed) << bi_valid) & 0xffff)));
bi_valid += len;
}
}
///<summary>
/// Send one empty static block to give enough lookahead for inflate.
/// This takes 10 bits, of which 7 may remain in the bit buffer.
/// The current inflate code requires 9 bits of lookahead. If the
/// last two codes for the previous block (real code plus EOB) were coded
/// on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode
/// the last real code. In this case we send two empty static blocks instead
/// of one. (There are no problems if the previous block is stored or fixed.)
/// To simplify the code, we assume the worst case of last real code encoded
/// on one bit only.
/// </summary>
private void _tr_align()
{
send_bits(STATIC_TREES << 1, 3);
send_code(END_BLOCK, StaticTree.static_ltree);
bi_flush();
// Of the 10 bits for the empty block, we have already sent
// (10 - bi_valid) bits. The lookahead for the last real code (before
// the EOB of the previous block) was thus at least one plus the length
// of the EOB plus what we have just sent of the empty static block.
if (1 + last_eob_len + 10 - bi_valid < 9)
{
send_bits(STATIC_TREES << 1, 3);
send_code(END_BLOCK, StaticTree.static_ltree);
bi_flush();
}
last_eob_len = 7;
}
/// <summary>
/// Save the match info and tally the frequency counts. Return true if
/// the current block must be flushed.
/// </summary>
private bool _tr_tally(int dist, int lc)
{
Pending_buf[d_buf + last_lit * 2] = (byte)(ZLibUtil.URShift(dist, 8));
Pending_buf[d_buf + last_lit * 2 + 1] = (byte)dist;
Pending_buf[l_buf + last_lit] = (byte)lc; last_lit++;
if (dist == 0)
{
// lc is the unmatched char
dyn_ltree[lc * 2]++;
}
else
{
matches++;
// Here, lc is the match length - MIN_MATCH
dist--; // dist = match distance - 1
dyn_ltree[(ZLibUtil._length_code[lc] + LITERALS + 1) * 2]++;
dyn_dtree[Tree.d_code(dist) * 2]++;
}
if ((last_lit & 0x1fff) == 0 && level > 2)
{
// Compute an upper bound for the compressed length
int out_length = last_lit * 8;
int in_length = strstart - block_start;
int dcode;
for (dcode = 0; dcode < D_CODES; dcode++)
{
out_length = (int)(out_length + (int)dyn_dtree[dcode * 2] * (5L + ZLibUtil.extra_dbits[dcode]));
}
out_length = ZLibUtil.URShift(out_length, 3);
if ((matches < (last_lit / 2)) && out_length < in_length / 2)
return true;
}
return (last_lit == lit_bufsize - 1);
// We avoid equality with lit_bufsize because of wraparound at 64K
// on 16 bit machines and because stored blocks are restricted to
// 64K-1 bytes.