depth             210 tools/packfi2/deflate.h     uch depth[2*L_CODES+1];
depth             445 tools/packfi2/trees.c #define smaller(tree, n, m, depth) \
depth             447 tools/packfi2/trees.c    (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
depth             465 tools/packfi2/trees.c             smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
depth             469 tools/packfi2/trees.c         if (smaller(tree, v, s->heap[j], s->depth)) break;
depth             639 tools/packfi2/trees.c             s->depth[n] = 0;
depth             653 tools/packfi2/trees.c         s->depth[node] = 0;
depth             677 tools/packfi2/trees.c         s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
depth             678 tools/packfi2/trees.c                                 s->depth[n] : s->depth[m]) + 1);