494     int node;          /* new node being created */  in build_tree()  local
517         node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);  in build_tree()
518         tree[node].Freq = 1;  in build_tree()
519         s->depth[node] = 0;  in build_tree()
520         s->opt_len--; if (stree) s->static_len -= stree[node].Len;  in build_tree()
533     node = elems;              /* next internal node of the tree */  in build_tree()
542         tree[node].Freq = tree[n].Freq + tree[m].Freq;  in build_tree()
543         s->depth[node] = (uch) (max(s->depth[n], s->depth[m]) + 1);  in build_tree()
544         tree[n].Dad = tree[m].Dad = (ush)node;  in build_tree()
548                     node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);  in build_tree()
552         s->heap[SMALLEST] = node++;  in build_tree()