]> git.ipfire.org Git - thirdparty/linux.git/commitdiff
lib min_heap: use size_t for array size and index variables
authorKuan-Wei Chiu <visitorckw@gmail.com>
Sat, 15 Feb 2025 16:56:18 +0000 (00:56 +0800)
committerAndrew Morton <akpm@linux-foundation.org>
Mon, 17 Mar 2025 06:24:14 +0000 (23:24 -0700)
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>
include/linux/min_heap.h
lib/min_heap.c

index 1160bed6579ec17754c4c8ef029b62ca9dddc140..79ddc0adbf2bf1d9ed675da4da60fdfdb798553c 100644 (file)
@@ -218,7 +218,7 @@ static size_t parent(size_t i, unsigned int lsbit, size_t size)
 
 /* Initialize a min-heap. */
 static __always_inline
-void __min_heap_init_inline(min_heap_char *heap, void *data, int size)
+void __min_heap_init_inline(min_heap_char *heap, void *data, size_t size)
 {
        heap->nr = 0;
        heap->size = size;
@@ -254,7 +254,7 @@ bool __min_heap_full_inline(min_heap_char *heap)
 
 /* Sift the element at pos down the heap. */
 static __always_inline
-void __min_heap_sift_down_inline(min_heap_char *heap, int pos, size_t elem_size,
+void __min_heap_sift_down_inline(min_heap_char *heap, size_t pos, size_t elem_size,
                                 const struct min_heap_callbacks *func, void *args)
 {
        const unsigned long lsbit = elem_size & -elem_size;
@@ -324,7 +324,7 @@ static __always_inline
 void __min_heapify_all_inline(min_heap_char *heap, size_t elem_size,
                              const struct min_heap_callbacks *func, void *args)
 {
-       int i;
+       ssize_t i;
 
        for (i = heap->nr / 2 - 1; i >= 0; i--)
                __min_heap_sift_down_inline(heap, i, elem_size, func, args);
@@ -379,7 +379,7 @@ bool __min_heap_push_inline(min_heap_char *heap, const void *element, size_t ele
                            const struct min_heap_callbacks *func, void *args)
 {
        void *data = heap->data;
-       int pos;
+       size_t pos;
 
        if (WARN_ONCE(heap->nr >= heap->size, "Pushing on a full heap"))
                return false;
@@ -428,10 +428,10 @@ bool __min_heap_del_inline(min_heap_char *heap, size_t elem_size, size_t idx,
        __min_heap_del_inline(container_of(&(_heap)->nr, min_heap_char, nr),    \
                              __minheap_obj_size(_heap), _idx, _func, _args)
 
-void __min_heap_init(min_heap_char *heap, void *data, int size);
+void __min_heap_init(min_heap_char *heap, void *data, size_t size);
 void *__min_heap_peek(struct min_heap_char *heap);
 bool __min_heap_full(min_heap_char *heap);
-void __min_heap_sift_down(min_heap_char *heap, int pos, size_t elem_size,
+void __min_heap_sift_down(min_heap_char *heap, size_t pos, size_t elem_size,
                          const struct min_heap_callbacks *func, void *args);
 void __min_heap_sift_up(min_heap_char *heap, size_t elem_size, size_t idx,
                        const struct min_heap_callbacks *func, void *args);
index 4485372ff3b1cecc7aa8d8628f9f68becab9415e..96f01a4c5fb68daae4a564b1f36f60e92e123ae6 100644 (file)
@@ -2,7 +2,7 @@
 #include <linux/export.h>
 #include <linux/min_heap.h>
 
-void __min_heap_init(min_heap_char *heap, void *data, int size)
+void __min_heap_init(min_heap_char *heap, void *data, size_t size)
 {
        __min_heap_init_inline(heap, data, size);
 }
@@ -20,7 +20,7 @@ bool __min_heap_full(min_heap_char *heap)
 }
 EXPORT_SYMBOL(__min_heap_full);
 
-void __min_heap_sift_down(min_heap_char *heap, int pos, size_t elem_size,
+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);