heap_max          338 net/zlib.c         int heap_max;               /* element of largest frequency */
heap_max         1882 net/zlib.c         tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
heap_max         1884 net/zlib.c         for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
heap_max         2004 net/zlib.c         s->heap_len = 0, s->heap_max = HEAP_SIZE;
heap_max         2042 net/zlib.c             s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
heap_max         2043 net/zlib.c             s->heap[--(s->heap_max)] = m;
heap_max         2061 net/zlib.c         s->heap[--(s->heap_max)] = s->heap[SMALLEST];