Searched refs:heap (Results 1 – 3 of 3) sorted by relevance
352 top = s->heap[SMALLEST]; \353 s->heap[SMALLEST] = s->heap[s->heap_len--]; \377 int v = s->heap[k]; in pqdownheap()382 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { in pqdownheap()386 if (smaller(tree, v, s->heap[j], s->depth)) break; in pqdownheap()389 s->heap[k] = s->heap[j]; k = j; in pqdownheap()394 s->heap[k] = v; in pqdownheap()430 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()433 n = s->heap[h]; in gen_bitlen()474 m = s->heap[--h]; in gen_bitlen()[all …]
179 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member
2074 tristate "Test heap/page initialization"2076 Test if the kernel is zero-initializing heap and page allocations.