heap_len          204 tools/packfi2/deflate.h     int heap_len;               /* number of elements in the heap */
heap_len          437 tools/packfi2/trees.c     s->heap[SMALLEST] = s->heap[s->heap_len--]; \
heap_len          462 tools/packfi2/trees.c     while (j <= s->heap_len) {
heap_len          464 tools/packfi2/trees.c         if (j < s->heap_len &&
heap_len          634 tools/packfi2/trees.c     s->heap_len = 0, s->heap_max = HEAP_SIZE;
heap_len          638 tools/packfi2/trees.c             s->heap[++(s->heap_len)] = max_code = n;
heap_len          650 tools/packfi2/trees.c     while (s->heap_len < 2) {
heap_len          651 tools/packfi2/trees.c         node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
heap_len          662 tools/packfi2/trees.c     for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
heap_len          690 tools/packfi2/trees.c     } while (s->heap_len >= 2);