Searched refs:heap (Results 1 – 4 of 4) sorted by relevance
41 tmp = heap[zz]; \42 while (weight[tmp] < weight[heap[zz >> 1]]) { \43 heap[zz] = heap[zz >> 1]; \46 heap[zz] = tmp; \54 #define DOWNHEAP1(heap, weight, Heap) \ argument58 tmp = heap[zz]; \64 && weight[heap[yy+1]] < weight[heap[yy]]) \66 if (weight[tmp] < weight[heap[yy]]) \68 heap[zz] = heap[yy]; \71 heap[zz] = tmp; \[all …]
982 ush heap[HEAP_SIZE]; /* heap used to build the Huffman trees */ member1129 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]; \[all …]
161 allocation on the stack or the heap. Unfortunately, we're not using it much.
691 -p log-elapsed-time -p check-fence -p check-heap \