2
* Modifications from vanilla NetBSD source:
3
* Add do ... while() macro fix
4
* Remove __inline, _DIAGASSERTs, __P
6
* $PostgreSQL: pgsql/src/port/qsort.c,v 1.5 2004-10-05 00:12:49 neilc Exp $
9
/* $NetBSD: qsort.c,v 1.13 2003/08/07 16:43:42 agc Exp $ */
12
* Copyright (c) 1992, 1993
13
* The Regents of the University of California. All rights reserved.
15
* Redistribution and use in source and binary forms, with or without
16
* modification, are permitted provided that the following conditions
18
* 1. Redistributions of source code must retain the above copyright
19
* notice, this list of conditions and the following disclaimer.
20
* 2. Redistributions in binary form must reproduce the above copyright
21
* notice, this list of conditions and the following disclaimer in the
22
* documentation and/or other materials provided with the distribution.
23
* 3. Neither the name of the University nor the names of its contributors
24
* may be used to endorse or promote products derived from this software
25
* without specific prior written permission.
27
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
42
#include <sys/types.h>
45
static char *med3(char *, char *, char *,
46
int (*) (const void *, const void *));
47
static void swapfunc(char *, char *, size_t, int);
49
#define min(a, b) ((a) < (b) ? (a) : (b))
52
* Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
54
#define swapcode(TYPE, parmi, parmj, n) \
56
size_t i = (n) / sizeof (TYPE); \
57
TYPE *pi = (TYPE *)(void *)(parmi); \
58
TYPE *pj = (TYPE *)(void *)(parmj); \
66
#define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \
67
es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1;
70
swapfunc(a, b, n, swaptype)
77
swapcode(long, a, b, n);
79
swapcode(char, a, b, n);
83
if (swaptype == 0) { \
84
long t = *(long *)(void *)(a); \
85
*(long *)(void *)(a) = *(long *)(void *)(b); \
86
*(long *)(void *)(b) = t; \
88
swapfunc(a, b, es, swaptype)
90
#define vecswap(a, b, n) if ((n) > 0) swapfunc((a), (b), (size_t)(n), swaptype)
97
int (*cmp) (const void *, const void *);
99
return cmp(a, b) < 0 ?
100
(cmp(b, c) < 0 ? b : (cmp(a, c) < 0 ? c : a))
101
: (cmp(b, c) > 0 ? b : (cmp(a, c) < 0 ? a : c));
109
int (*cmp) (const void *, const void *);
123
loop:SWAPINIT(a, es);
127
for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es)
128
for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0;
133
pm = (char *) a + (n / 2) * es;
137
pn = (char *) a + (n - 1) * es;
141
pl = med3(pl, pl + d, pl + 2 * d, cmp);
142
pm = med3(pm - d, pm, pm + d, cmp);
143
pn = med3(pn - 2 * d, pn - d, pn, cmp);
145
pm = med3(pl, pm, pn, cmp);
148
pa = pb = (char *) a + es;
150
pc = pd = (char *) a + (n - 1) * es;
153
while (pb <= pc && (r = cmp(pb, a)) <= 0)
163
while (pb <= pc && (r = cmp(pc, a)) >= 0)
181
{ /* Switch to insertion sort */
182
for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es)
183
for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0;
189
pn = (char *) a + n * es;
190
r = min(pa - (char *) a, pb - pa);
191
vecswap(a, pb - r, r);
192
r = min(pd - pc, pn - pd - es);
193
vecswap(pb, pn - r, r);
194
if ((r = pb - pa) > es)
195
qsort(a, r / es, es, cmp);
196
if ((r = pd - pc) > es)
198
/* Iterate rather than recurse to save stack space */
203
/* qsort(pn - r, r / es, es, cmp);*/