Lines Matching defs:cmp
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
104 local_qsort(void *a, size_t n, size_t es, cmp_t *cmp, void *thunk)
129 pl = med3(pl, pl + d, pl + 2 * d, cmp, thunk);
130 pm = med3(pm - d, pm, pm + d, cmp, thunk);
131 pn = med3(pn - 2 * d, pn - d, pn, cmp, thunk);
133 pm = med3(pl, pm, pn, cmp, thunk);
177 local_qsort(a, d1 / es, es, cmp, thunk);
181 /* qsort(pn - d2, d2 / es, es, cmp); */
189 local_qsort(pn - d2, d2 / es, es, cmp, thunk);
193 /* qsort(a, d1 / es, es, cmp); */
202 (qsort_r)(void *a, size_t n, size_t es, cmp_t *cmp, void *thunk)
204 local_qsort_r(a, n, es, cmp, thunk);
208 __qsort_r_compat(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp)
210 local_qsort_r_compat(a, n, es, cmp, thunk);
214 qsort_s(void *a, rsize_t n, rsize_t es, cmp_t *cmp, void *thunk)
228 } else if (cmp == NULL) {
229 __throw_constraint_handler_s("qsort_s : cmp == NULL",
239 local_qsort_s(a, n, es, cmp, thunk);
244 qsort(void *a, size_t n, size_t es, cmp_t *cmp)
246 local_qsort(a, n, es, cmp, NULL);