361 #define smaller(tree, n, m, depth) \  argument
362    (tree[n].Freq < tree[m].Freq || \
363    (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
419     int n, m;           /* iterate over the tree elements */  in gen_bitlen()  local
474             m = s->heap[--h];  in gen_bitlen()
475             if (m > max_code) continue;  in gen_bitlen()
476             if (tree[m].Len != (unsigned) bits) {  in gen_bitlen()
477                 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));  in gen_bitlen()
478                 s->opt_len += ((long)bits - (long)tree[m].Len)  in gen_bitlen()
479                               *(long)tree[m].Freq;  in gen_bitlen()
480                 tree[m].Len = (ush)bits;  in gen_bitlen()
546     int n, m;          /* iterate over heap elements */  in build_tree()  local
590         m = s->heap[SMALLEST]; /* m = node of next least frequency */  in build_tree()
593         s->heap[--(s->heap_max)] = m;  in build_tree()
596         tree[node].Freq = tree[n].Freq + tree[m].Freq;  in build_tree()
597         s->depth[node] = (uch) (max(s->depth[n], s->depth[m]) + 1);  in build_tree()
598         tree[n].Dad = tree[m].Dad = (ush)node;  in build_tree()
602                     node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);  in build_tree()