Lines Matching refs:heap
982 ush heap[HEAP_SIZE]; /* heap used to build the Huffman trees */ member
1129 int v = G2.heap[k]; in pqdownheap()
1134 if (j < G2.heap_len && SMALLER(tree, G2.heap[j + 1], G2.heap[j])) in pqdownheap()
1138 if (SMALLER(tree, v, G2.heap[j])) in pqdownheap()
1142 G2.heap[k] = G2.heap[j]; in pqdownheap()
1148 G2.heap[k] = v; in pqdownheap()
1175 tree[G2.heap[G2.heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()
1182 n = G2.heap[h]; in gen_bitlen()
1232 m = G2.heap[--h]; in gen_bitlen()
1307 top = G2.heap[SMALLEST]; \
1308 G2.heap[SMALLEST] = G2.heap[G2.heap_len--]; \
1330 G2.heap[++G2.heap_len] = max_code = n; in build_tree()
1343 int new = G2.heap[++G2.heap_len] = (max_code < 2 ? ++max_code : 0); in build_tree()
1365 m = G2.heap[SMALLEST]; /* m = node of next least frequency */ in build_tree()
1367 G2.heap[--G2.heap_max] = n; /* keep the nodes sorted by frequency */ in build_tree()
1368 G2.heap[--G2.heap_max] = m; in build_tree()
1381 G2.heap[SMALLEST] = node++; in build_tree()
1385 G2.heap[--G2.heap_max] = G2.heap[SMALLEST]; in build_tree()