Lines Matching refs:heap_len
430 * one less element. Updates heap and heap_len.
435 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
460 while (j <= s->heap_len) {
462 if (j < s->heap_len &&
632 s->heap_len = 0, s->heap_max = HEAP_SIZE;
636 s->heap[++(s->heap_len)] = max_code = n;
648 while (s->heap_len < 2) {
649 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
657 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
660 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
688 } while (s->heap_len >= 2);
