SMALLEST          352 lib/zlib_deflate/deftree.c     top = s->heap[SMALLEST]; \
SMALLEST          353 lib/zlib_deflate/deftree.c     s->heap[SMALLEST] = s->heap[s->heap_len--]; \
SMALLEST          354 lib/zlib_deflate/deftree.c     pqdownheap(s, tree, SMALLEST); \
SMALLEST          590 lib/zlib_deflate/deftree.c         m = s->heap[SMALLEST]; /* m = node of next least frequency */
SMALLEST          606 lib/zlib_deflate/deftree.c         s->heap[SMALLEST] = node++;
SMALLEST          607 lib/zlib_deflate/deftree.c         pqdownheap(s, tree, SMALLEST);
SMALLEST          611 lib/zlib_deflate/deftree.c     s->heap[--(s->heap_max)] = s->heap[SMALLEST];