SMALLEST 440 third_party/zlib/trees.c top = s->heap[SMALLEST]; \ SMALLEST 441 third_party/zlib/trees.c s->heap[SMALLEST] = s->heap[s->heap_len--]; \ SMALLEST 442 third_party/zlib/trees.c pqdownheap(s, tree, SMALLEST); \ SMALLEST 674 third_party/zlib/trees.c m = s->heap[SMALLEST]; /* m = node of next least frequency */ SMALLEST 691 third_party/zlib/trees.c s->heap[SMALLEST] = node++; SMALLEST 692 third_party/zlib/trees.c pqdownheap(s, tree, SMALLEST); SMALLEST 696 third_party/zlib/trees.c s->heap[--(s->heap_max)] = s->heap[SMALLEST];