qsort.c (f36cfd49adb62472fd7009ecd4f0927c126ff785) qsort.c (b1e34c44ef5f9e517c89a163857c55aa51be40ea)
1/*-
2 * Copyright (c) 1992, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright

--- 16 unchanged lines hidden (view full) ---

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
27 * SUCH DAMAGE.
28 */
29
30#include <sys/cdefs.h>
31__FBSDID("$FreeBSD$");
32
1/*-
2 * Copyright (c) 1992, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright

--- 16 unchanged lines hidden (view full) ---

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
27 * SUCH DAMAGE.
28 */
29
30#include <sys/cdefs.h>
31__FBSDID("$FreeBSD$");
32
33#include <sys/param.h>
33#include <sys/libkern.h>
34
34#include <sys/libkern.h>
35
35typedef int cmp_t(const void *, const void *);
36static __inline char *med3(char *, char *, char *, cmp_t *);
36#ifdef I_AM_QSORT_R
37typedef int cmp_t(void *, const void *, const void *);
38#else
39typedef int cmp_t(const void *, const void *);
40#endif
41static __inline char *med3(char *, char *, char *, cmp_t *, void *);
37static __inline void swapfunc(char *, char *, int, int);
38
39#define min(a, b) (a) < (b) ? (a) : (b)
40
41/*
42 * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
43 */
44#define swapcode(TYPE, parmi, parmj, n) { \

--- 6 unchanged lines hidden (view full) ---

51 *pj++ = t; \
52 } while (--i > 0); \
53}
54
55#define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \
56 es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1;
57
58static __inline void
42static __inline void swapfunc(char *, char *, int, int);
43
44#define min(a, b) (a) < (b) ? (a) : (b)
45
46/*
47 * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
48 */
49#define swapcode(TYPE, parmi, parmj, n) { \

--- 6 unchanged lines hidden (view full) ---

