Home | History | Annotate | Download | only in zlib

Lines Matching refs:heap_len

486  * one less element. Updates heap and heap_len.
491     s->heap[SMALLEST] = s->heap[s->heap_len--]; \
512     while (j <= s->heap_len) {
514         if (j < s->heap_len &&
639     s->heap_len = 0, s->heap_max = HEAP_SIZE;
643             s->heap[++(s->heap_len)] = max_code = n;
655     while (s->heap_len < 2) {
656         node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
664     /* The elements heap[heap_len/2 + 1 .. heap_len] are leaves of the tree,
667     for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
695     } while (s->heap_len >= 2);