53,11 → 53,7 |
* 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,6 → 71,7 |
*/ |
|
#include <_ansi.h> |
#include <sys/cdefs.h> |
#include <stdlib.h> |
|
#ifndef __GNUC__ |
81,7 → 78,14 |
#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 |
*/ |
#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); \ |
126,33 → 130,67 |
|
#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,11 → 201,11 |
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; |
174,8 → 212,8 |
|
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; |
182,8 → 220,8 |
} |
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 |
} |
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,7 → 249,13 |
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); |
#endif |
if ((r = pd - pc) > es) { |
/* Iterate rather than recurse to save stack space */ |
a = pn - r; |