| /src/external/mpl/dhcp/bind/dist/lib/isc/ |
| heap.c | 1 /* $NetBSD: heap.c,v 1.1 2024/02/18 20:57:49 christos Exp $ */
17 * Heap implementation of priority queues adapted from the following:
28 #include <isc/heap.h>
37 * element of the heap array is not used; i.e. heap subscripts are 1-based,
51 * When the heap is in a consistent state, the following invariant
57 !heap->compare(heap->array[(i)], heap->array[heap_parent(i)]))
59 /*% ISC heap structure. *
86 isc_heap_t *heap; local
111 isc_heap_t *heap; local
[all...] |
| /src/external/mpl/bind/dist/lib/isc/ |
| heap.c | 1 /* $NetBSD: heap.c,v 1.8 2025/01/26 16:25:37 christos Exp $ */
17 * Heap implementation of priority queues adapted from the following:
28 #include <isc/heap.h>
38 * element of the heap array is not used; i.e. heap subscripts are 1-based,
52 * When the heap is in a consistent state, the following invariant
58 !heap->compare(heap->array[(i)], heap->array[heap_parent(i)]))
60 /*% ISC heap structure. *
87 isc_heap_t *heap; local
112 isc_heap_t *heap; local
[all...] |
| /src/external/gpl3/binutils/dist/gprofng/libcollector/ |
| memmgr.h | 24 struct Heap;
25 typedef struct Heap Heap;
27 Heap *__collector_newHeap ();
28 void __collector_deleteHeap (Heap *heap);
33 void __collector_mmgr_init_mutex_locks (Heap *heap);
38 void *__collector_allocCSize (Heap *heap, unsigned sz, int log)
[all...] |
| /src/external/gpl3/binutils.old/dist/gprofng/libcollector/ |
| memmgr.h | 24 struct Heap;
25 typedef struct Heap Heap;
27 Heap *__collector_newHeap ();
28 void __collector_deleteHeap (Heap *heap);
33 void __collector_mmgr_init_mutex_locks (Heap *heap);
38 void *__collector_allocCSize (Heap *heap, unsigned sz, int log)
[all...] |
| /src/sys/arch/evbarm/stand/board/ |
| gemini_mem.c | 55 * "bad" things can happen if the gzboot heap is in
63 uint32_t heap, size; local
68 heap = size - BOARD_HEAP_SIZE;
70 printf(">> RAM 0x%x - 0x%x, heap at 0x%x\n", 0, size - 1, heap);
71 setheap((void *)heap, (void *)(size - 1));
|
| smdk2410.c | 55 uint32_t start, size, heap; local
60 heap = (start + size) - BOARD_HEAP_SIZE;
62 printf(">> RAM 0x%x - 0x%x, heap at 0x%x\n",
63 start, (start + size) - 1, heap);
64 setheap((void *)heap, (void *)(heap + BOARD_HEAP_SIZE - 1));
|
| ts7200.c | 42 void *heap = (void *)(0x800000 - BOARD_HEAP_SIZE); local
43 setheap(heap, (void *)(0x800000 - 1));
|
| integrator_mem.c | 54 uint32_t heap, size; local
86 heap = size - BOARD_HEAP_SIZE;
88 printf(">> RAM 0x%x - 0x%x, heap at 0x%x\n", 0, size - 1, heap);
89 setheap((void *)heap, (void *)(size - 1));
|
| /src/external/bsd/libevent/dist/test/ |
| regress_minheap.c | 45 check_heap(struct min_heap *heap)
48 for (i = 1; i < heap->n; ++i) {
50 tt_want(evutil_timercmp(&heap->p[i]->ev_timeout,
51 &heap->p[parent_idx]->ev_timeout, >=));
58 struct min_heap heap; local
63 min_heap_ctor_(&heap);
68 min_heap_push_(&heap, inserted[i]);
70 check_heap(&heap);
72 tt_assert(min_heap_size_(&heap) == 1024);
75 min_heap_erase_(&heap, inserted[i])
[all...] |
| /src/external/bsd/ntp/dist/sntp/libevent/test/ |
| regress_minheap.c | 46 check_heap(struct min_heap *heap)
49 for (i = 1; i < heap->n; ++i) {
51 tt_want(evutil_timercmp(&heap->p[i]->ev_timeout,
52 &heap->p[parent_idx]->ev_timeout, >=));
59 struct min_heap heap; local
64 min_heap_ctor_(&heap);
69 min_heap_push_(&heap, inserted[i]);
71 check_heap(&heap);
73 tt_assert(min_heap_size_(&heap) == 1024);
76 min_heap_erase_(&heap, inserted[i])
[all...] |
| /src/external/mpl/bind/dist/lib/isc/include/isc/ |
| heap.h | 1 /* $NetBSD: heap.h,v 1.8 2025/01/26 16:25:41 christos Exp $ */
18 /*! \file isc/heap.h */
34 * The index function allows the client of the heap to receive a callback
37 * from the heap require the index be provided.
42 * The heapaction function is used when iterating over the heap.
44 * NOTE: The heap structure CANNOT BE MODIFIED during the call to
56 * \brief Create a new heap. The heap is implemented using a space-efficient
57 * storage method. When the heap elements are deleted space is not freed
60 * Heap elements are indexed from 1
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/isc/include/isc/ |
| heap.h | 1 /* $NetBSD: heap.h,v 1.1 2024/02/18 20:57:52 christos Exp $ */
19 /*! \file isc/heap.h */
35 * The index function allows the client of the heap to receive a callback
38 * from the heap require the index be provided.
43 * The heapaction function is used when iterating over the heap.
45 * NOTE: The heap structure CANNOT BE MODIFIED during the call to
57 * \brief Create a new heap. The heap is implemented using a space-efficient
58 * storage method. When the heap elements are deleted space is not freed
61 * Heap elements are indexed from 1
[all...] |
| /src/external/mpl/dhcp/dist/includes/ |
| heap.h | 1 /* $NetBSD: heap.h,v 1.2 2018/04/07 22:37:29 christos Exp $ */
20 /* Id: heap.h,v 1.3 2007/05/19 19:16:25 dhankins Exp */
25 /*! \file isc/heap.h */
34 * The index function allows the client of the heap to receive a callback
37 * from the heap require the index be provided.
42 * The heapaction function is used when iterating over the heap.
44 * NOTE: The heap structure CANNOT BE MODIFIED during the call to
56 * \brief Create a new heap. The heap is implemented using a space-efficient
57 * storage method. When the heap elements are deleted space is not free
[all...] |
| /src/tests/usr.bin/c++/ |
| t_asan_heap_overflow.sh | 44 asan_test_case heap_overflow "Heap Overflow example" heap-buffer-overflow
|
| t_asan_uaf.sh | 43 asan_test_case uaf "Use After Free example" heap-use-after-free
|
| /src/tests/usr.bin/cc/ |
| t_asan_heap_overflow.sh | 44 asan_test_case heap_overflow "Heap Overflow example" heap-buffer-overflow
|
| t_asan_uaf.sh | 43 asan_test_case uaf "Use After Free example" heap-use-after-free
|
| /src/external/mit/libuv/dist/src/ |
| heap-inl.h | 33 /* A binary min heap. The usual properties hold: the root is the lowest
37 * The heap function try hard to detect corrupted tree nodes at the cost
40 struct heap { struct
50 HEAP_EXPORT(void heap_init(struct heap* heap));
51 HEAP_EXPORT(struct heap_node* heap_min(const struct heap* heap));
52 HEAP_EXPORT(void heap_insert(struct heap* heap,
55 HEAP_EXPORT(void heap_remove(struct heap* heap
[all...] |
| /src/external/bsd/jemalloc/dist/test/unit/ |
| ph.c | 7 ph_structs(heap, node_t, BFS_ENUMERATE_MAX);
23 * Duplicates are not allowed in the heap, so force an
40 ph_gen(static, heap, node_t, link, node_cmp_magic);
80 heap_print(const heap_t *heap) {
83 malloc_printf("vvv heap %p vvv\n", heap);
84 if (heap->ph.root == NULL) {
88 node_print(heap->ph.root, 0);
90 for (auxelm = node_next_get(heap->ph.root); auxelm != NULL;
98 malloc_printf("^^^ heap %p ^^^\n", heap)
154 heap_t heap; local
190 heap_t heap; local
[all...] |
| /src/sys/external/bsd/drm/dist/shared-core/ |
| radeon_mem.c | 83 static struct mem_block *alloc_block(struct mem_block *heap, int size,
89 list_for_each(p, heap) {
98 static struct mem_block *find_block(struct mem_block *heap, int start)
102 list_for_each(p, heap)
114 * 'heap' to stop it being subsumed.
133 /* Initialize. How to check for an uninitialized heap?
135 static int init_heap(struct mem_block **heap, int start, int size)
142 *heap = drm_alloc(sizeof(**heap), DRM_MEM_BUFS);
143 if (!*heap) {
224 struct mem_block *block, **heap; local
259 struct mem_block *block, **heap; local
285 struct mem_block **heap; local
[all...] |
| /src/external/gpl3/binutils/dist/libiberty/ |
| fibheap.c | 1 /* A Fibonacci heap datatype.
56 /* Create a new fibonacci heap. */
63 /* Create a new fibonacci heap node. */
77 fibheap_compare (fibheap_t heap ATTRIBUTE_UNUSED, fibnode_t a, fibnode_t b)
87 fibheap_comp_data (fibheap_t heap, fibheapkey_t key, void *data, fibnode_t b)
94 return fibheap_compare (heap, &a, b);
97 /* Insert DATA, with priority KEY, into HEAP. */
99 fibheap_insert (fibheap_t heap, fibheapkey_t key, void *data)
111 fibheap_ins_root (heap, node);
115 if (heap->min == NULL || node->key < heap->min->key
[all...] |
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| fibheap.c | 1 /* A Fibonacci heap datatype.
56 /* Create a new fibonacci heap. */
63 /* Create a new fibonacci heap node. */
77 fibheap_compare (fibheap_t heap ATTRIBUTE_UNUSED, fibnode_t a, fibnode_t b)
87 fibheap_comp_data (fibheap_t heap, fibheapkey_t key, void *data, fibnode_t b)
94 return fibheap_compare (heap, &a, b);
97 /* Insert DATA, with priority KEY, into HEAP. */
99 fibheap_insert (fibheap_t heap, fibheapkey_t key, void *data)
111 fibheap_ins_root (heap, node);
115 if (heap->min == NULL || node->key < heap->min->key
[all...] |
| /src/external/gpl3/gcc/dist/libiberty/ |
| fibheap.c | 1 /* A Fibonacci heap datatype.
56 /* Create a new fibonacci heap. */
63 /* Create a new fibonacci heap node. */
77 fibheap_compare (fibheap_t heap ATTRIBUTE_UNUSED, fibnode_t a, fibnode_t b)
87 fibheap_comp_data (fibheap_t heap, fibheapkey_t key, void *data, fibnode_t b)
94 return fibheap_compare (heap, &a, b);
97 /* Insert DATA, with priority KEY, into HEAP. */
99 fibheap_insert (fibheap_t heap, fibheapkey_t key, void *data)
111 fibheap_ins_root (heap, node);
115 if (heap->min == NULL || node->key < heap->min->key
[all...] |
| /src/external/gpl3/gcc.old/dist/libiberty/ |
| fibheap.c | 1 /* A Fibonacci heap datatype.
56 /* Create a new fibonacci heap. */
63 /* Create a new fibonacci heap node. */
77 fibheap_compare (fibheap_t heap ATTRIBUTE_UNUSED, fibnode_t a, fibnode_t b)
87 fibheap_comp_data (fibheap_t heap, fibheapkey_t key, void *data, fibnode_t b)
94 return fibheap_compare (heap, &a, b);
97 /* Insert DATA, with priority KEY, into HEAP. */
99 fibheap_insert (fibheap_t heap, fibheapkey_t key, void *data)
111 fibheap_ins_root (heap, node);
115 if (heap->min == NULL || node->key < heap->min->key
[all...] |
| /src/external/gpl3/gdb.old/dist/libiberty/ |
| fibheap.c | 1 /* A Fibonacci heap datatype.
56 /* Create a new fibonacci heap. */
63 /* Create a new fibonacci heap node. */
77 fibheap_compare (fibheap_t heap ATTRIBUTE_UNUSED, fibnode_t a, fibnode_t b)
87 fibheap_comp_data (fibheap_t heap, fibheapkey_t key, void *data, fibnode_t b)
94 return fibheap_compare (heap, &a, b);
97 /* Insert DATA, with priority KEY, into HEAP. */
99 fibheap_insert (fibheap_t heap, fibheapkey_t key, void *data)
111 fibheap_ins_root (heap, node);
115 if (heap->min == NULL || node->key < heap->min->key
[all...] |
