Searched refs:heap (Results 1 – 7 of 7) sorted by relevance
| /lib/ |
| A D | test_min_heap.c | 27 struct min_heap_test *heap, in pop_verify_heap() argument
30 int *values = heap->data; in pop_verify_heap()
36 while (heap->nr > 0) { in pop_verify_heap()
60 struct min_heap_test heap = { in test_heapify_all() local
77 heap.nr = ARRAY_SIZE(values); in test_heapify_all()
78 for (i = 0; i < heap.nr; i++) in test_heapify_all()
110 while (heap.nr < heap.size) { in test_heap_push()
146 heap.nr = 0; in test_heap_pop_push()
164 struct min_heap_test heap; in test_heap_del() local
177 min_heap_del_inline(&heap, get_random_u32() % heap.nr, &funcs, NULL); in test_heap_del()
[all …]
|
| A D | min_heap.c | 5 void __min_heap_init(min_heap_char *heap, void *data, size_t size) in __min_heap_init() argument
7 __min_heap_init_inline(heap, data, size); in __min_heap_init()
11 void *__min_heap_peek(struct min_heap_char *heap) in __min_heap_peek() argument
13 return __min_heap_peek_inline(heap); in __min_heap_peek()
17 bool __min_heap_full(min_heap_char *heap) in __min_heap_full() argument
19 return __min_heap_full_inline(heap); in __min_heap_full()
33 __min_heap_sift_up_inline(heap, elem_size, idx, func, args); in __min_heap_sift_up()
37 void __min_heapify_all(min_heap_char *heap, size_t elem_size, in __min_heapify_all() argument
40 __min_heapify_all_inline(heap, elem_size, func, args); in __min_heapify_all()
44 bool __min_heap_pop(min_heap_char *heap, size_t elem_size, in __min_heap_pop() argument
[all …]
|
| A D | Kconfig.kfence | 12 KFENCE is a low-overhead sampling-based detector of heap out-of-bounds
32 The KFENCE sample interval determines the frequency with which heap
|
| A D | Kconfig.kasan | 206 recorded for each heap block at allocation and free time, and
|
| A D | Kconfig.debug | 2285 tristate "Min heap test"
2288 Enable this to turn on min heap function tests. This test is
3154 tristate "Test heap/page initialization"
3156 Test if the kernel is zero-initializing heap and page allocations.
|
| /lib/zlib_deflate/ |
| A D | deftree.c | 298 top = s->heap[SMALLEST]; \
299 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
323 int v = s->heap[k]; in pqdownheap()
328 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { in pqdownheap()
335 s->heap[k] = s->heap[j]; k = j; in pqdownheap()
340 s->heap[k] = v; in pqdownheap()
379 n = s->heap[h]; in gen_bitlen()
420 m = s->heap[--h]; in gen_bitlen()
539 s->heap[--(s->heap_max)] = m; in build_tree()
552 s->heap[SMALLEST] = node++; in build_tree()
[all …]
|
| A D | defutil.h | 181 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member
|
Completed in 16 milliseconds