352     top = s->heap[SMALLEST]; \
353     s->heap[SMALLEST] = s->heap[s->heap_len--]; \
377     int v = s->heap[k];  in pqdownheap()
382             smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {  in pqdownheap()
386         if (smaller(tree, v, s->heap[j], s->depth)) break;  in pqdownheap()
389         s->heap[k] = s->heap[j];  k = j;  in pqdownheap()
394     s->heap[k] = v;  in pqdownheap()
430     tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */  in gen_bitlen()
433         n = s->heap[h];  in gen_bitlen()
474             m = s->heap[--h];  in gen_bitlen()
558             s->heap[++(s->heap_len)] = max_code = n;  in build_tree()
571         node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);  in build_tree()
590         m = s->heap[SMALLEST]; /* m = node of next least frequency */  in build_tree()
592         s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */  in build_tree()
593         s->heap[--(s->heap_max)] = m;  in build_tree()
606         s->heap[SMALLEST] = node++;  in build_tree()
611     s->heap[--(s->heap_max)] = s->heap[SMALLEST];  in build_tree()