56 *pj++ = t; \
57 } while (--i > 0); \
58}
59
60#define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \
61 es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1;
62
63static __inline void
59swapfunc(a, b, n, swaptype)
60 char *a, *b;
61 int n, swaptype;
64swapfunc(char *a, char *b, int n, int swaptype)
62{
63 if(swaptype <= 1)
64 swapcode(long, a, b, n)
65 else
66 swapcode(char, a, b, n)
67}
68
69#define swap(a, b) \
70 if (swaptype == 0) { \
71 long t = *(long *)(a); \
72 *(long *)(a) = *(long *)(b); \
73 *(long *)(b) = t; \
74 } else \
75 swapfunc(a, b, es, swaptype)
76
77#define vecswap(a, b, n) if ((n) > 0) swapfunc(a, b, n, swaptype)
78
65{
66 if(swaptype <= 1)
67 swapcode(long, a, b, n)
68 else
69 swapcode(char, a, b, n)
70}
71
72#define swap(a, b) \
73 if (swaptype == 0) { \
74 long t = *(long *)(a); \
75 *(long *)(a) = *(long *)(b); \
76 *(long *)(b) = t; \
77 } else \
78 swapfunc(a, b, es, swaptype)
79
80#define vecswap(a, b, n) if ((n) > 0) swapfunc(a, b, n, swaptype)
81
82#ifdef I_AM_QSORT_R
83#define CMP(t, x, y) (cmp((t), (x), (y)))
84#else
85#define CMP(t, x, y) (cmp((x), (y)))
86#endif
87
79static __inline char *
88static __inline char *
80med3(a, b, c, cmp)
81 char *a, *b, *c;
82 cmp_t *cmp;
89med3(char *a, char *b, char *c, cmp_t *cmp, void *thunk
90#ifndef I_AM_QSORT_R
91__unused
92#endif
93)
83{
94{
84 return cmp(a, b) < 0 ?
85 (cmp(b, c) < 0 ? b : (cmp(a, c) < 0 ? c : a ))
86 :(cmp(b, c) > 0 ? b : (cmp(a, c) < 0 ? a : c ));
95 return CMP(thunk, a, b) < 0 ?
96 (CMP(thunk, b, c) < 0 ? b : (CMP(thunk, a, c) < 0 ? c : a ))
97 :(CMP(thunk, b, c) > 0 ? b : (CMP(thunk, a, c) < 0 ? a : c ));
87}
88
98}
99
100#ifdef I_AM_QSORT_R
89void
101void
90qsort(a, n, es, cmp)
91 void *a;
92 size_t n, es;
93 cmp_t *cmp;
102qsort_r(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp)
103#else
104#define thunk NULL
105void
106qsort(void *a, size_t n, size_t es, cmp_t *cmp)
107#endif
94{
95 char *pa, *pb, *pc, *pd, *pl, *pm, *pn;
96 int d, r, swaptype, swap_cnt;
97
98loop: SWAPINIT(a, es);
99 swap_cnt = 0;
100 if (n < 7) {
101 for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
108{
109 char *pa, *pb, *pc, *pd, *pl, *pm, *pn;
110 int d, r, swaptype, swap_cnt;
111
112loop: SWAPINIT(a, es);
113 swap_cnt = 0;
114 if (n < 7) {
115 for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
102 for (pl = pm; pl > (char *)a && cmp(pl - es, pl) > 0;
116 for (pl = pm; pl > (char *)a && CMP(thunk, pl - es, pl) > 0;
103 pl -= es)
104 swap(pl, pl - es);
105 return;
106 }
107 pm = (char *)a + (n / 2) * es;
108 if (n > 7) {
109 pl = a;
110 pn = (char *)a + (n - 1) * es;
111 if (n > 40) {
112 d = (n / 8) * es;
117 pl -= es)
118 swap(pl, pl - es);
119 return;
120 }
121 pm = (char *)a + (n / 2) * es;
122 if (n > 7) {
123 pl = a;
124 pn = (char *)a + (n - 1) * es;
125 if (n > 40) {
126 d = (n / 8) * es;
113 pl = med3(pl, pl + d, pl + 2 * d, cmp);
114 pm = med3(pm - d, pm, pm + d, cmp);
115 pn = med3(pn - 2 * d, pn - d, pn, cmp);
127 pl = med3(pl, pl + d, pl + 2 * d, cmp, thunk);
128 pm = med3(pm - d, pm, pm + d, cmp, thunk);
129 pn = med3(pn - 2 * d, pn - d, pn, cmp, thunk);
116 }
130 }
117 pm = med3(pl, pm, pn, cmp);
131 pm = med3(pl, pm, pn, cmp, thunk);
118 }
119 swap(a, pm);
120 pa = pb = (char *)a + es;
121
122 pc = pd = (char *)a + (n - 1) * es;
123 for (;;) {
132 }
133 swap(a, pm);
134 pa = pb = (char *)a + es;
135
136 pc = pd = (char *)a + (n - 1) * es;
137 for (;;) {
124 while (pb <= pc && (r = cmp(pb, a)) <= 0) {
138 while (pb <= pc && (r = CMP(thunk, pb, a)) <= 0) {
125 if (r == 0) {
126 swap_cnt = 1;
127 swap(pa, pb);
128 pa += es;
129 }
130 pb += es;
131 }
139 if (r == 0) {
140 swap_cnt = 1;
141 swap(pa, pb);
142 pa += es;
143 }
144 pb += es;
145 }
132 while (pb <= pc && (r = cmp(pc, a)) >= 0) {
146 while (pb <= pc && (r = CMP(thunk, pc, a)) >= 0) {
133 if (r == 0) {
134 swap_cnt = 1;
135 swap(pc, pd);
136 pd -= es;
137 }
138 pc -= es;
139 }
140 if (pb > pc)
141 break;
142 swap(pb, pc);
143 swap_cnt = 1;
144 pb += es;
145 pc -= es;
146 }
147 if (swap_cnt == 0) { /* Switch to insertion sort */
148 for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
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)
149 for (pl = pm; pl > (char *)a && cmp(pl - es, pl) > 0;
163 for (pl = pm; pl > (char *)a && CMP(thunk, pl - es, pl) > 0;
150 pl -= es)
151 swap(pl, pl - es);
152 return;
153 }
154
155 pn = (char *)a + n * es;
156 r = min(pa - (char *)a, pb - pa);
157 vecswap(a, pb - r, r);
158 r = min(pd - pc, pn - pd - es);
159 vecswap(pb, pn - r, r);
160 if ((r = pb - pa) > es)
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#ifdef I_AM_QSORT_R
176 qsort_r(a, r / es, es, thunk, cmp);
177#else
161 qsort(a, r / es, es, cmp);
178 qsort(a, r / es, es, cmp);
179#endif
162 if ((r = pd - pc) > es) {
163 /* Iterate rather than recurse to save stack space */
164 a = pn - r;
165 n = r / es;
166 goto loop;
167 }
180 if ((r = pd - pc) > es) {
181 /* Iterate rather than recurse to save stack space */
182 a = pn - r;
183 n = r / es;
184 goto loop;
185 }
168/* qsort(pn - r, r / es, es, cmp);*/
169}
186}