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

/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/minidlna/zlib-1.2.3/
H A Dtrees.c432 * 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 Ddeflate.h204 int heap_len; /* number of elements in the heap */ member in struct:internal_state
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/zlib-1.2.3/
H A Dtrees.c432 * 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 Ddeflate.h204 int heap_len; /* number of elements in the heap */ member in struct:internal_state
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/lib/zlib_deflate/
H A Ddeftree.c348 * 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 Ddefutil.h180 int heap_len; /* number of elements in the heap */ member in struct:deflate_state
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/router/busybox-1.x/archival/
H A Dgzip.c872 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-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/ppp-2.4.4/pppdump/
H A Dzlib.c325 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-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/ppp-2.4.4/common/
H A Dzlib.c450 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...]

Completed in 185 milliseconds