HomeSort by relevance Sort by last modified time
    Searched refs:heap_len (Results 1 - 4 of 4) sorted by null

  /external/qemu/distrib/zlib-1.2.3/
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] are leaves of the tree
    [all...]
deflate.h 204 int heap_len; /* number of elements in the heap */ member in struct:internal_state
  /external/zlib/src/
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] are leaves of the tree
    [all...]
deflate.h 207 int heap_len; /* number of elements in the heap */ member in struct:internal_state

Completed in 35 milliseconds