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

  /external/qemu/distrib/zlib-1.2.3/
trees.c 483 * IN assertion: the fields freq and dad are set, heap[heap_max] and
512 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
514 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
634 s->heap_len = 0, s->heap_max = HEAP_SIZE;
672 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
673 s->heap[--(s->heap_max)] = m;
692 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
    [all...]
deflate.h 205 int heap_max; /* element of largest frequency */ member in struct:internal_state
  /external/zlib/
trees.c 487 * IN assertion: the fields freq and dad are set, heap[heap_max] and
516 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
518 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
638 s->heap_len = 0, s->heap_max = HEAP_SIZE;
676 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
677 s->heap[--(s->heap_max)] = m;
696 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
    [all...]
deflate.h 205 int heap_max; /* element of largest frequency */ member in struct:internal_state

Completed in 282 milliseconds