summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
1a3dc30)
svn path=/trunk/; revision=42429
*/
void *
bsearch(const void *key, const void *base0, size_t nelem,
*/
void *
bsearch(const void *key, const void *base0, size_t nelem,
- size_t size, int (*cmp)(const void *ck, const void *ce))
+ size_t size, int (__cdecl *cmp)(const void *ck, const void *ce))
{
char *base = (char *)base0;
int lim, cmpval;
{
char *base = (char *)base0;
int lim, cmpval;
* @implemented
*/
void *_lfind(const void *key, const void *base, unsigned int *nelp,
* @implemented
*/
void *_lfind(const void *key, const void *base, unsigned int *nelp,
- unsigned int width, int (*compar)(const void *, const void *))
+ unsigned int width, int (__cdecl *compar)(const void *, const void *))
{
char* char_base = (char*)base;
unsigned int i;
{
char* char_base = (char*)base;
unsigned int i;
* @implemented
*/
void *_lsearch(const void *key, void *base, unsigned int *nelp, unsigned int width,
* @implemented
*/
void *_lsearch(const void *key, void *base, unsigned int *nelp, unsigned int width,
- int (*compar)(const void *, const void *))
+ int (__cdecl *compar)(const void *, const void *))
{
void *ret_find = _lfind(key,base,nelp,width,compar);
{
void *ret_find = _lfind(key,base,nelp,width,compar);
-qst(size_t size, int (*compar)(const void*, const void*), char *base, char *max)
+qst(size_t size, int (__cdecl *compar)(const void*, const void*), char *base, char *max)
{
char c, *i, *j, *jj;
int ii;
{
char c, *i, *j, *jj;
int ii;
-qsort(void *base0, size_t n, size_t size, int (*compar)(const void*, const void*))
+qsort(void *base0, size_t n, size_t size, int (__cdecl *compar)(const void*, const void*))
{
char *base = (char *)base0;
char c, *i, *j, *lo, *hi;
{
char *base = (char *)base0;
char c, *i, *j, *lo, *hi;