heap              336 net/zlib.c         int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */
heap             1806 net/zlib.c         top = s->heap[SMALLEST]; \
heap             1807 net/zlib.c         s->heap[SMALLEST] = s->heap[s->heap_len--]; \
heap             1830 net/zlib.c         int v = s->heap[k];
heap             1835 net/zlib.c                 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
heap             1839 net/zlib.c             if (smaller(tree, v, s->heap[j], s->depth)) break;
heap             1842 net/zlib.c             s->heap[k] = s->heap[j];  k = j;
heap             1847 net/zlib.c         s->heap[k] = v;
heap             1882 net/zlib.c         tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
heap             1885 net/zlib.c             n = s->heap[h];
heap             1926 net/zlib.c                 m = s->heap[--h];
heap             2008 net/zlib.c                 s->heap[++(s->heap_len)] = max_code = n;
heap             2021 net/zlib.c             node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
heap             2040 net/zlib.c             m = s->heap[SMALLEST]; /* m = node of next least frequency */
heap             2042 net/zlib.c             s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
heap             2043 net/zlib.c             s->heap[--(s->heap_max)] = m;
heap             2056 net/zlib.c             s->heap[SMALLEST] = node++;
heap             2061 net/zlib.c         s->heap[--(s->heap_max)] = s->heap[SMALLEST];