Lines Matching full:heap

30  * Binary heap and hash tables, used in dummynet
60 static MALLOC_DEFINE(M_DN_HEAP, "dummynet", "dummynet heap");
63  * Heap management functions.
65  * In the heap, first node is element 0. Children of i are 2i+1 and 2i+2.
68  * heap_init() is called to expand the heap when needed.
118  * Insert element in heap. Normally, p != NULL, we insert p in
122  * Returns 1 on failure (cannot allocate new heap entry)
124  * If ofs > 0 the position (index, int) of the element in the heap is
175  * remove top element from heap, or obj if obj != NULL
196 	 * actually in this heap. */  in heap_extract()
240 		panic("cannot move items on this heap");
274  * heap property. It is needed when we delete a bunch of entries.
308  * cleanup the heap and free data structure