#include #include #include void qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b)) { if (n > 4) { int i = 0, j = n - 1; void * tmp = (void *) malloc(e_size); void * pivot = (void *) malloc(e_size); memcpy(pivot, data, e_size); while (1) { while ((cmp(data + i * e_size, pivot) < 0) && i < n) i++; while ((cmp(data + j * e_size, pivot) >=0) && j > 0) j--; if (i b, 0 if a == b, -1 if a < b */ int int_cmp(void * a, void * b) { return (* (int *) a > * (int*)b) ? 1 : (*(int *)a < * (int *)b) ? -1 : 0; } int __u8_cmp(void * a, void * b) { return (* (__u8 *) a > * (__u8 *)b) ? 1 : (*(__u8 *)a < * (__u8 *)b) ? -1 : 0; } int __u16_cmp(void * a, void * b) { return (* (__u16 *) a > * (__u16 *)b) ? 1 : (*(__u16 *)a < * (__u16 *)b) ? -1 : 0; } int __u32_cmp(void * a, void * b) { return (* (__u32 *) a > * (__u32 *)b) ? 1 : (*(__u32 *)a < * (__u32 *)b) ? -1 : 0; }