Searched refs:heap (Results 1 – 5 of 5) sorted by relevance
| /lib/ |
| D | test_min_heap.c | 33 struct min_heap *heap, in pop_verify_heap() argument
36 int *values = heap->data; in pop_verify_heap()
41 min_heap_pop(heap, funcs); in pop_verify_heap()
42 while (heap->nr > 0) { in pop_verify_heap()
57 min_heap_pop(heap, funcs); in pop_verify_heap()
66 struct min_heap heap = { in test_heapify_all() local
79 min_heapify_all(&heap, &funcs); in test_heapify_all()
80 err = pop_verify_heap(min_heap, &heap, &funcs); in test_heapify_all()
84 heap.nr = ARRAY_SIZE(values); in test_heapify_all()
85 for (i = 0; i < heap.nr; i++) in test_heapify_all()
[all …]
|
| 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
|
| D | Kconfig.debug | 2095 tristate "Min heap test"
2098 Enable this to turn on min heap function tests. This test is
2714 tristate "Test heap/page initialization"
2716 Test if the kernel is zero-initializing heap and page allocations.
|
| /lib/zlib_deflate/ |
| 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()
332 if (smaller(tree, v, s->heap[j], s->depth)) break; in pqdownheap()
335 s->heap[k] = s->heap[j]; k = j; in pqdownheap()
340 s->heap[k] = v; in pqdownheap()
376 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()
379 n = s->heap[h]; in gen_bitlen()
420 m = s->heap[--h]; in gen_bitlen()
[all …]
|
| D | defutil.h | 181 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member
|