Lines Matching refs:tree
190 ush dad; /* father node in Huffman tree */
203 ct_data *dyn_tree; /* the dynamic tree */
205 static_tree_desc *stat_desc; /* the corresponding static tree */
313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
317 struct tree_desc_s l_desc; /* desc. for literal tree */
318 struct tree_desc_s d_desc; /* desc. for distance tree */
319 struct tree_desc_s bl_desc; /* desc. for bit length tree */
322 /* number of codes at each bit length for an optimal tree */
1451 * Each code tree is stored in a compressed form which is itself
1522 /* The static literal tree. Since the bit lengths are imposed, there is no
1524 * The codes 286 and 287 are needed to build a canonical tree (see ct_init
1529 /* The static distance tree. (Actually a trivial tree since all codes use
1549 ct_data *static_tree; /* static tree or NULL */
1552 int elems; /* max number of elements in the tree */
1571 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
1573 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
1575 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
1576 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
1590 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
1591 /* Send a code of the given tree. c and tree must not have side effects */
1594 # define send_code(s, c, tree) \
1596 send_bits(s, tree[c].Code, tree[c].Len); }
1672 int n; /* iterates over tree elements */
1678 /* number of codes at each bit length for an optimal tree */
1713 /* Construct the codes of the static literal tree */
1721 * tree construction to get a canonical Huffman tree (longest code
1726 /* The static distance tree is trivial: */
1734 * Initialize the tree data structures for a new zlib stream.
1772 int n; /* iterates over tree elements */
1785 /* Index within the heap array of least frequent node in the Huffman tree */
1792 #define pqremove(s, tree, top) \
1796 pqdownheap(s, tree, SMALLEST); \
1800 * Compares to subtrees, using the tree depth as tie breaker when
1803 #define smaller(tree, n, m, depth) \
1804 (tree[n].Freq < tree[m].Freq || \
1805 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
1808 * Restore the heap property by moving down the tree starting at node k,
1813 local void pqdownheap(s, tree, k)
1815 ct_data *tree; /* the tree to restore */
1823 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
1827 if (smaller(tree, v, s->heap[j], s->depth)) break;
1832 /* And continue down the tree, setting j to the left son of k */
1839 * Compute the optimal bit lengths for a tree and update the total bit length
1842 * above are the tree nodes sorted by increasing frequency.
1850 tree_desc *desc; /* the tree descriptor */
1852 ct_data *tree = desc->dyn_tree;
1859 int n, m; /* iterate over the tree elements */
1868 * overflow in the case of the bit length tree).
1870 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
1874 bits = tree[tree[n].Dad].Len + 1;
1876 tree[n].Len = (ush)bits;
1877 /* We overwrite tree[n].Dad which is no longer needed */
1884 f = tree[n].Freq;
1897 s->bl_count[bits]--; /* move one leaf down the tree */
1916 if (tree[m].Len != (unsigned) bits) {
1917 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
1918 s->opt_len += ((long)bits - (long)tree[m].Len)
1919 *(long)tree[m].Freq;
1920 tree[m].Len = (ush)bits;
1928 * Generate the codes for a given tree and bit counts (which need not be
1931 * the given tree and the field len is set for all tree elements.
1932 * OUT assertion: the field code is set for all tree elements of non
1935 local void gen_codes (tree, max_code, bl_count)
1936 ct_data *tree; /* the tree to decorate */
1959 int len = tree[n].Len;
1962 tree[n].Code = bi_reverse(next_code[len]++, len);
1964 Tracec(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
1965 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
1970 * Construct one Huffman tree and assigns the code bit strings and lengths.
1972 * IN assertion: the field freq is set for all tree elements.
1979 tree_desc *desc; /* the tree descriptor */
1981 ct_data *tree = desc->dyn_tree;
1995 if (tree[n].Freq != 0) {
1999 tree[n].Len = 0;
2010 tree[node].Freq = 1;
2017 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
2020 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
2022 /* Construct the Huffman tree by repeatedly combining the least two
2025 node = elems; /* next internal node of the tree */
2027 pqremove(s, tree, n); /* n = node of least frequency */
2034 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2036 tree[n].Dad = tree[m].Dad = (ush)node;
2038 if (tree == s->bl_tree) {
2040 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
2045 pqdownheap(s, tree, SMALLEST);
2057 gen_codes ((ct_data *)tree, max_code, s->bl_count);
2061 * Scan a literal or distance tree to determine the frequencies of the codes
2062 * in the bit length tree.
2064 local void scan_tree (s, tree, max_code)
2066 ct_data *tree; /* the tree to be scanned */
2069 int n; /* iterates over all tree elements */
2072 int nextlen = tree[0].Len; /* length of next code */
2078 tree[max_code+1].Len = (ush)0xffff; /* guard */
2081 curlen = nextlen; nextlen = tree[n+1].Len;
2106 * Send a literal or distance tree in compressed form, using the codes in
2109 local void send_tree (s, tree, max_code)
2111 ct_data *tree; /* the tree to be scanned */
2114 int n; /* iterates over all tree elements */
2117 int nextlen = tree[0].Len; /* length of next code */
2122 /* tree[max_code+1].Len = -1; */ /* guard already set */
2126 curlen = nextlen; nextlen = tree[n+1].Len;
2157 * Construct the Huffman tree for the bit lengths and return the index in
2169 /* Build the bit length tree: */
2171 /* opt_len now includes the length of the tree representations, except
2182 /* Update opt_len to include the bit length tree and counts */
2192 * lengths of the bit length codes, the literal tree and the distance tree.
2197 int lcodes, dcodes, blcodes; /* number of codes for each tree */
2212 Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));
2214 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
2215 Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent));
2217 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
2218 Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));
2305 * the compressed block data, excluding the tree representations.
2308 /* Build the bit length tree for the above two trees, and get the index
2453 ct_data *ltree; /* literal tree */
2454 ct_data *dtree; /* distance tree */
2675 uIntf *, /* bits tree desired/actual depth */
2676 inflate_huft * FAR *, /* bits tree result */
2685 inflate_huft * FAR *, /* literal/length tree result */
2686 inflate_huft * FAR *, /* distance tree result */
2692 inflate_huft * FAR *, /* literal/length tree result */
2693 inflate_huft * FAR *)); /* distance tree result */
3056 BTREE, /* get bit lengths tree for a dynamic block */
3071 uInt bb; /* bit length tree depth */
3072 inflate_huft *tb; /* bit length decoding tree */
3180 end-of-block. Note however that the static length tree defines
3194 10. In the tree reconstruction algorithm, Code = Code + Increment
3400 Tracev((stderr, "inflate: bits tree ok\n"));
3896 uIntf *bb; /* bits tree desired/actual depth */
3897 inflate_huft * FAR *tb; /* bits tree result */
3904 z->msg = "oversubscribed dynamic bit lengths tree";
3908 z->msg = "incomplete dynamic bit lengths tree";
3921 inflate_huft * FAR *tl; /* literal/length tree result */
3922 inflate_huft * FAR *td; /* distance tree result */
3927 /* build literal/length tree */
3931 z->msg = "oversubscribed literal/length tree";
3935 z->msg = "incomplete literal/length tree";
3941 /* build distance tree */
3945 z->msg = "oversubscribed literal/length tree";
3952 z->msg = "incomplete literal/length tree";
4003 inflate_huft * FAR *tl; /* literal/length tree result */
4004 inflate_huft * FAR *td; /* distance tree result */
4103 inflate_huft *tree; /* pointer into tree */
4105 } code; /* if LEN or DIST, where in tree */
4116 inflate_huft *ltree; /* literal/length/eob tree */
4117 inflate_huft *dtree; /* distance tree */
4181 c->sub.code.tree = c->ltree;
4186 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
4208 c->sub.code.tree = t->next;
4227 c->sub.code.tree = c->dtree;
4233 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
4246 c->sub.code.tree = t->next;
4423 uInt ml; /* mask for literal/length tree */
4424 uInt md; /* mask for distance tree */