diff options
author | Kuan-Wei Chiu <visitorckw@gmail.com> | 2024-03-05 21:38:32 +0800 |
---|---|---|
committer | Kuan-Wei Chiu <visitorckw@gmail.com> | 2024-04-25 21:31:03 +0800 |
commit | 19f7efb34acad5d3c899889f57a0158f93124e54 (patch) | |
tree | d5de55ede912fa041f79a872d97a31e9a73ad75d | |
parent | 32bc3cee9da58b9e9d498d7d0896fd7715b7b862 (diff) |
lib min_heap: Add min_heap_full()
Add min_heap_full() which returns a boolean value indicating whether
the heap has reached its maximum capacity.
Signed-off-by: Kuan-Wei Chiu <visitorckw@gmail.com>
Reviewed-by: Ian Rogers <irogers@google.com>
-rw-r--r-- | include/linux/min_heap.h | 10 |
1 files changed, 10 insertions, 0 deletions
diff --git a/include/linux/min_heap.h b/include/linux/min_heap.h index 043de539bf71..d4ec7e749280 100644 --- a/include/linux/min_heap.h +++ b/include/linux/min_heap.h @@ -63,6 +63,16 @@ void *__min_heap_peek(struct min_heap_char *heap) #define min_heap_peek(_heap) \ (__minheap_cast(_heap) __min_heap_peek((min_heap_char *)_heap)) +/* Check if the heap is full. */ +static __always_inline +bool __min_heap_full(min_heap_char *heap) +{ + return heap->nr == heap->size; +} + +#define min_heap_full(_heap) \ + __min_heap_full((min_heap_char *)_heap) + /* Sift the element at pos down the heap. */ static __always_inline void __min_heapify(min_heap_char *heap, int pos, size_t elem_size, |