forked from mirrors/linux
		
	 0ac451ecec
			
		
	
	
		0ac451ecec
		
	
	
	
	
		
			
			Replace the int type with size_t for variables representing array sizes and indices in the min-heap implementation. Using size_t aligns with standard practices for size-related variables and avoids potential issues on platforms where int may be insufficient to represent all valid sizes or indices. Link: https://lkml.kernel.org/r/20250215165618.1757219-1-visitorckw@gmail.com Signed-off-by: Kuan-Wei Chiu <visitorckw@gmail.com> Cc: Ching-Chun (Jim) Huang <jserv@ccns.ncku.edu.tw> Cc: Yu-Chun Lin <eleanor15x@gmail.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
		
			
				
	
	
		
			70 lines
		
	
	
	
		
			2.1 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			70 lines
		
	
	
	
		
			2.1 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, size_t 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, size_t 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);
 |