mergesort: avoid left shift overflow
Use size_t to match n when building the bitmask for checking whether a rank is occupied, instead of the default signed int. Signed-off-by: René Scharfe <l.s.r@web.de> Signed-off-by: Junio C Hamano <gitster@pobox.com>
René Scharfe committed
Nov 16, 2021 at 00:19 UTC
42c456ff8116fb0373c5cf6df54d34cb343b058e
1 file changed
+1
-1
mergesort.c
+1
-1
@@ -63,7 +63,7 @@ void *llist_mergesort(void *list,
63
void *next = get_next_fn(list);
64
if (next)
65
set_next_fn(list, NULL);
66
- for (i = 0; n & (1 << i); i++)
66
+ for (i = 0; n & ((size_t)1 << i); i++)
67
list = llist_merge(ranks[i], list, get_next_fn,
68
set_next_fn, compare_fn);
69
n++;