Lines Matching defs:tree
326 ush dad; /* father node in Huffman tree */
339 ct_data *dyn_tree; /* the dynamic tree */
341 static_tree_desc *stat_desc; /* the corresponding static tree */
449 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
450 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
451 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
453 struct tree_desc_s l_desc; /* desc. for literal tree */
454 struct tree_desc_s d_desc; /* desc. for distance tree */
455 struct tree_desc_s bl_desc; /* desc. for bit length tree */
458 /* number of codes at each bit length for an optimal tree */
1857 * Each code tree is stored in a compressed form which is itself
1929 /* The static literal tree. Since the bit lengths are imposed, there is no
1931 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
1936 /* The static distance tree. (Actually a trivial tree since all codes use
1956 ct_data *static_tree; /* static tree or NULL */
1959 int elems; /* max number of elements in the tree */
1978 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
1980 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
1982 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
1983 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
1997 # define send_code(s, c, tree) send_bits(s, tree[(c)].Code, tree[(c)].Len)
1998 /* Send a code of the given tree. c and tree must not have side effects */
2001 # define send_code(s, c, tree) \
2003 send_bits(s, tree[c].Code, tree[c].Len); }
2079 int n; /* iterates over tree elements */
2085 /* number of codes at each bit length for an optimal tree */
2122 /* Construct the codes of the static literal tree */
2130 * tree construction to get a canonical Huffman tree (longest code
2135 /* The static distance tree is trivial: */
2144 * Initialize the tree data structures for a new zlib stream.
2179 int n; /* iterates over tree elements */
2192 /* Index within the heap array of least frequent node in the Huffman tree */
2199 #define pqremove(s, tree, top) \
2203 pqdownheap(s, tree, SMALLEST); \
2207 * Compares to subtrees, using the tree depth as tie breaker when
2210 #define smaller(tree, n, m, depth) \
2211 (tree[n].Freq < tree[m].Freq || \
2212 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
2215 * Restore the heap property by moving down the tree starting at node k,
2220 local void pqdownheap(s, tree, k)
2222 ct_data *tree; /* the tree to restore */
2230 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
2234 if (smaller(tree, v, s->heap[j], s->depth)) break;
2239 /* And continue down the tree, setting j to the left son of k */
2246 * Compute the optimal bit lengths for a tree and update the total bit length
2249 * above are the tree nodes sorted by increasing frequency.
2257 tree_desc *desc; /* the tree descriptor */
2259 ct_data *tree = desc->dyn_tree;
2266 int n, m; /* iterate over the tree elements */
2275 * overflow in the case of the bit length tree).
2277 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
2281 bits = tree[tree[n].Dad].Len + 1;
2283 tree[n].Len = (ush)bits;
2284 /* We overwrite tree[n].Dad which is no longer needed */
2291 f = tree[n].Freq;
2304 s->bl_count[bits]--; /* move one leaf down the tree */
2323 if (tree[m].Len != (unsigned) bits) {
2324 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
2325 s->opt_len += ((long)bits - (long)tree[m].Len)
2326 *(long)tree[m].Freq;
2327 tree[m].Len = (ush)bits;
2335 * Generate the codes for a given tree and bit counts (which need not be
2338 * the given tree and the field len is set for all tree elements.
2339 * OUT assertion: the field code is set for all tree elements of non
2342 local void gen_codes (tree, max_code, bl_count)
2343 ct_data *tree; /* the tree to decorate */
2366 int len = tree[n].Len;
2369 tree[n].Code = bi_reverse(next_code[len]++, len);
2371 Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
2372 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
2377 * Construct one Huffman tree and assigns the code bit strings and lengths.
2379 * IN assertion: the field freq is set for all tree elements.
2386 tree_desc *desc; /* the tree descriptor */
2388 ct_data *tree = desc->dyn_tree;
2402 if (tree[n].Freq != 0) {
2406 tree[n].Len = 0;
2417 tree[node].Freq = 1;
2424 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
2427 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
2429 /* Construct the Huffman tree by repeatedly combining the least two
2432 node = elems; /* next internal node of the tree */
2434 pqremove(s, tree, n); /* n = node of least frequency */
2441 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2443 tree[n].Dad = tree[m].Dad = (ush)node;
2445 if (tree == s->bl_tree) {
2447 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
2452 pqdownheap(s, tree, SMALLEST);
2464 gen_codes ((ct_data *)tree, max_code, s->bl_count);
2468 * Scan a literal or distance tree to determine the frequencies of the codes
2469 * in the bit length tree.
2471 local void scan_tree (s, tree, max_code)
2473 ct_data *tree; /* the tree to be scanned */
2476 int n; /* iterates over all tree elements */
2479 int nextlen = tree[0].Len; /* length of next code */
2485 tree[max_code+1].Len = (ush)0xffff; /* guard */
2488 curlen = nextlen; nextlen = tree[n+1].Len;
2513 * Send a literal or distance tree in compressed form, using the codes in
2516 local void send_tree (s, tree, max_code)
2518 ct_data *tree; /* the tree to be scanned */
2521 int n; /* iterates over all tree elements */
2524 int nextlen = tree[0].Len; /* length of next code */
2529 /* tree[max_code+1].Len = -1; */ /* guard already set */
2533 curlen = nextlen; nextlen = tree[n+1].Len;
2564 * Construct the Huffman tree for the bit lengths and return the index in
2576 /* Build the bit length tree: */
2578 /* opt_len now includes the length of the tree representations, except
2589 /* Update opt_len to include the bit length tree and counts */
2599 * lengths of the bit length codes, the literal tree and the distance tree.
2604 int lcodes, dcodes, blcodes; /* number of codes for each tree */
2619 Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));
2621 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
2622 Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent));
2624 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
2625 Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));
2716 * the compressed block data, excluding the tree representations.
2719 /* Build the bit length tree for the above two trees, and get the index
2854 ct_data *ltree; /* literal tree */
2855 ct_data *dtree; /* distance tree */
3471 uIntf *, /* bits tree desired/actual depth */
3472 inflate_huft * FAR *, /* bits tree result */
3481 inflate_huft * FAR *, /* literal/length tree result */
3482 inflate_huft * FAR *, /* distance tree result */
3488 inflate_huft * FAR *, /* literal/length tree result */
3489 inflate_huft * FAR *)); /* distance tree result */
3546 BTREE, /* get bit lengths tree for a dynamic block */
3567 uInt bb; /* bit length tree depth */
3568 inflate_huft *tb; /* bit length decoding tree */
3657 end-of-block. Note however that the static length tree defines
3671 10. In the tree reconstruction algorithm, Code = Code + Increment
3881 Tracev((stderr, "inflate: bits tree ok\n"));
4410 uIntf *bb; /* bits tree desired/actual depth */
4411 inflate_huft * FAR *tb; /* bits tree result */
4418 z->msg = (char*)"oversubscribed dynamic bit lengths tree";
4422 z->msg = (char*)"incomplete dynamic bit lengths tree";
4435 inflate_huft * FAR *tl; /* literal/length tree result */
4436 inflate_huft * FAR *td; /* distance tree result */
4441 /* build literal/length tree */
4446 z->msg = (char*)"oversubscribed literal/length tree";
4450 z->msg = (char*)"incomplete literal/length tree";
4456 /* build distance tree */
4461 z->msg = (char*)"oversubscribed distance tree";
4468 z->msg = (char*)"incomplete distance tree";
4473 z->msg = (char*)"empty distance tree with lengths";
4511 inflate_huft * FAR *tl; /* literal/length tree result */
4512 inflate_huft * FAR *td; /* distance tree result */
4646 inflate_huft *tree; /* pointer into tree */
4648 } code; /* if LEN or DIST, where in tree */
4659 inflate_huft *ltree; /* literal/length/eob tree */
4660 inflate_huft *dtree; /* distance tree */
4725 c->sub.code.tree = c->ltree;
4730 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
4752 c->sub.code.tree = t->next;
4771 c->sub.code.tree = c->dtree;
4777 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
4790 c->sub.code.tree = t->next;
4999 uInt ml; /* mask for literal/length tree */
5000 uInt md; /* mask for distance tree */