Searched defs:heap (Results 1 - 4 of 4) sorted by relevance

/bind-9.11.3/lib/isc/tests/
H A Dheap_test.c18 #include <isc/heap.h>
49 isc_heap_t *heap = NULL; local
58 result = isc_heap_create(mctx, compare, idx, 0, &heap);
60 ATF_REQUIRE(heap != NULL);
62 isc_heap_insert(heap, &e1);
66 isc_heap_delete(heap, e1.index);
69 isc_heap_destroy(&heap);
70 ATF_REQUIRE_EQ(heap, NULL);
/bind-9.11.3/lib/isc/
H A Dheap.c23 #include <isc/heap.h>
32 * element of the heap array is not used; i.e. heap subscripts are 1-based,
46 * When the heap is in a consistent state, the following invariant
51 ! heap->compare(heap->array[(i)], \
52 heap->array[heap_parent(i)]))
54 /*% ISC heap structure. */
68 heap_check(isc_heap_t *heap) { argument
70 for (i = 1; i <= heap
83 isc_heap_t *heap; local
111 isc_heap_t *heap; local
127 resize(isc_heap_t *heap) argument
149 float_up(isc_heap_t *heap, unsigned int i, void *elt) argument
168 sink_down(isc_heap_t *heap, unsigned int i, void *elt) argument
194 isc_heap_insert(isc_heap_t *heap, void *elt) argument
212 isc_heap_delete(isc_heap_t *heap, unsigned int idx) argument
241 isc_heap_increased(isc_heap_t *heap, unsigned int idx) argument
249 isc_heap_decreased(isc_heap_t *heap, unsigned int idx) argument
257 isc_heap_element(isc_heap_t *heap, unsigned int idx) argument
268 isc_heap_foreach(isc_heap_t *heap, isc_heapaction_t action, void *uap) argument
[all...]
H A Dtimer.c17 #include <isc/heap.h>
109 isc_heap_t * heap; member in struct:isc__timermgr
241 isc_heap_increased(manager->heap, timer->index);
244 isc_heap_decreased(manager->heap, timer->index);
252 result = isc_heap_insert(manager->heap, timer);
328 isc_heap_delete(manager->heap, timer->index);
671 timer = isc_heap_element(manager->heap, 1);
754 isc_heap_delete(manager->heap, 1);
878 manager->heap = NULL;
879 result = isc_heap_create(mctx, sooner, set_index, 0, &manager->heap);
[all...]
/bind-9.11.3/lib/dns/
H A Drbtdb.c25 #include <isc/heap.h>
697 * context to use for the heap (which differs from the main
1089 isc_heap_t *heap; local
1103 * we will not have a heap, and we move on. If we do, though,
1111 heap = rbtdb->heaps[idx];
1114 isc_heap_increased(heap, header->heap_index);
1116 isc_heap_decreased(heap, header->heap_index);
1120 * These functions allow the heap code to rank the priority of each
1142 * This function sets the heap index into the header.
1325 * Clean up heap object
[all...]

Completed in 30 milliseconds