=========================================================================== * 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. */
(s, lcodes, dcodes, blcodes)
| 836 | * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. |
| 837 | */ |
| 838 | local void send_all_trees(s, lcodes, dcodes, blcodes) |
| 839 | deflate_state *s; |
| 840 | int lcodes, dcodes, blcodes; /* number of codes for each tree */ |
| 841 | { |
| 842 | int rank; /* index in bl_order */ |
| 843 | |
| 844 | Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); |
| 845 | Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, |
| 846 | "too many codes"); |
| 847 | Tracev((stderr, "\nbl counts: ")); |
| 848 | send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */ |
| 849 | send_bits(s, dcodes-1, 5); |
| 850 | send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */ |
| 851 | for (rank = 0; rank < blcodes; rank++) { |
| 852 | Tracev((stderr, "\nbl code %2d ", bl_order[rank])); |
| 853 | send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); |
| 854 | } |
| 855 | Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); |
| 856 | |
| 857 | send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ |
| 858 | Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); |
| 859 | |
| 860 | send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ |
| 861 | Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); |
| 862 | } |
| 863 | |
| 864 | /* =========================================================================== |
| 865 | * Send a stored block |