/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/ |
H A D | trees.c | 286 local int heap_len; /* number of elements in the heap */ variable 580 * one less element. Updates heap and heap_len. 585 heap[SMALLEST] = heap[heap_len--]; \ 611 while (j <= heap_len) { 613 if (j < heap_len && smaller(tree, heap[j+1], heap[j])) j++; 779 heap_len = 0, heap_max = HEAP_SIZE; 783 heap[++heap_len] = max_code = n; 795 while (heap_len < 2) { 796 int new = heap[++heap_len] = (max_code < 2 ? ++max_code : 0); 804 /* The elements heap[heap_len/ [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/zlib-1.2.8/ |
H A D | trees.c | 430 * one less element. Updates heap and heap_len. 435 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 460 while (j <= s->heap_len) { 462 if (j < s->heap_len && 632 s->heap_len = 0, s->heap_max = HEAP_SIZE; 636 s->heap[++(s->heap_len)] = max_code = n; 648 while (s->heap_len < 2) { 649 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 657 /* The elements heap[heap_len/2+1 .. heap_len] ar [all...] |
H A D | deflate.h | 207 int heap_len; /* number of elements in the heap */ 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 | 432 * one less element. Updates heap and heap_len. 437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 462 while (j <= s->heap_len) { 464 if (j < s->heap_len && 634 s->heap_len = 0, s->heap_max = HEAP_SIZE; 638 s->heap[++(s->heap_len)] = max_code = n; 650 while (s->heap_len < 2) { 651 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 659 /* The elements heap[heap_len/2+1 .. heap_len] ar [all...] |
H A D | deflate.h | 204 int heap_len; /* number of elements in the heap */ 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 | 432 * one less element. Updates heap and heap_len. 437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 462 while (j <= s->heap_len) { 464 if (j < s->heap_len && 634 s->heap_len = 0, s->heap_max = HEAP_SIZE; 638 s->heap[++(s->heap_len)] = max_code = n; 650 while (s->heap_len < 2) { 651 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 659 /* The elements heap[heap_len/2+1 .. heap_len] ar [all...] |
H A D | deflate.h | 204 int heap_len; /* number of elements in the heap */ 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 | 432 * one less element. Updates heap and heap_len. 437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 462 while (j <= s->heap_len) { 464 if (j < s->heap_len && 634 s->heap_len = 0, s->heap_max = HEAP_SIZE; 638 s->heap[++(s->heap_len)] = max_code = n; 650 while (s->heap_len < 2) { 651 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 659 /* The elements heap[heap_len/2+1 .. heap_len] ar [all...] |
H A D | deflate.h | 204 int heap_len; /* number of elements in the heap */ member in struct:internal_state
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/zlib_deflate/ |
H A D | deftree.c | 348 * one less element. Updates heap and heap_len. 353 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 379 while (j <= s->heap_len) { 381 if (j < s->heap_len && 554 s->heap_len = 0, s->heap_max = HEAP_SIZE; 558 s->heap[++(s->heap_len)] = max_code = n; 570 while (s->heap_len < 2) { 571 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 579 /* The elements heap[heap_len/2+1 .. heap_len] ar [all...] |
H A D | defutil.h | 180 int heap_len; /* number of elements in the heap */ member in struct:deflate_state
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/zlib-1.2.7/ |
H A D | trees.c | 430 * one less element. Updates heap and heap_len. 435 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 460 while (j <= s->heap_len) { 462 if (j < s->heap_len && 632 s->heap_len = 0, s->heap_max = HEAP_SIZE; 636 s->heap[++(s->heap_len)] = max_code = n; 648 while (s->heap_len < 2) { 649 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 657 /* The elements heap[heap_len/2+1 .. heap_len] ar [all...] |
H A D | deflate.h | 207 int heap_len; /* number of elements in the heap */ 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 | 872 int heap_len; /* number of elements in the heap */ member in struct:globals2 1032 while (j <= G2.heap_len) { 1034 if (j < G2.heap_len && SMALLER(tree, G2.heap[j + 1], G2.heap[j])) 1204 * one less element. Updates heap and heap_len. */ 1212 G2.heap[SMALLEST] = G2.heap[G2.heap_len--]; \ 1229 G2.heap_len = 0; 1234 G2.heap[++G2.heap_len] = max_code = n; 1246 while (G2.heap_len < 2) { 1247 int new = G2.heap[++G2.heap_len] = (max_code < 2 ? ++max_code : 0); 1258 /* The elements heap[heap_len/ [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/pppdump/ |
H A D | zlib.c | 325 int heap_len; /* number of elements in the heap */ member in struct:deflate_state 1790 * one less element. Updates heap and heap_len. 1795 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 1820 while (j <= s->heap_len) { 1822 if (j < s->heap_len && 1992 s->heap_len = 0, s->heap_max = HEAP_SIZE; 1996 s->heap[++(s->heap_len)] = max_code = n; 2008 while (s->heap_len < 2) { 2009 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 2017 /* The elements heap[heap_len/ [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/pppdump/ |
H A D | zlib.c | 325 int heap_len; /* number of elements in the heap */ member in struct:deflate_state 1790 * one less element. Updates heap and heap_len. 1795 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 1820 while (j <= s->heap_len) { 1822 if (j < s->heap_len && 1992 s->heap_len = 0, s->heap_max = HEAP_SIZE; 1996 s->heap[++(s->heap_len)] = max_code = n; 2008 while (s->heap_len < 2) { 2009 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 2017 /* The elements heap[heap_len/ [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/common/ |
H A D | zlib.c | 450 int heap_len; /* number of elements in the heap */ member in struct:deflate_state 2188 * one less element. Updates heap and heap_len. 2193 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 2218 while (j <= s->heap_len) { 2220 if (j < s->heap_len && 2390 s->heap_len = 0, s->heap_max = HEAP_SIZE; 2394 s->heap[++(s->heap_len)] = max_code = n; 2406 while (s->heap_len < 2) { 2407 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 2415 /* The elements heap[heap_len/ [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/common/ |
H A D | zlib.c | 450 int heap_len; /* number of elements in the heap */ member in struct:deflate_state 2188 * one less element. Updates heap and heap_len. 2193 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 2218 while (j <= s->heap_len) { 2220 if (j < s->heap_len && 2390 s->heap_len = 0, s->heap_max = HEAP_SIZE; 2394 s->heap[++(s->heap_len)] = max_code = n; 2406 while (s->heap_len < 2) { 2407 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 2415 /* The elements heap[heap_len/ [all...] |