Lines Matching refs:a
36 #define min(a, b) (a) < (b) ? a : b argument
50 #define SWAPINIT(a, es) swaptype = (uintptr_t)a % sizeof(long) || \ argument
53 swapfunc(char *a, char *b, int n, int swaptype) in swapfunc() argument
56 swapcode(long, a, b, n) in swapfunc()
58 swapcode(char, a, b, n) in swapfunc()
60 #define swap(a, b) \ argument
62 long t = *(long *)(a); \
63 *(long *)(a) = *(long *)(b); \
66 swapfunc(a, b, es, swaptype)
67 #define vecswap(a, b, n) if ((n) > 0) swapfunc(a, b, n, swaptype) argument
69 med3(char *a, char *b, char *c, int (*cmp)(const void *, const void *)) in med3() argument
71 return cmp(a, b) < 0 ? in med3()
72 (cmp(b, c) < 0 ? b : (cmp(a, c) < 0 ? c : a )) in med3()
73 :(cmp(b, c) > 0 ? b : (cmp(a, c) < 0 ? a : c )); in med3()
80 char *a = aa; in qsort() local
81 loop: SWAPINIT(a, es); in qsort()
84 for (pm = (char *)a + es; pm < (char *) a + n * es; pm += es) in qsort()
85 for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0; in qsort()
90 pm = (char *)a + (n / 2) * es; in qsort()
92 pl = (char *)a; in qsort()
93 pn = (char *)a + (n - 1) * es; in qsort()
102 swap(a, pm); in qsort()
103 pa = pb = (char *)a + es; in qsort()
105 pc = pd = (char *)a + (n - 1) * es; in qsort()
107 while (pb <= pc && (r = cmp(pb, a)) <= 0) { in qsort()
115 while (pb <= pc && (r = cmp(pc, a)) >= 0) { in qsort()
131 for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es) in qsort()
132 for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0; in qsort()
137 pn = (char *)a + n * es; in qsort()
138 r = min(pa - (char *)a, pb - pa); in qsort()
139 vecswap(a, pb - r, r); in qsort()
143 qsort(a, r / es, es, cmp); in qsort()
146 a = pn - r; in qsort()