HomeSort by: relevance | last modified time | path
    Searched refs:heap_len (Results 1 - 3 of 3) sorted by relevancy

  /src/common/dist/zlib/
trees.c 486 * one less element. Updates heap and heap_len.
491 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
512 while (j <= s->heap_len) {
514 if (j < s->heap_len &&
639 s->heap_len = 0, s->heap_max = HEAP_SIZE;
643 s->heap[++(s->heap_len)] = max_code = n;
655 while (s->heap_len < 2) {
656 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
664 /* The elements heap[heap_len/2 + 1 .. heap_len] are leaves of the tree
    [all...]
deflate.h 216 int heap_len; /* number of elements in the heap */ member in struct:internal_state
  /src/sys/net/
zlib.c 477 int heap_len; /* number of elements in the heap */ member in struct:deflate_state
2528 * one less element. Updates heap and heap_len.
2533 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
2557 while (j <= s->heap_len) {
2559 if (j < s->heap_len &&
2726 s->heap_len = 0, s->heap_max = HEAP_SIZE;
2730 s->heap[++(s->heap_len)] = max_code = n;
2742 while (s->heap_len < 2) {
2743 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
2751 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree
    [all...]

Completed in 17 milliseconds