Home
last modified time | relevance | path

Searched refs:min_heap_char (Results 1 – 3 of 3) sorted by relevance

/linux-6.15/include/linux/
H A Dmin_heap.h37 typedef DEFINE_MIN_HEAP(char, min_heap_char) min_heap_char; typedef
236 void *__min_heap_peek_inline(struct min_heap_char *heap) in __min_heap_peek_inline()
247 bool __min_heap_full_inline(min_heap_char *heap) in __min_heap_full_inline()
339 bool __min_heap_pop_inline(min_heap_char *heap, size_t elem_size, in __min_heap_pop_inline()
432 void *__min_heap_peek(struct min_heap_char *heap);
433 bool __min_heap_full(min_heap_char *heap);
438 void __min_heapify_all(min_heap_char *heap, size_t elem_size,
440 bool __min_heap_pop(min_heap_char *heap, size_t elem_size,
454 __min_heap_full(container_of(&(_heap)->nr, min_heap_char, nr))
465 __min_heap_pop(container_of(&(_heap)->nr, min_heap_char, nr), \
[all …]
/linux-6.15/lib/
H A Dmin_heap.c5 void __min_heap_init(min_heap_char *heap, void *data, size_t size) in __min_heap_init()
11 void *__min_heap_peek(struct min_heap_char *heap) in __min_heap_peek()
17 bool __min_heap_full(min_heap_char *heap) in __min_heap_full()
23 void __min_heap_sift_down(min_heap_char *heap, size_t pos, size_t elem_size, in __min_heap_sift_down()
30 void __min_heap_sift_up(min_heap_char *heap, size_t elem_size, size_t idx, in __min_heap_sift_up()
37 void __min_heapify_all(min_heap_char *heap, size_t elem_size, in __min_heapify_all()
44 bool __min_heap_pop(min_heap_char *heap, size_t elem_size, in __min_heap_pop()
51 void __min_heap_pop_push(min_heap_char *heap, const void *element, size_t elem_size, in __min_heap_pop_push()
58 bool __min_heap_push(min_heap_char *heap, const void *element, size_t elem_size, in __min_heap_push()
65 bool __min_heap_del(min_heap_char *heap, size_t elem_size, size_t idx, in __min_heap_del()
/linux-6.15/fs/bcachefs/
H A Dbtree_node_scan.c434 min_heap_char real_heap; in bch2_scan_for_btree_nodes()
437 BUILD_BUG_ON(offsetof(found_btree_nodes, nr) != offsetof(min_heap_char, nr)); in bch2_scan_for_btree_nodes()
438 BUILD_BUG_ON(offsetof(found_btree_nodes, size) != offsetof(min_heap_char, size)); in bch2_scan_for_btree_nodes()