Searched refs:heap_len (Results 1 – 8 of 8) sorted by relevance
| /external/zlib/ |
| D | trees.c | 433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
458 while (j <= s->heap_len) {
460 if (j < s->heap_len &&
630 s->heap_len = 0, s->heap_max = HEAP_SIZE;
634 s->heap[++(s->heap_len)] = max_code = n;
646 while (s->heap_len < 2) {
647 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
658 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
686 } while (s->heap_len >= 2);
|
| D | deflate.h | 210 int heap_len; /* number of elements in the heap */ member
|
| /external/u-boot/lib/zlib/ |
| D | trees.c | 441 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
466 while (j <= s->heap_len) {
468 if (j < s->heap_len &&
638 s->heap_len = 0, s->heap_max = HEAP_SIZE;
642 s->heap[++(s->heap_len)] = max_code = n;
654 while (s->heap_len < 2) {
655 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
666 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
694 } while (s->heap_len >= 2);
|
| D | deflate.h | 204 int heap_len; /* number of elements in the heap */ member
|
| /external/python/cpython2/Modules/zlib/ |
| D | trees.c | 433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
458 while (j <= s->heap_len) {
460 if (j < s->heap_len &&
630 s->heap_len = 0, s->heap_max = HEAP_SIZE;
634 s->heap[++(s->heap_len)] = max_code = n;
646 while (s->heap_len < 2) {
647 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
658 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
686 } while (s->heap_len >= 2);
|
| D | deflate.h | 210 int heap_len; /* number of elements in the heap */ member
|
| /external/v8/third_party/zlib/ |
| D | trees.c | 433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
458 while (j <= s->heap_len) {
460 if (j < s->heap_len &&
630 s->heap_len = 0, s->heap_max = HEAP_SIZE;
634 s->heap[++(s->heap_len)] = max_code = n;
646 while (s->heap_len < 2) {
647 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
658 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
686 } while (s->heap_len >= 2);
|
| D | deflate.h | 210 int heap_len; /* number of elements in the heap */ member
|