1
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
4
* Copyright (c) 1992, 1993
5
* The Regents of the University of California. All rights reserved.
7
* Redistribution and use in source and binary forms, with or without
8
* modification, are permitted provided that the following conditions
10
* 1. Redistributions of source code must retain the above copyright
11
* notice, this list of conditions and the following disclaimer.
12
* 2. Redistributions in binary form must reproduce the above copyright
13
* notice, this list of conditions and the following disclaimer in the
14
* documentation and/or other materials provided with the distribution.
15
* 3. Neither the name of the University nor the names of its contributors
16
* may be used to endorse or promote products derived from this software
17
* without specific prior written permission.
19
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32
/* We need this because Solaris' version of qsort is broken and
33
* causes array bounds reads.
38
#include "nsQuickSort.h"
42
#if !defined(DEBUG) && (defined(__cplusplus) || defined(__gcc))
44
# define INLINE inline
50
typedef int cmp_t(const void *, const void *, void *);
51
static INLINE char *med3(char *, char *, char *, cmp_t *, void *);
52
static INLINE void swapfunc(char *, char *, int, int);
55
* Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
57
#define swapcode(TYPE, parmi, parmj, n) { \
58
long i = (n) / sizeof (TYPE); \
59
register TYPE *pi = (TYPE *) (parmi); \
60
register TYPE *pj = (TYPE *) (parmj); \
62
register TYPE t = *pi; \
68
#define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \
69
es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1;
72
swapfunc(char *a, char *b, int n, int swaptype)
75
swapcode(long, a, b, n)
77
swapcode(char, a, b, n)
81
if (swaptype == 0) { \
82
long t = *(long *)(a); \
83
*(long *)(a) = *(long *)(b); \
86
swapfunc((char *)a, (char*)b, (int)es, swaptype)
88
#define vecswap(a, b, n) if ((n) > 0) swapfunc((char *)a, (char *)b, (int)n, swaptype)
91
med3(char *a, char *b, char *c, cmp_t* cmp, void *data)
93
return cmp(a, b, data) < 0 ?
94
(cmp(b, c, data) < 0 ? b : (cmp(a, c, data) < 0 ? c : a ))
95
:(cmp(b, c, data) > 0 ? b : (cmp(a, c, data) < 0 ? a : c ));
106
char *pa, *pb, *pc, *pd, *pl, *pm, *pn;
107
int d, r, swaptype, swap_cnt;
109
loop: SWAPINIT(a, es);
112
for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
113
for (pl = pm; pl > (char *)a && cmp(pl - es, pl, data) > 0;
118
pm = (char *)a + (n / 2) * es;
121
pn = (char *)a + (n - 1) * es;
124
pl = med3(pl, pl + d, pl + 2 * d, cmp, data);
125
pm = med3(pm - d, pm, pm + d, cmp, data);
126
pn = med3(pn - 2 * d, pn - d, pn, cmp, data);
128
pm = med3(pl, pm, pn, cmp, data);
131
pa = pb = (char *)a + es;
133
pc = pd = (char *)a + (n - 1) * es;
135
while (pb <= pc && (r = cmp(pb, a, data)) <= 0) {
143
while (pb <= pc && (r = cmp(pc, a, data)) >= 0) {
158
if (swap_cnt == 0) { /* Switch to insertion sort */
159
for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
160
for (pl = pm; pl > (char *)a && cmp(pl - es, pl, data) > 0;
166
pn = (char *)a + n * es;
167
r = PR_MIN(pa - (char *)a, pb - pa);
168
vecswap(a, pb - r, r);
169
r = PR_MIN(pd - pc, (int)(pn - pd - es));
170
vecswap(pb, pn - r, r);
171
if ((r = pb - pa) > (int)es)
172
NS_QuickSort(a, r / es, es, cmp, data);
173
if ((r = pd - pc) > (int)es) {
174
/* Iterate rather than recurse to save stack space */
179
/* NS_QuickSort(pn - r, r / es, es, cmp, data);*/