Lines Matching defs:heap_len
325 int heap_len; /* number of elements in the heap */
1790 * one less element. Updates heap and heap_len.
1795 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
1820 while (j <= s->heap_len) {
1822 if (j < s->heap_len &&
1992 s->heap_len = 0, s->heap_max = HEAP_SIZE;
1996 s->heap[++(s->heap_len)] = max_code = n;
2008 while (s->heap_len < 2) {
2009 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
2017 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
2020 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
2047 } while (s->heap_len >= 2);