mirror of
https://github.com/torvalds/linux.git
synced 2024-12-04 01:51:34 +00:00
92a8b224b8
Patch series "Enhance min heap API with non-inline functions and optimizations", v2. Add non-inline versions of the min heap API functions in lib/min_heap.c and updates all users outside of kernel/events/core.c to use these non-inline versions. To mitigate the performance impact of indirect function calls caused by the non-inline versions of the swap and compare functions, a builtin swap has been introduced that swaps elements based on their size. Additionally, it micro-optimizes the efficiency of the min heap by pre-scaling the counter, following the same approach as in lib/sort.c. Documentation for the min heap API has also been added to the core-api section. This patch (of 10): All current min heap API functions are marked with '__always_inline'. However, as the number of users increases, inlining these functions everywhere leads to a increase in kernel size. In performance-critical paths, such as when perf events are enabled and min heap functions are called on every context switch, it is important to retain the inline versions for optimal performance. To balance this, the original inline functions are kept, and additional non-inline versions of the functions have been added in lib/min_heap.c. Link: https://lkml.kernel.org/r/20241020040200.939973-1-visitorckw@gmail.com Link: https://lore.kernel.org/20240522161048.8d8bbc7b153b4ecd92c50666@linux-foundation.org Link: https://lkml.kernel.org/r/20241020040200.939973-2-visitorckw@gmail.com Signed-off-by: Kuan-Wei Chiu <visitorckw@gmail.com> Suggested-by: Andrew Morton <akpm@linux-foundation.org> Cc: Adrian Hunter <adrian.hunter@intel.com> Cc: Arnaldo Carvalho de Melo <acme@kernel.org> Cc: Ching-Chun (Jim) Huang <jserv@ccns.ncku.edu.tw> Cc: Coly Li <colyli@suse.de> Cc: Ian Rogers <irogers@google.com> Cc: Ingo Molnar <mingo@redhat.com> Cc: Jiri Olsa <jolsa@kernel.org> Cc: Jonathan Corbet <corbet@lwn.net> Cc: Kent Overstreet <kent.overstreet@linux.dev> Cc: Kuan-Wei Chiu <visitorckw@gmail.com> Cc: "Liang, Kan" <kan.liang@linux.intel.com> Cc: Mark Rutland <mark.rutland@arm.com> Cc: Matthew Sakai <msakai@redhat.com> Cc: Matthew Wilcox (Oracle) <willy@infradead.org> Cc: Namhyung Kim <namhyung@kernel.org> Cc: Peter Zijlstra <peterz@infradead.org> Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
71 lines
2.0 KiB
C
71 lines
2.0 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
#include <linux/export.h>
|
|
#include <linux/min_heap.h>
|
|
|
|
void __min_heap_init(min_heap_char *heap, void *data, int size)
|
|
{
|
|
__min_heap_init_inline(heap, data, size);
|
|
}
|
|
EXPORT_SYMBOL(__min_heap_init);
|
|
|
|
void *__min_heap_peek(struct min_heap_char *heap)
|
|
{
|
|
return __min_heap_peek_inline(heap);
|
|
}
|
|
EXPORT_SYMBOL(__min_heap_peek);
|
|
|
|
bool __min_heap_full(min_heap_char *heap)
|
|
{
|
|
return __min_heap_full_inline(heap);
|
|
}
|
|
EXPORT_SYMBOL(__min_heap_full);
|
|
|
|
void __min_heap_sift_down(min_heap_char *heap, int pos, size_t elem_size,
|
|
const struct min_heap_callbacks *func, void *args)
|
|
{
|
|
__min_heap_sift_down_inline(heap, pos, elem_size, func, args);
|
|
}
|
|
EXPORT_SYMBOL(__min_heap_sift_down);
|
|
|
|
void __min_heap_sift_up(min_heap_char *heap, size_t elem_size, size_t idx,
|
|
const struct min_heap_callbacks *func, void *args)
|
|
{
|
|
__min_heap_sift_up_inline(heap, elem_size, idx, func, args);
|
|
}
|
|
EXPORT_SYMBOL(__min_heap_sift_up);
|
|
|
|
void __min_heapify_all(min_heap_char *heap, size_t elem_size,
|
|
const struct min_heap_callbacks *func, void *args)
|
|
{
|
|
__min_heapify_all_inline(heap, elem_size, func, args);
|
|
}
|
|
EXPORT_SYMBOL(__min_heapify_all);
|
|
|
|
bool __min_heap_pop(min_heap_char *heap, size_t elem_size,
|
|
const struct min_heap_callbacks *func, void *args)
|
|
{
|
|
return __min_heap_pop_inline(heap, elem_size, func, args);
|
|
}
|
|
EXPORT_SYMBOL(__min_heap_pop);
|
|
|
|
void __min_heap_pop_push(min_heap_char *heap, const void *element, size_t elem_size,
|
|
const struct min_heap_callbacks *func, void *args)
|
|
{
|
|
__min_heap_pop_push_inline(heap, element, elem_size, func, args);
|
|
}
|
|
EXPORT_SYMBOL(__min_heap_pop_push);
|
|
|
|
bool __min_heap_push(min_heap_char *heap, const void *element, size_t elem_size,
|
|
const struct min_heap_callbacks *func, void *args)
|
|
{
|
|
return __min_heap_push_inline(heap, element, elem_size, func, args);
|
|
}
|
|
EXPORT_SYMBOL(__min_heap_push);
|
|
|
|
bool __min_heap_del(min_heap_char *heap, size_t elem_size, size_t idx,
|
|
const struct min_heap_callbacks *func, void *args)
|
|
{
|
|
return __min_heap_del_inline(heap, elem_size, idx, func, args);
|
|
}
|
|
EXPORT_SYMBOL(__min_heap_del);
|