Lines Matching defs:heap_len
286 local int heap_len; /* number of elements in the heap */
580 * one less element. Updates heap and heap_len.
585 heap[SMALLEST] = heap[heap_len--]; \
611 while (j <= heap_len) {
613 if (j < heap_len && smaller(tree, heap[j+1], heap[j])) j++;
779 heap_len = 0, heap_max = HEAP_SIZE;
783 heap[++heap_len] = max_code = n;
795 while (heap_len < 2) {
796 int new = heap[++heap_len] = (max_code < 2 ? ++max_code : 0);
804 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
807 for (n = heap_len/2; n >= 1; n--) pqdownheap(tree, n);
833 } while (heap_len >= 2);