/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/ |
H A D | trees.c | 287 local int heap_max; /* element of largest frequency */ variable 632 * IN assertion: the fields freq and dad are set, heap[heap_max] and 660 tree[heap[heap_max]].Len = 0; /* root of the heap */ 662 for (h = heap_max+1; h < HEAP_SIZE; h++) { 779 heap_len = 0, heap_max = HEAP_SIZE; 816 heap[--heap_max] = n; /* keep the nodes sorted by frequency */ 817 heap[--heap_max] = m; 835 heap[--heap_max] = heap[SMALLEST];
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/zlib_deflate/ |
H A D | defutil.h | 181 int heap_max; /* element of largest frequency */ member in struct:deflate_state
|
H A D | deftree.c | 400 * 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-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/zlib-1.2.8/ |
H A D | trees.c | 481 * 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 D | deflate.h | 208 int heap_max; /* element of largest frequency */ member in struct:internal_state
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/zlib/ |
H A D | trees.c | 483 * 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 D | deflate.h | 205 int heap_max; /* element of largest frequency */ member in struct:internal_state
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/zlib-1.2.3/ |
H A D | trees.c | 483 * 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 D | deflate.h | 205 int heap_max; /* element of largest frequency */ member in struct:internal_state
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/transmission/zlib-1.2.3/ |
H A D | trees.c | 483 * 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 D | deflate.h | 205 int heap_max; /* element of largest frequency */ member in struct:internal_state
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/zlib-1.2.7/ |
H A D | trees.c | 481 * 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 D | deflate.h | 208 int heap_max; /* element of largest frequency */ member in struct:internal_state
|
/netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/archival/ |
H A D | gzip.c | 873 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-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/pppdump/ |
H A D | zlib.c | 326 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-R7000-V1.0.7.12_1.2.5/src/router/ppp/pppdump/ |
H A D | zlib.c | 326 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-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/common/ |
H A D | zlib.c | 451 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];
|
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/common/ |
H A D | zlib.c | 451 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];
|