Searched refs:heap (Results 1 - 3 of 3) sorted by relevance
/darwin-on-arm/xnu/libkern/zlib/ |
H A D | trees.c | 119 * need for the L_CODES extra codes used during heap construction. However 454 /* Index within the heap array of least frequent node in the Huffman tree */ 458 * Remove the smallest element from the heap and recreate the heap with 459 * one less element. Updates heap and heap_len. 463 top = s->heap[SMALLEST]; \ 464 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 477 * Restore the heap property by moving down the tree starting at node k, 479 * when the heap propert [all...] |
H A D | deflate.h | 73 /* maximum heap size */ 230 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state 231 int heap_len; /* number of elements in the heap */ 233 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. 234 * The same heap array is used to build all trees.
|
/darwin-on-arm/xnu/bsd/netinet/ |
H A D | ip_dummynet.c | 65 * + heap management functions; 179 CTLFLAG_RD | CTLFLAG_LOCKED, &ready_heap.size, 0, "Size of ready heap"); 181 CTLFLAG_RD | CTLFLAG_LOCKED, &extract_heap.size, 0, "Size of extract heap"); 250 * In the heap, first node is element 0. Children of i are 2i+1 and 2i+2. 253 * heap_init() is called to expand the heap when needed. 568 * Insert element in heap. Normally, p != NULL, we insert p in 572 * Returns 1 on failure (cannot allocate new heap entry) 574 * If offset > 0 the position (index, int) of the element in the heap is 577 #define SET_OFFSET(heap, node) \ 578 if (heap [all...] |
Completed in 74 milliseconds