Searched refs:heap (Results 1 - 5 of 5) sorted by relevance

/bind-9.6-ESV-R11/lib/isc/
H A Dheap.c32 #include <isc/heap.h>
41 * element of the heap array is not used; i.e. heap subscripts are 1-based,
55 * When the heap is in a consistent state, the following invariant
60 ! heap->compare(heap->array[(i)], \
61 heap->array[heap_parent(i)]))
63 /*% ISC heap structure. */
80 isc_heap_t *heap; local
85 heap
108 isc_heap_t *heap; local
124 resize(isc_heap_t *heap) argument
146 float_up(isc_heap_t *heap, unsigned int i, void *elt) argument
164 sink_down(isc_heap_t *heap, unsigned int i, void *elt) argument
189 isc_heap_insert(isc_heap_t *heap, void *elt) argument
206 isc_heap_delete(isc_heap_t *heap, unsigned int index) argument
231 isc_heap_increased(isc_heap_t *heap, unsigned int index) argument
239 isc_heap_decreased(isc_heap_t *heap, unsigned int index) argument
247 isc_heap_element(isc_heap_t *heap, unsigned int index) argument
257 isc_heap_foreach(isc_heap_t *heap, isc_heapaction_t action, void *uap) argument
[all...]
H A Dtimer.c25 #include <isc/heap.h>
100 isc_heap_t * heap; member in struct:isc_timermgr
174 isc_heap_increased(manager->heap, timer->index);
177 isc_heap_decreased(manager->heap, timer->index);
185 result = isc_heap_insert(manager->heap, timer);
261 isc_heap_delete(manager->heap, timer->index);
594 timer = isc_heap_element(manager->heap, 1);
677 isc_heap_delete(manager->heap, 1);
795 manager->heap = NULL;
796 result = isc_heap_create(mctx, sooner, set_index, 0, &manager->heap);
[all...]
/bind-9.6-ESV-R11/lib/isc/include/isc/
H A Dheap.h23 /*! \file isc/heap.h */
37 * The index function allows the client of the heap to receive a callback
40 * from the heap require the index be provided.
45 * The heapaction function is used when iterating over the heap.
47 * NOTE: The heap structure CANNOT BE MODIFIED during the call to
59 * \brief Create a new heap. The heap is implemented using a space-efficient
60 * storage method. When the heap elements are deleted space is not freed
71 * heap. This option may be NULL if this functionality is unneeded.
72 *\li "size_increment" is a hint about how large the heap shoul
[all...]
/bind-9.6-ESV-R11/lib/isc/win32/
H A Dlibisc.mak134 -@erase "$(INTDIR)\heap.obj"
248 "$(INTDIR)\heap.obj" \
343 -@erase "$(INTDIR)\heap.obj"
344 -@erase "$(INTDIR)\heap.sbr"
514 "$(INTDIR)\heap.sbr" \
601 "$(INTDIR)\heap.obj" \
1272 SOURCE=..\heap.c
1277 "$(INTDIR)\heap.obj" : $(SOURCE) "$(INTDIR)"
1284 "$(INTDIR)\heap.obj" "$(INTDIR)\heap
[all...]
/bind-9.6-ESV-R11/lib/dns/
H A Drbtdb.c31 #include <isc/heap.h>
445 * context to use for the heap (which differs from the main
727 isc_heap_t *heap; local
738 * we will not have a heap, and we move on. If we do, though,
746 heap = rbtdb->heaps[idx];
749 isc_heap_increased(heap, header->heap_index);
751 isc_heap_decreased(heap, header->heap_index);
755 * These functions allow the heap code to rank the priority of each
779 * This function sets the heap index into the header.
964 * Clean up heap object
[all...]

Completed in 219 milliseconds