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

/illumos-gate/usr/src/uts/common/zmod/
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
/illumos-gate/usr/src/boot/lib/libz/
H A Dtrees.c481 * IN assertion: the fields freq and dad are set, heap[heap_max] and
510 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
512 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
632 s->heap_len = 0, s->heap_max = HEAP_SIZE;
670 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
671 s->heap[--(s->heap_max)] = m;
690 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
H A Ddeflate.h208 int heap_max; /* element of largest frequency */ member in struct:internal_state
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c326 int heap_max; /* element of largest frequency */ member in struct:deflate_state
1841 * IN assertion: the fields freq and dad are set, heap[heap_max] and
1870 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
1872 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
1992 s->heap_len = 0, s->heap_max = HEAP_SIZE;
2030 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
2031 s->heap[--(s->heap_max)] = m;
2049 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c488 int heap_max; /* element of largest frequency */ member in struct:deflate_state
2648 * IN assertion: the fields freq and dad are set, heap[heap_max] and
2680 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
2682 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
2819 s->heap_len = 0, s->heap_max = HEAP_SIZE;
2862 s->heap[--(s->heap_max)] = n;
2863 s->heap[--(s->heap_max)] = m;
2882 s->heap[--(s->heap_max)] = s->heap[SMALLEST];

Completed in 97 milliseconds