diff options
author | Yaakov Selkowitz <yselkowi@redhat.com> | 2014-12-05 16:21:04 +0000 |
---|---|---|
committer | Yaakov Selkowitz <yselkowi@redhat.com> | 2014-12-05 16:21:04 +0000 |
commit | bf9897549dabfe002ebc8048e910706995383ae9 (patch) | |
tree | 1a3ac4f3d0bd39c1ef086e972f225ee3eca0a78d /newlib/libc/search/qsort.c | |
parent | ce6c6a4d82f03cdc14ed72964ba718ace495ee6c (diff) | |
download | newlib-bf9897549dabfe002ebc8048e910706995383ae9.zip newlib-bf9897549dabfe002ebc8048e910706995383ae9.tar.gz newlib-bf9897549dabfe002ebc8048e910706995383ae9.tar.bz2 |
* libc/include/stdlib.h (__bsd_qsort_r): Declare.
(qsort_r): Declare.
* libc/search/Makefile.am (ELIX_2_SOURCES): Rename from ELIX_SOURCES.
(ELIX_4_SOURCES): Define. Add bsd_qsort_r.c and qsort_r.c.
(libsearch_la_SOURCES): Adapt accordingly.
(lib_a_SOURCES): Adapt accordingly.
(CHEWOUT_FILES): Add qsort_r.def.
* libc/search/Makefile.in: Regenerate.
* libc/search/bsd_qsort_r.c: New file.
* libc/search/qsort.c: Update from FreeBSD HEAD. Adapt for both BSD
and GNU qsort_r flavors.
* libc/search/qsort_r.c: New file.
Diffstat (limited to 'newlib/libc/search/qsort.c')
-rw-r--r-- | newlib/libc/search/qsort.c | 100 |
1 files changed, 72 insertions, 28 deletions
diff --git a/newlib/libc/search/qsort.c b/newlib/libc/search/qsort.c index d47f470..bf6285f 100644 --- a/newlib/libc/search/qsort.c +++ b/newlib/libc/search/qsort.c @@ -53,11 +53,7 @@ PORTABILITY * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. - * 3. All advertising materials mentioning features or use of this software - * must display the following acknowledgement: - * This product includes software developed by the University of - * California, Berkeley and its contributors. - * 4. Neither the name of the University nor the names of its contributors + * 3. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * @@ -75,13 +71,21 @@ PORTABILITY */ #include <_ansi.h> +#include <sys/cdefs.h> #include <stdlib.h> #ifndef __GNUC__ #define inline #endif -static inline char *med3 _PARAMS((char *, char *, char *, int (*)())); +#if defined(I_AM_QSORT_R) +typedef int cmp_t(void *, const void *, const void *); +#elif defined(I_AM_GNU_QSORT_R) +typedef int cmp_t(const void *, const void *, void *); +#else +typedef int cmp_t(const void *, const void *); +#endif +static inline char *med3 _PARAMS((char *, char *, char *, cmp_t *, void *)); static inline void swapfunc _PARAMS((char *, char *, int, int)); #define min(a, b) (a) < (b) ? a : b @@ -91,10 +95,10 @@ static inline void swapfunc _PARAMS((char *, char *, int, int)); */ #define swapcode(TYPE, parmi, parmj, n) { \ long i = (n) / sizeof (TYPE); \ - register TYPE *pi = (TYPE *) (parmi); \ - register TYPE *pj = (TYPE *) (parmj); \ + TYPE *pi = (TYPE *) (parmi); \ + TYPE *pj = (TYPE *) (parmj); \ do { \ - register TYPE t = *pi; \ + TYPE t = *pi; \ *pi++ = *pj; \ *pj++ = t; \ } while (--i > 0); \ @@ -110,7 +114,7 @@ _DEFUN(swapfunc, (a, b, n, swaptype), int n _AND int swaptype) { - if(swaptype <= 1) + if(swaptype <= 1) swapcode(long, a, b, n) else swapcode(char, a, b, n) @@ -126,33 +130,67 @@ _DEFUN(swapfunc, (a, b, n, swaptype), #define vecswap(a, b, n) if ((n) > 0) swapfunc(a, b, n, swaptype) +#if defined(I_AM_QSORT_R) +#define CMP(t, x, y) (cmp((t), (x), (y))) +#elif defined(I_AM_GNU_QSORT_R) +#define CMP(t, x, y) (cmp((x), (y), (t))) +#else +#define CMP(t, x, y) (cmp((x), (y))) +#endif + static inline char * -_DEFUN(med3, (a, b, c, cmp), +_DEFUN(med3, (a, b, c, cmp, thunk), char *a _AND char *b _AND char *c _AND - int (*cmp)()) + cmp_t *cmp _AND + void *thunk +#if !defined(I_AM_QSORT_R) && !defined(I_AM_GNU_QSORT_R) +__unused +#endif +) { - return cmp(a, b) < 0 ? - (cmp(b, c) < 0 ? b : (cmp(a, c) < 0 ? c : a )) - :(cmp(b, c) > 0 ? b : (cmp(a, c) < 0 ? a : c )); + return CMP(thunk, a, b) < 0 ? + (CMP(thunk, b, c) < 0 ? b : (CMP(thunk, a, c) < 0 ? c : a )) + :(CMP(thunk, b, c) > 0 ? b : (CMP(thunk, a, c) < 0 ? a : c )); } +#if defined(I_AM_QSORT_R) +void +_DEFUN(__bsd_qsort_r, (a, n, es, thunk, cmp), + void *a _AND + size_t n _AND + size_t es _AND + void *thunk _AND + cmp_t *cmp) +#elif defined(I_AM_GNU_QSORT_R) +void +_DEFUN(qsort_r, (a, n, es, cmp, thunk), + void *a _AND + size_t n _AND + size_t es _AND + cmp_t *cmp _AND + void *thunk) +#else +#define thunk NULL void _DEFUN(qsort, (a, n, es, cmp), void *a _AND size_t n _AND size_t es _AND - int (*cmp)()) + cmp_t *cmp) +#endif { char *pa, *pb, *pc, *pd, *pl, *pm, *pn; - int d, r, swaptype, swap_cnt; + size_t d, r; + int cmp_result; + int swaptype, swap_cnt; loop: SWAPINIT(a, es); swap_cnt = 0; if (n < 7) { for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es) - for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0; + for (pl = pm; pl > (char *) a && CMP(thunk, pl - es, pl) > 0; pl -= es) swap(pl, pl - es); return; @@ -163,27 +201,27 @@ loop: SWAPINIT(a, es); pn = (char *) a + (n - 1) * es; if (n > 40) { d = (n / 8) * es; - pl = med3(pl, pl + d, pl + 2 * d, cmp); - pm = med3(pm - d, pm, pm + d, cmp); - pn = med3(pn - 2 * d, pn - d, pn, cmp); + pl = med3(pl, pl + d, pl + 2 * d, cmp, thunk); + pm = med3(pm - d, pm, pm + d, cmp, thunk); + pn = med3(pn - 2 * d, pn - d, pn, cmp, thunk); } - pm = med3(pl, pm, pn, cmp); + pm = med3(pl, pm, pn, cmp, thunk); } swap(a, pm); pa = pb = (char *) a + es; pc = pd = (char *) a + (n - 1) * es; for (;;) { - while (pb <= pc && (r = cmp(pb, a)) <= 0) { - if (r == 0) { + while (pb <= pc && (cmp_result = CMP(thunk, pb, a)) <= 0) { + if (cmp_result == 0) { swap_cnt = 1; swap(pa, pb); pa += es; } pb += es; } - while (pb <= pc && (r = cmp(pc, a)) >= 0) { - if (r == 0) { + while (pb <= pc && (cmp_result = CMP(thunk, pc, a)) >= 0) { + if (cmp_result == 0) { swap_cnt = 1; swap(pc, pd); pd -= es; @@ -199,7 +237,7 @@ loop: SWAPINIT(a, es); } if (swap_cnt == 0) { /* Switch to insertion sort */ for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es) - for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0; + for (pl = pm; pl > (char *) a && CMP(thunk, pl - es, pl) > 0; pl -= es) swap(pl, pl - es); return; @@ -211,8 +249,14 @@ loop: SWAPINIT(a, es); r = min(pd - pc, pn - pd - es); vecswap(pb, pn - r, r); if ((r = pb - pa) > es) +#if defined(I_AM_QSORT_R) + __bsd_qsort_r(a, r / es, es, thunk, cmp); +#elif defined(I_AM_GNU_QSORT_R) + qsort_r(a, r / es, es, cmp, thunk); +#else qsort(a, r / es, es, cmp); - if ((r = pd - pc) > es) { +#endif + if ((r = pd - pc) > es) { /* Iterate rather than recurse to save stack space */ a = pn - r; n = r / es; |