Lines Matching refs:trees
436 /* used by trees.c: */
449 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
453 * The same heap array is used to build all trees.
457 /* Depth of each subtree used as tie breaker for trees of equal frequency
473 * - creating new Huffman trees less frequently may not provide fast
478 * trees more frequently.
490 ulg opt_len; /* bit length of current block with optimal trees */
491 ulg static_len; /* bit length of current block with static trees */
527 /* in trees.c */
1834 /* +++ trees.c */
1835 /* trees.c -- output deflated data using Huffman coding
1843 * The "deflation" process uses several Huffman trees. The more
1866 /* From: trees.c,v 1.11 1996/07/24 13:41:06 me Exp $ */
2172 /* Initialize the trees. */
2563 /* Determine the bit length frequencies for literal and distance trees */
2582 Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",
2589 * Send the header for a block using dynamic Huffman trees: the counts, the
2679 * Determine the best encoding for the current block: dynamic trees, static
2680 * trees or store, and output the encoded block to the zip file. This function
2692 /* Build the Huffman trees unless a stored block is forced */
2698 /* Construct the literal and distance trees */
2710 /* Build the bit length tree for the above two trees, and get the index
2764 } else if (static_lenb >= 0) { /* force static trees */
2841 * Send the block data compressed using the given Huffman trees
2987 /* --- trees.c */
3538 DTREE, /* get length, distance trees for a dynamic block */
3560 } trees; /* if DTREE, decoding info for trees */
3563 inflate_huft *td; /* trees to free */
3652 However, static trees define 32 codes (all 5 bits) to fill out the
3684 ZFREE(z, s->sub.trees.blens);
3828 s->sub.trees.table = t = (uInt)b & 0x3fff;
3841 if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
3847 s->sub.trees.index = 0;
3851 while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
3854 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
3857 while (s->sub.trees.index < 19)
3858 s->sub.trees.blens[border[s->sub.trees.index++]] = 0;
3859 s->sub.trees.bb = 7;
3860 t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb,
3861 &s->sub.trees.tb, z);
3867 ZFREE(z, s->sub.trees.blens);
3871 s->sub.trees.index = 0;
3875 while (t = s->sub.trees.table,
3876 s->sub.trees.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f))
3881 t = s->sub.trees.bb;
3883 h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
3889 s->sub.trees.blens[s->sub.trees.index++] = c;
3899 i = s->sub.trees.index;
3900 t = s->sub.trees.table;
3904 inflate_trees_free(s->sub.trees.tb, z);
3905 ZFREE(z, s->sub.trees.blens);
3911 c = c == 16 ? s->sub.trees.blens[i - 1] : 0;
3913 s->sub.trees.blens[i++] = c;
3915 s->sub.trees.index = i;
3918 inflate_trees_free(s->sub.trees.tb, z);
3919 s->sub.trees.tb = Z_NULL;
3927 t = s->sub.trees.table;
3932 s->sub.trees.blens, &bl, &bd, &tl, &td, z);
3937 ZFREE(z, s->sub.trees.blens);
3942 ZFREE(z, s->sub.trees.blens);
3943 Tracev((stderr, "inflate: trees ok, %d * %d bytes used\n",
4091 /* inftrees.c -- generate Huffman trees for efficient decoding