2
* Copyright (c) 1992, 1993
3
* The Regents of the University of California. All rights reserved.
5
* Redistribution and use in source and binary forms, with or without
6
* modification, are permitted provided that the following conditions
8
* 1. Redistributions of source code must retain the above copyright
9
* notice, this list of conditions and the following disclaimer.
10
* 2. Redistributions in binary form must reproduce the above copyright
11
* notice, this list of conditions and the following disclaimer in the
12
* documentation and/or other materials provided with the distribution.
13
* 4. Neither the name of the University nor the names of its contributors
14
* may be used to endorse or promote products derived from this software
15
* without specific prior written permission.
17
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30
#include "clamav-config.h"
39
static inline char *med3(char *, char *, char *, int (*)(const void *, const void *));
40
static inline void swapfunc(char *, char *, int, int);
43
* Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
45
#define swapcode(TYPE, parmi, parmj, n) { \
46
long i = (n) / sizeof (TYPE); \
47
register TYPE *pi = (TYPE *) (parmi); \
48
register TYPE *pj = (TYPE *) (parmj); \
50
register TYPE t = *pi; \
56
#define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \
57
es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1;
60
swapfunc(a, b, n, swaptype)
65
swapcode(long, a, b, n)
67
swapcode(char, a, b, n)
71
if (swaptype == 0) { \
72
long t = *(long *)(a); \
73
*(long *)(a) = *(long *)(b); \
76
swapfunc(a, b, es, swaptype)
78
#define vecswap(a, b, n) if ((n) > 0) swapfunc(a, b, n, swaptype)
80
#define CMP1(a, b) ((int)(*((uint32_t *)(a)) - *((uint32_t *)(b))))
81
#define CMP(a, b) (cmp ? (cmp(a, b)) : CMP1(a, b))
82
#define MED3(a, b, c, d) (d ? (med3(a, b, c, d)) : (CMP1(a, b) < 0 ? (CMP1(b, c) < 0 ? (b) : (CMP1(a, c) < 0 ? (c) : (a))) : (CMP1(b, c) > 0 ? (b) : (CMP1(a, c) < 0 ? (a) : (c)))))
87
int (*cmp)(const void *, const void *);
89
return CMP(a, b) < 0 ?
90
(CMP(b, c) < 0 ? b : (CMP(a, c) < 0 ? c : a ))
91
:(CMP(b, c) > 0 ? b : (CMP(a, c) < 0 ? a : c ));
94
void cli_qsort(void *a, size_t n, size_t es, int (*cmp)(const void *, const void *))
96
char *pa, *pb, *pc, *pd, *pl, *pm, *pn;
97
int d, r, swaptype, swap_cnt;
99
loop: SWAPINIT(a, es);
102
for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es)
103
for (pl = pm; pl > (char *) a && CMP(pl - es, pl) > 0;
108
pm = (char *) a + (n / 2) * es;
111
pn = (char *) a + (n - 1) * es;
114
pl = MED3(pl, pl + d, pl + 2 * d, cmp);
115
pm = MED3(pm - d, pm, pm + d, cmp);
116
pn = MED3(pn - 2 * d, pn - d, pn, cmp);
118
pm = MED3(pl, pm, pn, cmp);
121
pa = pb = (char *) a + es;
123
pc = pd = (char *) a + (n - 1) * es;
125
while (pb <= pc && (r = CMP(pb, a)) <= 0) {
133
while (pb <= pc && (r = CMP(pc, a)) >= 0) {
148
if (swap_cnt == 0) { /* Switch to insertion sort */
149
for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es)
150
for (pl = pm; pl > (char *) a && CMP(pl - es, pl) > 0;
156
pn = (char *) a + n * es;
157
r = MIN(pa - (char *)a, pb - pa);
158
vecswap(a, pb - r, r);
159
r = MIN((size_t) (pd - pc), (size_t) (pn - pd - es));
160
vecswap(pb, pn - r, r);
161
if ((size_t) (r = pb - pa) > es)
162
cli_qsort(a, r / es, es, cmp);
163
if ((size_t) (r = pd - pc) > es) {
164
/* Iterate rather than recurse to save stack space */
169
/* cli_qsort(pn - r, r / es, es, cmp);*/