mirror/freebsd
1
0
Fork 0
mirror of https://git.FreeBSD.org/src.git synced 2024-12-16 10:20:30 +00:00
Code Issues Releases Activity

Add declarations to eliminate -Wmissing-prototypes warnings.

Browse Source
This commit is contained in:
Craig Rodrigues 2015-09-20 03:53:08 +00:00
parent d5cc6f7378
commit 8d3aa83d8b
Notes: svn2git 2020-12-20 02:59:44 +00:00 
svn path=/head/; revision=288005
3 changed files with 15 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
lib/libc/stdlib/atexit.c
View File

@ -82,6 +82,9 @@ struct atexit {
static struct atexit *__atexit; /* points to head of LIFO stack */
typedef DECLARE_BLOCK(void, atexit_block, void);
int atexit_b(atexit_block func);
int __cxa_atexit(void (*func)(void *), void *arg, void *dso);
/*
* Register the function described by 'fptr' to be called at application
* exit or owning shared object unload time. This is a helper function

6
lib/libc/stdlib/heapsort.c
View File

@ -138,6 +138,12 @@ typedef DECLARE_BLOCK(int, heapsort_block, const void *, const void *);
} \
}
#ifdef I_AM_HEAPSORT_B
int heapsort_b(void *vbase, size_t nmemb, size_t size, heapsort_block compar);
#else
int heapsort(void *vbase, size_t nmemb, size_t size,
int (*compar)(const void *, const void *));
#endif
/*
* Heapsort -- Knuth, Vol. 3, page 145. Runs in O (N lg N), both average
* and worst. While heapsort is faster than the worst case of quicksort,

6
lib/libc/stdlib/merge.c
View File

@ -99,6 +99,12 @@ static void insertionsort(u_char *, size_t, size_t, cmp_t);
((u_char *)0 + \
(((u_char *)p + PSIZE - 1 - (u_char *) 0) & ~(PSIZE - 1)))
#ifdef I_AM_MERGESORT_B
int mergesort_b(void *base, size_t nmemb, size_t size, cmp_t cmp);
#else
int mergesort(void *base, size_t nmemb, size_t size, cmp_t cmp);
#endif
/*
* Arguments are as for qsort.
*/