Lines Matching refs:min_heap_char
37 typedef DEFINE_MIN_HEAP(char, min_heap_char) min_heap_char; typedef
221 void __min_heap_init_inline(min_heap_char *heap, void *data, size_t size) in __min_heap_init_inline()
232 __min_heap_init_inline(container_of(&(_heap)->nr, min_heap_char, nr), _data, _size)
236 void *__min_heap_peek_inline(struct min_heap_char *heap) in __min_heap_peek_inline()
243 __min_heap_peek_inline(container_of(&(_heap)->nr, min_heap_char, nr)))
247 bool __min_heap_full_inline(min_heap_char *heap) in __min_heap_full_inline()
253 __min_heap_full_inline(container_of(&(_heap)->nr, min_heap_char, nr))
257 void __min_heap_sift_down_inline(min_heap_char *heap, size_t pos, size_t elem_size, in __min_heap_sift_down_inline()
292 __min_heap_sift_down_inline(container_of(&(_heap)->nr, min_heap_char, nr), _pos, \
297 void __min_heap_sift_up_inline(min_heap_char *heap, size_t elem_size, size_t idx, in __min_heap_sift_up_inline()
319 __min_heap_sift_up_inline(container_of(&(_heap)->nr, min_heap_char, nr), \
324 void __min_heapify_all_inline(min_heap_char *heap, size_t elem_size, in __min_heapify_all_inline()
334 __min_heapify_all_inline(container_of(&(_heap)->nr, min_heap_char, nr), \
339 bool __min_heap_pop_inline(min_heap_char *heap, size_t elem_size, in __min_heap_pop_inline()
356 __min_heap_pop_inline(container_of(&(_heap)->nr, min_heap_char, nr), \
365 void __min_heap_pop_push_inline(min_heap_char *heap, const void *element, size_t elem_size, in __min_heap_pop_push_inline()
373 __min_heap_pop_push_inline(container_of(&(_heap)->nr, min_heap_char, nr), _element, \
378 bool __min_heap_push_inline(min_heap_char *heap, const void *element, size_t elem_size, in __min_heap_push_inline()
399 __min_heap_push_inline(container_of(&(_heap)->nr, min_heap_char, nr), _element, \
404 bool __min_heap_del_inline(min_heap_char *heap, size_t elem_size, size_t idx, in __min_heap_del_inline()
428 __min_heap_del_inline(container_of(&(_heap)->nr, min_heap_char, nr), \
431 void __min_heap_init(min_heap_char *heap, void *data, size_t size);
432 void *__min_heap_peek(struct min_heap_char *heap);
433 bool __min_heap_full(min_heap_char *heap);
434 void __min_heap_sift_down(min_heap_char *heap, size_t pos, size_t elem_size,
436 void __min_heap_sift_up(min_heap_char *heap, size_t elem_size, size_t idx,
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,
442 void __min_heap_pop_push(min_heap_char *heap, const void *element, size_t elem_size,
444 bool __min_heap_push(min_heap_char *heap, const void *element, size_t elem_size,
446 bool __min_heap_del(min_heap_char *heap, size_t elem_size, size_t idx,
450 __min_heap_init(container_of(&(_heap)->nr, min_heap_char, nr), _data, _size)
452 (__minheap_cast(_heap) __min_heap_peek(container_of(&(_heap)->nr, min_heap_char, nr)))
454 __min_heap_full(container_of(&(_heap)->nr, min_heap_char, nr))
456 __min_heap_sift_down(container_of(&(_heap)->nr, min_heap_char, nr), _pos, \
459 __min_heap_sift_up(container_of(&(_heap)->nr, min_heap_char, nr), \
462 __min_heapify_all(container_of(&(_heap)->nr, min_heap_char, nr), \
465 __min_heap_pop(container_of(&(_heap)->nr, min_heap_char, nr), \
468 __min_heap_pop_push(container_of(&(_heap)->nr, min_heap_char, nr), _element, \
471 __min_heap_push(container_of(&(_heap)->nr, min_heap_char, nr), _element, \
474 __min_heap_del(container_of(&(_heap)->nr, min_heap_char, nr), \