| 111 | #else |
| 112 | #define thunk NULL |
| 113 | void |
| 114 | qsort(void *a, size_t n, size_t es, cmp_t *cmp) |
| 115 | #endif |
| 116 | { |
| 117 | char *pa, *pb, *pc, *pd, *pl, *pm, *pn; |
| 118 | size_t d1, d2; |
| 119 | int cmp_result; |
| 120 | int swaptype_long, swaptype_int, swap_cnt; |
| 121 | |
| 122 | loop: SWAPINIT(long, a, es); |
| 123 | SWAPINIT(int, a, es); |
| 124 | swap_cnt = 0; |
| 125 | if (n < 7) { |
| 126 | for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es) |
| 127 | for (pl = pm; |
| 128 | pl > (char *)a && CMP(thunk, pl - es, pl) > 0; |
| 129 | pl -= es) |
| 130 | swap(pl, pl - es); |
| 131 | return; |
| 132 | } |
| 133 | pm = (char *)a + (n / 2) * es; |
| 134 | if (n > 7) { |
| 135 | pl = a; |
| 136 | pn = (char *)a + (n - 1) * es; |
| 137 | if (n > 40) { |
| 138 | size_t d = (n / 8) * es; |
| 139 | |
| 140 | pl = med3(pl, pl + d, pl + 2 * d, cmp, thunk); |
| 141 | pm = med3(pm - d, pm, pm + d, cmp, thunk); |
| 142 | pn = med3(pn - 2 * d, pn - d, pn, cmp, thunk); |
| 143 | } |
| 144 | pm = med3(pl, pm, pn, cmp, thunk); |
| 145 | } |
| 146 | swap(a, pm); |
| 147 | pa = pb = (char *)a + es; |
| 148 | |
| 149 | pc = pd = (char *)a + (n - 1) * es; |
| 150 | for (;;) { |
| 151 | while (pb <= pc && (cmp_result = CMP(thunk, pb, a)) <= 0) { |
| 152 | if (cmp_result == 0) { |
| 153 | swap_cnt = 1; |
| 154 | swap(pa, pb); |
| 155 | pa += es; |
| 156 | } |
| 157 | pb += es; |
| 158 | } |
| 159 | while (pb <= pc && (cmp_result = CMP(thunk, pc, a)) >= 0) { |
| 160 | if (cmp_result == 0) { |
| 161 | swap_cnt = 1; |
| 162 | swap(pc, pd); |
| 163 | pd -= es; |
| 164 | } |
| 165 | pc -= es; |
| 166 | } |
| 167 | if (pb > pc) |
| 168 | break; |
| 169 | swap(pb, pc); |
| 170 | swap_cnt = 1; |