|
@@ -368,7 +368,7 @@ typedef struct { char * first; char * last; } stack_entry;
|
|
|
/* ---------------------------------------------------------------------- */
|
|
|
|
|
|
static char * pivot_big(char *first, char *mid, char *last, size_t size,
|
|
|
- int compare(const void *, const void *)) {
|
|
|
+ SDL_CompareCallback compare) {
|
|
|
size_t d=(((last-first)/size)>>3)*size;
|
|
|
#ifdef DEBUG_QSORT
|
|
|
fprintf(stderr, "pivot_big: first=%p last=%p size=%lu n=%lu\n", first, (unsigned long)last, size, (unsigned long)((last-first+1)/size));
|
|
@@ -409,7 +409,7 @@ fprintf(stderr,"-> %d %d %d @ %p %p %p\n",*(int*)m1,*(int*)m2,*(int*)m3, m1,m2,m
|
|
|
/* ---------------------------------------------------------------------- */
|
|
|
|
|
|
static void qsort_nonaligned(void *base, size_t nmemb, size_t size,
|
|
|
- int (*compare)(const void *, const void *)) {
|
|
|
+ SDL_CompareCallback compare) {
|
|
|
|
|
|
stack_entry stack[STACK_SIZE];
|
|
|
int stacktop=0;
|
|
@@ -440,7 +440,7 @@ static void qsort_nonaligned(void *base, size_t nmemb, size_t size,
|
|
|
}
|
|
|
|
|
|
static void qsort_aligned(void *base, size_t nmemb, size_t size,
|
|
|
- int (*compare)(const void *, const void *)) {
|
|
|
+ SDL_CompareCallback compare) {
|
|
|
|
|
|
stack_entry stack[STACK_SIZE];
|
|
|
int stacktop=0;
|
|
@@ -471,7 +471,7 @@ static void qsort_aligned(void *base, size_t nmemb, size_t size,
|
|
|
}
|
|
|
|
|
|
static void qsort_words(void *base, size_t nmemb,
|
|
|
- int (*compare)(const void *, const void *)) {
|
|
|
+ SDL_CompareCallback compare) {
|
|
|
|
|
|
stack_entry stack[STACK_SIZE];
|
|
|
int stacktop=0;
|