Lines Matching +defs:last +defs:depth
273 * array to 64K, this link is maintained only for the last 32K strings.
353 uch depth[2*L_CODES+1];
391 int last_eob_len; /* bit length of EOB code for last block */
402 /* Number of valid bits in bi_buf. All bits above the last valid bit
407 /* Number of blocks produced since the last time Z_PACKET_FLUSH
585 * (except for the last MIN_MATCH-1 bytes of the input file).
788 /* If we came back in here to get the last output from
1413 * enough lookahead, the last two strings are not inserted in
1557 * 3 .. 258, the last 256 values correspond to the top 8 bits of
1822 * Compares to subtrees, using the tree depth as tie breaker when
1825 #define smaller(tree, n, m, depth) \
1827 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
1845 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
1849 if (smaller(tree, v, s->heap[j], s->depth)) break;
1973 /* Check that the bit counts in bl_count are consistent. The last code
2019 s->depth[n] = 0;
2033 s->depth[node] = 0;
2057 s->depth[node] = (uch) (MAX(s->depth[n], s->depth[m]) + 1);
2092 int prevlen = -1; /* last emitted length */
2137 int prevlen = -1; /* last emitted length */
2180 * bl_order of the last bit length code to send.
2185 int max_blindex; /* index of last bit length code of non zero freq */
2250 int eof; /* true if this is the last block for a file */
2307 int flush; /* Z_FINISH if this is the last block for a file */
2310 int max_blindex; /* index of last bit length code of non zero freq */
2331 * in bl_order of the last bit length code to send.
2345 /* If compression failed and this is the first and last block,
2366 * compression, and this block contains all the data since the last
2385 * the last block flush, because compression would have been
2697 uIntf *, /* bits tree desired/actual depth */
2705 uIntf *, /* literal desired/actual bit depth */
2706 uIntf *, /* distance desired/actual bit depth */
2712 uIntf *, /* literal desired/actual bit depth */
2713 uIntf *, /* distance desired/actual bit depth */
3082 DONEB, /* finished last block, done */
3093 uInt bb; /* bit length tree depth */
3103 uInt last; /* true if this block is the last block */
3175 /* infblock.c -- interpret and process block types to last block
3207 Huffman codes, but the last two had better not show up in the data.
3220 really is 258. The last length deserves its own, short code
3301 s->last = t & 1;
3306 s->last ? " (last)" : ""));
3314 s->last ? " (last)" : ""));
3334 s->last ? " (last)" : ""));
3375 s->mode = s->last ? DRY : TYPE;
3511 if (!s->last)
3785 /* Adjust last length count to fill out codes, if needed */
3864 /* connect to last table, if there is one */
3872 u[h-1][j] = r; /* connect to last table */
3918 uIntf *bb; /* bits tree desired/actual depth */
3941 uIntf *bl; /* literal desired/actual bit depth */
3942 uIntf *bd; /* distance desired/actual bit depth */
4023 uIntf *bl; /* literal desired/actual bit depth */
4024 uIntf *bd; /* distance desired/actual bit depth */