SMALLEST          436 other-licenses/zlib/trees.c     top = s->heap[SMALLEST]; \
SMALLEST          437 other-licenses/zlib/trees.c     s->heap[SMALLEST] = s->heap[s->heap_len--]; \
SMALLEST          438 other-licenses/zlib/trees.c     pqdownheap(s, tree, SMALLEST); \
SMALLEST          670 other-licenses/zlib/trees.c         m = s->heap[SMALLEST]; /* m = node of next least frequency */
SMALLEST          687 other-licenses/zlib/trees.c         s->heap[SMALLEST] = node++;
SMALLEST          688 other-licenses/zlib/trees.c         pqdownheap(s, tree, SMALLEST);
SMALLEST          692 other-licenses/zlib/trees.c     s->heap[--(s->heap_max)] = s->heap[SMALLEST];