71 #define	CMP(t, x, y) (cmp((x), (y), (t)))
73 #define	CMP(t, x, y) (cmp((t), (x), (y)))
75 #define	CMP(t, x, y) (cmp((x), (y), (t)))
77 #define	CMP(t, x, y) (cmp((x), (y)))
81 med3(char *a, char *b, char *c, cmp_t *cmp, void *thunk  in med3()  argument
104 local_qsort(void *a, size_t n, size_t es, cmp_t *cmp, void *thunk)  in local_qsort()  argument
131 			pl = med3(pl, pl + d, pl + 2 * d, cmp, thunk);  in local_qsort()
132 			pm = med3(pm - d, pm, pm + d, cmp, thunk);  in local_qsort()
133 			pn = med3(pn - 2 * d, pn - d, pn, cmp, thunk);  in local_qsort()
135 		pm = med3(pl, pm, pn, cmp, thunk);  in local_qsort()
190 			local_qsort(a, d1 / es, es, cmp, thunk);  in local_qsort()
202 			local_qsort(pn - d2, d2 / es, es, cmp, thunk);  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
241 		} else if (cmp == NULL) {  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()