=========================================================================== * Send a literal or distance tree in compressed form, using the codes in * bl_tree. */
(s, tree, max_code)
| 750 | * bl_tree. |
| 751 | */ |
| 752 | local void send_tree (s, tree, max_code) |
| 753 | deflate_state *s; |
| 754 | ct_data *tree; /* the tree to be scanned */ |
| 755 | int max_code; /* and its largest code of non zero frequency */ |
| 756 | { |
| 757 | int n; /* iterates over all tree elements */ |
| 758 | int prevlen = -1; /* last emitted length */ |
| 759 | int curlen; /* length of current code */ |
| 760 | int nextlen = tree[0].Len; /* length of next code */ |
| 761 | int count = 0; /* repeat count of the current code */ |
| 762 | int max_count = 7; /* max repeat count */ |
| 763 | int min_count = 4; /* min repeat count */ |
| 764 | |
| 765 | /* tree[max_code+1].Len = -1; */ /* guard already set */ |
| 766 | if (nextlen == 0) max_count = 138, min_count = 3; |
| 767 | |
| 768 | for (n = 0; n <= max_code; n++) { |
| 769 | curlen = nextlen; nextlen = tree[n+1].Len; |
| 770 | if (++count < max_count && curlen == nextlen) { |
| 771 | continue; |
| 772 | } else if (count < min_count) { |
| 773 | do { send_code(s, curlen, s->bl_tree); } while (--count != 0); |
| 774 | |
| 775 | } else if (curlen != 0) { |
| 776 | if (curlen != prevlen) { |
| 777 | send_code(s, curlen, s->bl_tree); count--; |
| 778 | } |
| 779 | Assert(count >= 3 && count <= 6, " 3_6?"); |
| 780 | send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2); |
| 781 | |
| 782 | } else if (count <= 10) { |
| 783 | send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3); |
| 784 | |
| 785 | } else { |
| 786 | send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7); |
| 787 | } |
| 788 | count = 0; prevlen = curlen; |
| 789 | if (nextlen == 0) { |
| 790 | max_count = 138, min_count = 3; |
| 791 | } else if (curlen == nextlen) { |
| 792 | max_count = 6, min_count = 3; |
| 793 | } else { |
| 794 | max_count = 7, min_count = 4; |
| 795 | } |
| 796 | } |
| 797 | } |
| 798 | |
| 799 | /* =========================================================================== |
| 800 | * Construct the Huffman tree for the bit lengths and return the index in |
no test coverage detected