Lines Matching refs:depth
440 * Compares to subtrees, using the tree depth as tie breaker when
443 #define smaller(tree, n, m, depth) \
445 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
463 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
467 if (smaller(tree, v, s->heap[j], s->depth)) break;
637 s->depth[n] = 0;
651 s->depth[node] = 0;
675 s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
676 s->depth[n] : s->depth[m]) + 1);
