qsort.c (6609261660989cac8bbb8acbf94d4e80d8c59c70) qsort.c (0d2fabfc0439acfdb5d369feb2961e1b91faa39e)
1/*-
2 * SPDX-License-Identifier: BSD-3-Clause
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

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

30 */
31
32#if defined(LIBC_SCCS) && !defined(lint)
33static char sccsid[] = "@(#)qsort.c 8.1 (Berkeley) 6/4/93";
34#endif /* LIBC_SCCS and not lint */
35#include <sys/cdefs.h>
36__FBSDID("$FreeBSD$");
37
1/*-
2 * SPDX-License-Identifier: BSD-3-Clause
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

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

30 */
31
32#if defined(LIBC_SCCS) && !defined(lint)
33static char sccsid[] = "@(#)qsort.c 8.1 (Berkeley) 6/4/93";
34#endif /* LIBC_SCCS and not lint */
35#include <sys/cdefs.h>
36__FBSDID("$FreeBSD$");
37
38#include <errno.h>
39#include <stdint.h>
38#include <stdlib.h>
40#include <stdlib.h>
41#include <string.h>
42#include "libc_private.h"
39
43
40#ifdef I_AM_QSORT_R
44#if defined(I_AM_QSORT_R)
41typedef int cmp_t(void *, const void *, const void *);
45typedef int cmp_t(void *, const void *, const void *);
46#elif defined(I_AM_QSORT_S)
47typedef int cmp_t(const void *, const void *, void *);
42#else
43typedef int cmp_t(const void *, const void *);
44#endif
45static inline char *med3(char *, char *, char *, cmp_t *, void *);
46
47#define MIN(a, b) ((a) < (b) ? a : b)
48
49/*

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

60 *a++ = *b;
61 *b++ = t;
62 } while (--es > 0);
63}
64
65#define vecswap(a, b, n) \
66 if ((n) > 0) swapfunc(a, b, n)
67
48#else
49typedef int cmp_t(const void *, const void *);
50#endif
51static inline char *med3(char *, char *, char *, cmp_t *, void *);
52
53#define MIN(a, b) ((a) < (b) ? a : b)
54
55/*

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

66 *a++ = *b;
67 *b++ = t;
68 } while (--es > 0);
69}
70
71#define vecswap(a, b, n) \
72 if ((n) > 0) swapfunc(a, b, n)
73
68#ifdef I_AM_QSORT_R
74#if defined(I_AM_QSORT_R)
69#define CMP(t, x, y) (cmp((t), (x), (y)))
75#define CMP(t, x, y) (cmp((t), (x), (y)))
76#elif defined(I_AM_QSORT_S)
77#define CMP(t, x, y) (cmp((x), (y), (t)))
70#else
71#define CMP(t, x, y) (cmp((x), (y)))
72#endif
73
74static inline char *
75med3(char *a, char *b, char *c, cmp_t *cmp, void *thunk
78#else
79#define CMP(t, x, y) (cmp((x), (y)))
80#endif
81
82static inline char *
83med3(char *a, char *b, char *c, cmp_t *cmp, void *thunk
76#ifndef I_AM_QSORT_R
84#if !defined(I_AM_QSORT_R) && !defined(I_AM_QSORT_S)
77__unused
78#endif
79)
80{
81 return CMP(thunk, a, b) < 0 ?
82 (CMP(thunk, b, c) < 0 ? b : (CMP(thunk, a, c) < 0 ? c : a ))
83 :(CMP(thunk, b, c) > 0 ? b : (CMP(thunk, a, c) < 0 ? a : c ));
84}
85
85__unused
86#endif
87)
88{
89 return CMP(thunk, a, b) < 0 ?
90 (CMP(thunk, b, c) < 0 ? b : (CMP(thunk, a, c) < 0 ? c : a ))
91 :(CMP(thunk, b, c) > 0 ? b : (CMP(thunk, a, c) < 0 ? a : c ));
92}
93
86#ifdef I_AM_QSORT_R
94#if defined(I_AM_QSORT_R)
87void
88qsort_r(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp)
95void
96qsort_r(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp)
97#elif defined(I_AM_QSORT_S)
98errno_t
99qsort_s(void *a, rsize_t n, rsize_t es, cmp_t *cmp, void *thunk)
89#else
90#define thunk NULL
91void
92qsort(void *a, size_t n, size_t es, cmp_t *cmp)
93#endif
94{
95 char *pa, *pb, *pc, *pd, *pl, *pm, *pn;
96 size_t d1, d2;
97 int cmp_result;
98 int swap_cnt;
99
100#else
101#define thunk NULL
102void
103qsort(void *a, size_t n, size_t es, cmp_t *cmp)
104#endif
105{
106 char *pa, *pb, *pc, *pd, *pl, *pm, *pn;
107 size_t d1, d2;
108 int cmp_result;
109 int swap_cnt;
110
111#ifdef I_AM_QSORT_S
112 if (n > RSIZE_MAX) {
113 __throw_constraint_handler_s("qsort_s : n > RSIZE_MAX", EINVAL);
114 return (EINVAL);
115 } else if (es > RSIZE_MAX) {
116 __throw_constraint_handler_s("qsort_s : es > RSIZE_MAX", EINVAL);
117 return (EINVAL);
118 } else if (n != 0) {
119 if (a == NULL) {
120 __throw_constraint_handler_s("qsort_s : a == NULL", EINVAL);
121 return (EINVAL);
122 } else if (cmp == NULL) {
123 __throw_constraint_handler_s("qsort_s : cmp == NULL", EINVAL);
124 return (EINVAL);
125 }
126 }
127#endif
128
100loop:
101 swap_cnt = 0;
102 if (n < 7) {
103 for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
104 for (pl = pm;
105 pl > (char *)a && CMP(thunk, pl - es, pl) > 0;
106 pl -= es)
107 swapfunc(pl, pl - es, es);
129loop:
130 swap_cnt = 0;
131 if (n < 7) {
132 for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
133 for (pl = pm;
134 pl > (char *)a && CMP(thunk, pl - es, pl) > 0;
135 pl -= es)
136 swapfunc(pl, pl - es, es);
137#ifdef I_AM_QSORT_S
138 return (0);
139#else
108 return;
140 return;
141#endif
109 }
110 pm = (char *)a + (n / 2) * es;
111 if (n > 7) {
112 pl = a;
113 pn = (char *)a + (n - 1) * es;
114 if (n > 40) {
115 size_t d = (n / 8) * es;
116

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

149 pc -= es;
150 }
151 if (swap_cnt == 0) { /* Switch to insertion sort */
152 for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
153 for (pl = pm;
154 pl > (char *)a && CMP(thunk, pl - es, pl) > 0;
155 pl -= es)
156 swapfunc(pl, pl - es, es);
142 }
143 pm = (char *)a + (n / 2) * es;
144 if (n > 7) {
145 pl = a;
146 pn = (char *)a + (n - 1) * es;
147 if (n > 40) {
148 size_t d = (n / 8) * es;
149

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

182 pc -= es;
183 }
184 if (swap_cnt == 0) { /* Switch to insertion sort */
185 for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
186 for (pl = pm;
187 pl > (char *)a && CMP(thunk, pl - es, pl) > 0;
188 pl -= es)
189 swapfunc(pl, pl - es, es);
190#ifdef I_AM_QSORT_S
191 return (0);
192#else
157 return;
193 return;
194#endif
158 }
159
160 pn = (char *)a + n * es;
161 d1 = MIN(pa - (char *)a, pb - pa);
162 vecswap(a, pb - d1, d1);
163 d1 = MIN(pd - pc, pn - pd - es);
164 vecswap(pb, pn - d1, d1);
165
166 d1 = pb - pa;
167 d2 = pd - pc;
168 if (d1 <= d2) {
169 /* Recurse on left partition, then iterate on right partition */
170 if (d1 > es) {
195 }
196
197 pn = (char *)a + n * es;
198 d1 = MIN(pa - (char *)a, pb - pa);
199 vecswap(a, pb - d1, d1);
200 d1 = MIN(pd - pc, pn - pd - es);
201 vecswap(pb, pn - d1, d1);
202
203 d1 = pb - pa;
204 d2 = pd - pc;
205 if (d1 <= d2) {
206 /* Recurse on left partition, then iterate on right partition */
207 if (d1 > es) {
171#ifdef I_AM_QSORT_R
208#if defined(I_AM_QSORT_R)
172 qsort_r(a, d1 / es, es, thunk, cmp);
209 qsort_r(a, d1 / es, es, thunk, cmp);
210#elif defined(I_AM_QSORT_S)
211 qsort_s(a, d1 / es, es, cmp, thunk);
173#else
174 qsort(a, d1 / es, es, cmp);
175#endif
176 }
177 if (d2 > es) {
178 /* Iterate rather than recurse to save stack space */
179 /* qsort(pn - d2, d2 / es, es, cmp); */
180 a = pn - d2;
181 n = d2 / es;
182 goto loop;
183 }
184 } else {
185 /* Recurse on right partition, then iterate on left partition */
186 if (d2 > es) {
212#else
213 qsort(a, d1 / es, es, cmp);
214#endif
215 }
216 if (d2 > es) {
217 /* Iterate rather than recurse to save stack space */
218 /* qsort(pn - d2, d2 / es, es, cmp); */
219 a = pn - d2;
220 n = d2 / es;
221 goto loop;
222 }
223 } else {
224 /* Recurse on right partition, then iterate on left partition */
225 if (d2 > es) {
187#ifdef I_AM_QSORT_R
226#if defined(I_AM_QSORT_R)
188 qsort_r(pn - d2, d2 / es, es, thunk, cmp);
227 qsort_r(pn - d2, d2 / es, es, thunk, cmp);
228#elif defined(I_AM_QSORT_S)
229 qsort_s(pn - d2, d2 / es, es, cmp, thunk);
189#else
190 qsort(pn - d2, d2 / es, es, cmp);
191#endif
192 }
193 if (d1 > es) {
194 /* Iterate rather than recurse to save stack space */
195 /* qsort(a, d1 / es, es, cmp); */
196 n = d1 / es;
197 goto loop;
198 }
199 }
230#else
231 qsort(pn - d2, d2 / es, es, cmp);
232#endif
233 }
234 if (d1 > es) {
235 /* Iterate rather than recurse to save stack space */
236 /* qsort(a, d1 / es, es, cmp); */
237 n = d1 / es;
238 goto loop;
239 }
240 }
241
242#ifdef I_AM_QSORT_S
243 return (0);
244#endif
200}
245}