Searched refs:heap_len (Results 1 – 5 of 5) sorted by relevance
| /external/zlib/src/ |
| D | trees.c | 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);
660 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
688 } while (s->heap_len >= 2);
|
| D | deflate.h | 207 int heap_len; /* number of elements in the heap */ member
|
| /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
| D | fx_zlib_trees.c | 435 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
460 while (j <= s->heap_len) { in pqdownheap()
462 if (j < s->heap_len && in pqdownheap()
632 s->heap_len = 0, s->heap_max = HEAP_SIZE; in build_tree()
636 s->heap[++(s->heap_len)] = max_code = n; in build_tree()
648 while (s->heap_len < 2) { in build_tree()
649 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); in build_tree()
660 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n); in build_tree()
688 } while (s->heap_len >= 2); in build_tree()
|
| D | deflate.h | 207 int heap_len; /* number of elements in the heap */ member
|
| /external/chromium-trace/trace-viewer/tracing/third_party/jszip/ |
| D | jszip.min.js | 13 …count=new C.Buf16(gb+1),this.heap=new C.Buf16(2*cb+1),f(this.heap),this.heap_len=0,this.heap_max=0…
14 …heap_len&&(e<a.heap_len&&q(b,a.heap[e+1],a.heap[e],a.depth)&&e++,!q(b,d,a.heap[e],a.depth));)a.hea…
|