1 /* $NetBSD: qsort.c,v 1.10 1998/11/15 17:13:51 christos Exp $ */ 2 3 /*- 4 * Copyright (c) 1992, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 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. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include <sys/cdefs.h> 37 #if defined(LIBC_SCCS) && !defined(lint) 38 #if 0 39 static char sccsid[] = "@(#)qsort.c 8.1 (Berkeley) 6/4/93"; 40 #else 41 __RCSID("$NetBSD: qsort.c,v 1.10 1998/11/15 17:13:51 christos Exp $"); 42 #endif 43 #endif /* LIBC_SCCS and not lint */ 44 45 #include <sys/types.h> 46 #include <stdlib.h> 47 48 static __inline char *med3 __P((char *, char *, char *, 49 int (*)(const void *, const void *))); 50 static __inline void swapfunc __P((char *, char *, size_t, int)); 51 52 #define min(a, b) (a) < (b) ? a : b 53 54 /* 55 * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function". 56 */ 57 #define swapcode(TYPE, parmi, parmj, n) { \ 58 size_t i = (n) / sizeof (TYPE); \ 59 TYPE *pi = (TYPE *)(void *)(parmi); \ 60 TYPE *pj = (TYPE *)(void *)(parmj); \ 61 do { \ 62 TYPE t = *pi; \ 63 *pi++ = *pj; \ 64 *pj++ = t; \ 65 } while (--i > 0); \ 66 } 67 68 #define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \ 69 es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1; 70 71 static __inline void 72 swapfunc(a, b, n, swaptype) 73 char *a, *b; 74 size_t n; 75 int swaptype; 76 { 77 if (swaptype <= 1) 78 swapcode(long, a, b, n) 79 else 80 swapcode(char, a, b, n) 81 } 82 83 #define swap(a, b) \ 84 if (swaptype == 0) { \ 85 long t = *(long *)(void *)(a); \ 86 *(long *)(void *)(a) = *(long *)(void *)(b); \ 87 *(long *)(void *)(b) = t; \ 88 } else \ 89 swapfunc(a, b, es, swaptype) 90 91 #define vecswap(a, b, n) if ((n) > 0) swapfunc((a), (b), (size_t)(n), swaptype) 92 93 static __inline char * 94 med3(a, b, c, cmp) 95 char *a, *b, *c; 96 int (*cmp) __P((const void *, const void *)); 97 { 98 return cmp(a, b) < 0 ? 99 (cmp(b, c) < 0 ? b : (cmp(a, c) < 0 ? c : a )) 100 :(cmp(b, c) > 0 ? b : (cmp(a, c) < 0 ? a : c )); 101 } 102 103 void 104 qsort(a, n, es, cmp) 105 void *a; 106 size_t n, es; 107 int (*cmp) __P((const void *, const void *)); 108 { 109 char *pa, *pb, *pc, *pd, *pl, *pm, *pn; 110 int d, r, swaptype, swap_cnt; 111 112 loop: SWAPINIT(a, es); 113 swap_cnt = 0; 114 if (n < 7) { 115 for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es) 116 for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0; 117 pl -= es) 118 swap(pl, pl - es); 119 return; 120 } 121 pm = (char *) a + (n / 2) * es; 122 if (n > 7) { 123 pl = (char *) a; 124 pn = (char *) a + (n - 1) * es; 125 if (n > 40) { 126 d = (n / 8) * es; 127 pl = med3(pl, pl + d, pl + 2 * d, cmp); 128 pm = med3(pm - d, pm, pm + d, cmp); 129 pn = med3(pn - 2 * d, pn - d, pn, cmp); 130 } 131 pm = med3(pl, pm, pn, cmp); 132 } 133 swap(a, pm); 134 pa = pb = (char *) a + es; 135 136 pc = pd = (char *) a + (n - 1) * es; 137 for (;;) { 138 while (pb <= pc && (r = cmp(pb, a)) <= 0) { 139 if (r == 0) { 140 swap_cnt = 1; 141 swap(pa, pb); 142 pa += es; 143 } 144 pb += es; 145 } 146 while (pb <= pc && (r = cmp(pc, a)) >= 0) { 147 if (r == 0) { 148 swap_cnt = 1; 149 swap(pc, pd); 150 pd -= es; 151 } 152 pc -= es; 153 } 154 if (pb > pc) 155 break; 156 swap(pb, pc); 157 swap_cnt = 1; 158 pb += es; 159 pc -= es; 160 } 161 if (swap_cnt == 0) { /* Switch to insertion sort */ 162 for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es) 163 for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0; 164 pl -= es) 165 swap(pl, pl - es); 166 return; 167 } 168 169 pn = (char *) a + n * es; 170 r = min(pa - (char *) a, pb - pa); 171 vecswap(a, pb - r, r); 172 r = min(pd - pc, pn - pd - es); 173 vecswap(pb, pn - r, r); 174 if ((r = pb - pa) > es) 175 qsort(a, r / es, es, cmp); 176 if ((r = pd - pc) > es) { 177 /* Iterate rather than recurse to save stack space */ 178 a = pn - r; 179 n = r / es; 180 goto loop; 181 } 182 /* qsort(pn - r, r / es, es, cmp);*/ 183 } 184