#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)qsort.c 8.1 (Berkeley) 6/4/93";
#endif
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#ifdef I_AM_QSORT_R
typedef int cmp_t(void *, const void *, const void *);
#else
typedef int cmp_t(const void *, const void *);
#endif
static inline char *med3(char *, char *, char *, cmp_t *, void *);
static inline void swapfunc(char *, char *, size_t, int, int);
#define MIN(a, b) ((a) < (b) ? a : b)
#define swapcode(TYPE, parmi, parmj, n) { \
size_t i = (n) / sizeof (TYPE); \
TYPE *pi = (TYPE *) (parmi); \
TYPE *pj = (TYPE *) (parmj); \
do { \
TYPE t = *pi; \
*pi++ = *pj; \
*pj++ = t; \
} while (--i > 0); \
}
#define SWAPINIT(TYPE, a, es) swaptype_ ## TYPE = \
((char *)a - (char *)0) % sizeof(TYPE) || \
es % sizeof(TYPE) ? 2 : es == sizeof(TYPE) ? 0 : 1;
static inline void
swapfunc(char *a, char *b, size_t n, int swaptype_long, int swaptype_int)
{
if (swaptype_long <= 1)
swapcode(long, a, b, n)
else if (swaptype_int <= 1)
swapcode(int, a, b, n)
else
swapcode(char, a, b, n)
}
#define swap(a, b) \
if (swaptype_long == 0) { \
long t = *(long *)(a); \
*(long *)(a) = *(long *)(b); \
*(long *)(b) = t; \
} else if (swaptype_int == 0) { \
int t = *(int *)(a); \
*(int *)(a) = *(int *)(b); \
*(int *)(b) = t; \
} else \
swapfunc(a, b, es, swaptype_long, swaptype_int)
#define vecswap(a, b, n) \
if ((n) > 0) swapfunc(a, b, n, swaptype_long, swaptype_int)
#ifdef I_AM_QSORT_R
#define CMP(t, x, y) (cmp((t), (x), (y)))
#else
#define CMP(t, x, y) (cmp((x), (y)))
#endif
static inline char *
med3(char *a, char *b, char *c, cmp_t *cmp, void *thunk
#ifndef I_AM_QSORT_R
__unused
#endif
)
{
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 ));
}
#ifdef __LP64__
#define DEPTH(x) (2 * (flsl((long)(x)) - 1))
#else
#define DEPTH(x) (2 * (fls((int)(x)) - 1))
#endif
#ifdef I_AM_QSORT_R
int __heapsort_r(void *, size_t, size_t, void *, int (*)(void *, const void *, const void *));
#endif
static bool
_isort(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp, int swap_limit, int swaptype_long, int swaptype_int)
{
int swap_cnt = 0;
for (char *pm = (char *)a + es; pm < (char *)a + n * es; pm += es) {
for (char *pl = pm; pl > (char *)a && CMP(thunk, pl - es, pl) > 0;
pl -= es) {
swap(pl, pl - es);
if (swap_limit && ++swap_cnt > swap_limit) return false;
}
}
return true;
}
#ifdef I_AM_QSORT_R
static void
_qsort(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp, int depth_limit)
#else
#define thunk NULL
static void
_qsort(void *a, size_t n, size_t es, cmp_t *cmp, int depth_limit)
#endif
{
char *pa, *pb, *pc, *pd, *pl, *pm, *pn;
size_t d1, d2;
int cmp_result;
int swaptype_long, swaptype_int, swap_cnt;
loop:
SWAPINIT(long, a, es);
SWAPINIT(int, a, es);
swap_cnt = 0;
if (depth_limit-- <= 0) {
#ifdef I_AM_QSORT_R
__heapsort_r(a, n, es, thunk, cmp);
#else
heapsort(a, n, es, cmp);
#endif
return;
}
if (n <= 7) {
_isort(a, n, es, thunk, cmp, 0, swaptype_long, swaptype_int);
return;
}
pl = a;
pm = (char *)a + (n / 2) * es;
pn = (char *)a + (n - 1) * es;
if (n > 40) {
size_t d = (n / 8) * es;
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, thunk);
swap(a, pm);
pa = pb = (char *)a + es;
pc = pd = (char *)a + (n - 1) * es;
for (;;) {
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 && (cmp_result = CMP(thunk, pc, a)) >= 0) {
if (cmp_result == 0) {
swap_cnt = 1;
swap(pc, pd);
pd -= es;
}
pc -= es;
}
if (pb > pc)
break;
swap(pb, pc);
swap_cnt = 1;
pb += es;
pc -= es;
}
pn = (char *)a + n * es;
d1 = MIN(pa - (char *)a, pb - pa);
vecswap(a, pb - d1, d1);
d1 = MIN(pd - pc, pn - pd - es);
vecswap(pb, pn - d1, d1);
if (swap_cnt == 0) {
int r = 1 + n / 4;
if (!_isort(a, n, es, thunk, cmp, r, swaptype_long, swaptype_int)) {
goto nevermind;
}
return;
}
nevermind:
d1 = pb - pa;
d2 = pd - pc;
if (d1 <= d2) {
if (d1 > es) {
#ifdef I_AM_QSORT_R
_qsort(a, d1 / es, es, thunk, cmp, depth_limit);
#else
_qsort(a, d1 / es, es, cmp, depth_limit);
#endif
}
if (d2 > es) {
a = pn - d2;
n = d2 / es;
goto loop;
}
} else {
if (d2 > es) {
#ifdef I_AM_QSORT_R
_qsort(pn - d2, d2 / es, es, thunk, cmp, depth_limit);
#else
_qsort(pn - d2, d2 / es, es, cmp, depth_limit);
#endif
}
if (d1 > es) {
n = d1 / es;
goto loop;
}
}
}
void
#ifdef I_AM_QSORT_R
qsort_r(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp)
#else
qsort(void *a, size_t n, size_t es, cmp_t *cmp)
#endif
{
_qsort(a, n, es,
#ifdef I_AM_QSORT_R
thunk,
#endif
cmp, DEPTH(n));
}