SMALLEST          434 3rdparty/zlib/trees.c     top = s->heap[SMALLEST]; \
SMALLEST          435 3rdparty/zlib/trees.c     s->heap[SMALLEST] = s->heap[s->heap_len--]; \
SMALLEST          436 3rdparty/zlib/trees.c     pqdownheap(s, tree, SMALLEST); \
SMALLEST          668 3rdparty/zlib/trees.c         m = s->heap[SMALLEST]; /* m = node of next least frequency */
SMALLEST          685 3rdparty/zlib/trees.c         s->heap[SMALLEST] = node++;
SMALLEST          686 3rdparty/zlib/trees.c         pqdownheap(s, tree, SMALLEST);
SMALLEST          690 3rdparty/zlib/trees.c     s->heap[--(s->heap_max)] = s->heap[SMALLEST];