Lines Matching refs:heap
488 top = s->heap[SMALLEST]; \
489 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
508 int v = s->heap[k]; in pqdownheap()
513 smaller(tree, s->heap[j + 1], s->heap[j], s->depth)) { in pqdownheap()
517 if (smaller(tree, v, s->heap[j], s->depth)) break; in pqdownheap()
520 s->heap[k] = s->heap[j]; k = j; in pqdownheap()
525 s->heap[k] = v; in pqdownheap()
557 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()
560 n = s->heap[h]; in gen_bitlen()
601 m = s->heap[--h]; in gen_bitlen()
641 s->heap[++(s->heap_len)] = max_code = n; in build_tree()
654 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); in build_tree()
673 m = s->heap[SMALLEST]; /* m = node of next least frequency */ in build_tree()
675 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ in build_tree()
676 s->heap[--(s->heap_max)] = m; in build_tree()
690 s->heap[SMALLEST] = node++; in build_tree()
695 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()