Lines Matching refs:trees
472 /* used by trees.c: */
486 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
492 * trees.
497 * Depth of each subtree used as tie breaker for trees of
521 * - creating new Huffman trees less frequently may not
526 * but have of course the overhead of transmitting trees
541 ulg opt_len; /* bit length of current block with optimal trees */
542 ulg static_len; /* bit length of current block with static trees */
583 /* in trees.c */
2209 /* +++ trees.c */
2211 * trees.c -- output deflated data using Huffman coding
2219 * The "deflation" process uses several Huffman trees. The more
2242 /* From: trees.c,v 1.11 1996/07/24 13:41:06 me Exp $ */
2577 /* Initialize the trees. */
3012 * distance trees
3035 Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",
3043 * Send the header for a block using dynamic Huffman trees: the counts, the
3153 * Determine the best encoding for the current block: dynamic trees, static
3154 * trees or store, and output the encoded block to the zip file.
3167 /* Build the Huffman trees unless a stored block is forced */
3173 /* Construct the literal and distance trees */
3188 * Build the bit length tree for the above two trees,
3260 #define FRC_STAT_COND static_lenb >= 0 /* force static trees */
3356 * Send the block data compressed using the given Huffman trees
3525 /* --- trees.c */
4078 inflate_huft *, /* space for trees */
4089 inflate_huft *, /* space for trees */
4155 DTREE, /* get length, distance trees for a dynamic block */
4177 } trees; /* if DTREE, decoding info for trees */
4270 * However, static trees define 32 codes (all 5 bits) to fill out the
4303 s->sub.trees.blens != Z_NULL) {
4304 ZFREE(z, s->sub.trees.blens);
4305 s->sub.trees.blens = Z_NULL;
4456 s->sub.trees.table = t = (uInt)b & 0x3fff;
4469 if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t,
4476 s->sub.trees.index = 0;
4481 while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
4484 s->sub.trees.blens[border[s->sub.trees.index++]] =
4488 while (s->sub.trees.index < 19)
4489 s->sub.trees.blens[border[s->sub.trees.index++]] =
4491 s->sub.trees.bb = 7;
4492 t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb,
4493 &s->sub.trees.tb, s->hufts, z);
4496 ZFREE(z, s->sub.trees.blens);
4497 s->sub.trees.blens = Z_NULL;
4503 s->sub.trees.index = 0;
4508 while (t = s->sub.trees.table,
4509 s->sub.trees.index < 258 + (t & 0x1f) +
4515 t = s->sub.trees.bb;
4517 h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
4523 s->sub.trees.blens[s->sub.trees.index++] =
4532 i = s->sub.trees.index;
4533 t = s->sub.trees.table;
4538 ZFREE(z, s->sub.trees.blens);
4539 s->sub.trees.blens = Z_NULL;
4545 c = c == 16 ? s->sub.trees.blens[i - 1] : 0;
4547 s->sub.trees.blens[i++] = c;
4549 s->sub.trees.index = i;
4552 s->sub.trees.tb = Z_NULL;
4562 t = s->sub.trees.table;
4565 s->sub.trees.blens, &bl, &bd, &tl, &td,
4567 ZFREE(z, s->sub.trees.blens);
4568 s->sub.trees.blens = Z_NULL;
4576 Tracev((stderr, "inflate: trees ok\n"));
4737 * inftrees.c -- generate Huffman trees for efficient decoding
4771 inflate_huft *hp, /* space for trees */
4840 inflate_huft *hp; /* space for trees */
5072 inflate_huft *hp; /* space for trees */
5101 inflate_huft *hp; /* space for trees */