88 #define swapcode(TYPE, parmi, parmj, n) { 		\  argument
89 	size_t i = (n) / sizeof (TYPE); 			\
104 swapfunc(char *a, char *b, size_t n, int swaptype_intptr_t, int swaptype_int)  in swapfunc()  argument
107 		swapcode(intptr_t, a, b, n)  in swapfunc()
109 		swapcode(int, a, b, n)  in swapfunc()
111 		swapcode(char, a, b, n)  in swapfunc()
126 #define	vecswap(a, b, n)				\  argument
127 	if ((n) > 0) swapfunc(a, b, n, swaptype_intptr_t, swaptype_int)
172 	size_t n,
179 	size_t n,  in __bsd_qsort_r()  argument
186 	size_t n,  in __bsd_qsort_r()
194 	size_t n,  in __bsd_qsort_r()
204 	struct { void *a; size_t n; } parameter_stack[PARAMETER_STACK_LEVELS];  in __bsd_qsort_r()  member
209 	if (n < 7) {  in __bsd_qsort_r()
211 		for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es)  in __bsd_qsort_r()
219 	pm = (char *) a + (n / 2) * es;  in __bsd_qsort_r()
220 	if (n > 7) {  in __bsd_qsort_r()
222 		pn = (char *) a + (n - 1) * es;  in __bsd_qsort_r()
223 		if (n > 40) {  in __bsd_qsort_r()
224 			d = (n / 8) * es;  in __bsd_qsort_r()
238 	pc = pd = (char *) a + (n - 1) * es;  in __bsd_qsort_r()
269 		for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es)  in __bsd_qsort_r()
280 	pn = (char *) a + n * es;  in __bsd_qsort_r()
297 		n = r;  in __bsd_qsort_r()
302 		n = d;  in __bsd_qsort_r()
325 			parameter_stack[recursion_level].n = n / es;  in __bsd_qsort_r()
328 			n = r / es;  in __bsd_qsort_r()
346 	if (n > es) {  /* The larger part needs sorting. Iterate to sort.  */  in __bsd_qsort_r()
347 		n = n / es;  in __bsd_qsort_r()
355 		n = parameter_stack[recursion_level].n;  in __bsd_qsort_r()