Searched refs:heap_max (Results 1 – 2 of 2) sorted by relevance
376 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()378 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { in gen_bitlen()500 s->heap_len = 0, s->heap_max = HEAP_SIZE; in build_tree()538 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ in build_tree()539 s->heap[--(s->heap_max)] = m; in build_tree()557 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
183 int heap_max; /* element of largest frequency */ member
