blob: a026821116329c02b6ca352afb660d0caa092753 [file] [log] [blame]
/*
* Copyright (C) 2003 Filip Pizlo. All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY FILIP PIZLO ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL FILIP PIZLO OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "tsf_internal.h"
#ifdef HAVE_QSORT
void tsf_sort(void *base,size_t nmemb,size_t size,
int (*compar)(const void *a,const void *b)) {
qsort(base,nmemb,size,compar);
}
#else
#error "I haven't written my own sorting algorithm yet. Bummer."
#endif
static int ui32_compare(const void *pa,
const void *pb) {
uint32_t a = *((uint32_t*)pa),
b = *((uint32_t*)pb);
if (a<b) {
return -1;
} else if (a==b) {
return 0;
} else {
return 1;
}
}
void tsf_ui32_sort(uint32_t *base,
size_t nmemb) {
tsf_sort(base,nmemb,sizeof(uint32_t),ui32_compare);
}