Lines Matching defs:depth
492 uch depth[2*L_CODES+1];
2546 * Compares to subtrees, using the tree depth as tie breaker when
2549 #define smaller(tree, n, m, depth) \
2551 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
2569 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
2573 if (smaller(tree, v, s->heap[j], s->depth)) break;
2743 s->depth[n] = 0;
2757 s->depth[node] = 0;
2781 s->depth[node] = (uch) (MAX(s->depth[n], s->depth[m]) + 1);
3790 uIntf *, /* bits tree desired/actual depth */
3799 uIntf *, /* literal desired/actual bit depth */
3800 uIntf *, /* distance desired/actual bit depth */
3807 uIntf *, /* literal desired/actual bit depth */
3808 uIntf *, /* distance desired/actual bit depth */
3884 uInt bb; /* bit length tree depth */
4652 uIntf *bb; /* bits tree desired/actual depth */
4681 uIntf *bl; /* literal desired/actual bit depth */
4682 uIntf *bd; /* distance desired/actual bit depth */
4908 uIntf *bl; /* literal desired/actual bit depth */
4909 uIntf *bd; /* distance desired/actual bit depth */