heap_max          430 lib/zlib_deflate/deftree.c     tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
heap_max          432 lib/zlib_deflate/deftree.c     for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
heap_max          554 lib/zlib_deflate/deftree.c     s->heap_len = 0, s->heap_max = HEAP_SIZE;
heap_max          592 lib/zlib_deflate/deftree.c         s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
heap_max          593 lib/zlib_deflate/deftree.c         s->heap[--(s->heap_max)] = m;
heap_max          611 lib/zlib_deflate/deftree.c     s->heap[--(s->heap_max)] = s->heap[SMALLEST];
heap_max          181 lib/zlib_deflate/defutil.h     int heap_max;               /* element of largest frequency */