2 * Copyright (c) 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Peter McIlroy and by Dan Bernstein at New York University,
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#)radixsort.c 8.2 (Berkeley) 4/28/95
37 * $DragonFly: src/lib/libcr/stdlib/Attic/radixsort.c,v 1.6 2004/03/13 19:46:56 eirikn Exp $
43 * Program r_sort_a() is unstable but uses O(logN) extra memory for a stack.
44 * Use radixsort(a, n, trace, endchar) for this case.
46 * For stable sorting (using N extra pointers) use sradixsort(), which calls
49 * For a description of this code, see D. McIlroy, P. McIlroy, K. Bostic,
50 * "Engineering Radix Sort".
53 #include <sys/types.h>
63 static inline void simplesort
64 (const u_char **, int, int, const u_char *, u_int);
65 static void r_sort_a (const u_char **, int, int, const u_char *, u_int);
66 static void r_sort_b (const u_char **,
67 const u_char **, int, int, const u_char *, u_int);
69 #define THRESHOLD 20 /* Divert to simplesort(). */
70 #define SIZE 512 /* Default stack size. */
75 for (c = 0; c < endch; c++) \
78 for (c++; c < 256; c++) \
84 if (endch != 0 && endch != 255) { \
92 radixsort(a, n, tab, endch)
93 const u_char **a, *tab;
102 r_sort_a(a, n, 0, tr, endch);
107 sradixsort(a, n, tab, endch)
108 const u_char **a, *tab;
112 const u_char *tr, **ta;
118 simplesort(a, n, 0, tr, endch);
120 if ((ta = malloc(n * sizeof(a))) == NULL)
122 r_sort_b(a, ta, n, 0, tr, endch);
128 #define empty(s) (s >= sp)
129 #define pop(a, n, i) a = (--sp)->sa, n = sp->sn, i = sp->si
130 #define push(a, n, i) sp->sa = a, sp->sn = n, (sp++)->si = i
131 #define swap(a, b, t) t = a, a = b, b = t
133 /* Unstable, in-place sort. */
135 r_sort_a(a, n, i, tr, endch)
141 static int count[256], nc, bmin;
143 const u_char **ak, *r;
144 stack s[SIZE], *sp, *sp0, *sp1, temp;
146 const u_char **an, *t, **aj, **top[256];
154 simplesort(a, n, i, tr, endch);
159 /* Make character histogram. */
161 bmin = 255; /* First occupied bin, excluding eos. */
162 for (ak = a; ak < an;) {
164 if (++count[c] == 1 && c != endch) {
170 if (sp + nc > s + SIZE) { /* Get more stack. */
171 r_sort_a(a, n, i, tr, endch);
177 * Set top[]; push incompletely sorted bins onto stack.
178 * top[] = pointers to last out-of-place element in bins.
179 * count[] = counts of elements in bins.
180 * Before permuting: top[c-1] + count[c] = top[c];
181 * during deal: top[c] counts down to top[c-1].
183 sp0 = sp1 = sp; /* Stack position of biggest bin. */
184 bigc = 2; /* Size of biggest bin. */
185 if (endch == 0) /* Special case: set top[eos]. */
186 top[0] = ak = a + count[0];
191 for (cp = count + bmin; nc > 0; cp++) {
192 while (*cp == 0) /* Find next non-empty pile. */
201 top[cp-count] = ak += *cp;
204 swap(*sp0, *sp1, temp); /* Play it safe -- biggest bin last. */
207 * Permute misplacements home. Already home: everything
208 * before aj, and in bin[c], items from top[c] on.
210 * r = next element to put in place;
211 * ak = top[r[i]] = location to put the next element.
212 * aj = bottom of 1st disordered bin.
214 * Once the 1st disordered bin is done, ie. aj >= ak,
215 * aj<-aj + count[c] connects the bins in a linked list;
218 for (aj = a; aj < an; *aj = r, aj += count[c], count[c] = 0)
219 for (r = *aj; aj < (ak = --top[c = tr[r[i]]]);)
224 /* Stable sort, requiring additional memory. */
226 r_sort_b(a, ta, n, i, tr, endch)
227 const u_char **a, **ta;
232 static int count[256], nc, bmin;
234 const u_char **ak, **ai;
235 stack s[512], *sp, *sp0, *sp1, temp;
236 const u_char **top[256];
244 simplesort(a, n, i, tr, endch);
250 for (ak = a + n; --ak >= a;) {
252 if (++count[c] == 1 && c != endch) {
258 if (sp + nc > s + SIZE) {
259 r_sort_b(a, ta, n, i, tr, endch);
267 top[0] = ak = a + count[0];
274 for (cp = count + bmin; nc > 0; cp++) {
284 top[cp-count] = ak += c;
285 *cp = 0; /* Reset count[]. */
288 swap(*sp0, *sp1, temp);
290 for (ak = ta + n, ai = a+n; ak > ta;) /* Copy to temp. */
292 for (ak = ta+n; --ak >= ta;) /* Deal to piles. */
293 *--top[tr[(*ak)[i]]] = *ak;
298 simplesort(a, n, b, tr, endch) /* insertion sort */
305 const u_char **ak, **ai, *s, *t;
307 for (ak = a+1; --n >= 1; ak++)
308 for (ai = ak; ai > a; ai--) {
309 for (s = ai[0] + b, t = ai[-1] + b;
310 (ch = tr[*s]) != endch; s++, t++)
315 swap(ai[0], ai[-1], s);