AuroraMiddleware/glibc
1
0
Fork 0
mirror of https://sourceware.org/git/glibc.git synced 2024-11-21 20:40:05 +00:00
Code Issues Packages Projects Releases Wiki Activity

stdlib: Fix heapsort for cases with exactly two elements

Browse Source 
When malloc fails to allocate a buffer and falls back to heapsort, the
current heapsort implementation does not perform sorting when there are
exactly two elements. Heapsort is now skipped only when there is
exactly one element.

Signed-off-by: Kuan-Wei Chiu <visitorckw@gmail.com>
Reviewed-by: Adhemerval Zanella  <adhemerval.zanella@linaro.org>
This commit is contained in:
Kuan-Wei Chiu 2024-01-16 10:16:56 +08:00 committed by Adhemerval Zanella
parent 9d2703c109
commit 74d2731a5f
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
stdlib/qsort.c
View File

@ -162,7 +162,7 @@ get_swap_type (void *const pbase, size_t size)
static void static void
heapsort_r (void *base, size_t n, size_t size, __compar_d_fn_t cmp, void *arg) heapsort_r (void *base, size_t n, size_t size, __compar_d_fn_t cmp, void *arg)
{ {
if (n <= 1) if (n == 0)
return; return;
enum swap_type_t swap_type = get_swap_type (base, size); enum swap_type_t swap_type = get_swap_type (base, size);