Searched refs:heap_max (Results 1 - 2 of 2) sorted by relevance

/barrelfish-master/lib/zlib/
H A Dtrees.c483 * IN assertion: the fields freq and dad are set, heap[heap_max] and
512 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
514 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
634 s->heap_len = 0, s->heap_max = HEAP_SIZE;
672 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
673 s->heap[--(s->heap_max)] = m;
692 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
H A Ddeflate.h205 int heap_max; /* element of largest frequency */ member in struct:internal_state

Completed in 34 milliseconds