67 #define	vecswap(a, b, n)				\  argument
68 	if ((n) > 0) swapfunc(a, b, n)
104 local_qsort(void *a, size_t n, size_t es, cmp_t *cmp, void *thunk)  in local_qsort()  argument
112 	if (__predict_false(n < 2))  in local_qsort()
116 	if (n < 7) {  in local_qsort()
117 		for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)  in local_qsort()
124 	pm = (char *)a + (n / 2) * es;  in local_qsort()
125 	if (n > 7) {  in local_qsort()
127 		pn = (char *)a + (n - 1) * es;  in local_qsort()
128 		if (n > 40) {  in local_qsort()
129 			size_t d = (n / 8) * es;  in local_qsort()
140 	pc = pd = (char *)a + (n - 1) * es;  in local_qsort()
166 		for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)  in local_qsort()
174 	pn = (char *)a + n * es;  in local_qsort()
196 			n = d2 / es;  in local_qsort()
207 			n = d1 / es;  in local_qsort()
215 (qsort_r)(void *a, size_t n, size_t es, cmp_t *cmp, void *thunk)
217 	local_qsort_r(a, n, es, cmp, thunk);
221 __qsort_r_compat(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp)  in __qsort_r_compat()  argument
223 	local_qsort_r_compat(a, n, es, cmp, thunk);  in __qsort_r_compat()
227 qsort_s(void *a, rsize_t n, rsize_t es, cmp_t *cmp, void *thunk)  in qsort_s()  argument
229 	if (n > RSIZE_MAX) {  in qsort_s()
236 	} else if (n != 0) {  in qsort_s()
252 	local_qsort_s(a, n, es, cmp, thunk);  in qsort_s()
257 qsort(void *a, size_t n, size_t es, cmp_t *cmp)  in qsort()  argument
259 	local_qsort(a, n, es, cmp, NULL);  in qsort()