Browse Source
This should sort properly on Windows and any other platform without qsort_r(). It does _not_ fix any potential issues on any platforms with an incompatible qsort_r() prototype (such as FreeBSD < 13).pull/83/head
3 changed files with 63 additions and 1 deletions
@ -0,0 +1,56 @@ |
|||
/*****************************************************************************
|
|||
* qsort_r.c: future POSIX qsort_r() replacement |
|||
***************************************************************************** |
|||
* Copyright © 2018 Rémi Denis-Courmont |
|||
* |
|||
* This program is free software; you can redistribute it and/or modify it |
|||
* under the terms of the GNU Lesser General Public License as published by |
|||
* the Free Software Foundation; either version 2.1 of the License, or |
|||
* (at your option) any later version. |
|||
* |
|||
* This program is distributed in the hope that it will be useful, |
|||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|||
* GNU Lesser General Public License for more details. |
|||
* |
|||
* You should have received a copy of the GNU Lesser General Public License |
|||
* along with this program; if not, write to the Free Software Foundation, |
|||
* Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA. |
|||
*****************************************************************************/ |
|||
|
|||
#ifdef HAVE_CONFIG_H |
|||
# include <config.h> |
|||
#endif |
|||
|
|||
#include <stdlib.h> |
|||
|
|||
static _Thread_local struct |
|||
{ |
|||
int (*compar)(const void *, const void *, void *); |
|||
void *arg; |
|||
} state; |
|||
|
|||
static int compar_wrapper(const void *a, const void *b) |
|||
{ |
|||
return state.compar(a, b, state.arg); |
|||
} |
|||
|
|||
/* Follow the upcoming POSIX prototype, coming from GNU/libc.
|
|||
* Note that this differs from the BSD prototype. */ |
|||
|
|||
void qsort_r(void *base, size_t nmemb, size_t size, |
|||
int (*compar)(const void *, const void *, void *), |
|||
void *arg) |
|||
{ |
|||
int (*saved_compar)(const void *, const void *, void *) = state.compar; |
|||
void *saved_arg = state.arg; |
|||
|
|||
state.compar = compar; |
|||
state.arg = arg; |
|||
|
|||
qsort(base, nmemb, size, compar_wrapper); |
|||
|
|||
/* Restore state for nested reentrant calls */ |
|||
state.compar = saved_compar; |
|||
state.arg = saved_arg; |
|||
} |
|||
Loading…
Reference in new issue