lib/zlib_deflate/deftree.c

294  * one less element. Updates heap and heap_len.
299     s->heap[SMALLEST] = s->heap[s->heap_len--]; \
325     while (j <= s->heap_len) {
327         if (j < s->heap_len &&
500     s->heap_len = 0, s->heap_max = HEAP_SIZE;
504             s->heap[++(s->heap_len)] = max_code = n;
516     while (s->heap_len < 2) {
517         node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
525     /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
528     for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
555     } while (s->heap_len >= 2);