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

/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/lib/zlib_deflate/
H A Ddefutil.h181 int heap_max; /* element of largest frequency */ member in struct:deflate_state
H A Ddeftree.c400 * IN assertion: the fields freq and dad are set, heap[heap_max] and
430 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
432 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
554 s->heap_len = 0, s->heap_max = HEAP_SIZE;
592 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
593 s->heap[--(s->heap_max)] = m;
611 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/minidlna/zlib-1.2.3/
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
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/zlib-1.2.3/
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
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/router/busybox-1.x/archival/
H A Dgzip.c873 int heap_max; /* element of largest frequency */ member in struct:globals2
1055 * IN assertion: the fields freq and dad are set, heap[heap_max] and
1083 tree[G2.heap[G2.heap_max]].Len = 0; /* root of the heap */
1085 for (h = G2.heap_max + 1; h < HEAP_SIZE; h++) {
1230 G2.heap_max = HEAP_SIZE;
1271 G2.heap[--G2.heap_max] = n; /* keep the nodes sorted by frequency */
1272 G2.heap[--G2.heap_max] = m;
1290 G2.heap[--G2.heap_max] = G2.heap[SMALLEST];
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/ppp-2.4.4/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];
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/ppp-2.4.4/common/
H A Dzlib.c451 int heap_max; /* element of largest frequency */ member in struct:deflate_state
2239 * IN assertion: the fields freq and dad are set, heap[heap_max] and
2268 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
2270 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
2390 s->heap_len = 0, s->heap_max = HEAP_SIZE;
2428 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
2429 s->heap[--(s->heap_max)] = m;
2447 s->heap[--(s->heap_max)] = s->heap[SMALLEST];

Completed in 280 milliseconds