SMALLEST         1806 net/zlib.c         top = s->heap[SMALLEST]; \
SMALLEST         1807 net/zlib.c         s->heap[SMALLEST] = s->heap[s->heap_len--]; \
SMALLEST         1808 net/zlib.c         pqdownheap(s, tree, SMALLEST); \
SMALLEST         2040 net/zlib.c             m = s->heap[SMALLEST]; /* m = node of next least frequency */
SMALLEST         2056 net/zlib.c             s->heap[SMALLEST] = node++;
SMALLEST         2057 net/zlib.c             pqdownheap(s, tree, SMALLEST);
SMALLEST         2061 net/zlib.c         s->heap[--(s->heap_max)] = s->heap[SMALLEST];