Home
last modified time | relevance | path

Searched refs:heap_len (Results 1 – 4 of 4) sorted by relevance

/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/
Dtrees.c435 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);
660 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
688 } while (s->heap_len >= 2);
Ddeflate.h207 int heap_len; /* number of elements in the heap */ member
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/
Dtrees.c437 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);
662 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
690 } while (s->heap_len >= 2);
Ddeflate.h204 int heap_len; /* number of elements in the heap */ member