Searched refs:heap_max (Results 1 – 5 of 5) sorted by relevance
559 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()561 for (h = s->heap_max + 1; h < HEAP_SIZE; h++) { in gen_bitlen()639 s->heap_len = 0, s->heap_max = HEAP_SIZE; in build_tree()677 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ in build_tree()678 s->heap[--(s->heap_max)] = m; in build_tree()697 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
217 int heap_max; /* element of largest frequency */ member
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];
205 int heap_max; /* element of largest frequency */ member
478 int heap_max; /* element of largest frequency */ member2606 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()2608 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { in gen_bitlen()2726 s->heap_len = 0, s->heap_max = HEAP_SIZE; in build_tree()2764 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ in build_tree()2765 s->heap[--(s->heap_max)] = m; in build_tree()2783 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()