24 #define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \  argument
28 swapfunc(char *a, char *b, int n, int swaptype)  in swapfunc()  argument
31 		swapcode(long, a, b, n);  in swapfunc()
33 		swapcode(char, a, b, n);  in swapfunc()
36 #define yswap(a, b) do {					\  argument
38 		long t = *(long *)(a);			\
39 		*(long *)(a) = *(long *)(b);		\
42 		swapfunc(a, b, es, swaptype);		\
45 #define vecswap(a, b, n)	if ((n) > 0) swapfunc(a, b, n, swaptype)  argument
48 med3(char *a, char *b, char *c, int (*cmp)(const void *, const void *))  in med3()  argument
50 	return cmp(a, b) < 0 ?  in med3()
51 		(cmp(b, c) < 0 ? b : (cmp(a, c) < 0 ? c : a))  in med3()
52 		: (cmp(b, c) > 0 ? b : (cmp(a, c) < 0 ? a : c));  in med3()
56 #define min(a, b) (((a) < (b)) ? (a) : (b))  argument
65 	register char *a = aa;  in yaffs_qsort()  local
67 loop:	SWAPINIT(a, es);  in yaffs_qsort()
70 		for (pm = (char *)a + es; pm < (char *) a + n * es; pm += es)  in yaffs_qsort()
71 			for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0;  in yaffs_qsort()
76 	pm = (char *)a + (n / 2) * es;  in yaffs_qsort()
78 		pl = (char *)a;  in yaffs_qsort()
79 		pn = (char *)a + (n - 1) * es;  in yaffs_qsort()
88 	yswap(a, pm);  in yaffs_qsort()
89 	pa = pb = (char *)a + es;  in yaffs_qsort()
91 	pc = pd = (char *)a + (n - 1) * es;  in yaffs_qsort()
93 		while (pb <= pc && (r = cmp(pb, a)) <= 0) {  in yaffs_qsort()
101 		while (pb <= pc && (r = cmp(pc, a)) >= 0) {  in yaffs_qsort()
117 		for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es)  in yaffs_qsort()
118 			for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0;  in yaffs_qsort()
124 	pn = (char *)a + n * es;  in yaffs_qsort()
125 	r = min(pa - (char *)a, pb - pa);  in yaffs_qsort()
126 	vecswap(a, pb - r, r);  in yaffs_qsort()
131 		yaffs_qsort(a, r / es, es, cmp);  in yaffs_qsort()
135 		a = pn - r;  in yaffs_qsort()